public class DocIDPriorityQueue extends Object
| Modifier and Type | Field and Description |
|---|---|
int |
base |
protected org.apache.lucene.search.ScoreDoc[] |
heap |
int |
size |
| Constructor and Description |
|---|
DocIDPriorityQueue(DocComparator comparator,
int maxSize,
int base) |
| Modifier and Type | Method and Description |
|---|---|
org.apache.lucene.search.ScoreDoc |
add(org.apache.lucene.search.ScoreDoc element)
Adds an Object to a PriorityQueue in log(size) time.
|
void |
clear()
Removes all entries from the PriorityQueue.
|
org.apache.lucene.search.ScoreDoc |
pop()
Removes and returns the least element of the PriorityQueue in log(size)
time.
|
org.apache.lucene.search.ScoreDoc |
replace(org.apache.lucene.search.ScoreDoc element) |
org.apache.lucene.search.ScoreDoc |
replace(org.apache.lucene.search.ScoreDoc newEle,
org.apache.lucene.search.ScoreDoc oldEle)
Takes O(size) time.
|
int |
size()
Returns the number of elements currently stored in the PriorityQueue.
|
Comparable<?> |
sortValue(org.apache.lucene.search.ScoreDoc doc) |
org.apache.lucene.search.ScoreDoc |
top()
Returns the least element of the PriorityQueue in constant time.
|
org.apache.lucene.search.ScoreDoc |
updateTop()
Should be called when the Object at top changes values.
|
public int size
protected final org.apache.lucene.search.ScoreDoc[] heap
public final int base
public DocIDPriorityQueue(DocComparator comparator, int maxSize, int base)
public final org.apache.lucene.search.ScoreDoc add(org.apache.lucene.search.ScoreDoc element)
ArrayIndexOutOfBoundsException is thrown.public Comparable<?> sortValue(org.apache.lucene.search.ScoreDoc doc)
public org.apache.lucene.search.ScoreDoc replace(org.apache.lucene.search.ScoreDoc element)
public org.apache.lucene.search.ScoreDoc replace(org.apache.lucene.search.ScoreDoc newEle,
org.apache.lucene.search.ScoreDoc oldEle)
public final org.apache.lucene.search.ScoreDoc top()
public final org.apache.lucene.search.ScoreDoc pop()
public final org.apache.lucene.search.ScoreDoc updateTop()
pq.top().change(); pq.updateTop();instead of
o = pq.pop(); o.change(); pq.push(o);
public final int size()
public final void clear()
Copyright © 2005–2013. All rights reserved.