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

Public Types | |
| typedef S | StateId |
Public Member Functions | |
| TrivialQueue () | |
| StateId | Head () const |
| void | Enqueue (StateId s) |
| void | Dequeue () |
| void | Update (StateId s) |
| bool | Empty () const |
| void | Clear () |
Trivial queue discipline, templated on the StateId. You may enqueue at most one state at a time. It is used for strongly connected components with only one state and no self loops.
Definition at line 107 of file queue.h.
| typedef S fst::TrivialQueue< S >::StateId |
Reimplemented from fst::QueueBase< S >.
| fst::TrivialQueue< S >::TrivialQueue | ( | ) | [inline] |
| void fst::TrivialQueue< S >::Clear | ( | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::TrivialQueue< S >::Dequeue | ( | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| bool fst::TrivialQueue< S >::Empty | ( | ) | const [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::TrivialQueue< S >::Enqueue | ( | StateId | s | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| StateId fst::TrivialQueue< S >::Head | ( | ) | const [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::TrivialQueue< S >::Update | ( | StateId | s | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
1.7.1