Module org.apache.lucene.core

Package org.apache.lucene.search

Class DisiPriorityQueue

java.lang.Object

org.apache.lucene.search.DisiPriorityQueue

All Implemented Interfaces:

Iterable<DisiWrapper>

public final class DisiPriorityQueue
extends Object
implements Iterable<DisiWrapper>

A priority queue of DocIdSetIterators that orders by current doc ID. This specialization is needed over PriorityQueue because the pluggable comparison function makes the rebalancing quite slow.

Field Summary

Fields

Modifier and Type	Field	Description
private final DisiWrapper[]	heap
private int	size

Constructor Summary

Constructors

Constructor	Description
DisiPriorityQueue(int maxSize)

Method Summary

Modifier and Type	Method	Description
DisiWrapper	add(DisiWrapper entry)
void	addAll(DisiWrapper[] entries, int offset, int len)
void	clear()	Clear the heap.
(package private) void	downHeap(int size)
Iterator<DisiWrapper>	iterator()
(package private) static int	leftNode(int node)
(package private) static int	parentNode(int node)
DisiWrapper	pop()
private DisiWrapper	prepend(DisiWrapper w1, DisiWrapper w2)
(package private) static int	rightNode(int leftNode)
int	size()
DisiWrapper	top()
DisiWrapper	top2()	Return the 2nd least value in this heap, or null if the heap contains less than 2 values.
DisiWrapper	topList()	Get the list of scorers which are on the current doc.
private DisiWrapper	topList(DisiWrapper list, DisiWrapper[] heap, int size, int i)
DisiWrapper	updateTop()
(package private) DisiWrapper	updateTop(DisiWrapper topReplacement)
(package private) void	upHeap(int i)

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 Details

heap

private final DisiWrapper[] heap

size

private int size

Constructor Details

DisiPriorityQueue

public DisiPriorityQueue(int maxSize)

Method Details

leftNode

static int leftNode(int node)

rightNode

static int rightNode(int leftNode)

parentNode

static int parentNode(int node)

size

public int size()

top

public DisiWrapper top()

top2

public DisiWrapper top2()

Return the 2nd least value in this heap, or null if the heap contains less than 2 values.

topList

public DisiWrapper topList()

Get the list of scorers which are on the current doc.

prepend

private DisiWrapper prepend(DisiWrapper w1,
 DisiWrapper w2)

topList

private DisiWrapper topList(DisiWrapper list,
 DisiWrapper[] heap,
 int size,
 int i)

add

public DisiWrapper add(DisiWrapper entry)

addAll

public void addAll(DisiWrapper[] entries,
 int offset,
 int len)

pop

public DisiWrapper pop()

updateTop

public DisiWrapper updateTop()

updateTop

DisiWrapper updateTop(DisiWrapper topReplacement)

clear

public void clear()

Clear the heap.

upHeap

void upHeap(int i)

downHeap

void downHeap(int size)

iterator

public Iterator<DisiWrapper> iterator()

Specified by:

iterator in interface Iterable<DisiWrapper>