Module regex_automata::nfa::thompson::nfa

Structs

• DenseTransitions
  A sequence of transitions used to represent a dense state.
• Inner 🔒
  The “inner” part of the NFA. We split this part out so that we can easily wrap it in an Arc above in the definition of NFA.
• NFA
  A byte oriented Thompson non-deterministic finite automaton (NFA).
• PatternIter
  An iterator over all pattern IDs in an NFA.
• SparseTransitions
  A sequence of transitions used to represent a sparse state.
• Transition
  A single transition to another state.

Enums

• State
  A state in an NFA.