#include <vector>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <set>
#include <iostream>
#include <utility>
Go to the source code of this file.
Classes | |
class | bfirst_cursor |
A bfirst_cursor implements the breadth-first traversal on deterministic automata. More... | |
class | cursor |
A plain cursor is a pointer to an automaton state that is able to move along defined transitions. More... | |
class | dfirst_cursor |
Implements the depth-first traversal on deterministic automata. More... | |
class | forward_cursor |
A pointer to a deterministic-automaton transition (source state, letter, aim state). More... | |
class | queue_cursor |
A forward_cursor storing its path in a queue of cursors. More... | |
class | stack_cursor |
A forward_cursor storing its path in a stack of cursors. More... | |
class | transition_cursor |
A pointer to an automaton transition (source state, letter, aim state). More... | |
Functions | |
template<class T > | |
bfirst_mark_cursor_type< T, typename T::concept, set_marker< typename T::state_type > >::model | bfirst_markc (const T &x) |
Construct a bfirst_cursor from either a cyclic automaton, a forward or queue cursor on cyclic structures. | |
template<typename T > | |
bfirst_cursor_type< T, typename T::concept >::model | bfirstc (const T &x) |
Constructs a bfirst_cursor from either an automaton, a forward cursor or a queue cursor. | |
template<typename T > | |
dfirst_mark_cursor_type< T, typename T::concept, set_marker< typename T::state_type > >::model | dfirst_markc (const T &x) |
Construct a dfirst_cursor from either a cyclic automaton, a forward or stack cursor on cyclic structures. | |
template<typename T > | |
dfirst_cursor_type< T, typename T::concept >::model | dfirstc (const T &x) |
Constructs a dfirst_cursor from either an automaton, a forward cursor or a stack cursor. | |
template<typename Cursor , typename InputIterator > | |
bool | forward (Cursor &c, InputIterator i, InputIterator j) |
Tries to move the cursor c along the path defined by the range [first, last) . | |
template<typename DFA > | |
forward_cursor< DFA > | forwardc (const DFA &a) |
Constructs a forward_cursor that points to the initial state of a deterministic automaton. | |
template<typename DFA > | |
forward_cursor< DFA > | forwardc (const DFA &a, typename DFA::state_type q) |
Constructs a forward_cursor that points to a specified state of a deterministic automaton. | |
template<typename DFA > | |
cursor< DFA > | plainc (const DFA &a) |
Constructs a plain cursor that points to the initial state of a deterministic automaton. | |
template<typename DFA > | |
cursor< DFA > | plainc (const DFA &a, typename DFA::state_type q) |
Constructs a plain cursor that points to a specified state of a deterministic automaton. | |
template<class ForwardCursor > | |
queue_cursor< ForwardCursor > | queuec (const ForwardCursor &x) |
Constructs a queue_cursor from a forward_cursor. | |
template<typename ForwardCursor > | |
stack_cursor< ForwardCursor > | stackc (const ForwardCursor &c) |
Constructs a stack_cursor containing a specified forward cursor. | |
template<typename FA > | |
transition_cursor< FA > | transitionc (const FA &a) |
Constructs a transition_cursor that points to the initial state of an automaton. | |
template<typename FA > | |
transition_cursor< FA > | transitionc (const FA &a, typename FA::state_type q) |
Constructs a transition_cursor that points to a specified state of an automaton. |