Uses of Class
org.apache.lucene.util.automaton.Automaton
Package
Description
Text analysis.
Code to search indices.
Finite-state automaton for regular expressions.
-
Uses of Automaton in org.apache.lucene.analysis
Modifier and TypeMethodDescriptionTokenStreamToAutomaton.toAutomaton
(TokenStream in) Pulls the graph (includingPositionLengthAttribute
) from the providedTokenStream
, and creates the corresponding automaton where arcs are bytes (or Unicode code points if unicodeArcs = true) from each term.Modifier and TypeMethodDescriptionstatic TokenStream
AutomatonToTokenStream.toTokenStream
(Automaton automaton) converts an automaton into a TokenStream. -
Uses of Automaton in org.apache.lucene.search
Modifier and TypeFieldDescriptionprotected final Automaton
AutomatonQuery.automaton
the automaton to match index terms againstModifier and TypeMethodDescriptionAutomatonQuery.getAutomaton()
Returns the automaton used to create this querystatic Automaton
PrefixQuery.toAutomaton
(BytesRef prefix) Build an automaton accepting all terms with the specified prefix.static Automaton
TermRangeQuery.toAutomaton
(BytesRef lowerTerm, BytesRef upperTerm, boolean includeLower, boolean includeUpper) static Automaton
WildcardQuery.toAutomaton
(Term wildcardquery) Convert Lucene wildcard syntax into an automaton.ModifierConstructorDescriptionAutomatonQuery
(Term term, Automaton automaton) Create a new AutomatonQuery from anAutomaton
.AutomatonQuery
(Term term, Automaton automaton, int determinizeWorkLimit) Create a new AutomatonQuery from anAutomaton
.AutomatonQuery
(Term term, Automaton automaton, int determinizeWorkLimit, boolean isBinary) Create a new AutomatonQuery from anAutomaton
.AutomatonQuery
(Term term, Automaton automaton, int determinizeWorkLimit, boolean isBinary, MultiTermQuery.RewriteMethod rewriteMethod) Create a new AutomatonQuery from anAutomaton
. -
Uses of Automaton in org.apache.lucene.util.automaton
Modifier and TypeFieldDescriptionfinal Automaton
CompiledAutomaton.automaton
Two dimensional array of transitions, indexed by state number for traversal.Modifier and TypeMethodDescriptionstatic Automaton
DaciukMihovAutomatonBuilder.build
(Collection<BytesRef> input) Build a minimal, deterministic automaton from a sorted list ofBytesRef
representing strings in UTF-8.static Automaton
Operations.complement
(Automaton a, int determinizeWorkLimit) Returns a (deterministic) automaton that accepts the complement of the language of the given automaton.static Automaton
Operations.concatenate
(List<Automaton> l) Returns an automaton that accepts the concatenation of the languages of the given automata.static Automaton
Operations.concatenate
(Automaton a1, Automaton a2) Returns an automaton that accepts the concatenation of the languages of the given automata.Converts an incoming utf32 automaton to an equivalent utf8 one.static Automaton
Operations.determinize
(Automaton a, int workLimit) Determinizes the given automaton.Automaton.Builder.finish()
Compiles all added states and transitions into a newAutomaton
and returns it.AutomatonProvider.getAutomaton
(String name) Returns automaton of the given name.TooComplexToDeterminizeException.getAutomaton()
Returns the automaton that caused this exception, if any.static Automaton
Operations.intersection
(Automaton a1, Automaton a2) Returns an automaton that accepts the intersection of the languages of the given automata.static Automaton
Automata.makeAnyBinary()
Returns a new (deterministic) automaton that accepts all binary terms.static Automaton
Automata.makeAnyChar()
Returns a new (deterministic) automaton that accepts any single codepoint.static Automaton
Automata.makeAnyString()
Returns a new (deterministic) automaton that accepts all strings.static Automaton
Automata.makeBinary
(BytesRef term) Returns a new (deterministic) automaton that accepts the single given binary term.static Automaton
Automata.makeBinaryInterval
(BytesRef min, boolean minInclusive, BytesRef max, boolean maxInclusive) Creates a new deterministic, minimal automaton accepting all binary terms in the specified interval.static Automaton
Automata.makeChar
(int c) Returns a new (deterministic) automaton that accepts a single codepoint of the given value.static Automaton
Automata.makeCharRange
(int min, int max) Returns a new (deterministic) automaton that accepts a single codepoint whose value is in the given interval (including both end points).static Automaton
Automata.makeDecimalInterval
(int min, int max, int digits) Returns a new automaton that accepts strings representing decimal (base 10) non-negative integers in the given interval.static Automaton
Automata.makeEmpty()
Returns a new (deterministic) automaton with the empty language.static Automaton
Automata.makeEmptyString()
Returns a new (deterministic) automaton that accepts only the empty string.static Automaton
Automata.makeNonEmptyBinary()
Returns a new (deterministic) automaton that accepts all binary terms except the empty string.static Automaton
Automata.makeString
(int[] word, int offset, int length) Returns a new (deterministic) automaton that accepts the single given string from the specified unicode code points.static Automaton
Automata.makeString
(String s) Returns a new (deterministic) automaton that accepts the single given string.static Automaton
Automata.makeStringUnion
(Collection<BytesRef> utf8Strings) Returns a new (deterministic and minimal) automaton that accepts the union of the given collection ofBytesRef
s representing UTF-8 encoded strings.static Automaton
Minimizes (and determinizes if not already deterministic) the given automaton using Hopcroft's algorithm.static Automaton
Returns a (deterministic) automaton that accepts the intersection of the language ofa1
and the complement of the language ofa2
.static Automaton
Returns an automaton that accepts the union of the empty string and the language of the given automaton.static Automaton
Operations.removeDeadStates
(Automaton a) Removes transitions to dead states (a state is "dead" if it is not reachable from the initial state or no accept state is reachable from it.)static Automaton
Returns an automaton that accepts the Kleene star (zero or more concatenated repetitions) of the language of the given automaton.static Automaton
Returns an automaton that acceptsmin
or more concatenated repetitions of the language of the given automaton.static Automaton
Returns an automaton that accepts betweenmin
andmax
(including both) concatenated repetitions of the language of the given automaton.static Automaton
Returns an automaton accepting the reverse language.static Automaton
Reverses the automaton, returning the new initial states.LevenshteinAutomata.toAutomaton
(int n) Compute a DFA that accepts all strings within an edit distance ofn
.LevenshteinAutomata.toAutomaton
(int n, String prefix) Compute a DFA that accepts all strings within an edit distance ofn
, matching the specified exact prefix.RegExp.toAutomaton()
Constructs newAutomaton
from thisRegExp
.RegExp.toAutomaton
(int determinizeWorkLimit) Constructs newAutomaton
from thisRegExp
.RegExp.toAutomaton
(Map<String, Automaton> automata, int determinizeWorkLimit) Constructs newAutomaton
from thisRegExp
.RegExp.toAutomaton
(AutomatonProvider automaton_provider, int determinizeWorkLimit) Constructs newAutomaton
from thisRegExp
.static Automaton
Operations.union
(Collection<Automaton> l) Returns an automaton that accepts the union of the languages of the given automata.static Automaton
Returns an automaton that accepts the union of the languages of the given automata.Modifier and TypeMethodDescriptionstatic int
Automata.appendAnyChar
(Automaton a, int state) Accept any single character starting from the specified state, returning the new statestatic int
Automata.appendChar
(Automaton a, int state, int c) Appends the specified character to the specified state, returning a new state.static Automaton
Operations.complement
(Automaton a, int determinizeWorkLimit) Returns a (deterministic) automaton that accepts the complement of the language of the given automaton.static Automaton
Operations.concatenate
(Automaton a1, Automaton a2) Returns an automaton that accepts the concatenation of the languages of the given automata.Converts an incoming utf32 automaton to an equivalent utf8 one.void
Copies over all states/transitions from other.void
Copies over all states/transitions from other.void
Automaton.Builder.copyStates
(Automaton other) Copies over all states from other.static Automaton
Operations.determinize
(Automaton a, int workLimit) Determinizes the given automaton.static String
Operations.getCommonPrefix
(Automaton a) Returns the longest string that is a prefix of all accepted strings and visits each state at most once.static BytesRef
Operations.getCommonPrefixBytesRef
(Automaton a) Returns the longest BytesRef that is a prefix of all accepted strings and visits each state at most once.static BytesRef
Operations.getCommonSuffixBytesRef
(Automaton a) Returns the longest BytesRef that is a suffix of all accepted strings.static IntsRef
Operations.getSingleton
(Automaton a) If this automaton accepts a single input, return it.static boolean
Operations.hasDeadStates
(Automaton a) Returns true if this automaton has any states that cannot be reached from the initial state or cannot reach an accept state.static boolean
Operations.hasDeadStatesFromInitial
(Automaton a) Returns true if there are dead states reachable from an initial state.static boolean
Operations.hasDeadStatesToAccept
(Automaton a) Returns true if there are dead states that reach an accept state.static Automaton
Operations.intersection
(Automaton a1, Automaton a2) Returns an automaton that accepts the intersection of the languages of the given automata.static boolean
Returns true if the given automaton accepts no strings.static boolean
Returns true if the language of this automaton is finite.static boolean
Returns true if the given automaton accepts all strings.static boolean
Returns true if the given automaton accepts all strings for the specified min/max range of the alphabet.static Automaton
Minimizes (and determinizes if not already deterministic) the given automaton using Hopcroft's algorithm.static Automaton
Returns a (deterministic) automaton that accepts the intersection of the language ofa1
and the complement of the language ofa2
.static Automaton
Returns an automaton that accepts the union of the empty string and the language of the given automaton.static Automaton
Operations.removeDeadStates
(Automaton a) Removes transitions to dead states (a state is "dead" if it is not reachable from the initial state or no accept state is reachable from it.)static Automaton
Returns an automaton that accepts the Kleene star (zero or more concatenated repetitions) of the language of the given automaton.static Automaton
Returns an automaton that acceptsmin
or more concatenated repetitions of the language of the given automaton.static Automaton
Returns an automaton that accepts betweenmin
andmax
(including both) concatenated repetitions of the language of the given automaton.static Automaton
Returns an automaton accepting the reverse language.static Automaton
Reverses the automaton, returning the new initial states.static boolean
Returns true if the given string is accepted by the automaton.static boolean
Returns true if the given string (expressed as unicode codepoints) is accepted by the automaton.static boolean
Operations.sameLanguage
(Automaton a1, Automaton a2) Returns true if these two automata accept exactly the same language.static boolean
Returns true if the language ofa1
is a subset of the language ofa2
.static int[]
Operations.topoSortStates
(Automaton a) Returns the topological sort of all states reachable from the initial state.static Automaton
Returns an automaton that accepts the union of the languages of the given automata.Modifier and TypeMethodDescriptionstatic Automaton
Operations.concatenate
(List<Automaton> l) Returns an automaton that accepts the concatenation of the languages of the given automata.RegExp.toAutomaton
(Map<String, Automaton> automata, int determinizeWorkLimit) Constructs newAutomaton
from thisRegExp
.static Automaton
Operations.union
(Collection<Automaton> l) Returns an automaton that accepts the union of the languages of the given automata.ModifierConstructorDescriptionConverts incoming automaton to byte-based (UTF32ToUTF8) firstByteRunAutomaton
(Automaton a, boolean isBinary, int determinizeWorkLimit) expert: if isBinary is true, the input is already byte-basedConstruct with a default number of determinizeWorkLimit.CharacterRunAutomaton
(Automaton a, int determinizeWorkLimit) Constructor specifying determinizeWorkLimit.CompiledAutomaton
(Automaton automaton) Create this, passing simplify=true and finite=null, so that we try to simplify the automaton and determine if it is finite.CompiledAutomaton
(Automaton automaton, Boolean finite, boolean simplify) Create this.CompiledAutomaton
(Automaton automaton, Boolean finite, boolean simplify, int determinizeWorkLimit, boolean isBinary) Create this.Constructor.FiniteStringsIterator
(Automaton a, int startState, int endState) Constructor.LimitedFiniteStringsIterator
(Automaton a, int limit) Constructor.protected
RunAutomaton
(Automaton a, int alphabetSize) Constructs a newRunAutomaton
from a deterministicAutomaton
.protected
RunAutomaton
(Automaton a, int alphabetSize, int determinizeWorkLimit) Constructs a newRunAutomaton
from a deterministicAutomaton
.TooComplexToDeterminizeException
(Automaton automaton, int determinizeWorkLimit) Use this constructor when the automaton failed to determinize.