K
- Key typepublic interface ObjectHeap<K>
Modifier and Type | Interface and Description |
---|---|
static interface |
ObjectHeap.UnsortedIter<K>
Unsorted iterator - in heap order.
|
Modifier and Type | Method and Description |
---|---|
void |
add(K key)
Add a key-value pair to the heap
|
void |
add(K key,
int max)
Add a key-value pair to the heap, except if the new element is larger than
the top, and we are at design size (overflow)
|
void |
clear()
Delete all elements from the heap.
|
boolean |
isEmpty()
Is the heap empty?
|
K |
peek()
Get the current top key
|
K |
poll()
Remove the first element
|
K |
replaceTopElement(K e)
Combined operation that removes the top element, and inserts a new element
instead.
|
int |
size()
Query the size
|
ObjectHeap.UnsortedIter<K> |
unsortedIter()
Get an unsorted iterator to inspect the heap.
|
void add(K key)
key
- Keyvoid add(K key, int max)
key
- Keymax
- Maximum size of heapK replaceTopElement(K e)
e
- New element to insertK peek()
K poll()
void clear()
int size()
boolean isEmpty()
true
when the size is 0.ObjectHeap.UnsortedIter<K> unsortedIter()
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.