Module nfa

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.