Uses of Interface
org.jheaps.AddressableHeap
-
Packages that use AddressableHeap Package Description org.jheaps Interfacesorg.jheaps.array Heaps using an array representationorg.jheaps.dag Heaps using an explicit "pointer-based" dag representationorg.jheaps.monotone Monotone heapsorg.jheaps.tree Heaps using an explicit "pointer-based" tree representation -
-
Uses of AddressableHeap in org.jheaps
Subinterfaces of AddressableHeap in org.jheaps Modifier and Type Interface Description interface
DoubleEndedAddressableHeap<K,V>
A double-ended heap whose elements can be addressed using handles.interface
MergeableAddressableHeap<K,V>
An addressable heap that allows melding with another addressable heap.interface
MergeableDoubleEndedAddressableHeap<K,V>
A double-ended addressable heap that allows melding with another double-ended addressable heap.Methods in org.jheaps that return AddressableHeap Modifier and Type Method Description AddressableHeap<K,V>
AddressableHeapFactory. get(Comparator<? super K> comparator)
Get a new heap. -
Uses of AddressableHeap in org.jheaps.array
Classes in org.jheaps.array that implement AddressableHeap Modifier and Type Class Description class
BinaryArrayAddressableHeap<K,V>
An array based binary addressable heap.class
DaryArrayAddressableHeap<K,V>
An array based d-ary addressable heap. -
Uses of AddressableHeap in org.jheaps.dag
Classes in org.jheaps.dag that implement AddressableHeap Modifier and Type Class Description class
HollowHeap<K,V>
Hollow heaps. -
Uses of AddressableHeap in org.jheaps.monotone
Classes in org.jheaps.monotone that implement AddressableHeap Modifier and Type Class Description class
BigIntegerRadixAddressableHeap<V>
An addressable radix heap forBigInteger
keys.class
DoubleRadixAddressableHeap<V>
An addressable radix heap for double keys.class
IntegerRadixAddressableHeap<V>
An addressable radix heap for (signed) integer keys.class
LongRadixAddressableHeap<V>
An addressable radix heap for (signed) long keys. -
Uses of AddressableHeap in org.jheaps.tree
Classes in org.jheaps.tree that implement AddressableHeap Modifier and Type Class Description class
BinaryTreeAddressableHeap<K,V>
An explicit binary tree addressable heap.class
BinaryTreeSoftAddressableHeap<K,V>
A binary tree soft addressable heap.class
CostlessMeldPairingHeap<K,V>
The costless meld variant of the pairing heaps.class
DaryTreeAddressableHeap<K,V>
An explicit d-ary tree addressable heap.class
FibonacciHeap<K,V>
Fibonacci heaps.class
LeftistHeap<K,V>
Leftist heaps.class
PairingHeap<K,V>
Pairing heaps.class
RankPairingHeap<K,V>
Rank-Pairing heaps.class
ReflectedFibonacciHeap<K,V>
Reflected double ended heaps based on Fibonacci heaps.class
ReflectedHeap<K,V>
Reflected double ended heaps.class
ReflectedPairingHeap<K,V>
Reflected double ended heaps based on pairing heaps.class
SimpleFibonacciHeap<K,V>
Simple Fibonacci heaps.class
SkewHeap<K,V>
Skew heaps.
-