Efficient DFA based parser for parsing a STEP enum.
Construct the parsing DFA
Static
Readonly
Parse a generated enum that is based on a minimal perfect hash.
The map to the enum type using a minimal perfect hash that doesn't require string extraction.
The input buffer.
The offset in the input buffer where the enum may be.
The end point of the parse which should not be overflowed.
The matching enum value or undefined if none matches or the parse fails.
Get the value of a given state for a given value.
Useful for using this for mappings. Will cause an exception if out of bounds.
The byte value to lookup.
The state to get the value for.
Match a step enum
The input buffer to match against.
The cursor to test the match against.
The end point to look at in the buffer.
The end of the match.
Efficient DFA based parser for parsing a STEP enum.