| package org.apache.lucene.search; |
| |
| /** |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to You under the Apache License, Version 2.0 |
| * (the "License"); you may not use this file except in compliance with |
| * the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| import org.apache.lucene.analysis.MockAnalyzer; |
| import org.apache.lucene.document.Document; |
| import org.apache.lucene.document.Field; |
| import org.apache.lucene.document.NumericField; |
| import org.apache.lucene.index.IndexReader; |
| import org.apache.lucene.index.IndexWriter; |
| import org.apache.lucene.index.RandomIndexWriter; |
| import org.apache.lucene.index.SlowMultiReaderWrapper; |
| import org.apache.lucene.index.IndexReader.AtomicReaderContext; |
| import org.apache.lucene.store.Directory; |
| import org.apache.lucene.util.BytesRef; |
| import org.apache.lucene.util.LuceneTestCase; |
| import org.apache.lucene.util.NumericUtils; |
| import org.apache.lucene.util._TestUtil; |
| import org.junit.AfterClass; |
| import org.junit.BeforeClass; |
| import org.junit.Test; |
| |
| public class TestNumericRangeQuery64 extends LuceneTestCase { |
| // distance of entries |
| private static final long distance = 66666L; |
| // shift the starting of the values to the left, to also have negative values: |
| private static final long startOffset = - 1L << 31; |
| // number of docs to generate for testing |
| private static final int noDocs = atLeast(5000); |
| |
| private static Directory directory = null; |
| private static IndexReader reader = null; |
| private static IndexSearcher searcher = null; |
| |
| @BeforeClass |
| public static void beforeClass() throws Exception { |
| directory = newDirectory(); |
| RandomIndexWriter writer = new RandomIndexWriter(random, directory, |
| newIndexWriterConfig(TEST_VERSION_CURRENT, new MockAnalyzer(random)) |
| .setMaxBufferedDocs(_TestUtil.nextInt(random, 50, 1000)) |
| .setMergePolicy(newLogMergePolicy())); |
| |
| NumericField |
| field8 = new NumericField("field8", 8, NumericField.TYPE_STORED), |
| field6 = new NumericField("field6", 6, NumericField.TYPE_STORED), |
| field4 = new NumericField("field4", 4, NumericField.TYPE_STORED), |
| field2 = new NumericField("field2", 2, NumericField.TYPE_STORED), |
| fieldNoTrie = new NumericField("field"+Integer.MAX_VALUE, Integer.MAX_VALUE, NumericField.TYPE_STORED), |
| ascfield8 = new NumericField("ascfield8", 8, NumericField.TYPE_UNSTORED), |
| ascfield6 = new NumericField("ascfield6", 6, NumericField.TYPE_UNSTORED), |
| ascfield4 = new NumericField("ascfield4", 4, NumericField.TYPE_UNSTORED), |
| ascfield2 = new NumericField("ascfield2", 2, NumericField.TYPE_UNSTORED); |
| |
| Document doc = new Document(); |
| // add fields, that have a distance to test general functionality |
| doc.add(field8); doc.add(field6); doc.add(field4); doc.add(field2); doc.add(fieldNoTrie); |
| // add ascending fields with a distance of 1, beginning at -noDocs/2 to test the correct splitting of range and inclusive/exclusive |
| doc.add(ascfield8); doc.add(ascfield6); doc.add(ascfield4); doc.add(ascfield2); |
| |
| // Add a series of noDocs docs with increasing long values, by updating the fields |
| for (int l=0; l<noDocs; l++) { |
| long val=distance*l+startOffset; |
| field8.setLongValue(val); |
| field6.setLongValue(val); |
| field4.setLongValue(val); |
| field2.setLongValue(val); |
| fieldNoTrie.setLongValue(val); |
| |
| val=l-(noDocs/2); |
| ascfield8.setLongValue(val); |
| ascfield6.setLongValue(val); |
| ascfield4.setLongValue(val); |
| ascfield2.setLongValue(val); |
| writer.addDocument(doc); |
| } |
| reader = writer.getReader(); |
| searcher=newSearcher(reader); |
| writer.close(); |
| } |
| |
| @AfterClass |
| public static void afterClass() throws Exception { |
| searcher.close(); |
| searcher = null; |
| reader.close(); |
| reader = null; |
| directory.close(); |
| directory = null; |
| } |
| |
| @Override |
| public void setUp() throws Exception { |
| super.setUp(); |
| // set the theoretical maximum term count for 8bit (see docs for the number) |
| // super.tearDown will restore the default |
| BooleanQuery.setMaxClauseCount(7*255*2 + 255); |
| } |
| |
| /** 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() == null || |
| searcher.getIndexReader().getSequentialSubReaders().length == 1)) { |
| assertEquals("Distinct term number is equal for all query types", lastTerms, terms); |
| } |
| lastTerms = terms; |
| } |
| } |
| |
| @Test |
| public void testRange_8bit() throws Exception { |
| testRange(8); |
| } |
| |
| @Test |
| public void testRange_6bit() throws Exception { |
| testRange(6); |
| } |
| |
| @Test |
| public void testRange_4bit() throws Exception { |
| testRange(4); |
| } |
| |
| @Test |
| public void testRange_2bit() throws Exception { |
| testRange(2); |
| } |
| |
| @Test |
| public void testInverseRange() throws Exception { |
| AtomicReaderContext context = (AtomicReaderContext) new SlowMultiReaderWrapper(searcher.getIndexReader()).getTopReaderContext(); |
| NumericRangeFilter<Long> f = NumericRangeFilter.newLongRange("field8", 8, 1000L, -1000L, true, true); |
| assertSame("A inverse range should return the EMPTY_DOCIDSET instance", DocIdSet.EMPTY_DOCIDSET, |
| f.getDocIdSet(context)); |
| f = NumericRangeFilter.newLongRange("field8", 8, Long.MAX_VALUE, null, false, false); |
| assertSame("A exclusive range starting with Long.MAX_VALUE should return the EMPTY_DOCIDSET instance", |
| DocIdSet.EMPTY_DOCIDSET, f.getDocIdSet(context)); |
| f = NumericRangeFilter.newLongRange("field8", 8, null, Long.MIN_VALUE, false, false); |
| assertSame("A exclusive range ending with Long.MIN_VALUE should return the EMPTY_DOCIDSET instance", |
| DocIdSet.EMPTY_DOCIDSET, f.getDocIdSet(context)); |
| } |
| |
| @Test |
| public void testOneMatchQuery() throws Exception { |
| NumericRangeQuery<Long> q = NumericRangeQuery.newLongRange("ascfield8", 8, 1000L, 1000L, true, true); |
| assertSame(MultiTermQuery.CONSTANT_SCORE_BOOLEAN_QUERY_REWRITE, q.getRewriteMethod()); |
| TopDocs topDocs = searcher.search(q, noDocs); |
| ScoreDoc[] sd = topDocs.scoreDocs; |
| assertNotNull(sd); |
| assertEquals("Score doc count", 1, sd.length ); |
| } |
| |
| private void testLeftOpenRange(int precisionStep) throws Exception { |
| String field="field"+precisionStep; |
| int count=3000; |
| long upper=(count-1)*distance + (distance/3) + startOffset; |
| NumericRangeQuery<Long> q=NumericRangeQuery.newLongRange(field, precisionStep, null, upper, true, true); |
| TopDocs topDocs = searcher.search(q, null, noDocs, Sort.INDEXORDER); |
| if (VERBOSE) System.out.println("Found "+q.getTotalNumberOfTerms()+" distinct terms in left open range for field '"+field+"'."); |
| ScoreDoc[] sd = topDocs.scoreDocs; |
| assertNotNull(sd); |
| assertEquals("Score doc count", count, sd.length ); |
| Document doc=searcher.doc(sd[0].doc); |
| assertEquals("First doc", startOffset, Long.parseLong(doc.get(field)) ); |
| doc=searcher.doc(sd[sd.length-1].doc); |
| assertEquals("Last doc", (count-1)*distance+startOffset, Long.parseLong(doc.get(field)) ); |
| |
| q=NumericRangeQuery.newLongRange(field, precisionStep, null, upper, false, true); |
| topDocs = searcher.search(q, null, noDocs, Sort.INDEXORDER); |
| sd = topDocs.scoreDocs; |
| assertNotNull(sd); |
| assertEquals("Score doc count", count, sd.length ); |
| doc=searcher.doc(sd[0].doc); |
| assertEquals("First doc", startOffset, Long.parseLong(doc.get(field)) ); |
| doc=searcher.doc(sd[sd.length-1].doc); |
| assertEquals("Last doc", (count-1)*distance+startOffset, Long.parseLong(doc.get(field)) ); |
| } |
| |
| @Test |
| public void testLeftOpenRange_8bit() throws Exception { |
| testLeftOpenRange(8); |
| } |
| |
| @Test |
| public void testLeftOpenRange_6bit() throws Exception { |
| testLeftOpenRange(6); |
| } |
| |
| @Test |
| public void testLeftOpenRange_4bit() throws Exception { |
| testLeftOpenRange(4); |
| } |
| |
| @Test |
| public void testLeftOpenRange_2bit() throws Exception { |
| testLeftOpenRange(2); |
| } |
| |
| 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)) ); |
| } |
| |
| @Test |
| public void testRightOpenRange_8bit() throws Exception { |
| testRightOpenRange(8); |
| } |
| |
| @Test |
| public void testRightOpenRange_6bit() throws Exception { |
| testRightOpenRange(6); |
| } |
| |
| @Test |
| public void testRightOpenRange_4bit() throws Exception { |
| testRightOpenRange(4); |
| } |
| |
| @Test |
| public void testRightOpenRange_2bit() throws Exception { |
| testRightOpenRange(2); |
| } |
| |
| @Test |
| public void testInfiniteValues() throws Exception { |
| Directory dir = newDirectory(); |
| IndexWriter writer = new IndexWriter(dir, newIndexWriterConfig( |
| TEST_VERSION_CURRENT, new MockAnalyzer(random))); |
| Document doc = new Document(); |
| doc.add(new NumericField("double").setDoubleValue(Double.NEGATIVE_INFINITY)); |
| doc.add(new NumericField("long").setLongValue(Long.MIN_VALUE)); |
| writer.addDocument(doc); |
| |
| doc = new Document(); |
| doc.add(new NumericField("double").setDoubleValue(Double.POSITIVE_INFINITY)); |
| doc.add(new NumericField("long").setLongValue(Long.MAX_VALUE)); |
| writer.addDocument(doc); |
| |
| doc = new Document(); |
| doc.add(new NumericField("double").setDoubleValue(0.0)); |
| doc.add(new NumericField("long").setLongValue(0L)); |
| writer.addDocument(doc); |
| writer.close(); |
| |
| IndexSearcher s = new IndexSearcher(dir); |
| |
| Query q=NumericRangeQuery.newLongRange("long", null, null, true, true); |
| TopDocs topDocs = s.search(q, 10); |
| assertEquals("Score doc count", 3, topDocs.scoreDocs.length ); |
| |
| q=NumericRangeQuery.newLongRange("long", null, null, false, false); |
| topDocs = s.search(q, 10); |
| assertEquals("Score doc count", 3, topDocs.scoreDocs.length ); |
| |
| q=NumericRangeQuery.newLongRange("long", Long.MIN_VALUE, Long.MAX_VALUE, true, true); |
| topDocs = s.search(q, 10); |
| assertEquals("Score doc count", 3, topDocs.scoreDocs.length ); |
| |
| q=NumericRangeQuery.newLongRange("long", Long.MIN_VALUE, Long.MAX_VALUE, false, false); |
| topDocs = s.search(q, 10); |
| assertEquals("Score doc count", 1, topDocs.scoreDocs.length ); |
| |
| q=NumericRangeQuery.newDoubleRange("double", null, null, true, true); |
| topDocs = s.search(q, 10); |
| assertEquals("Score doc count", 3, topDocs.scoreDocs.length ); |
| |
| q=NumericRangeQuery.newDoubleRange("double", null, null, false, false); |
| topDocs = s.search(q, 10); |
| assertEquals("Score doc count", 3, topDocs.scoreDocs.length ); |
| |
| s.close(); |
| dir.close(); |
| } |
| |
| private void testRandomTrieAndClassicRangeQuery(int precisionStep) throws Exception { |
| String field="field"+precisionStep; |
| int termCountT=0,termCountC=0; |
| int num = atLeast(10); |
| for (int i = 0; i < num; i++) { |
| long lower=(long)(random.nextDouble()*noDocs*distance)+startOffset; |
| long upper=(long)(random.nextDouble()*noDocs*distance)+startOffset; |
| if (lower>upper) { |
| long a=lower; lower=upper; upper=a; |
| } |
| final BytesRef lowerBytes = new BytesRef(NumericUtils.BUF_SIZE_LONG), upperBytes = new BytesRef(NumericUtils.BUF_SIZE_LONG); |
| NumericUtils.longToPrefixCoded(lower, 0, lowerBytes); |
| NumericUtils.longToPrefixCoded(upper, 0, upperBytes); |
| |
| // test inclusive range |
| NumericRangeQuery<Long> tq=NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, true); |
| TermRangeQuery cq=new TermRangeQuery(field, lowerBytes, upperBytes, 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, lowerBytes, upperBytes, 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, lowerBytes, upperBytes, 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, lowerBytes, upperBytes, 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 && |
| (searcher.getIndexReader().getSequentialSubReaders() == null || |
| searcher.getIndexReader().getSequentialSubReaders().length == 1)) { |
| assertEquals("Total number of terms should be equal for unlimited precStep", termCountT, termCountC); |
| } else if (VERBOSE) { |
| System.out.println("Average number of terms during random search on '" + field + "':"); |
| System.out.println(" Trie query: " + (((double)termCountT)/(num * 4))); |
| System.out.println(" Classical query: " + (((double)termCountC)/(num * 4))); |
| } |
| } |
| |
| @Test |
| public void testRandomTrieAndClassicRangeQuery_8bit() throws Exception { |
| testRandomTrieAndClassicRangeQuery(8); |
| } |
| |
| @Test |
| public void testRandomTrieAndClassicRangeQuery_6bit() throws Exception { |
| testRandomTrieAndClassicRangeQuery(6); |
| } |
| |
| @Test |
| public void testRandomTrieAndClassicRangeQuery_4bit() throws Exception { |
| testRandomTrieAndClassicRangeQuery(4); |
| } |
| |
| @Test |
| public void testRandomTrieAndClassicRangeQuery_2bit() throws Exception { |
| testRandomTrieAndClassicRangeQuery(2); |
| } |
| |
| @Test |
| public void testRandomTrieAndClassicRangeQuery_NoTrie() throws Exception { |
| testRandomTrieAndClassicRangeQuery(Integer.MAX_VALUE); |
| } |
| |
| private void testRangeSplit(int precisionStep) throws Exception { |
| String field="ascfield"+precisionStep; |
| // 10 random tests |
| int num = atLeast(10); |
| for (int i = 0; i < num; i++) { |
| long lower=(long)(random.nextDouble()*noDocs - noDocs/2); |
| long upper=(long)(random.nextDouble()*noDocs - noDocs/2); |
| if (lower>upper) { |
| long a=lower; lower=upper; upper=a; |
| } |
| // test inclusive range |
| Query tq=NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, true); |
| TopDocs tTopDocs = searcher.search(tq, 1); |
| assertEquals("Returned count of range query must be equal to inclusive range length", upper-lower+1, tTopDocs.totalHits ); |
| // test exclusive range |
| tq=NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, false, false); |
| tTopDocs = searcher.search(tq, 1); |
| assertEquals("Returned count of range query must be equal to exclusive range length", Math.max(upper-lower-1, 0), tTopDocs.totalHits ); |
| // test left exclusive range |
| tq=NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, false, true); |
| tTopDocs = searcher.search(tq, 1); |
| assertEquals("Returned count of range query must be equal to half exclusive range length", upper-lower, tTopDocs.totalHits ); |
| // test right exclusive range |
| tq=NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, false); |
| tTopDocs = searcher.search(tq, 1); |
| assertEquals("Returned count of range query must be equal to half exclusive range length", upper-lower, tTopDocs.totalHits ); |
| } |
| } |
| |
| @Test |
| public void testRangeSplit_8bit() throws Exception { |
| testRangeSplit(8); |
| } |
| |
| @Test |
| public void testRangeSplit_6bit() throws Exception { |
| testRangeSplit(6); |
| } |
| |
| @Test |
| public void testRangeSplit_4bit() throws Exception { |
| testRangeSplit(4); |
| } |
| |
| @Test |
| public void testRangeSplit_2bit() throws Exception { |
| testRangeSplit(2); |
| } |
| |
| /** we fake a double test using long2double conversion of NumericUtils */ |
| private void testDoubleRange(int precisionStep) throws Exception { |
| final String field="ascfield"+precisionStep; |
| final long lower=-1000L, upper=+2000L; |
| |
| Query tq=NumericRangeQuery.newDoubleRange(field, precisionStep, |
| NumericUtils.sortableLongToDouble(lower), NumericUtils.sortableLongToDouble(upper), true, true); |
| TopDocs tTopDocs = searcher.search(tq, 1); |
| assertEquals("Returned count of range query must be equal to inclusive range length", upper-lower+1, tTopDocs.totalHits ); |
| |
| Filter tf=NumericRangeFilter.newDoubleRange(field, precisionStep, |
| NumericUtils.sortableLongToDouble(lower), NumericUtils.sortableLongToDouble(upper), true, true); |
| tTopDocs = searcher.search(new MatchAllDocsQuery(), tf, 1); |
| assertEquals("Returned count of range filter must be equal to inclusive range length", upper-lower+1, tTopDocs.totalHits ); |
| } |
| |
| @Test |
| public void testDoubleRange_8bit() throws Exception { |
| testDoubleRange(8); |
| } |
| |
| @Test |
| public void testDoubleRange_6bit() throws Exception { |
| testDoubleRange(6); |
| } |
| |
| @Test |
| public void testDoubleRange_4bit() throws Exception { |
| testDoubleRange(4); |
| } |
| |
| @Test |
| public void testDoubleRange_2bit() throws Exception { |
| testDoubleRange(2); |
| } |
| |
| private void testSorting(int precisionStep) throws Exception { |
| String field="field"+precisionStep; |
| // 10 random tests, the index order is ascending, |
| // so using a reverse sort field should retun descending documents |
| int num = atLeast(10); |
| for (int i = 0; i < num; i++) { |
| long lower=(long)(random.nextDouble()*noDocs*distance)+startOffset; |
| long upper=(long)(random.nextDouble()*noDocs*distance)+startOffset; |
| if (lower>upper) { |
| long a=lower; lower=upper; upper=a; |
| } |
| Query tq=NumericRangeQuery.newLongRange(field, precisionStep, lower, upper, true, true); |
| TopDocs topDocs = searcher.search(tq, null, noDocs, new Sort(new SortField(field, SortField.LONG, true))); |
| if (topDocs.totalHits==0) continue; |
| ScoreDoc[] sd = topDocs.scoreDocs; |
| assertNotNull(sd); |
| long last=Long.parseLong(searcher.doc(sd[0].doc).get(field)); |
| for (int j=1; j<sd.length; j++) { |
| long act=Long.parseLong(searcher.doc(sd[j].doc).get(field)); |
| assertTrue("Docs should be sorted backwards", last>act ); |
| last=act; |
| } |
| } |
| } |
| |
| @Test |
| public void testSorting_8bit() throws Exception { |
| testSorting(8); |
| } |
| |
| @Test |
| public void testSorting_6bit() throws Exception { |
| testSorting(6); |
| } |
| |
| @Test |
| public void testSorting_4bit() throws Exception { |
| testSorting(4); |
| } |
| |
| @Test |
| public void testSorting_2bit() throws Exception { |
| testSorting(2); |
| } |
| |
| @Test |
| public void testEqualsAndHash() throws Exception { |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test1", 4, 10L, 20L, true, true)); |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test2", 4, 10L, 20L, false, true)); |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test3", 4, 10L, 20L, true, false)); |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test4", 4, 10L, 20L, false, false)); |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test5", 4, 10L, null, true, true)); |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test6", 4, null, 20L, true, true)); |
| QueryUtils.checkHashEquals(NumericRangeQuery.newLongRange("test7", 4, null, null, true, true)); |
| QueryUtils.checkEqual( |
| NumericRangeQuery.newLongRange("test8", 4, 10L, 20L, true, true), |
| NumericRangeQuery.newLongRange("test8", 4, 10L, 20L, true, true) |
| ); |
| QueryUtils.checkUnequal( |
| NumericRangeQuery.newLongRange("test9", 4, 10L, 20L, true, true), |
| NumericRangeQuery.newLongRange("test9", 8, 10L, 20L, true, true) |
| ); |
| QueryUtils.checkUnequal( |
| NumericRangeQuery.newLongRange("test10a", 4, 10L, 20L, true, true), |
| NumericRangeQuery.newLongRange("test10b", 4, 10L, 20L, true, true) |
| ); |
| QueryUtils.checkUnequal( |
| NumericRangeQuery.newLongRange("test11", 4, 10L, 20L, true, true), |
| NumericRangeQuery.newLongRange("test11", 4, 20L, 10L, true, true) |
| ); |
| QueryUtils.checkUnequal( |
| NumericRangeQuery.newLongRange("test12", 4, 10L, 20L, true, true), |
| NumericRangeQuery.newLongRange("test12", 4, 10L, 20L, false, true) |
| ); |
| QueryUtils.checkUnequal( |
| NumericRangeQuery.newLongRange("test13", 4, 10L, 20L, true, true), |
| NumericRangeQuery.newFloatRange("test13", 4, 10f, 20f, true, true) |
| ); |
| // difference to int range is tested in TestNumericRangeQuery32 |
| } |
| } |
