One node of a minimal deterministic UTF-8 trie for a code-point class. Its transitions are byte ranges that are pairwise disjoint, so at most one edge matches any byte — that determinism is what makes the byte-program one-pass-friendly. child >= 0 is a node id; child == -1 is accept (a code point ends here — the run continues at the construct's successor). More...

#include <lazy_dfa.hpp>

Public Attributes
std::vector< std::pair< utf8_byte_range, std::int32_t > >	trans

Detailed Description

One node of a minimal deterministic UTF-8 trie for a code-point class. Its transitions are byte ranges that are pairwise disjoint, so at most one edge matches any byte — that determinism is what makes the byte-program one-pass-friendly. child >= 0 is a node id; child == -1 is accept (a code point ends here — the run continues at the construct's successor).

Definition at line 84 of file lazy_dfa.hpp.

Member Data Documentation

◆ trans

std::vector<std::pair<utf8_byte_range, std::int32_t> > real::detail::utf8_trie_node::trans

Definition at line 86 of file lazy_dfa.hpp.

The documentation for this struct was generated from the following file:

include/real/automata/lazy_dfa.hpp

Public Attributes

Detailed Description

Member Data Documentation

◆ trans