#include <fst/state-table.h>

Public Types | |
| typedef T | StateTuple |
| typedef StateTuple::StateId | StateId |
Public Member Functions | |
| ErasableStateTable () | |
| StateId | FindState (const StateTuple &tuple) |
| const StateTuple & | Tuple (StateId s) const |
| StateId | Size () const |
| void | Erase (StateId s) |
An implementation using a hash map for the tuple to state ID mapping. This version permits erasing of states. The state tuple T must have == defined and its default constructor must produce a tuple that will never be seen. F is the hash function.
Definition at line 256 of file state-table.h.
| typedef StateTuple::StateId fst::ErasableStateTable< T, F >::StateId |
Reimplemented in fst::ErasableComposeStateTable< A, F >.
Definition at line 259 of file state-table.h.
| typedef T fst::ErasableStateTable< T, F >::StateTuple |
Reimplemented in fst::ErasableComposeStateTable< A, F >.
Definition at line 258 of file state-table.h.
| fst::ErasableStateTable< T, F >::ErasableStateTable | ( | ) | [inline] |
Definition at line 261 of file state-table.h.
| void fst::ErasableStateTable< T, F >::Erase | ( | StateId | s | ) | [inline] |
Definition at line 278 of file state-table.h.
| StateId fst::ErasableStateTable< T, F >::FindState | ( | const StateTuple & | tuple | ) | [inline] |
Definition at line 263 of file state-table.h.
| StateId fst::ErasableStateTable< T, F >::Size | ( | ) | const [inline] |
Definition at line 276 of file state-table.h.
| const StateTuple& fst::ErasableStateTable< T, F >::Tuple | ( | StateId | s | ) | const [inline] |
Definition at line 272 of file state-table.h.
1.7.1