Uses of Class
org.jheaps.annotations.LogarithmicTime

Packages that use LogarithmicTime

Package	Description
org.jheaps.array	Heaps using an array representation
org.jheaps.tree	Heaps using an explicit "pointer-based" tree representation

Uses of LogarithmicTime in org.jheaps.array

Methods in org.jheaps.array with annotations of type LogarithmicTime

Modifier and Type	Method and Description
K	BinaryArrayWeakHeap.deleteMin() Delete and return an element with the minimum key.
Integer	BinaryArrayIntegerValueHeap.deleteMin() Delete and return an element with the minimum key.
K	BinaryArrayBulkInsertWeakHeap.deleteMin() Delete and return an element with the minimum key.
void	BinaryArrayIntegerValueHeap.insert(Integer key) Insert a key into the heap.
void	BinaryArrayIntegerValueHeap.insert(Integer key, V value) Insert an element into the heap.
void	BinaryArrayWeakHeap.insert(K key) Insert a key into the heap.

Uses of LogarithmicTime in org.jheaps.tree

Methods in org.jheaps.tree with annotations of type LogarithmicTime

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>	BinaryTreeAddressableHeap.deleteMin() Delete and return 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>	PairingHeap.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>	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>	PairingHeap.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>	BinaryTreeAddressableHeap.insert(K key, V value) Insert a new element into the heap.
void	PairingHeap.meld(MergeableAddressableHeap<K,V> other) Meld a heap into the current heap.