Module regex_automata::nfa::thompson::range_trie

source Β·

Structs§

  • NextDupe πŸ”’
    The next state to process during duplication.
  • NextInsert πŸ”’
    The next state to process during insertion and any remaining ranges that we want to add for a particular sequence of ranges. The first such instance is always the root state along with all ranges given.
  • NextIter πŸ”’
    The next state (and its corresponding transition) that we want to visit during iteration in lexicographic order.
  • A range trie represents an ordered set of sequences of bytes.
  • Split πŸ”’
    Split represents a partitioning of two ranges into one or more ranges. This is the secret sauce that makes a range trie work, as it’s what tells us how to deal with two overlapping but unequal ranges during insertion.
  • State πŸ”’
    A single state in this trie.
  • Transition πŸ”’
    A transition is a single range of bytes. If a particular byte is in this range, then the corresponding machine may transition to the state pointed to by next_id.

Enums§

  • SplitRange πŸ”’
    A tagged range indicating how it was derived from a pair of ranges.

Constants§

  • FINAL πŸ”’
    There is only one final state in this trie. Every sequence of byte ranges added shares the same final state.
  • ROOT πŸ”’
    The root state of the trie.

Functions§

  • intersects πŸ”’
    Returns true if and only if the given ranges intersect.