org.apache.lucene.index

Class MultiTermsEnum.TermMergeQueue

java.lang.Object

org.apache.lucene.util.PriorityQueue<MultiTermsEnum.TermsEnumWithSlice>

org.apache.lucene.index.MultiTermsEnum.TermMergeQueue

All Implemented Interfaces:

java.lang.Iterable<MultiTermsEnum.TermsEnumWithSlice>

Enclosing class:

MultiTermsEnum

private static final class MultiTermsEnum.TermMergeQueue
extends PriorityQueue<MultiTermsEnum.TermsEnumWithSlice>

Field Summary

Fields

Modifier and Type	Field and Description
(package private) int[]	stack

Constructor Summary

Constructors

Constructor and Description
TermMergeQueue(int size)

Method Summary

Modifier and Type	Method and Description
(package private) int	fillTop(MultiTermsEnum.TermsEnumWithSlice[] tops) Add the PriorityQueue.top() slice as well as all slices that are positionned on the same term to tops and return how many of them there are.
private MultiTermsEnum.TermsEnumWithSlice	get(int i)
protected boolean	lessThan(MultiTermsEnum.TermsEnumWithSlice termsA, MultiTermsEnum.TermsEnumWithSlice termsB) Determines the ordering of objects in this priority queue.

Methods inherited from class org.apache.lucene.util.PriorityQueue

add, clear, getHeapArray, insertWithOverflow, iterator, pop, remove, size, top, updateTop, updateTop

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

stack

final int[] stack

Constructor Detail

TermMergeQueue

TermMergeQueue(int size)

Method Detail

lessThan

protected boolean lessThan(MultiTermsEnum.TermsEnumWithSlice termsA,
                           MultiTermsEnum.TermsEnumWithSlice termsB)

Description copied from class: PriorityQueue

Determines the ordering of objects in this priority queue. Subclasses must define this one method.

Specified by:

lessThan in class PriorityQueue<MultiTermsEnum.TermsEnumWithSlice>

Returns:

true iff parameter a is less than parameter b.

fillTop

int fillTop(MultiTermsEnum.TermsEnumWithSlice[] tops)

Add the PriorityQueue.top() slice as well as all slices that are positionned on the same term to tops and return how many of them there are.

get

private MultiTermsEnum.TermsEnumWithSlice get(int i)