AutomatonQuery
A Query that will match terms against a finite-state machine.
This query will match documents that contain terms accepted by a given finite-state machine. The automaton can be constructed with the org.gnit.lucenekmp.util.automaton API. Alternatively, it can be created from a regular expression with RegexpQuery or from the standard Lucene wildcard syntax with WildcardQuery.
When the query is executed, it will will enumerate the term dictionary in an intelligent way to reduce the number of comparisons. For example: the regular expression of [dl]og will make approximately four comparisons: do, dog, lo, and log.
Inheritors
Constructors
Properties
Functions
Expert: Constructs an appropriate Weight implementation for this query.
Override and implement query instance equivalence properly in a subclass. This is required so that QueryCache works properly.
Constructs an enumeration that expands the pattern term. This method should only be called if the field exists (ie, implementations can assume the field does exist). This method never returns null. The returned TermsEnum is positioned to the first matching term.
Returns the automaton used to create this query
To rewrite to a simpler form, instead return a simpler enum from .getTermsEnum. For example, to rewrite to a single term, return a SingleTermsEnum
Recurse through the query tree, visiting any child queries.