Module nfa

Source

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 Nfas.
State ๐Ÿ”’
The states in a Nfa represent byte offsets.

Enumsยง

Transition ๐Ÿ”’
The transitions between states in a Nfa reflect bit validity.