Module fst_no_std::automaton

Automaton implementations for finite state transducers.

This module defines a trait, Automaton, with several implementations including, but not limited to, union, intersection and complement.

Structs

• AlwaysMatch
  An automaton that always matches.
• Complement
  An automaton that matches exactly when the automaton it wraps does not.
• ComplementState
  The Automaton state for Complement<A>.
• Intersection
  An automaton that matches when both of its component automata match.
• IntersectionState
  The Automaton state for Intersection<A, B>.
• Levenshtein
  A Unicode aware Levenshtein automaton for running efficient fuzzy queries.
• StartsWith
  An automaton that matches a string that begins with something that the wrapped automaton matches.
• StartsWithState
  The Automaton state for StartsWith<A>.
• Str
  An automaton that matches if the input equals to a specific string.
• Subsequence
  An automaton that matches if the input contains a specific subsequence.
• Union
  An automaton that matches when one of its component automata match.
• UnionState
  The Automaton state for Union<A, B>.

Enums

• LevenshteinError
  An error that occurred while building a Levenshtein automaton.

Traits

• Automaton
  Automaton describes types that behave as a finite automaton.