mayya-sharipova commented on a change in pull request #1725: URL: https://github.com/apache/lucene-solr/pull/1725#discussion_r482105620
########## File path: lucene/core/src/java/org/apache/lucene/search/comparators/DocComparator.java ########## @@ -0,0 +1,183 @@ +/* + * 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. + */ + +package org.apache.lucene.search.comparators; + +import org.apache.lucene.index.LeafReaderContext; +import org.apache.lucene.search.DocIdSetIterator; +import org.apache.lucene.search.FieldComparator; +import org.apache.lucene.search.LeafFieldComparator; +import org.apache.lucene.search.Scorable; + +import java.io.IOException; + +/** + * Comparator that sorts by asc _doc + */ +public class DocComparator extends FieldComparator<Integer> { + private final int[] docIDs; + private final boolean enableSkipping; // if skipping functionality should be enabled + private int bottom; + private int topValue; + private boolean topValueSet; + private boolean bottomValueSet; + private boolean hitsThresholdReached; + + /** Creates a new comparator based on document ids for {@code numHits} */ + public DocComparator(int numHits, boolean reverse) { + this.docIDs = new int[numHits]; + // skipping functionality is enabled if we are sorting by _doc in asc order Review comment: @jimczi Thanks for the feedback. > I was thinking that we could use the information exposed in SortField#getComparator, we don't need to add a new callback Good point, I haven't noticed that before, I've refactored the code to use `sortPos` from this function. > However, I think we can rely on what you describe above, setHitsThresholdReached and competitiveIterator are the callbacks that we need to enable the optimization. ... we probably don't need 485fe4f Doing sort optimization only on primary sort in `MultiLeafFieldComparator` is implicit and some refactoring of it may bring wrong result. So I think it is good to have extra protection ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
