public class TermInSetQuery extends Query implements Accountable
ConstantScoreQuery over a BooleanQuery containing only
BooleanClause.Occur.SHOULD clauses.
For instance in the following example, both q1 and q2
would yield the same scores:
Query q1 = new TermInSetQuery("field", new BytesRef("foo"), new BytesRef("bar"));
BooleanQuery bq = new BooleanQuery();
bq.add(new TermQuery(new Term("field", "foo")), Occur.SHOULD);
bq.add(new TermQuery(new Term("field", "bar")), Occur.SHOULD);
Query q2 = new ConstantScoreQuery(bq);
When there are few terms, this query executes like a regular disjunction.
However, when there are many terms, instead of merging iterators on the fly,
it will populate a bit set with matching docs and return a Scorer
over this bit set.
NOTE: This query produces scores that are equal to its boost
NULL_ACCOUNTABLE| Constructor and Description |
|---|
TermInSetQuery(String field,
BytesRef... terms)
Creates a new
TermInSetQuery from the given array of terms. |
TermInSetQuery(String field,
Collection<BytesRef> terms)
Creates a new
TermInSetQuery from the given collection of terms. |
| Modifier and Type | Method and Description |
|---|---|
Weight |
createWeight(IndexSearcher searcher,
ScoreMode scoreMode,
float boost)
Expert: Constructs an appropriate Weight implementation for this query.
|
boolean |
equals(Object other)
Override and implement query instance equivalence properly in a subclass.
|
Collection<Accountable> |
getChildResources()
Returns nested resources of this class.
|
PrefixCodedTerms |
getTermData()
Returns the terms wrapped in a PrefixCodedTerms.
|
int |
hashCode()
Override and implement query hash code properly in a subclass.
|
long |
ramBytesUsed()
Return the memory usage of this object in bytes.
|
Query |
rewrite(IndexReader reader)
Expert: called to re-write queries into primitive queries.
|
String |
toString(String defaultField)
Prints a query to a string, with
field assumed to be the
default field and omitted. |
void |
visit(QueryVisitor visitor)
Recurse through the query tree, visiting any child queries
|
classHash, sameClassAs, toStringpublic TermInSetQuery(String field, Collection<BytesRef> terms)
TermInSetQuery from the given collection of terms.public TermInSetQuery(String field, BytesRef... terms)
TermInSetQuery from the given array of terms.public Query rewrite(IndexReader reader) throws IOException
QueryCallers are expected to call rewrite multiple times if necessary, until the
rewritten query is the same as the original query.
rewrite in class QueryIOExceptionIndexSearcher.rewrite(Query)public void visit(QueryVisitor visitor)
Querypublic boolean equals(Object other)
QueryQueryCache works properly.
Typically a query will be equal to another only if it's an instance of
the same class and its document-filtering properties are identical that other
instance. Utility methods are provided for certain repetitive code.equals in class QueryQuery.sameClassAs(Object),
Query.classHash()public int hashCode()
QueryQueryCache works properly.hashCode in class QueryQuery.equals(Object)public PrefixCodedTerms getTermData()
public String toString(String defaultField)
Queryfield assumed to be the
default field and omitted.public long ramBytesUsed()
AccountableramBytesUsed in interface Accountablepublic Collection<Accountable> getChildResources()
AccountablegetChildResources in interface AccountableAccountablespublic Weight createWeight(IndexSearcher searcher, ScoreMode scoreMode, float boost) throws IOException
QueryOnly implemented by primitive queries, which re-write to themselves.
createWeight in class QueryscoreMode - How the produced scorers will be consumed.boost - The boost that is propagated by the parent queries.IOExceptionCopyright © 2000-2022 Apache Software Foundation. All Rights Reserved.