regex_automata::nfa::thompson

Module map

Source

Structs§

  • An entry in this map.
  • A bounded hash map where the key is a sequence of NFA transitions and the value is a pre-existing NFA state ID.
  • An entry in this map.
  • A key that uniquely identifies an NFA state. It is a triple that represents a transition from one state for a particular byte range.
  • A cache of suffixes used to modestly compress UTF-8 automata for large Unicode character classes.

Constants§