#include <pattern.h>
|
| typedef std::pair< Char, State * > | Edge |
| | hi of char range [lo,hi] and state to transition to More...
|
| |
| typedef std::map< Char, Edge > | Edges |
| | maps lo to hi and state to transition to on char in range [lo,hi] More...
|
| |
hi of char range [lo,hi] and state to transition to
maps lo to hi and state to transition to on char in range [lo,hi]
| reflex::Pattern::DFA::State::State |
( |
| ) |
|
|
inline |
| Accept reflex::Pattern::DFA::State::accept |
nonzero if final state, the index of an accepted/captured subpattern
| Edges reflex::Pattern::DFA::State::edges |
| Index reflex::Pattern::DFA::State::first |
index of this state in the opcode table in the first assembly pass, also used in breadth-first search to cut DFA for predict match
| Index reflex::Pattern::DFA::State::index |
index of this state in the opcode table, also used in HFA construction
| State* reflex::Pattern::DFA::State::left |
left pointer for O(log N) node insertion in the hash table overflow tree
| State* reflex::Pattern::DFA::State::next |
points to next state in the list of states allocated depth-first by subset construction
| bool reflex::Pattern::DFA::State::redo |
true if this is a final state of a negative pattern
| State* reflex::Pattern::DFA::State::right |
right pointer for O(log N) node insertion in the hash table overflow tree
| State* reflex::Pattern::DFA::State::tnode |
the corresponding tree DFA node, when applicable
The documentation for this struct was generated from the following file: