public class NodeTermRangeQuery extends MultiNodeTermQuery
NodePrimitiveQuery that matches documents within an range of terms.
This query matches the documents looking for terms that fall into the
supplied range according to Byte.compareTo(Byte). It is not intended
for numerical ranges; use NumericRangeQuery instead.
This query uses the MultiNodeTermQuery.CONSTANT_SCORE_AUTO_REWRITE_DEFAULT
rewrite method.
Code taken from TermRangeQuery and adapted for SIREn.
MultiNodeTermQuery.RewriteMethodCONSTANT_SCORE_AUTO_REWRITE_DEFAULT, CONSTANT_SCORE_BOOLEAN_QUERY_REWRITE, CONSTANT_SCORE_FILTER_REWRITE, field, rewriteMethod, SCORING_BOOLEAN_QUERY_REWRITEdatatypeancestor, levelConstraint, lowerBound, upperBound| Constructor and Description |
|---|
NodeTermRangeQuery(String field,
org.apache.lucene.util.BytesRef lowerTerm,
org.apache.lucene.util.BytesRef upperTerm,
boolean includeLower,
boolean includeUpper)
Constructs a query selecting all terms greater/equal than
lowerTerm
but less/equal than upperTerm. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(Object obj) |
org.apache.lucene.util.BytesRef |
getLowerTerm()
Returns the lower value of this range query
|
protected org.apache.lucene.index.TermsEnum |
getTermsEnum(org.apache.lucene.index.Terms terms,
org.apache.lucene.util.AttributeSource atts)
Construct the enumeration to be used, expanding the
pattern term.
|
org.apache.lucene.util.BytesRef |
getUpperTerm()
Returns the upper value of this range query
|
int |
hashCode() |
boolean |
includesLower()
Returns
true if the lower endpoint is inclusive |
boolean |
includesUpper()
Returns
true if the upper endpoint is inclusive |
static NodeTermRangeQuery |
newStringRange(String field,
String lowerTerm,
String upperTerm,
boolean includeLower,
boolean includeUpper)
Factory that creates a new TermRangeQuery using Strings for term text.
|
String |
toString(String field)
Prints a user-readable version of this query.
|
getField, getRewriteMethod, getTermsEnum, rewrite, setRewriteMethodsetDatatype, wrapToStringWithDatatypegetDocsNodesAndPositionsEnum, getLevelConstraint, getNodeConstraint, setAncestorPointer, setLevelConstraint, setNodeConstraint, setNodeConstraintpublic NodeTermRangeQuery(String field, org.apache.lucene.util.BytesRef lowerTerm, org.apache.lucene.util.BytesRef upperTerm, boolean includeLower, boolean includeUpper)
lowerTerm
but less/equal than upperTerm.
If an endpoint is null, it is said to be "open". Either or both endpoints may be open. Open endpoints may not be exclusive (you can't select all but the first or last term without explicitly specifying the term to exclude.)
field - The field that holds both lower and upper terms.lowerTerm - The term text at the lower end of the rangeupperTerm - The term text at the upper end of the rangeincludeLower - If true, the lowerTerm is
included in the range.includeUpper - If true, the upperTerm is
included in the range.public static NodeTermRangeQuery newStringRange(String field, String lowerTerm, String upperTerm, boolean includeLower, boolean includeUpper)
public org.apache.lucene.util.BytesRef getLowerTerm()
public org.apache.lucene.util.BytesRef getUpperTerm()
public boolean includesLower()
true if the lower endpoint is inclusivepublic boolean includesUpper()
true if the upper endpoint is inclusiveprotected org.apache.lucene.index.TermsEnum getTermsEnum(org.apache.lucene.index.Terms terms,
org.apache.lucene.util.AttributeSource atts)
throws IOException
MultiNodeTermQueryTermsEnum.EMPTY if no
terms match). The TermsEnum must already be
positioned to the first matching term.
The given AttributeSource is passed by the MultiNodeTermQuery.RewriteMethod to
provide attributes, the rewrite method uses to inform about e.g. maximum competitive boosts.
This is currently only used by TopNodeTermsRewritegetTermsEnum in class MultiNodeTermQueryIOExceptionpublic String toString(String field)
toString in class org.apache.lucene.search.Querypublic int hashCode()
hashCode in class MultiNodeTermQuerypublic boolean equals(Object obj)
equals in class MultiNodeTermQueryCopyright © 2014. All rights reserved.