Public Types | |
typedef Graph | graph_type |
The type of automata implementation. | |
typedef I | iterator_type |
The type of iterators used on the subset. | |
typedef std::pair< I, I > | range_type |
Type of the pair used to define the couple begin/end. | |
Public Member Functions | |
DeltaConstIterator (const graph_type &g, typename graph_type::hstate_t s) | |
Initialize the iterator. | |
void | next () |
Step toward the next item. | |
bool | done () const |
Tell if all the items have been visited. | |
graph_type::htransition_t | operator* () const |
Access the current item. |
Graph is the type of automata implementation. I is the type of iterators used on the subset.
Definition at line 34 of file bmig/iterator.hh.
DeltaConstIterator | ( | const graph_type & | g, | |
typename graph_type::hstate_t | s | |||
) |
Initialize the iterator.
g | the automaton implementation | |
s | the starting state |
bool done | ( | ) | const |
Tell if all the items have been visited.
Return true if there is no more item to visit and false otherwise.