Uses of Interface
org.jheaps.AddressableHeap.Handle
Packages that use AddressableHeap.Handle
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.Handle in org.jheaps
Subinterfaces of AddressableHeap.Handle in org.jheapsModifier and TypeInterfaceDescriptionstatic interface
A double-ended heap element handle.Methods in org.jheaps that return AddressableHeap.Handle -
Uses of AddressableHeap.Handle in org.jheaps.array
Classes in org.jheaps.array that implement AddressableHeap.HandleMethods in org.jheaps.array that return AddressableHeap.HandleModifier and TypeMethodDescriptionAbstractArrayAddressableHeap.deleteMin()
Delete and return an element with the minimum key.AbstractArrayAddressableHeap.findMin()
Find an element with the minimum key.Insert a new element into the heap with a null value.Insert a new element into the heap.Methods in org.jheaps.array that return types with arguments of type AddressableHeap.HandleModifier and TypeMethodDescriptionBinaryArrayAddressableHeap.handlesIterator()
Get an iterator for all handles currently in the heap.DaryArrayAddressableHeap.handlesIterator()
Get an iterator for all handles currently in the heap. -
Uses of AddressableHeap.Handle in org.jheaps.dag
Classes in org.jheaps.dag that implement AddressableHeap.HandleMethods in org.jheaps.dag that return AddressableHeap.Handle -
Uses of AddressableHeap.Handle in org.jheaps.monotone
Classes in org.jheaps.monotone that implement AddressableHeap.HandleMethods in org.jheaps.monotone that return AddressableHeap.Handle -
Uses of AddressableHeap.Handle in org.jheaps.tree
Classes in org.jheaps.tree that implement AddressableHeap.HandleModifier and TypeClassDescriptionprivate class
(package private) static class
(package private) static class
private class
(package private) static class
FibonacciHeap.Node<K,
V> (package private) static class
(package private) static class
PairingHeap.Node<K,
V> (package private) static class
RankPairingHeap.Node<K,
V> private static class
(package private) static class
(package private) static class
SkewHeap.Node<K,
V> Fields in org.jheaps.tree declared as AddressableHeap.HandleModifier and TypeFieldDescription(package private) AddressableHeap.Handle<K,
ReflectedHeap.HandleMap<K, V>> ReflectedHeap.ReflectedHandle.inner
(package private) AddressableHeap.Handle<K,
ReflectedHeap.HandleMap<K, V>> ReflectedHeap.HandleMap.otherInner
Methods in org.jheaps.tree that return AddressableHeap.HandleModifier and TypeMethodDescriptionprivate AddressableHeap.Handle<K,
V> SimpleFibonacciHeap.comparableDeleteMin()
private AddressableHeap.Handle<K,
V> SimpleFibonacciHeap.comparatorDeleteMin()
BinaryTreeAddressableHeap.deleteMin()
Delete and return an element with the minimum key.BinaryTreeSoftAddressableHeap.deleteMin()
Delete and return an element with the minimum key.CostlessMeldPairingHeap.deleteMin()
Delete and return an element with the minimum key.DaryTreeAddressableHeap.deleteMin()
FibonacciHeap.deleteMin()
Delete and return an element with the minimum key.PairingHeap.deleteMin()
Delete and return an element with the minimum key.RankPairingHeap.deleteMin()
Delete and return an element with the minimum key.SimpleFibonacciHeap.deleteMin()
Delete and return an element with the minimum key.SkewHeap.deleteMin()
Delete and return an element with the minimum key.BinaryTreeAddressableHeap.findMin()
Find an element with the minimum key.CostlessMeldPairingHeap.findMin()
Find an element with the minimum key.DaryTreeAddressableHeap.findMin()
FibonacciHeap.findMin()
Find an element with the minimum key.PairingHeap.findMin()
Find an element with the minimum key.RankPairingHeap.findMin()
Find an element with the minimum key.SimpleFibonacciHeap.findMin()
Find an element with the minimum key.SkewHeap.findMin()
Find an element with the minimum key.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Constructors in org.jheaps.tree with parameters of type AddressableHeap.HandleModifierConstructorDescriptionHandleMap
(ReflectedHeap.ReflectedHandle<K, V> outer, AddressableHeap.Handle<K, ReflectedHeap.HandleMap<K, V>> otherInner)