Uses of Interface
org.jheaps.AddressableHeap.Handle
-
Packages that use AddressableHeap.Handle 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.Handle in org.jheaps
Subinterfaces of AddressableHeap.Handle in org.jheaps Modifier and Type Interface Description static interface
DoubleEndedAddressableHeap.Handle<K,V>
A double-ended heap element handle.Methods in org.jheaps that return AddressableHeap.Handle Modifier and Type Method Description AddressableHeap.Handle<K,V>
AddressableHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
AddressableHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
AddressableHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
AddressableHeap. insert(K key, V value)
Insert a new element into the heap. -
Uses of AddressableHeap.Handle in org.jheaps.array
Classes in org.jheaps.array that implement AddressableHeap.Handle Modifier and Type Class Description protected class
AbstractArrayAddressableHeap.ArrayHandle
Methods in org.jheaps.array that return AddressableHeap.Handle Modifier and Type Method Description AddressableHeap.Handle<K,V>
AbstractArrayAddressableHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
AbstractArrayAddressableHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
AbstractArrayAddressableHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
AbstractArrayAddressableHeap. insert(K key, V value)
Insert a new element into the heap.Methods in org.jheaps.array that return types with arguments of type AddressableHeap.Handle Modifier and Type Method Description java.util.Iterator<AddressableHeap.Handle<K,V>>
BinaryArrayAddressableHeap. handlesIterator()
Get an iterator for all handles currently in the heap.java.util.Iterator<AddressableHeap.Handle<K,V>>
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.Handle Modifier and Type Class Description (package private) static class
HollowHeap.Item<K,V>
Methods in org.jheaps.dag that return AddressableHeap.Handle Modifier and Type Method Description AddressableHeap.Handle<K,V>
HollowHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
HollowHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
HollowHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
HollowHeap. insert(K key, V value)
Insert a new element into the heap. -
Uses of AddressableHeap.Handle in org.jheaps.monotone
Classes in org.jheaps.monotone that implement AddressableHeap.Handle Modifier and Type Class Description protected class
AbstractRadixAddressableHeap.Node
List NodeMethods in org.jheaps.monotone that return AddressableHeap.Handle Modifier and Type Method Description AddressableHeap.Handle<K,V>
AbstractRadixAddressableHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
AbstractRadixAddressableHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
AbstractRadixAddressableHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
AbstractRadixAddressableHeap. insert(K key, V value)
Insert a new element into the heap. -
Uses of AddressableHeap.Handle in org.jheaps.tree
Classes in org.jheaps.tree that implement AddressableHeap.Handle Modifier and Type Class Description private class
BinaryTreeAddressableHeap.Node
(package private) static class
BinaryTreeSoftAddressableHeap.SoftHandle<K,V>
(package private) static class
CostlessMeldPairingHeap.Node<K,V>
private class
DaryTreeAddressableHeap.Node
(package private) static class
FibonacciHeap.Node<K,V>
(package private) static class
LeftistHeap.LeftistNode<K,V>
(package private) static class
PairingHeap.Node<K,V>
(package private) static class
RankPairingHeap.Node<K,V>
private static class
ReflectedHeap.ReflectedHandle<K,V>
(package private) static class
SimpleFibonacciHeap.Node<K,V>
(package private) static class
SkewHeap.Node<K,V>
Fields in org.jheaps.tree declared as AddressableHeap.Handle Modifier and Type Field Description (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.Handle Modifier and Type Method Description private AddressableHeap.Handle<K,V>
SimpleFibonacciHeap. comparableDeleteMin()
private AddressableHeap.Handle<K,V>
SimpleFibonacciHeap. comparatorDeleteMin()
AddressableHeap.Handle<K,V>
BinaryTreeAddressableHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
BinaryTreeSoftAddressableHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
CostlessMeldPairingHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
DaryTreeAddressableHeap. deleteMin()
AddressableHeap.Handle<K,V>
FibonacciHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
PairingHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
RankPairingHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
SimpleFibonacciHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
SkewHeap. deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
BinaryTreeAddressableHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
CostlessMeldPairingHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
DaryTreeAddressableHeap. findMin()
AddressableHeap.Handle<K,V>
FibonacciHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
PairingHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
RankPairingHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
SimpleFibonacciHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
SkewHeap. findMin()
Find an element with the minimum key.AddressableHeap.Handle<K,V>
BinaryTreeAddressableHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
BinaryTreeAddressableHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
BinaryTreeSoftAddressableHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
BinaryTreeSoftAddressableHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
CostlessMeldPairingHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
CostlessMeldPairingHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
DaryTreeAddressableHeap. insert(K key)
AddressableHeap.Handle<K,V>
DaryTreeAddressableHeap. insert(K key, V value)
AddressableHeap.Handle<K,V>
FibonacciHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
FibonacciHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
PairingHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
PairingHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
RankPairingHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
RankPairingHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
SimpleFibonacciHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
SimpleFibonacciHeap. insert(K key, V value)
Insert a new element into the heap.AddressableHeap.Handle<K,V>
SkewHeap. insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
SkewHeap. insert(K key, V value)
Insert a new element into the heap.Constructors in org.jheaps.tree with parameters of type AddressableHeap.Handle Constructor Description HandleMap(ReflectedHeap.ReflectedHandle<K,V> outer, AddressableHeap.Handle<K,ReflectedHeap.HandleMap<K,V>> otherInner)
-