Module org.apache.lucene.core
Package org.apache.lucene.util.automaton
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/
.
-
ClassDescriptionConstruction of basic automata.Represents an automaton and all its states and transitions.Records new states and transitions and then
Automaton.Builder.finish()
creates theAutomaton
.Automaton provider forRegExp.
RegExp.toAutomaton(AutomatonProvider,int)
Automaton representation for matching UTF-8 byte[].Automaton representation for matching char[].Immutable class holding compiled details for a given Automaton.Automata are compiled into different internal forms for the most efficient execution depending upon the language they accept.Builds a minimal, deterministicAutomaton
that accepts a set of strings.DFSA state withchar
labels on transitions.Iterates all accepted strings.Nodes for path stack.Parametric description for generating a Levenshtein automaton of degree 1.Parametric description for generating a Levenshtein automaton of degree 1, with transpositions as primitive edits.Parametric description for generating a Levenshtein automaton of degree 2.Parametric description for generating a Levenshtein automaton of degree 2, with transpositions as primitive edits.Class to construct DFAs that match a word within some edit distance.A ParametricDescription describes the structure of a Levenshtein DFA for some degree n.FiniteStringsIterator
which limits the number of iterated accepted strings.Operations for minimizing automata.Automata operations.Regular Expression extension toAutomaton
.The type of expression represented by a RegExp node.Finite-state automaton with fast run operation.Pair of states.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 setThis exception is thrown when determinizing an automaton would require too much work.Holds one transition from anAutomaton
.Converts UTF-32 automata to the equivalent UTF-8 representation.