Uses of Class org.jheaps.annotations.ConstantTime

Packages that use ConstantTime
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 ConstantTime in org.jheaps.array

Methods in org.jheaps.array with annotations of type ConstantTime
Modifier and Type	Method	Description
`void`	AbstractArrayAddressableHeap.`clear()`	Clear all the elements of the heap.
`void`	AbstractArrayWeakHeap.`clear()`	Clear all the elements of this heap.
`void`	BinaryArrayBulkInsertWeakHeap.`clear()`	Clear all the elements of this heap.
`void`	BinaryArrayIntegerValueHeap.`clear()`	Clear all the elements of this heap.
`AddressableHeap.Handle<K,V>`	AbstractArrayAddressableHeap.`findMin()`	Find an element with the minimum key.
`K`	AbstractArrayHeap.`findMin()`	Find an element with the minimum key.
`K`	BinaryArrayBulkInsertWeakHeap.`findMin()`	Find an element with the minimum key.
`java.lang.Integer`	BinaryArrayIntegerValueHeap.`findMin()`	Find an element with the minimum key.
`K`	BinaryArrayWeakHeap.`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`	AbstractArrayAddressableHeap.`isEmpty()`	Returns `true` if this heap is empty.
`boolean`	AbstractArrayWeakHeap.`isEmpty()`	Returns `true` if this heap is empty.
`boolean`	BinaryArrayBulkInsertWeakHeap.`isEmpty()`	Returns `true` if this heap is empty.
`boolean`	BinaryArrayIntegerValueHeap.`isEmpty()`	Returns `true` if this heap is empty.
`long`	AbstractArrayAddressableHeap.`size()`	Returns the number of elements in the heap.
`long`	AbstractArrayWeakHeap.`size()`	Returns the number of elements in this heap.
`long`	BinaryArrayBulkInsertWeakHeap.`size()`	Returns the number of elements in this heap.
`long`	BinaryArrayIntegerValueHeap.`size()`	Returns the number of elements in this heap.

Uses of ConstantTime in org.jheaps.dag

Methods in org.jheaps.dag with annotations of type ConstantTime
Modifier and Type	Method	Description
`void`	HollowHeap.`clear()`	Clear all the elements of the heap.
`AddressableHeap.Handle<K,V>`	HollowHeap.`findMin()`	Find an element with the minimum key.
`AddressableHeap.Handle<K,V>`	HollowHeap.`insert(K key)`	Insert a new element into the heap with a null value.
`AddressableHeap.Handle<K,V>`	HollowHeap.`insert(K key, V value)`	Insert a new element into the heap.
`boolean`	HollowHeap.`isEmpty()`	Returns `true` if this heap is empty.
`void`	HollowHeap.`meld(MergeableAddressableHeap<K,V> other)`	Meld a heap into the current heap.
`long`	HollowHeap.`size()`	Returns the number of elements in the heap.

Constructors in org.jheaps.dag with annotations of type ConstantTime
Constructor	Description
`HollowHeap()`	Constructs a new, empty heap, using the natural ordering of its keys.
`HollowHeap(java.util.Comparator<? super K> comparator)`	Constructs a new, empty heap, ordered according to the given comparator.

Uses of ConstantTime in org.jheaps.monotone

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

Constructors in org.jheaps.tree with annotations of type ConstantTime
Constructor	Description
`CostlessMeldPairingHeap()`	Constructs a new, empty heap, using the natural ordering of its keys.
`CostlessMeldPairingHeap(java.util.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(java.util.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(java.util.Comparator<? super K> comparator)`	Constructs a new, empty heap, ordered according to the given comparator.
`RankPairingHeap()`	Constructs a new, empty heap, using the natural ordering of its keys.
`RankPairingHeap(java.util.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(java.util.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.dag

Uses of ConstantTime in org.jheaps.monotone

Uses of ConstantTime in org.jheaps.tree

Uses of Class
org.jheaps.annotations.ConstantTime