Uses of Interface
org.jheaps.Heap
-
Packages that use Heap Package Description org.jheaps Interfacesorg.jheaps.array Heaps using an array representationorg.jheaps.monotone Monotone heapsorg.jheaps.tree Heaps using an explicit "pointer-based" tree representation -
-
Uses of Heap in org.jheaps
Subinterfaces of Heap in org.jheaps Modifier and Type Interface Description interface
DoubleEndedHeap<K>
A double-ended heap.interface
DoubleEndedValueHeap<K,V>
A double-ended heap with values.interface
MergeableHeap<K>
A heap that allows melding with another heap.interface
ValueHeap<K,V>
A heap with values. -
Uses of Heap in org.jheaps.array
Classes in org.jheaps.array that implement Heap Modifier and Type Class Description class
BinaryArrayBulkInsertWeakHeap<K>
An array based binary weak heap using bulk insertion.class
BinaryArrayHeap<K>
An array based binary heap.class
BinaryArrayIntegerValueHeap<V>
An optimized array-based binary heap with integer keys.class
BinaryArrayWeakHeap<K>
An array based binary weak heap.class
DaryArrayHeap<K>
An array based d-ary heap.class
MinMaxBinaryArrayDoubleEndedHeap<K>
An array based binary MinMax heap. -
Uses of Heap in org.jheaps.monotone
Classes in org.jheaps.monotone that implement Heap Modifier and Type Class Description class
BigIntegerRadixHeap
A radix heap forBigInteger
keys.class
DoubleRadixHeap
A radix heap for double keys.class
IntegerRadixHeap
A radix heap for (signed) integer keys.class
LongRadixHeap
A radix heap for (signed) long keys. -
Uses of Heap in org.jheaps.tree
Classes in org.jheaps.tree that implement Heap Modifier and Type Class Description class
BinaryTreeSoftHeap<K>
A binary tree soft heap.
-