Uses of Interface org.jheaps.DoubleEndedAddressableHeap.Handle (JHeaps)

Packages that use DoubleEndedAddressableHeap.Handle
Package	Description
org.jheaps	Interfaces
org.jheaps.tree	Heaps using an explicit "pointer-based" tree representation

Methods in org.jheaps that return DoubleEndedAddressableHeap.Handle
Modifier and Type	Method	Description
`DoubleEndedAddressableHeap.Handle<K,V>`	DoubleEndedAddressableHeap.`deleteMax()`	Delete and return an element with the maximum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	DoubleEndedAddressableHeap.`deleteMin()`	Delete and return an element with the minimum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	DoubleEndedAddressableHeap.`findMax()`	Find an element with the maximum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	DoubleEndedAddressableHeap.`findMin()`	Find an element with the minimum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	DoubleEndedAddressableHeap.`insert(K key)`	Insert a new element into the heap with a null value.
`DoubleEndedAddressableHeap.Handle<K,V>`	DoubleEndedAddressableHeap.`insert(K key, V value)`	Insert a new element into the heap.

Methods in org.jheaps.tree that return DoubleEndedAddressableHeap.Handle
Modifier and Type	Method	Description
`DoubleEndedAddressableHeap.Handle<K,V>`	ReflectedHeap.`deleteMax()`	Delete and return an element with the maximum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	ReflectedHeap.`deleteMin()`	Delete and return an element with the minimum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	ReflectedHeap.`findMax()`	Find an element with the maximum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	ReflectedHeap.`findMin()`	Find an element with the minimum key.
`DoubleEndedAddressableHeap.Handle<K,V>`	ReflectedHeap.`insert(K key)`	Insert a new element into the heap with a null value.
`DoubleEndedAddressableHeap.Handle<K,V>`	ReflectedHeap.`insert(K key, V value)`	Insert a new element into the heap.

Uses of Interfaceorg.jheaps.DoubleEndedAddressableHeap.Handle