Package org.apache.lucene.util.automaton
Finite-state automaton for regular expressions.
This package contains a full DFA/NFA implementation with Unicode alphabet and support for all standard (and a number of non-standard) regular expression operations.
The most commonly used functionality is located in the classes
and Automaton
.
RegExp
For more information, go to the package home page at
http://www.brics.dk/automaton/
.
-
Interface Summary Interface Description AutomatonProvider Automaton provider forRegExp.
RegExp.toAutomaton(AutomatonProvider,int)
-
Class Summary Class Description Automata Construction of basic automata.Automaton Represents an automaton and all its states and transitions.Automaton.Builder Records new states and transitions and thenAutomaton.Builder.finish()
creates theAutomaton
.ByteRunAutomaton Automaton representation for matching UTF-8 byte[].CharacterRunAutomaton Automaton representation for matching char[].CompiledAutomaton Immutable class holding compiled details for a given Automaton.DaciukMihovAutomatonBuilder Builds a minimal, deterministicAutomaton
that accepts a set of strings.DaciukMihovAutomatonBuilder.State DFSA state withchar
labels on transitions.FiniteStringsIterator Iterates all accepted strings.FiniteStringsIterator.PathNode Nodes for path stack.FrozenIntSet IntSet Lev1ParametricDescription Parametric description for generating a Levenshtein automaton of degree 1Lev1TParametricDescription Parametric description for generating a Levenshtein automaton of degree 1, with transpositions as primitive editsLev2ParametricDescription Parametric description for generating a Levenshtein automaton of degree 2Lev2TParametricDescription Parametric description for generating a Levenshtein automaton of degree 2, with transpositions as primitive editsLevenshteinAutomata Class to construct DFAs that match a word within some edit distance.LevenshteinAutomata.ParametricDescription A ParametricDescription describes the structure of a Levenshtein DFA for some degree n.LimitedFiniteStringsIterator FiniteStringsIterator
which limits the number of iterated accepted strings.MinimizationOperations Operations for minimizing automata.MinimizationOperations.IntPair MinimizationOperations.StateList MinimizationOperations.StateListNode Operations Automata operations.Operations.PointTransitions Operations.PointTransitionSet Operations.TransitionList RegExp Regular Expression extension toAutomaton
.RunAutomaton Finite-state automaton with fast run operation.StatePair Pair of states.StateSet A thin wrapper ofIntIntHashMap
Maps from state in integer representation to its reference count Whenever the count of a state is 0, that state will be removed from the setTransition Holds one transition from anAutomaton
.UTF32ToUTF8 Converts UTF-32 automata to the equivalent UTF-8 representation.UTF32ToUTF8.UTF8Byte UTF32ToUTF8.UTF8Sequence -
Enum Summary Enum Description CompiledAutomaton.AUTOMATON_TYPE Automata are compiled into different internal forms for the most efficient execution depending upon the language they accept.RegExp.Kind The type of expression represented by a RegExp node. -
Exception Summary Exception Description TooComplexToDeterminizeException This exception is thrown when determinizing an automaton would require too much work.