DFA created by subset construction from regex patterns. More...
Classes | |
struct | State |
Public Types | |
typedef std::list< State * > | List |
Public Member Functions | |
DFA () | |
~DFA () | |
void | clear () |
delete DFA More... | |
State * | state () |
new DFA state. More... | |
State * | state (Positions &pos) |
new DFA state with positions, destroys pos. More... | |
State * | state (State *tnode) |
new DFA state with optional tree DFA node and positions, destroys pos. More... | |
State * | state (State *tnode, Positions &pos) |
new DFA state with optional tree DFA node and positions, destroys pos. More... | |
State * | root () |
root of the DFA is the first state created or NULL. More... | |
State * | start () |
start state the DFA is the first state created. More... | |
Public Attributes | |
List | list |
block allocation list More... | |
uint16_t | next |
block allocation, next available slot in last block More... | |
Static Public Attributes | |
static const uint16_t | ALLOC = 1024 |
allocate 1024 DFA states at a time, to improve performance. More... | |
DFA created by subset construction from regex patterns.
typedef std::list<State*> reflex::Pattern::DFA::List |
|
inline |
|
inline |
|
inline |
delete DFA
new DFA state with positions, destroys pos.
|
static |
allocate 1024 DFA states at a time, to improve performance.
List reflex::Pattern::DFA::list |
block allocation list
uint16_t reflex::Pattern::DFA::next |
block allocation, next available slot in last block