Sort changes from Lucene by updated descending
This places the most recent results first. Lucene internally manages the result stack by running a priority queue and keeping only the top N in the queue. Change-Id: I9c01239eb03c79b693e95f1b099970a15c3b7394
This commit is contained in:
committed by
Dave Borowitz
parent
95b77ffdf3
commit
bf96550ba2
@@ -63,6 +63,8 @@ import org.apache.lucene.search.NumericRangeQuery;
|
||||
import org.apache.lucene.search.Query;
|
||||
import org.apache.lucene.search.ScoreDoc;
|
||||
import org.apache.lucene.search.SearcherManager;
|
||||
import org.apache.lucene.search.Sort;
|
||||
import org.apache.lucene.search.SortField;
|
||||
import org.apache.lucene.search.TermQuery;
|
||||
import org.apache.lucene.search.TopDocs;
|
||||
import org.apache.lucene.util.BytesRef;
|
||||
@@ -333,13 +335,18 @@ public class LuceneChangeIndex implements ChangeIndex, LifecycleListener {
|
||||
@Override
|
||||
public ResultSet<ChangeData> read() throws OrmException {
|
||||
IndexSearcher[] searchers = new IndexSearcher[indexes.size()];
|
||||
Sort sort = new Sort(
|
||||
new SortField(
|
||||
ChangeField.UPDATED.getName(),
|
||||
SortField.Type.INT,
|
||||
true /* descending */));
|
||||
try {
|
||||
TopDocs[] hits = new TopDocs[indexes.size()];
|
||||
for (int i = 0; i < indexes.size(); i++) {
|
||||
searchers[i] = indexes.get(i).acquire();
|
||||
hits[i] = searchers[i].search(query, LIMIT);
|
||||
hits[i] = searchers[i].search(query, LIMIT, sort);
|
||||
}
|
||||
TopDocs docs = TopDocs.merge(null, LIMIT, hits);
|
||||
TopDocs docs = TopDocs.merge(sort, LIMIT, hits);
|
||||
|
||||
List<ChangeData> result =
|
||||
Lists.newArrayListWithCapacity(docs.scoreDocs.length);
|
||||
|
||||
Reference in New Issue
Block a user