Tree DFA constructed from string patterns.
More...
|
| static const uint16_t | ALLOC = 64 |
| | allocate 64 nodes at a time, to improve performance More...
|
| |
Tree DFA constructed from string patterns.
| reflex::Pattern::Tree::Tree |
( |
| ) |
|
|
inline |
| reflex::Pattern::Tree::~Tree |
( |
| ) |
|
|
inline |
| void reflex::Pattern::Tree::clear |
( |
| ) |
|
|
inline |
create an edge from a tree node to a target tree node, return the target tree node.
| Node* reflex::Pattern::Tree::leaf |
( |
| ) |
|
|
inline |
| Node* reflex::Pattern::Tree::root |
( |
| ) |
|
|
inline |
return the root of the tree.
| const uint16_t reflex::Pattern::Tree::ALLOC = 64 |
|
static |
allocate 64 nodes at a time, to improve performance
| List reflex::Pattern::Tree::list |
| uint16_t reflex::Pattern::Tree::next |
block allocation, next available slot in last block
| Node* reflex::Pattern::Tree::tree |
The documentation for this struct was generated from the following file: