|
REAL
Regular Expression Algorithmic Library — constexpr C++20 regex
|
A minimal deterministic UTF-8 trie for a code-point class. root == -1 means the class is empty.
More...
#include <lazy_dfa.hpp>
Public Attributes | |
| std::vector< utf8_trie_node > | nodes |
| std::int32_t | root {-1} |
A minimal deterministic UTF-8 trie for a code-point class. root == -1 means the class is empty.
Definition at line 90 of file lazy_dfa.hpp.
| std::vector<utf8_trie_node> real::detail::utf8_trie::nodes |
Definition at line 92 of file lazy_dfa.hpp.
| std::int32_t real::detail::utf8_trie::root {-1} |
Definition at line 93 of file lazy_dfa.hpp.