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

Packages that use de.lmu.ifi.dbs.elki.utilities.datastructures.heap

Package	Description
de.lmu.ifi.dbs.elki.algorithm.clustering	Clustering algorithms.
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation	Correlation clustering algorithms
de.lmu.ifi.dbs.elki.algorithm.outlier	Outlier detection algorithms
de.lmu.ifi.dbs.elki.database.ids.generic	Database object identification and ID group handling - generic implementations.
de.lmu.ifi.dbs.elki.database.ids.integer	Integer-based DBID implementation -- do not use directly - always use DBIDUtil.
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query	Queries on the R-Tree family of indexes: kNN and range queries.
de.lmu.ifi.dbs.elki.utilities.datastructures.heap	Heap structures and variations such as bounded priority heaps.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.algorithm.clustering

Class and Description
UpdatableHeap A heap as used in OPTICS that allows updating entries.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.algorithm.clustering.correlation

Class and Description
IntegerPriorityObject Object for a priority queue with integer priority.
ObjectHeap Basic in-memory heap for K values.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.algorithm.outlier

Class and Description
ComparableMinHeap Advanced priority queue class, based on a binary heap (for small sizes), which will for larger heaps be accompanied by a 4-ary heap (attached below the root of the two-ary heap, making the root actually 3-ary).
Heap.UnorderedIter Heap iterator.
ObjectHeap Basic in-memory heap for K values.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.database.ids.generic

Class and Description
Heap Basic in-memory heap structure.
TiedTopBoundedHeap A size-limited heap similar to TopBoundedHeap, discarding elements with the highest value.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.database.ids.integer

Class and Description
DoubleIntegerMaxHeap Advanced priority queue class, based on a binary heap (for small sizes), which will for larger heaps be accompanied by a 4-ary heap (attached below the root of the two-ary heap, making the root actually 3-ary).

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query

Class and Description
ComparableMinHeap Advanced priority queue class, based on a binary heap (for small sizes), which will for larger heaps be accompanied by a 4-ary heap (attached below the root of the two-ary heap, making the root actually 3-ary).

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.utilities.datastructures.heap

Class and Description
ComparableMaxHeap.UnsortedIter Unsorted iterator - in heap order.
ComparableMinHeap.UnsortedIter Unsorted iterator - in heap order.
ComparatorMaxHeap.UnsortedIter Unsorted iterator - in heap order.
ComparatorMinHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleHeap Basic in-memory heap for double values.
DoubleHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleIntegerHeap Basic in-memory heap interface, for double keys and int values.
DoubleIntegerHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleIntegerMaxHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleIntegerMinHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleLongHeap Basic in-memory heap interface, for double keys and long values.
DoubleLongHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleLongMaxHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleLongMinHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleMaxHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleMinHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleObjectHeap Basic in-memory heap interface, for double keys and V values.
DoubleObjectHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleObjectMaxHeap.UnsortedIter Unsorted iterator - in heap order.
DoubleObjectMinHeap.UnsortedIter Unsorted iterator - in heap order.
DoublePriorityObject Object for a priority queue with integer priority.
Heap Basic in-memory heap structure.
Heap.UnorderedIter Heap iterator.
IntegerHeap Basic in-memory heap for int values.
IntegerHeap.UnsortedIter Unsorted iterator - in heap order.
IntegerMaxHeap.UnsortedIter Unsorted iterator - in heap order.
IntegerMinHeap.UnsortedIter Unsorted iterator - in heap order.
IntegerObjectHeap Basic in-memory heap interface, for int keys and V values.
IntegerObjectHeap.UnsortedIter Unsorted iterator - in heap order.
IntegerObjectMaxHeap.UnsortedIter Unsorted iterator - in heap order.
IntegerObjectMinHeap.UnsortedIter Unsorted iterator - in heap order.
IntegerPriorityObject Object for a priority queue with integer priority.
ObjectHeap Basic in-memory heap for K values.
ObjectHeap.UnsortedIter Unsorted iterator - in heap order.
TiedTopBoundedHeap.UnorderedIter Unordered heap iterator class.
TopBoundedHeap Heap class that is bounded in size from the top.
TopBoundedUpdatableHeap Heap class that is bounded in size from the top.
UpdatableHeap A heap as used in OPTICS that allows updating entries.