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 interfaceDoubleEndedAddressableHeap<K,V>A double-ended heap whose elements can be addressed using handles.interfaceMergeableAddressableHeap<K,V>An addressable heap that allows melding with another addressable heap.interfaceMergeableDoubleEndedAddressableHeap<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 classBinaryArrayAddressableHeap<K,V>An array based binary addressable heap.classDaryArrayAddressableHeap<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 classHollowHeap<K,V>Hollow heaps. -
Uses of AddressableHeap in org.jheaps.monotone
Classes in org.jheaps.monotone that implement AddressableHeap Modifier and Type Class Description classBigIntegerRadixAddressableHeap<V>An addressable radix heap forBigIntegerkeys.classDoubleRadixAddressableHeap<V>An addressable radix heap for double keys.classIntegerRadixAddressableHeap<V>An addressable radix heap for (signed) integer keys.classLongRadixAddressableHeap<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 classBinaryTreeAddressableHeap<K,V>An explicit binary tree addressable heap.classBinaryTreeSoftAddressableHeap<K,V>A binary tree soft addressable heap.classCostlessMeldPairingHeap<K,V>The costless meld variant of the pairing heaps.classDaryTreeAddressableHeap<K,V>An explicit d-ary tree addressable heap.classFibonacciHeap<K,V>Fibonacci heaps.classLeftistHeap<K,V>Leftist heaps.classPairingHeap<K,V>Pairing heaps.classRankPairingHeap<K,V>Rank-Pairing heaps.classReflectedFibonacciHeap<K,V>Reflected double ended heaps based on Fibonacci heaps.classReflectedHeap<K,V>Reflected double ended heaps.classReflectedPairingHeap<K,V>Reflected double ended heaps based on pairing heaps.classSimpleFibonacciHeap<K,V>Simple Fibonacci heaps.classSkewHeap<K,V>Skew heaps.
-