|
REAL
Regular Expression Algorithmic Library — constexpr C++20 regex
|
Byte-class alphabet over a Pike program: bytes that satisfy exactly the same byte/klass predicates share a class, so the DFA transitions over classes instead of 256 raw bytes. The same reduction real::dfa uses, computed here from the Pike program's own ops.
More...
#include <lazy_dfa.hpp>
Public Attributes | |
| std::array< std::uint8_t, 256 > | of {} |
| byte -> class index. | |
| std::uint16_t | count {0} |
| number of distinct classes. | |
Byte-class alphabet over a Pike program: bytes that satisfy exactly the same byte/klass predicates share a class, so the DFA transitions over classes instead of 256 raw bytes. The same reduction real::dfa uses, computed here from the Pike program's own ops.
Definition at line 357 of file lazy_dfa.hpp.
| std::uint16_t real::detail::lazy_byte_alphabet::count {0} |
number of distinct classes.
Definition at line 360 of file lazy_dfa.hpp.
| std::array<std::uint8_t, 256> real::detail::lazy_byte_alphabet::of {} |
byte -> class index.
Definition at line 359 of file lazy_dfa.hpp.