Apache
/
lucene
mirror of https://github.com/apache/lucene.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

LUCENE-10089: Disable numeric sort optimization early (#291) 

This commit moves the responsibility to disable
the numeric sort optimization on comparators to the SortField.
This way we don't need to apply the logic on every top field collectors.
This commit is contained in:
Jim Ferenczi 2021-09-13 07:31:43 +02:00 committed by GitHub
parent 56968b762a
commit 19537578dd
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 82 additions and 54 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
lucene/core/src/java/org/apache/lucene/search/FieldValueHitQueue.java
View File

@ -135,7 +135,6 @@ public abstract class FieldValueHitQueue<T extends FieldValueHitQueue.Entry>
SortField field = fields[i];
reverseMul[i] = field.reverse ? -1 : 1;
comparators[i] = field.getComparator(size, i);
if (field.getOptimizeSortWithPoints() == false) comparators[i].disableSkipping();
}
if (numComparators == 1) {
// inform a comparator that sort is based on this single field

34
lucene/core/src/java/org/apache/lucene/search/SortField.java
View File

@ -501,36 +501,48 @@ public class SortField {
* @return {@link FieldComparator} to use when sorting
*/
public FieldComparator<?> getComparator(final int numHits, final int sortPos) {
final FieldComparator<?> fieldComparator;
switch (type) {
case SCORE:
return new FieldComparator.RelevanceComparator(numHits);
fieldComparator = new FieldComparator.RelevanceComparator(numHits);
break;
case DOC:
return new DocComparator(numHits, reverse, sortPos);
fieldComparator = new DocComparator(numHits, reverse, sortPos);
break;
case INT:
return new IntComparator(numHits, field, (Integer) missingValue, reverse, sortPos);
fieldComparator =
new IntComparator(numHits, field, (Integer) missingValue, reverse, sortPos);
break;
case FLOAT:
return new FloatComparator(numHits, field, (Float) missingValue, reverse, sortPos);
fieldComparator =
new FloatComparator(numHits, field, (Float) missingValue, reverse, sortPos);
break;
case LONG:
return new LongComparator(numHits, field, (Long) missingValue, reverse, sortPos);
fieldComparator = new LongComparator(numHits, field, (Long) missingValue, reverse, sortPos);
break;
case DOUBLE:
return new DoubleComparator(numHits, field, (Double) missingValue, reverse, sortPos);
fieldComparator =
new DoubleComparator(numHits, field, (Double) missingValue, reverse, sortPos);
break;
case CUSTOM:
assert comparatorSource != null;
return comparatorSource.newComparator(field, numHits, sortPos, reverse);
fieldComparator = comparatorSource.newComparator(field, numHits, sortPos, reverse);
break;
case STRING:
return new FieldComparator.TermOrdValComparator(
numHits, field, missingValue == STRING_LAST);
case STRING_VAL:
return new FieldComparator.TermValComparator(numHits, field, missingValue == STRING_LAST);
fieldComparator =
new FieldComparator.TermValComparator(numHits, field, missingValue == STRING_LAST);
break;
case REWRITEABLE:
throw new IllegalStateException(
@ -539,6 +551,10 @@ public class SortField {
default:
throw new IllegalStateException("Illegal sort type: " + type);
}
if (getOptimizeSortWithPoints() == false) {
fieldComparator.disableSkipping();
}
return fieldComparator;
}
/**

21
lucene/core/src/java/org/apache/lucene/search/SortedNumericSortField.java
View File

@ -242,9 +242,11 @@ public class SortedNumericSortField extends SortField {
@Override
public FieldComparator<?> getComparator(int numHits, int sortPos) {
final FieldComparator<?> fieldComparator;
switch (type) {
case INT:
return new IntComparator(numHits, getField(), (Integer) missingValue, reverse, sortPos) {
fieldComparator =
new IntComparator(numHits, getField(), (Integer) missingValue, reverse, sortPos) {
@Override
public LeafFieldComparator getLeafComparator(LeafReaderContext context)
throws IOException {
@ -258,8 +260,10 @@ public class SortedNumericSortField extends SortField {
};
}
};
break;
case FLOAT:
return new FloatComparator(numHits, getField(), (Float) missingValue, reverse, sortPos) {
fieldComparator =
new FloatComparator(numHits, getField(), (Float) missingValue, reverse, sortPos) {
@Override
public LeafFieldComparator getLeafComparator(LeafReaderContext context)
throws IOException {
@ -273,8 +277,10 @@ public class SortedNumericSortField extends SortField {
};
}
};
break;
case LONG:
return new LongComparator(numHits, getField(), (Long) missingValue, reverse, sortPos) {
fieldComparator =
new LongComparator(numHits, getField(), (Long) missingValue, reverse, sortPos) {
@Override
public LeafFieldComparator getLeafComparator(LeafReaderContext context)
throws IOException {
@ -288,8 +294,10 @@ public class SortedNumericSortField extends SortField {
};
}
};
break;
case DOUBLE:
return new DoubleComparator(numHits, getField(), (Double) missingValue, reverse, sortPos) {
fieldComparator =
new DoubleComparator(numHits, getField(), (Double) missingValue, reverse, sortPos) {
@Override
public LeafFieldComparator getLeafComparator(LeafReaderContext context)
throws IOException {
@ -303,6 +311,7 @@ public class SortedNumericSortField extends SortField {
};
}
};
break;
case CUSTOM:
case DOC:
case REWRITEABLE:
@ -312,6 +321,10 @@ public class SortedNumericSortField extends SortField {
default:
throw new AssertionError();
}
if (getOptimizeSortWithPoints() == false) {
fieldComparator.disableSkipping();
}
return fieldComparator;
}
private NumericDocValues getValue(LeafReader reader) throws IOException {