See: Description
| Interface | Description |
|---|---|
| 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.
|
| DoubleLongHeap |
Basic in-memory heap interface, for double keys and long values.
|
| DoubleLongHeap.UnsortedIter |
Unsorted iterator - in heap order.
|
| DoubleObjectHeap<V> |
Basic in-memory heap interface, for double keys and V values.
|
| DoubleObjectHeap.UnsortedIter<V> |
Unsorted iterator - in heap order.
|
| IntegerHeap |
Basic in-memory heap for int values.
|
| IntegerHeap.UnsortedIter |
Unsorted iterator - in heap order.
|
| IntegerObjectHeap<V> |
Basic in-memory heap interface, for int keys and V values.
|
| IntegerObjectHeap.UnsortedIter<V> |
Unsorted iterator - in heap order.
|
| ObjectHeap<K> |
Basic in-memory heap for K values.
|
| ObjectHeap.UnsortedIter<K> |
Unsorted iterator - in heap order.
|
| Class | Description |
|---|---|
| ComparableMaxHeap<K extends Comparable<? super K>> |
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).
|
| ComparableMinHeap<K extends Comparable<? super K>> |
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).
|
| ComparatorMaxHeap<K> |
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).
|
| ComparatorMinHeap<K> |
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).
|
| 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).
|
| DoubleIntegerMinHeap |
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).
|
| DoubleLongMaxHeap |
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).
|
| DoubleLongMinHeap |
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).
|
| DoubleMaxHeap |
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).
|
| DoubleMinHeap |
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).
|
| DoubleObjectMaxHeap<V> |
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).
|
| DoubleObjectMinHeap<V> |
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).
|
| DoublePriorityObject<O> |
Object for a priority queue with integer priority.
|
| Heap<E> |
Basic in-memory heap structure.
|
| IntegerMaxHeap |
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).
|
| IntegerMinHeap |
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).
|
| IntegerObjectMaxHeap<V> |
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).
|
| IntegerObjectMinHeap<V> |
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).
|
| IntegerPriorityObject<O> |
Object for a priority queue with integer priority.
|
| 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.
|
Heap structures and variations such as bounded priority heaps.