mirror of https://github.com/apache/lucene.git
LUCENE-10633: Fix handling of missing values in reverse sorts.
This commit is contained in:
parent
1ad28a3136
commit
7c9d3cd6ff
|
@ -403,7 +403,7 @@ public class TermOrdValComparator extends FieldComparator<BytesRef> {
|
||||||
minOrd = -1;
|
minOrd = -1;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (bottomOrd == Integer.MAX_VALUE) {
|
if (bottomOrd == missingOrd) {
|
||||||
// The queue still contains missing values.
|
// The queue still contains missing values.
|
||||||
if (singleSort) {
|
if (singleSort) {
|
||||||
// If there is no tie breaker, we can start ignoring missing values from now on.
|
// If there is no tie breaker, we can start ignoring missing values from now on.
|
||||||
|
@ -421,7 +421,7 @@ public class TermOrdValComparator extends FieldComparator<BytesRef> {
|
||||||
|
|
||||||
} else {
|
} else {
|
||||||
|
|
||||||
if (bottomOrd == -1) {
|
if (bottomOrd == missingOrd) {
|
||||||
// The queue still contains missing values.
|
// The queue still contains missing values.
|
||||||
if (singleSort) {
|
if (singleSort) {
|
||||||
// If there is no tie breaker, we can start ignoring missing values from now on.
|
// If there is no tie breaker, we can start ignoring missing values from now on.
|
||||||
|
|
Loading…
Reference in New Issue