/**
* test for constant score + boolean query + filter, the other tests only use the constant score
* mode
*/
private void testRange(int precisionStep) throws Exception {
String field = "field" + precisionStep;
int count = 3000;
long lower = (distance * 3 / 2) + startOffset,
upper = lower + count * distance + (distance / 3);
NumericRangeQuery<Long> q =
NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, true);
NumericRangeFilter<Long> f =
NumericRangeFilter.newLongRange(field, precisionStep, lower, upper, true, true);
int lastTerms = 0;
for (byte i = 0; i < 3; i++) {
TopDocs topDocs;
int terms;
String type;
q.clearTotalNumberOfTerms();
f.clearTotalNumberOfTerms();
switch (i) {
case 0:
type = " (constant score filter rewrite)";
q.setRewriteMethod(MultiTermQuery.CONSTANT_SCORE_FILTER_REWRITE);
topDocs = searcher.search(q, null, noDocs, Sort.INDEXORDER);
terms = q.getTotalNumberOfTerms();
break;
case 1:
type = " (constant score boolean rewrite)";
q.setRewriteMethod(MultiTermQuery.CONSTANT_SCORE_BOOLEAN_QUERY_REWRITE);
topDocs = searcher.search(q, null, noDocs, Sort.INDEXORDER);
terms = q.getTotalNumberOfTerms();
break;
case 2:
type = " (filter)";
topDocs = searcher.search(new MatchAllDocsQuery(), f, noDocs, Sort.INDEXORDER);
terms = f.getTotalNumberOfTerms();
break;
default:
return;
}
if (VERBOSE)
System.out.println(
"Found " + terms + " distinct terms in range for field '" + field + "'" + type + ".");
ScoreDoc[] sd = topDocs.scoreDocs;
assertNotNull(sd);
assertEquals("Score doc count" + type, count, sd.length);
Document doc = searcher.doc(sd[0].doc);
assertEquals("First doc" + type, 2 * distance + startOffset, Long.parseLong(doc.get(field)));
doc = searcher.doc(sd[sd.length - 1].doc);
assertEquals(
"Last doc" + type, (1 + count) * distance + startOffset, Long.parseLong(doc.get(field)));
if (i > 0 && searcher.getIndexReader().getSequentialSubReaders().length == 1) {
assertEquals("Distinct term number is equal for all query types", lastTerms, terms);
}
lastTerms = terms;
}
}
private void testRightOpenRange(int precisionStep) throws Exception {
String field = "field" + precisionStep;
int count = 3000;
long lower = (count - 1) * distance + (distance / 3) + startOffset;
NumericRangeQuery<Long> q =
NumericRangeQuery.newLongRange(field, precisionStep, lower, null, true, true);
TopDocs topDocs = searcher.search(q, null, noDocs, Sort.INDEXORDER);
if (VERBOSE)
System.out.println(
"Found "
+ q.getTotalNumberOfTerms()
+ " distinct terms in right open range for field '"
+ field
+ "'.");
ScoreDoc[] sd = topDocs.scoreDocs;
assertNotNull(sd);
assertEquals("Score doc count", noDocs - count, sd.length);
Document doc = searcher.doc(sd[0].doc);
assertEquals("First doc", count * distance + startOffset, Long.parseLong(doc.get(field)));
doc = searcher.doc(sd[sd.length - 1].doc);
assertEquals("Last doc", (noDocs - 1) * distance + startOffset, Long.parseLong(doc.get(field)));
q = NumericRangeQuery.newLongRange(field, precisionStep, lower, null, true, false);
topDocs = searcher.search(q, null, noDocs, Sort.INDEXORDER);
sd = topDocs.scoreDocs;
assertNotNull(sd);
assertEquals("Score doc count", noDocs - count, sd.length);
doc = searcher.doc(sd[0].doc);
assertEquals("First doc", count * distance + startOffset, Long.parseLong(doc.get(field)));
doc = searcher.doc(sd[sd.length - 1].doc);
assertEquals("Last doc", (noDocs - 1) * distance + startOffset, Long.parseLong(doc.get(field)));
}
private void testRandomTrieAndClassicRangeQuery(int precisionStep) throws Exception {
final Random rnd = newRandom();
String field = "field" + precisionStep;
int termCountT = 0, termCountC = 0;
for (int i = 0; i < 50; i++) {
long lower = (long) (rnd.nextDouble() * noDocs * distance) + startOffset;
long upper = (long) (rnd.nextDouble() * noDocs * distance) + startOffset;
if (lower > upper) {
long a = lower;
lower = upper;
upper = a;
}
// test inclusive range
NumericRangeQuery<Long> tq =
NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, true);
TermRangeQuery cq =
new TermRangeQuery(
field,
NumericUtils.longToPrefixCoded(lower),
NumericUtils.longToPrefixCoded(upper),
true,
true);
TopDocs tTopDocs = searcher.search(tq, 1);
TopDocs cTopDocs = searcher.search(cq, 1);
assertEquals(
"Returned count for NumericRangeQuery and TermRangeQuery must be equal",
cTopDocs.totalHits,
tTopDocs.totalHits);
termCountT += tq.getTotalNumberOfTerms();
termCountC += cq.getTotalNumberOfTerms();
// test exclusive range
tq = NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, false, false);
cq =
new TermRangeQuery(
field,
NumericUtils.longToPrefixCoded(lower),
NumericUtils.longToPrefixCoded(upper),
false,
false);
tTopDocs = searcher.search(tq, 1);
cTopDocs = searcher.search(cq, 1);
assertEquals(
"Returned count for NumericRangeQuery and TermRangeQuery must be equal",
cTopDocs.totalHits,
tTopDocs.totalHits);
termCountT += tq.getTotalNumberOfTerms();
termCountC += cq.getTotalNumberOfTerms();
// test left exclusive range
tq = NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, false, true);
cq =
new TermRangeQuery(
field,
NumericUtils.longToPrefixCoded(lower),
NumericUtils.longToPrefixCoded(upper),
false,
true);
tTopDocs = searcher.search(tq, 1);
cTopDocs = searcher.search(cq, 1);
assertEquals(
"Returned count for NumericRangeQuery and TermRangeQuery must be equal",
cTopDocs.totalHits,
tTopDocs.totalHits);
termCountT += tq.getTotalNumberOfTerms();
termCountC += cq.getTotalNumberOfTerms();
// test right exclusive range
tq = NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, false);
cq =
new TermRangeQuery(
field,
NumericUtils.longToPrefixCoded(lower),
NumericUtils.longToPrefixCoded(upper),
true,
false);
tTopDocs = searcher.search(tq, 1);
cTopDocs = searcher.search(cq, 1);
assertEquals(
"Returned count for NumericRangeQuery and TermRangeQuery must be equal",
cTopDocs.totalHits,
tTopDocs.totalHits);
termCountT += tq.getTotalNumberOfTerms();
termCountC += cq.getTotalNumberOfTerms();
}
if (precisionStep == Integer.MAX_VALUE) {
assertEquals(
"Total number of terms should be equal for unlimited precStep", termCountT, termCountC);
} else {
System.out.println("Average number of terms during random search on '" + field + "':");
System.out.println(" Trie query: " + (((double) termCountT) / (50 * 4)));
System.out.println(" Classical query: " + (((double) termCountC) / (50 * 4)));
}
}
