Uses of Interface
org.jheaps.AddressableHeap.Handle

Packages that use AddressableHeap.Handle

Package	Description
org.jheaps	Interfaces
org.jheaps.array	Heaps using an array representation
org.jheaps.dag	Heaps using an explicit "pointer-based" dag representation
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	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

Methods in org.jheaps.array that return types with arguments of type AddressableHeap.Handle

Modifier and Type	Method	Description
Iterator<AddressableHeap.Handle<K,V>>	BinaryArrayAddressableHeap.handlesIterator()	Get an iterator for all handles currently in the heap.
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

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.tree

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

Modifier and Type	Method	Description
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.