| 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 java.io.IOException; |
| |
| import org.apache.lucene.document.Document; |
| import org.apache.lucene.document.Field.Store; |
| import org.apache.lucene.document.NumericDocValuesField; |
| import org.apache.lucene.document.StringField; |
| import org.apache.lucene.index.IndexReader; |
| import org.apache.lucene.index.LeafReaderContext; |
| import org.apache.lucene.index.RandomIndexWriter; |
| import org.apache.lucene.index.Term; |
| import org.apache.lucene.search.BooleanClause.Occur; |
| import org.apache.lucene.search.FieldValueHitQueue.Entry; |
| import org.apache.lucene.store.Directory; |
| import org.apache.lucene.util.LuceneTestCase; |
| import org.apache.lucene.util.TestUtil; |
| |
| public class TestTopFieldCollector extends LuceneTestCase { |
| private IndexSearcher is; |
| private IndexReader ir; |
| private Directory dir; |
| |
| @Override |
| public void setUp() throws Exception { |
| super.setUp(); |
| dir = newDirectory(); |
| RandomIndexWriter iw = new RandomIndexWriter(random(), dir); |
| int numDocs = atLeast(100); |
| for (int i = 0; i < numDocs; i++) { |
| Document doc = new Document(); |
| iw.addDocument(doc); |
| } |
| ir = iw.getReader(); |
| iw.close(); |
| is = newSearcher(ir); |
| } |
| |
| @Override |
| public void tearDown() throws Exception { |
| ir.close(); |
| dir.close(); |
| super.tearDown(); |
| } |
| |
| public void testSortWithoutFillFields() throws Exception { |
| |
| // There was previously a bug in TopFieldCollector when fillFields was set |
| // to false - the same doc and score was set in ScoreDoc[] array. This test |
| // asserts that if fillFields is false, the documents are set properly. It |
| // does not use Searcher's default search methods (with Sort) since all set |
| // fillFields to true. |
| Sort[] sort = new Sort[] { new Sort(SortField.FIELD_DOC), new Sort() }; |
| for(int i = 0; i < sort.length; i++) { |
| Query q = new MatchAllDocsQuery(); |
| TopDocsCollector<Entry> tdc = TopFieldCollector.create(sort[i], 10, false, |
| false, false); |
| |
| is.search(q, tdc); |
| |
| ScoreDoc[] sd = tdc.topDocs().scoreDocs; |
| for(int j = 1; j < sd.length; j++) { |
| assertTrue(sd[j].doc != sd[j - 1].doc); |
| } |
| |
| } |
| } |
| |
| public void testSortWithoutScoreTracking() throws Exception { |
| |
| // Two Sort criteria to instantiate the multi/single comparators. |
| Sort[] sort = new Sort[] {new Sort(SortField.FIELD_DOC), new Sort() }; |
| for(int i = 0; i < sort.length; i++) { |
| Query q = new MatchAllDocsQuery(); |
| TopDocsCollector<Entry> tdc = TopFieldCollector.create(sort[i], 10, true, false, |
| false); |
| |
| is.search(q, tdc); |
| |
| TopDocs td = tdc.topDocs(); |
| ScoreDoc[] sd = td.scoreDocs; |
| for(int j = 0; j < sd.length; j++) { |
| assertTrue(Float.isNaN(sd[j].score)); |
| } |
| assertTrue(Float.isNaN(td.getMaxScore())); |
| } |
| } |
| |
| public void testSortWithScoreNoMaxScoreTracking() throws Exception { |
| |
| // Two Sort criteria to instantiate the multi/single comparators. |
| Sort[] sort = new Sort[] {new Sort(SortField.FIELD_DOC), new Sort() }; |
| for(int i = 0; i < sort.length; i++) { |
| Query q = new MatchAllDocsQuery(); |
| TopDocsCollector<Entry> tdc = TopFieldCollector.create(sort[i], 10, true, true, |
| false); |
| |
| is.search(q, tdc); |
| |
| TopDocs td = tdc.topDocs(); |
| ScoreDoc[] sd = td.scoreDocs; |
| for(int j = 0; j < sd.length; j++) { |
| assertTrue(!Float.isNaN(sd[j].score)); |
| } |
| assertTrue(Float.isNaN(td.getMaxScore())); |
| } |
| } |
| |
| // MultiComparatorScoringNoMaxScoreCollector |
| public void testSortWithScoreNoMaxScoreTrackingMulti() throws Exception { |
| |
| // Two Sort criteria to instantiate the multi/single comparators. |
| Sort[] sort = new Sort[] {new Sort(SortField.FIELD_DOC, SortField.FIELD_SCORE) }; |
| for(int i = 0; i < sort.length; i++) { |
| Query q = new MatchAllDocsQuery(); |
| TopDocsCollector<Entry> tdc = TopFieldCollector.create(sort[i], 10, true, true, |
| false); |
| |
| is.search(q, tdc); |
| |
| TopDocs td = tdc.topDocs(); |
| ScoreDoc[] sd = td.scoreDocs; |
| for(int j = 0; j < sd.length; j++) { |
| assertTrue(!Float.isNaN(sd[j].score)); |
| } |
| assertTrue(Float.isNaN(td.getMaxScore())); |
| } |
| } |
| |
| public void testSortWithScoreAndMaxScoreTracking() throws Exception { |
| |
| // Two Sort criteria to instantiate the multi/single comparators. |
| Sort[] sort = new Sort[] {new Sort(SortField.FIELD_DOC), new Sort() }; |
| for(int i = 0; i < sort.length; i++) { |
| Query q = new MatchAllDocsQuery(); |
| TopDocsCollector<Entry> tdc = TopFieldCollector.create(sort[i], 10, true, true, |
| true); |
| |
| is.search(q, tdc); |
| |
| TopDocs td = tdc.topDocs(); |
| ScoreDoc[] sd = td.scoreDocs; |
| for(int j = 0; j < sd.length; j++) { |
| assertTrue(!Float.isNaN(sd[j].score)); |
| } |
| assertTrue(!Float.isNaN(td.getMaxScore())); |
| } |
| } |
| |
| public void testSortWithScoreAndMaxScoreTrackingNoResults() throws Exception { |
| |
| // Two Sort criteria to instantiate the multi/single comparators. |
| Sort[] sort = new Sort[] {new Sort(SortField.FIELD_DOC), new Sort() }; |
| for(int i = 0; i < sort.length; i++) { |
| TopDocsCollector<Entry> tdc = TopFieldCollector.create(sort[i], 10, true, true, true); |
| TopDocs td = tdc.topDocs(); |
| assertEquals(0, td.totalHits); |
| assertTrue(Float.isNaN(td.getMaxScore())); |
| } |
| } |
| |
| public void testComputeScoresOnlyOnce() throws Exception { |
| Directory dir = newDirectory(); |
| RandomIndexWriter w = new RandomIndexWriter(random(), dir); |
| Document doc = new Document(); |
| StringField text = new StringField("text", "foo", Store.NO); |
| doc.add(text); |
| NumericDocValuesField relevance = new NumericDocValuesField("relevance", 1); |
| doc.add(relevance); |
| w.addDocument(doc); |
| text.setStringValue("bar"); |
| w.addDocument(doc); |
| text.setStringValue("baz"); |
| w.addDocument(doc); |
| IndexReader reader = w.getReader(); |
| Query foo = new TermQuery(new Term("text", "foo")); |
| Query bar = new TermQuery(new Term("text", "bar")); |
| foo = new BoostQuery(foo, 2); |
| Query baz = new TermQuery(new Term("text", "baz")); |
| baz = new BoostQuery(baz, 3); |
| Query query = new BooleanQuery.Builder() |
| .add(foo, Occur.SHOULD) |
| .add(bar, Occur.SHOULD) |
| .add(baz, Occur.SHOULD) |
| .build(); |
| final IndexSearcher searcher = new IndexSearcher(reader); |
| for (Sort sort : new Sort[] {new Sort(SortField.FIELD_SCORE), new Sort(new SortField("f", SortField.Type.SCORE))}) { |
| for (boolean doDocScores : new boolean[] {false, true}) { |
| for (boolean doMaxScore : new boolean[] {false, true}) { |
| final TopFieldCollector topCollector = TopFieldCollector.create(sort, TestUtil.nextInt(random(), 1, 2), true, doDocScores, doMaxScore); |
| final Collector assertingCollector = new Collector() { |
| @Override |
| public LeafCollector getLeafCollector(LeafReaderContext context) throws IOException { |
| final LeafCollector in = topCollector.getLeafCollector(context); |
| return new FilterLeafCollector(in) { |
| @Override |
| public void setScorer(final Scorer scorer) throws IOException { |
| Scorer s = new Scorer(null) { |
| |
| int lastComputedDoc = -1; |
| |
| @Override |
| public float score() throws IOException { |
| if (lastComputedDoc == docID()) { |
| throw new AssertionError("Score computed twice on " + docID()); |
| } |
| lastComputedDoc = docID(); |
| return scorer.score(); |
| } |
| |
| @Override |
| public int freq() throws IOException { |
| return scorer.freq(); |
| } |
| |
| @Override |
| public int docID() { |
| return scorer.docID(); |
| } |
| |
| @Override |
| public int nextDoc() throws IOException { |
| return scorer.nextDoc(); |
| } |
| |
| @Override |
| public int advance(int target) throws IOException { |
| return scorer.advance(target); |
| } |
| |
| @Override |
| public long cost() { |
| return scorer.cost(); |
| } |
| |
| }; |
| super.setScorer(s); |
| } |
| }; |
| } |
| @Override |
| public boolean needsScores() { |
| return topCollector.needsScores(); |
| } |
| }; |
| searcher.search(query, assertingCollector); |
| } |
| } |
| } |
| reader.close(); |
| w.close(); |
| dir.close(); |
| } |
| |
| } |