Uses of Class
org.jheaps.annotations.LogarithmicTime

Packages that use LogarithmicTime

Package	Description
org.jheaps.array	Heaps using an array representation
org.jheaps.dag	Heaps using an explicit "pointer-based" dag representation
org.jheaps.monotone	Monotone heaps
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	Description
void	AbstractArrayAddressableHeap.ArrayHandle.decreaseKey(K newKey)
AddressableHeap.Handle<K,V>	AbstractArrayAddressableHeap.deleteMin()	Delete and return an element with the minimum key.
K	AbstractArrayHeap.deleteMin()	Delete and return an element with the minimum key.
K	BinaryArrayBulkInsertWeakHeap.deleteMin()	Delete and return an element with the minimum key.
java.lang.Integer	BinaryArrayIntegerValueHeap.deleteMin()	Delete and return an element with the minimum key.
K	BinaryArrayWeakHeap.deleteMin()	Delete and return 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.
void	AbstractArrayHeap.insert(K key)	Insert a key into the heap.
void	BinaryArrayIntegerValueHeap.insert(java.lang.Integer key)	Insert a key into the heap.
void	BinaryArrayIntegerValueHeap.insert(java.lang.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.dag

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

Modifier and Type	Method	Description
AddressableHeap.Handle<K,V>	HollowHeap.deleteMin()	Delete and return an element with the minimum key.

Uses of LogarithmicTime in org.jheaps.monotone

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

Modifier and Type	Method	Description
AddressableHeap.Handle<K,V>	AbstractRadixAddressableHeap.deleteMin()	Delete and return an element with the minimum key.
K	AbstractRadixHeap.deleteMin()	Delete and return an element with the minimum key.

Uses of LogarithmicTime in org.jheaps.tree

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

Modifier and Type	Method	Description
void	BinaryTreeAddressableHeap.Node.decreaseKey(K newKey)
void	DaryTreeAddressableHeap.Node.decreaseKey(K newKey)
void	PairingHeap.Node.decreaseKey(K newKey)	Decrease the key of the element.
void	BinaryTreeAddressableHeap.Node.delete()
void	DaryTreeAddressableHeap.Node.delete()
void	FibonacciHeap.Node.delete()	Delete the element from the heap that it belongs.
void	PairingHeap.Node.delete()	Delete the element from the heap that it belongs.
void	RankPairingHeap.Node.delete()	Delete the element from the heap that it belongs.
void	SimpleFibonacciHeap.Node.delete()	Delete the element from the heap that it belongs.
AddressableHeap.Handle<K,V>	BinaryTreeAddressableHeap.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.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>	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>	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>	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.
void	PairingHeap.meld(MergeableAddressableHeap<K,V> other)	Meld a heap into the current heap.