Structsยง
- Nfa ๐
- A non-deterministic finite automaton (NFA) that represents the layout of a type.
The transmutability of two given types is computed by comparing their
Nfa
s. - State ๐
- The states in a
Nfa
represent byte offsets.
Enumsยง
- Transition ๐
- The transitions between states in a
Nfa
reflect bit validity.