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

Public Types | |
| typedef S | StateId |
| typedef C | Compare |
Public Member Functions | |
| ShortestFirstQueue (C comp) | |
| StateId | Head () const |
| void | Enqueue (StateId s) |
| void | Dequeue () |
| void | Update (StateId s) |
| bool | Empty () const |
| void | Clear () |
Shortest-first queue discipline, templated on the StateId and comparison function object. Comparison function object COMP is used to compare two StateIds. If a (single) state's order changes, it can be reordered in the queue with a call to Update(). If 'update == false', call to Update() does not reorder the queue.
Definition at line 207 of file queue.h.
| typedef C fst::ShortestFirstQueue< S, C, update >::Compare |
| typedef S fst::ShortestFirstQueue< S, C, update >::StateId |
Reimplemented from fst::QueueBase< S >.
| fst::ShortestFirstQueue< S, C, update >::ShortestFirstQueue | ( | C | comp | ) | [inline] |
| void fst::ShortestFirstQueue< S, C, update >::Clear | ( | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::ShortestFirstQueue< S, C, update >::Dequeue | ( | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| bool fst::ShortestFirstQueue< S, C, update >::Empty | ( | ) | const [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::ShortestFirstQueue< S, C, update >::Enqueue | ( | StateId | s | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
| StateId fst::ShortestFirstQueue< S, C, update >::Head | ( | ) | const [inline] |
Reimplemented from fst::QueueBase< S >.
| void fst::ShortestFirstQueue< S, C, update >::Update | ( | StateId | s | ) | [inline] |
Reimplemented from fst::QueueBase< S >.
1.7.1