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

Heap structures and variations such as bounded priority heaps.

See:
Description

Class Summary

Heap<E>	Basic in-memory heap structure.
IntegerPriorityObject<O>	Object for a priority queue with integer priority.
KNNHeap<D extends Distance<D>>	Heap used for KNN management.
KNNHeap.Comp<D extends Distance<D>>	Comparator to use.
KNNList<D extends Distance<D>>	Finalized KNN List.
KNNList.DBIDItr	Proxy iterator for accessing DBIDs.
KNNList.DBIDView	A view on the DBIDs of the result
KNNList.DistanceItr<D extends Distance<D>>	Proxy iterator for accessing DBIDs.
KNNList.DistanceView<D extends Distance<D>>	A view on the Distances of the result
TiedTopBoundedHeap<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.
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.