private static final class FieldValueHitQueue.OneComparatorFieldValueHitQueue<T extends FieldValueHitQueue.Entry> extends FieldValueHitQueue<T>
FieldValueHitQueue which is optimized in case
there is just one comparator.FieldValueHitQueue.Entry| Modifier and Type | Field and Description |
|---|---|
private FieldComparator<?> |
oneComparator |
private int |
oneReverseMul |
comparators, fields, reverseMul| Constructor and Description |
|---|
OneComparatorFieldValueHitQueue(SortField[] fields,
int size) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
lessThan(FieldValueHitQueue.Entry hitA,
FieldValueHitQueue.Entry hitB)
Returns whether
hitA is less relevant than hitB. |
create, fillFields, getComparators, getComparators, getFields, getReverseMuladd, clear, getHeapArray, insertWithOverflow, iterator, pop, remove, size, top, updateTop, updateTopprivate final int oneReverseMul
private final FieldComparator<?> oneComparator
public OneComparatorFieldValueHitQueue(SortField[] fields, int size)
protected boolean lessThan(FieldValueHitQueue.Entry hitA, FieldValueHitQueue.Entry hitB)
hitA is less relevant than hitB.lessThan in class FieldValueHitQueue<T extends FieldValueHitQueue.Entry>hitA - EntryhitB - Entrytrue if document hitA should be sorted after document hitB.