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 TypeInterfaceDescriptioninterfaceA double-ended heap whose elements can be addressed using handles.interfaceAn addressable heap that allows melding with another addressable heap.interfaceA 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) classAbstract implementation of a heap using an array representation.classAn array based binary addressable heap.classAn 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) classBase abstract implementation of an addressable radix heap.classAn addressable radix heap forBigIntegerkeys.classAn addressable radix heap for double keys.classAn addressable radix heap for (signed) integer keys.classAn addressable radix heap for (signed) long keys. -
Uses of AddressableHeap in org.jheaps.tree
Classes in org.jheaps.tree that implement AddressableHeapModifier and TypeClassDescriptionclassAn explicit binary tree addressable heap.classA binary tree soft addressable heap.classThe costless meld variant of the pairing heaps.classAn 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.classReflected 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.Fields in org.jheaps.tree declared as AddressableHeapModifier and TypeFieldDescriptionprivate final AddressableHeap<K, ReflectedHeap.HandleMap<K, V>> ReflectedHeap.maxHeapA maximum heapprivate final AddressableHeap<K, ReflectedHeap.HandleMap<K, V>> ReflectedHeap.minHeapA minimum heapMethods in org.jheaps.tree that return AddressableHeapModifier and TypeMethodDescriptionReflectedFibonacciHeap.Factory.get(Comparator<? super K> comparator) ReflectedPairingHeap.Factory.get(Comparator<? super K> comparator)