Uses of Interface
org.jheaps.AddressableHeap.Handle

Packages that use AddressableHeap.Handle

Package	Description
org.jheaps	Interfaces
org.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 and 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 and 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.tree

Methods in org.jheaps.tree that return AddressableHeap.Handle

Modifier and Type	Method and Description
AddressableHeap.Handle<K,V>	SkewHeap.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>	PairingHeap.deleteMin() Delete and return an element with the minimum key.
AddressableHeap.Handle<K,V>	FibonacciHeap.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>	BinaryTreeSoftAddressableHeap.deleteMin() Delete and return an element with the minimum key.
AddressableHeap.Handle<K,V>	BinaryTreeAddressableHeap.deleteMin() Delete and return an element with the minimum key.
AddressableHeap.Handle<K,V>	SkewHeap.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>	PairingHeap.findMin() Find an element with the minimum key.
AddressableHeap.Handle<K,V>	FibonacciHeap.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>	BinaryTreeAddressableHeap.findMin() Find an element with the minimum key.
AddressableHeap.Handle<K,V>	SkewHeap.insert(K key) Insert a new element into the heap with a null value.
AddressableHeap.Handle<K,V>	SimpleFibonacciHeap.insert(K key) Insert a new element into the heap with a null value.
AddressableHeap.Handle<K,V>	PairingHeap.insert(K key) Insert a new element into the heap with a null value.
AddressableHeap.Handle<K,V>	FibonacciHeap.insert(K key) Insert a new element into the heap with a null value.
AddressableHeap.Handle<K,V>	CostlessMeldPairingHeap.insert(K key) Insert a new element into the heap with a null value.
AddressableHeap.Handle<K,V>	BinaryTreeSoftAddressableHeap.insert(K key) Insert a new element into the heap with a null value.
AddressableHeap.Handle<K,V>	BinaryTreeAddressableHeap.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.
AddressableHeap.Handle<K,V>	SimpleFibonacciHeap.insert(K key, V value) Insert a new element into the heap.
AddressableHeap.Handle<K,V>	PairingHeap.insert(K key, V value) Insert a new element into the heap.
AddressableHeap.Handle<K,V>	FibonacciHeap.insert(K key, V value) Insert a new element into the heap.
AddressableHeap.Handle<K,V>	CostlessMeldPairingHeap.insert(K key, V value) Insert a new element into the heap.
AddressableHeap.Handle<K,V>	BinaryTreeSoftAddressableHeap.insert(K key, V value) Insert a new element into the heap.
AddressableHeap.Handle<K,V>	BinaryTreeAddressableHeap.insert(K key, V value) Insert a new element into the heap.