Package de.lmu.ifi.dbs.elki.utilities.datastructures.heap

Heap structures and variations such as bounded priority heaps.

See: Description

Class Summary

Class	Description
AbstractHeap	Abstract base class for heaps.
ComparableMaxHeap<K extends Comparable<K>>	Basic in-memory heap structure.
ComparableMinHeap<K extends Comparable<K>>	Basic in-memory heap structure.
DoubleHeap	Basic in-memory heap structure.
DoubleMaxHeap	Basic in-memory heap structure.
DoubleMinHeap	Basic in-memory heap structure.
DoubleObjMaxHeap<V>	Basic in-memory heap structure.
DoubleObjMinHeap<V>	Basic in-memory heap structure.
DoublePriorityObject<O>	Object for a priority queue with integer priority.
Heap<E>	Basic in-memory heap structure.
IntegerHeap	Basic in-memory heap structure.
IntegerMaxHeap	Basic in-memory heap structure.
IntegerMinHeap	Basic in-memory heap structure.
IntegerPriorityObject<O>	Object for a priority queue with integer priority.
ObjectHeap<K>	Basic in-memory heap structure.
TiedTopBoundedHeap<E>	A size-limited heap similar to TopBoundedHeap, discarding elements with the highest value.
TiedTopBoundedUpdatableHeap<E>	A size-limited heap similar to TopBoundedHeap, discarding elements with the highest value.
TopBoundedHeap<E>	Heap class that is bounded in size from the top.
TopBoundedUpdatableHeap<E>	Heap class that is bounded in size from the top.
UpdatableHeap<O>	A heap as used in OPTICS that allows updating entries.

Package de.lmu.ifi.dbs.elki.utilities.datastructures.heap Description

Heap structures and variations such as bounded priority heaps.