Uses of Class org.jheaps.annotations.ConstantTime (JHeaps)

Packages that use ConstantTime
Package Description

org.jheaps.array
Heaps using an array representation

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

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

Uses of ConstantTime in org.jheaps.array

Methods in org.jheaps.array with annotations of type ConstantTime
Modifier and Type	Method and Description
`void`	BinaryArrayIntegerValueHeap.`clear()` Clear all the elements of this heap.
`void`	BinaryArrayBulkInsertWeakHeap.`clear()` Clear all the elements of this heap.
`K`	BinaryArrayWeakHeap.`findMin()` Find an element with the minimum key.
`Integer`	BinaryArrayIntegerValueHeap.`findMin()` Find an element with the minimum key.
`K`	BinaryArrayBulkInsertWeakHeap.`findMin()` Find an element with the minimum key.
`V`	BinaryArrayIntegerValueHeap.`findMinValue()` Find the value of an element with the minimum key.
`void`	BinaryArrayBulkInsertWeakHeap.`insert(K key)` Insert a key into the heap.
`boolean`	BinaryArrayIntegerValueHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	BinaryArrayBulkInsertWeakHeap.`isEmpty()` Returns `true` if this heap is empty.
`long`	BinaryArrayIntegerValueHeap.`size()` Returns the number of elements in this heap.
`long`	BinaryArrayBulkInsertWeakHeap.`size()` Returns the number of elements in this heap.

Uses of ConstantTime in org.jheaps.tree

Methods in org.jheaps.tree with annotations of type ConstantTime
Modifier and Type	Method and Description
`void`	SkewHeap.`clear()` Clear all the elements of the heap.
`void`	SimpleFibonacciHeap.`clear()` Clear all the elements of the heap.
`void`	PairingHeap.`clear()` Clear all the elements of the heap.
`void`	FibonacciHeap.`clear()` Clear all the elements of the heap.
`void`	CostlessMeldPairingHeap.`clear()` Clear all the elements of the heap.
`void`	BinaryTreeSoftHeap.`clear()` Clear all the elements of this heap.
`void`	BinaryTreeSoftAddressableHeap.`clear()` Clear all the elements of the heap.
`void`	BinaryTreeAddressableHeap.`clear()` Clear all the elements of the heap.
`AddressableHeap.Handle<K,V>`	SkewHeap.`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>`	PairingHeap.`findMin()` Find an element with the minimum key.
`AddressableHeap.Handle<K,V>`	FibonacciHeap.`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>`	BinaryTreeAddressableHeap.`findMin()` Find an element with the minimum key.
`AddressableHeap.Handle<K,V>`	SimpleFibonacciHeap.`insert(K key)` Insert a new element into the heap with a null value.
`AddressableHeap.Handle<K,V>`	FibonacciHeap.`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>`	FibonacciHeap.`insert(K key, V value)` Insert a new element into the heap.
`boolean`	SkewHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	SimpleFibonacciHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	PairingHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	FibonacciHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	CostlessMeldPairingHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	BinaryTreeSoftHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	BinaryTreeSoftAddressableHeap.`isEmpty()` Returns `true` if this heap is empty.
`boolean`	BinaryTreeAddressableHeap.`isEmpty()` Returns `true` if this heap is empty.
`void`	SimpleFibonacciHeap.`meld(MergeableAddressableHeap<K,V> other)` Meld a heap into the current heap.
`void`	FibonacciHeap.`meld(MergeableAddressableHeap<K,V> other)` Meld a heap into the current heap.
`void`	CostlessMeldPairingHeap.`meld(MergeableAddressableHeap<K,V> other)` Meld a heap into the current heap.
`long`	SkewHeap.`size()` Returns the number of elements in the heap.
`long`	SimpleFibonacciHeap.`size()` Returns the number of elements in the heap.
`long`	PairingHeap.`size()` Returns the number of elements in the heap.
`long`	FibonacciHeap.`size()` Returns the number of elements in the heap.
`long`	CostlessMeldPairingHeap.`size()` Returns the number of elements in the heap.
`long`	BinaryTreeSoftHeap.`size()` Returns the number of elements in this heap.
`long`	BinaryTreeSoftAddressableHeap.`size()` Returns the number of elements in the heap.
`long`	BinaryTreeAddressableHeap.`size()` Returns the number of elements in the heap.

Constructors in org.jheaps.tree with annotations of type ConstantTime
Constructor and Description
`CostlessMeldPairingHeap()` Constructs a new, empty heap, using the natural ordering of its keys.
`CostlessMeldPairingHeap(Comparator<? super K> comparator)` Constructs a new, empty heap, ordered according to the given comparator.
`FibonacciHeap()` Constructs a new, empty heap, using the natural ordering of its keys.
`FibonacciHeap(Comparator<? super K> comparator)` Constructs a new, empty heap, ordered according to the given comparator.
`PairingHeap()` Constructs a new, empty heap, using the natural ordering of its keys.
`PairingHeap(Comparator<? super K> comparator)` Constructs a new, empty heap, ordered according to the given comparator.
`SimpleFibonacciHeap()` Constructs a new, empty heap, using the natural ordering of its keys.
`SimpleFibonacciHeap(Comparator<? super K> comparator)` Constructs a new, empty heap, ordered according to the given comparator.

Uses of Classorg.jheaps.annotations.ConstantTime

Uses of ConstantTime in org.jheaps.array

Uses of ConstantTime in org.jheaps.tree

Uses of Class
org.jheaps.annotations.ConstantTime