Uses of Interface
org.jheaps.AddressableHeap
Packages that use AddressableHeap
Package
Description
Interfaces
Heaps using an array representation
Heaps using an explicit "pointer-based" dag representation
Monotone heaps
Heaps using an explicit "pointer-based" tree representation
-
Uses of AddressableHeap in org.jheaps
Subinterfaces of AddressableHeap in org.jheapsModifier and TypeInterfaceDescriptioninterface
A double-ended heap whose elements can be addressed using handles.interface
An addressable heap that allows melding with another addressable heap.interface
A double-ended addressable heap that allows melding with another double-ended addressable heap.Methods in org.jheaps that return AddressableHeapModifier and TypeMethodDescriptionAddressableHeapFactory.get
(Comparator<? super K> comparator) Get a new heap. -
Uses of AddressableHeap in org.jheaps.array
Classes in org.jheaps.array that implement AddressableHeapModifier and TypeClassDescription(package private) class
Abstract implementation of a heap using an array representation.class
An array based binary addressable heap.class
An array based d-ary addressable heap. -
Uses of AddressableHeap in org.jheaps.dag
Classes in org.jheaps.dag that implement AddressableHeap -
Uses of AddressableHeap in org.jheaps.monotone
Classes in org.jheaps.monotone that implement AddressableHeapModifier and TypeClassDescription(package private) class
Base abstract implementation of an addressable radix heap.class
An addressable radix heap forBigInteger
keys.class
An addressable radix heap for double keys.class
An addressable radix heap for (signed) integer keys.class
An addressable radix heap for (signed) long keys. -
Uses of AddressableHeap in org.jheaps.tree
Classes in org.jheaps.tree that implement AddressableHeapModifier and TypeClassDescriptionclass
An explicit binary tree addressable heap.class
A binary tree soft addressable heap.class
The costless meld variant of the pairing heaps.class
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
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.Fields in org.jheaps.tree declared as AddressableHeapModifier and TypeFieldDescriptionprivate final AddressableHeap<K,
ReflectedHeap.HandleMap<K, V>> ReflectedHeap.maxHeap
A maximum heapprivate final AddressableHeap<K,
ReflectedHeap.HandleMap<K, V>> ReflectedHeap.minHeap
A minimum heapMethods in org.jheaps.tree that return AddressableHeapModifier and TypeMethodDescriptionReflectedFibonacciHeap.Factory.get
(Comparator<? super K> comparator) ReflectedPairingHeap.Factory.get
(Comparator<? super K> comparator)