#include <fst/queue.h>
Inherits fst::QueueBase< S >.

Public Types | |
| typedef S | StateId |
Public Member Functions | |
| template<class Arc , class ArcFilter > | |
| TopOrderQueue (const Fst< Arc > &fst, ArcFilter filter) | |
| TopOrderQueue (const vector< StateId > &order) | |
| StateId | Head () const |
| void | Enqueue (StateId s) |
| void | Dequeue () |
| void | Update (StateId s) |
| bool | Empty () const |
| void | Clear () |
Topological-order queue discipline, templated on the StateId. States are ordered in the queue topologically. The FST must be acyclic.
Definition at line 308 of file queue.h.
| typedef S fst::TopOrderQueue< S >::StateId |
Reimplemented from fst::QueueBase< S >.
| fst::TopOrderQueue< S >::TopOrderQueue | ( | const Fst< Arc > & | fst, | |
| ArcFilter | filter | |||
| ) | [inline] |
| fst::TopOrderQueue< S >::TopOrderQueue | ( | const vector< StateId > & | order | ) | [inline] |
| void fst::TopOrderQueue< S >::Clear | ( | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::TopOrderQueue< S >::Dequeue | ( | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| bool fst::TopOrderQueue< S >::Empty | ( | ) | const [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::TopOrderQueue< S >::Enqueue | ( | StateId | s | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| StateId fst::TopOrderQueue< S >::Head | ( | ) | const [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::TopOrderQueue< S >::Update | ( | StateId | s | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
1.7.1