Uses of Annotation Interface
org.jheaps.annotations.LogarithmicTime
Packages that use LogarithmicTime
Package
Description
Heaps using an array representation
Heaps using an explicit "pointer-based" dag representation
Monotone heaps
Heaps using an explicit "pointer-based" tree representation
-
Uses of LogarithmicTime in org.jheaps.array
Methods in org.jheaps.array with annotations of type LogarithmicTimeModifier and TypeMethodDescriptionvoid
AbstractArrayAddressableHeap.ArrayHandle.decreaseKey
(K newKey) AbstractArrayAddressableHeap.deleteMin()
Delete and return an element with the minimum key.AbstractArrayHeap.deleteMin()
Delete and return an element with the minimum key.BinaryArrayBulkInsertWeakHeap.deleteMin()
Delete and return an element with the minimum key.BinaryArrayIntegerValueHeap.deleteMin()
Delete and return an element with the minimum key.BinaryArrayWeakHeap.deleteMin()
Delete and return an element with the minimum key.Insert a new element into the heap with a null value.Insert a new element into the heap.void
Insert a key into the heap.void
Insert a key into the heap.void
Insert an element into the heap.void
Insert a key into the heap. -
Uses of LogarithmicTime in org.jheaps.dag
Methods in org.jheaps.dag with annotations of type LogarithmicTimeModifier and TypeMethodDescriptionHollowHeap.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 -
Uses of LogarithmicTime in org.jheaps.tree
Methods in org.jheaps.tree with annotations of type LogarithmicTimeModifier and TypeMethodDescriptionvoid
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.BinaryTreeAddressableHeap.deleteMin()
Delete and return an element with the minimum key.CostlessMeldPairingHeap.deleteMin()
Delete and return an element with the minimum key.DaryTreeAddressableHeap.deleteMin()
FibonacciHeap.deleteMin()
Delete and return an element with the minimum key.PairingHeap.deleteMin()
Delete and return an element with the minimum key.RankPairingHeap.deleteMin()
Delete and return an element with the minimum key.SimpleFibonacciHeap.deleteMin()
Delete and return an element with the minimum key.SkewHeap.deleteMin()
Delete and return an element with the minimum key.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.Insert a new element into the heap with a null value.Insert a new element into the heap.void
PairingHeap.meld
(MergeableAddressableHeap<K, V> other) Meld a heap into the current heap.