A B C D F G H I L M N O P R S V

A

AddressableHeap<K,V> - Interface in org.jheaps

A heap whose elements can be addressed using handles.

AddressableHeap.Handle<K,V> - Interface in org.jheaps

A heap element handle.

AddressableHeapFactory<K,V> - Interface in org.jheaps

An addressable heap factory.

B

Beta - Annotation Type in org.jheaps.annotations

Marker interface to indicate that a public API may change or be removed in the future.

BigIntegerRadixAddressableHeap<V> - Class in org.jheaps.monotone

An addressable radix heap for BigInteger keys.

BigIntegerRadixAddressableHeap(BigInteger, BigInteger) - Constructor for class org.jheaps.monotone.BigIntegerRadixAddressableHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

BigIntegerRadixHeap - Class in org.jheaps.monotone

A radix heap for BigInteger keys.

BigIntegerRadixHeap(BigInteger, BigInteger) - Constructor for class org.jheaps.monotone.BigIntegerRadixHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

BinaryArrayAddressableHeap<K,V> - Class in org.jheaps.array

An array based binary addressable heap.

BinaryArrayAddressableHeap() - Constructor for class org.jheaps.array.BinaryArrayAddressableHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryArrayAddressableHeap(int) - Constructor for class org.jheaps.array.BinaryArrayAddressableHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

BinaryArrayAddressableHeap(Comparator<? super K>) - Constructor for class org.jheaps.array.BinaryArrayAddressableHeap

Constructs a new, empty heap, ordered according to the given comparator.

BinaryArrayAddressableHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.BinaryArrayAddressableHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

BinaryArrayBulkInsertWeakHeap<K> - Class in org.jheaps.array

An array based binary weak heap using bulk insertion.

BinaryArrayBulkInsertWeakHeap() - Constructor for class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryArrayBulkInsertWeakHeap(int) - Constructor for class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

BinaryArrayBulkInsertWeakHeap(Comparator<? super K>) - Constructor for class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Constructs a new, empty heap, ordered according to the given comparator.

BinaryArrayBulkInsertWeakHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

BinaryArrayHeap<K> - Class in org.jheaps.array

An array based binary heap.

BinaryArrayHeap() - Constructor for class org.jheaps.array.BinaryArrayHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryArrayHeap(int) - Constructor for class org.jheaps.array.BinaryArrayHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

BinaryArrayHeap(Comparator<? super K>) - Constructor for class org.jheaps.array.BinaryArrayHeap

Constructs a new, empty heap, ordered according to the given comparator.

BinaryArrayHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.BinaryArrayHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

BinaryArrayIntegerValueHeap<V> - Class in org.jheaps.array

An optimized array-based binary heap with integer keys.

BinaryArrayIntegerValueHeap() - Constructor for class org.jheaps.array.BinaryArrayIntegerValueHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryArrayIntegerValueHeap(int) - Constructor for class org.jheaps.array.BinaryArrayIntegerValueHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

BinaryArrayWeakHeap<K> - Class in org.jheaps.array

An array based binary weak heap.

BinaryArrayWeakHeap() - Constructor for class org.jheaps.array.BinaryArrayWeakHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryArrayWeakHeap(int) - Constructor for class org.jheaps.array.BinaryArrayWeakHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

BinaryArrayWeakHeap(Comparator<? super K>) - Constructor for class org.jheaps.array.BinaryArrayWeakHeap

Constructs a new, empty heap, ordered according to the given comparator.

BinaryArrayWeakHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.BinaryArrayWeakHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

BinaryTreeAddressableHeap<K,V> - Class in org.jheaps.tree

An explicit binary tree addressable heap.

BinaryTreeAddressableHeap() - Constructor for class org.jheaps.tree.BinaryTreeAddressableHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryTreeAddressableHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.BinaryTreeAddressableHeap

Constructs a new, empty heap, ordered according to the given comparator.

BinaryTreeSoftAddressableHeap<K,V> - Class in org.jheaps.tree

A binary tree soft addressable heap.

BinaryTreeSoftAddressableHeap(double) - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryTreeSoftAddressableHeap(double, Comparator<? super K>) - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Constructs a new, empty heap, ordered according to the given comparator.

BinaryTreeSoftHeap<K> - Class in org.jheaps.tree

A binary tree soft heap.

BinaryTreeSoftHeap(double) - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap

Constructs a new, empty heap, using the natural ordering of its keys.

BinaryTreeSoftHeap(double, Comparator<? super K>) - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap

Constructs a new, empty heap, ordered according to the given comparator.

C

clear() - Method in interface org.jheaps.AddressableHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Clear all the elements of this heap.

clear() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Clear all the elements of this heap.

clear() - Method in interface org.jheaps.Heap

Clear all the elements of this heap.

clear() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Clear all the elements of this heap.

clear() - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.FibonacciHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.PairingHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.ReflectedHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.SimpleFibonacciHeap

Clear all the elements of the heap.

clear() - Method in class org.jheaps.tree.SkewHeap

Clear all the elements of the heap.

comparator() - Method in interface org.jheaps.AddressableHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Returns the comparator used to order the keys in this heap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in interface org.jheaps.Heap

Returns the comparator used to order the keys in this heap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Returns the comparator used to order the keys in this heap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.FibonacciHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.PairingHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.ReflectedHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.SimpleFibonacciHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

comparator() - Method in class org.jheaps.tree.SkewHeap

Returns the comparator used to order the keys in this AddressableHeap, or null if this heap uses the natural ordering of its keys.

Constants - Class in org.jheaps

Global library configuration flags which affect generated code at compile time.

ConstantTime - Annotation Type in org.jheaps.annotations

Marker interface to indicate that an operation takes constant time.

CostlessMeldPairingHeap<K,V> - Class in org.jheaps.tree

The costless meld variant of the pairing heaps.

CostlessMeldPairingHeap() - Constructor for class org.jheaps.tree.CostlessMeldPairingHeap

Constructs a new, empty heap, using the natural ordering of its keys.

CostlessMeldPairingHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.CostlessMeldPairingHeap

Constructs a new, empty heap, ordered according to the given comparator.

D

DaryArrayAddressableHeap<K,V> - Class in org.jheaps.array

An array based d-ary addressable heap.

DaryArrayAddressableHeap(int) - Constructor for class org.jheaps.array.DaryArrayAddressableHeap

Constructs a new, empty heap, using the natural ordering of its keys.

DaryArrayAddressableHeap(int, int) - Constructor for class org.jheaps.array.DaryArrayAddressableHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

DaryArrayAddressableHeap(int, Comparator<? super K>) - Constructor for class org.jheaps.array.DaryArrayAddressableHeap

Constructs a new, empty heap, ordered according to the given comparator.

DaryArrayAddressableHeap(int, Comparator<? super K>, int) - Constructor for class org.jheaps.array.DaryArrayAddressableHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

DaryArrayHeap<K> - Class in org.jheaps.array

An array based d-ary heap.

DaryArrayHeap(int) - Constructor for class org.jheaps.array.DaryArrayHeap

Constructs a new, empty heap, using the natural ordering of its keys.

DaryArrayHeap(int, int) - Constructor for class org.jheaps.array.DaryArrayHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

DaryArrayHeap(int, Comparator<? super K>) - Constructor for class org.jheaps.array.DaryArrayHeap

Constructs a new, empty heap, ordered according to the given comparator.

DaryArrayHeap(int, Comparator<? super K>, int) - Constructor for class org.jheaps.array.DaryArrayHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

DEBUG - Static variable in class org.jheaps.Constants

Global debug flag which affects compiled code

DEBUG_LEVEL1 - Static variable in class org.jheaps.Constants

Global level one debug flag which affects compiled code.

DEBUG_LEVEL2 - Static variable in class org.jheaps.Constants

Global level two debug flag which affects compiled code

decreaseKey(K) - Method in interface org.jheaps.AddressableHeap.Handle

Decrease the key of the element.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayAddressableHeap

Default initial capacity of the binary heap.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayHeap

Default initial capacity of the binary heap.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap

Default initial capacity of the heap.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayWeakHeap

Default initial capacity of the binary heap.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayAddressableHeap

Default initial capacity of the binary heap.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayHeap

Default initial capacity of the heap.

DEFAULT_HEAP_CAPACITY - Static variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Default initial capacity of the heap.

delete() - Method in interface org.jheaps.AddressableHeap.Handle

Delete the element from the heap that it belongs.

deleteMax() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Delete and return an element with the maximum key.

deleteMax() - Method in interface org.jheaps.DoubleEndedAddressableHeap

Delete and return an element with the maximum key.

deleteMax() - Method in interface org.jheaps.DoubleEndedHeap

Delete and return an element with the maximum key.

deleteMax() - Method in class org.jheaps.tree.ReflectedHeap

Delete and return an element with the maximum key.

deleteMin() - Method in interface org.jheaps.AddressableHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.array.BinaryArrayWeakHeap

Delete and return an element with the minimum key.

deleteMin() - Method in interface org.jheaps.DoubleEndedAddressableHeap

Delete and return an element with the minimum key.

deleteMin() - Method in interface org.jheaps.Heap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.FibonacciHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.PairingHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.ReflectedHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.SimpleFibonacciHeap

Delete and return an element with the minimum key.

deleteMin() - Method in class org.jheaps.tree.SkewHeap

Delete and return an element with the minimum key.

DoubleEndedAddressableHeap<K,V> - Interface in org.jheaps

A double-ended heap whose elements can be addressed using handles.

DoubleEndedAddressableHeap.Handle<K,V> - Interface in org.jheaps

A double-ended heap element handle.

DoubleEndedHeap<K> - Interface in org.jheaps

A double-ended heap.

DoubleEndedValueHeap<K,V> - Interface in org.jheaps

A double-ended heap with values.

DoubleRadixAddressableHeap<V> - Class in org.jheaps.monotone

An addressable radix heap for double keys.

DoubleRadixAddressableHeap(double, double) - Constructor for class org.jheaps.monotone.DoubleRadixAddressableHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

DoubleRadixHeap - Class in org.jheaps.monotone

A radix heap for double keys.

DoubleRadixHeap(double, double) - Constructor for class org.jheaps.monotone.DoubleRadixHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

F

FibonacciHeap<K,V> - Class in org.jheaps.tree

Fibonacci heaps.

FibonacciHeap() - Constructor for class org.jheaps.tree.FibonacciHeap

Constructs a new, empty heap, using the natural ordering of its keys.

FibonacciHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.FibonacciHeap

Constructs a new, empty heap, ordered according to the given comparator.

findMax() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Find an element with the maximum key.

findMax() - Method in interface org.jheaps.DoubleEndedAddressableHeap

Find an element with the maximum key.

findMax() - Method in interface org.jheaps.DoubleEndedHeap

Find an element with the maximum key.

findMax() - Method in class org.jheaps.tree.ReflectedHeap

Find an element with the maximum key.

findMaxValue() - Method in interface org.jheaps.DoubleEndedValueHeap

Find the value of an element with the maximum key.

findMin() - Method in interface org.jheaps.AddressableHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.array.BinaryArrayWeakHeap

Find an element with the minimum key.

findMin() - Method in interface org.jheaps.DoubleEndedAddressableHeap

Find an element with the minimum key.

findMin() - Method in interface org.jheaps.Heap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.FibonacciHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.PairingHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.ReflectedHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.SimpleFibonacciHeap

Find an element with the minimum key.

findMin() - Method in class org.jheaps.tree.SkewHeap

Find an element with the minimum key.

findMinValue() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Find the value of an element with the minimum key.

findMinValue() - Method in interface org.jheaps.DoubleEndedValueHeap

Find the value of an element with the minimum key.

findMinValue() - Method in interface org.jheaps.ValueHeap

Find the value of an element with the minimum key.

G

get(Comparator<? super K>) - Method in interface org.jheaps.AddressableHeapFactory

Get a new heap.

getKey() - Method in interface org.jheaps.AddressableHeap.Handle

Return the key of the element.

getValue() - Method in interface org.jheaps.AddressableHeap.Handle

Return the value of the element.

H

Heap<K> - Interface in org.jheaps

A heap.

heapify(K[], V[]) - Static method in class org.jheaps.array.BinaryArrayAddressableHeap

Create a heap from an array of elements.

heapify(K[], V[], Comparator<? super K>) - Static method in class org.jheaps.array.BinaryArrayAddressableHeap

Create a heap from an array of elements.

heapify(K[]) - Static method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Create a heap from an array of elements.

heapify(K[], Comparator<? super K>) - Static method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Create a heap from an array of elements.

heapify(K[]) - Static method in class org.jheaps.array.BinaryArrayHeap

Create a heap from an array of elements.

heapify(K[], Comparator<? super K>) - Static method in class org.jheaps.array.BinaryArrayHeap

Create a heap from an array of elements.

heapify(K[]) - Static method in class org.jheaps.array.BinaryArrayWeakHeap

Create a heap from an array of elements.

heapify(K[], Comparator<? super K>) - Static method in class org.jheaps.array.BinaryArrayWeakHeap

Create a heap from an array of elements.

heapify(int, K[], V[]) - Static method in class org.jheaps.array.DaryArrayAddressableHeap

Create a heap from an array of elements.

heapify(int, K[], V[], Comparator<? super K>) - Static method in class org.jheaps.array.DaryArrayAddressableHeap

Create a heap from an array of elements.

heapify(int, K[]) - Static method in class org.jheaps.array.DaryArrayHeap

Create a heap from an array of elements.

heapify(int, K[], Comparator<? super K>) - Static method in class org.jheaps.array.DaryArrayHeap

Create a heap from an array of elements.

heapify(K[]) - Static method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Create a heap from an array of elements.

heapify(K[], Comparator<? super K>) - Static method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Create a heap from an array of elements.

I

increaseKey(K) - Method in interface org.jheaps.DoubleEndedAddressableHeap.Handle

Increase the key of the element.

insert(K, V) - Method in interface org.jheaps.AddressableHeap

Insert a new element into the heap.

insert(K) - Method in interface org.jheaps.AddressableHeap

Insert a new element into the heap with a null value.

insert(K) - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Insert a key into the heap.

insert(Integer, V) - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Insert an element into the heap.

insert(Integer) - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Insert a key into the heap.

insert(K) - Method in class org.jheaps.array.BinaryArrayWeakHeap

Insert a key into the heap.

insert(K, V) - Method in interface org.jheaps.DoubleEndedAddressableHeap

Insert a new element into the heap.

insert(K) - Method in interface org.jheaps.DoubleEndedAddressableHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in interface org.jheaps.DoubleEndedValueHeap

Insert an element into the heap.

insert(K) - Method in interface org.jheaps.Heap

Insert a key into the heap.

insert(K) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Insert a new element into the heap.

insert(K, V) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Insert a new element into the heap.

insert(K) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Insert a new element into the heap with a null value.

insert(K) - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Insert a key into the heap.

insert(K, V) - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Insert a new element into the heap.

insert(K) - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in class org.jheaps.tree.FibonacciHeap

Insert a new element into the heap.

insert(K) - Method in class org.jheaps.tree.FibonacciHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in class org.jheaps.tree.PairingHeap

Insert a new element into the heap.

insert(K) - Method in class org.jheaps.tree.PairingHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in class org.jheaps.tree.ReflectedHeap

Insert a new element into the heap.

insert(K) - Method in class org.jheaps.tree.ReflectedHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in class org.jheaps.tree.SimpleFibonacciHeap

Insert a new element into the heap.

insert(K) - Method in class org.jheaps.tree.SimpleFibonacciHeap

Insert a new element into the heap with a null value.

insert(K) - Method in class org.jheaps.tree.SkewHeap

Insert a new element into the heap with a null value.

insert(K, V) - Method in class org.jheaps.tree.SkewHeap

Insert a new element into the heap.

insert(K, V) - Method in interface org.jheaps.ValueHeap

Insert an element into the heap.

IntegerRadixAddressableHeap<V> - Class in org.jheaps.monotone

An addressable radix heap for (signed) integer keys.

IntegerRadixAddressableHeap(int, int) - Constructor for class org.jheaps.monotone.IntegerRadixAddressableHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

IntegerRadixHeap - Class in org.jheaps.monotone

A radix heap for (signed) integer keys.

IntegerRadixHeap(int, int) - Constructor for class org.jheaps.monotone.IntegerRadixHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

isEmpty() - Method in interface org.jheaps.AddressableHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Returns true if this heap is empty.

isEmpty() - Method in interface org.jheaps.Heap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.FibonacciHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.PairingHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.ReflectedHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.SimpleFibonacciHeap

Returns true if this heap is empty.

isEmpty() - Method in class org.jheaps.tree.SkewHeap

Returns true if this heap is empty.

L

LeftistHeap<K,V> - Class in org.jheaps.tree

Leftist heaps.

LeftistHeap() - Constructor for class org.jheaps.tree.LeftistHeap

Constructs a new, empty heap, using the natural ordering of its keys.

LeftistHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.LeftistHeap

Constructs a new, empty heap, ordered according to the given comparator.

LinearTime - Annotation Type in org.jheaps.annotations

Marker interface to indicate that an operation takes O(n) time where n is the size of the input.

LogarithmicTime - Annotation Type in org.jheaps.annotations

Marker interface to indicate that an operation takes O(log(n)) time where n is the size of the input.

LogLogTime - Annotation Type in org.jheaps.annotations

Marker interface to indicate that an operation takes O(loglog(n)) time where n is the size of the input.

LongRadixAddressableHeap<V> - Class in org.jheaps.monotone

An addressable radix heap for (signed) long keys.

LongRadixAddressableHeap(long, long) - Constructor for class org.jheaps.monotone.LongRadixAddressableHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

LongRadixHeap - Class in org.jheaps.monotone

A radix heap for (signed) long keys.

LongRadixHeap(long, long) - Constructor for class org.jheaps.monotone.LongRadixHeap

Constructs a new heap which can store values between a minimum and a maximum key value (inclusive).

M

meld(MergeableAddressableHeap<K, V>) - Method in interface org.jheaps.MergeableAddressableHeap

Meld a heap into the current heap.

meld(MergeableDoubleEndedAddressableHeap<K, V>) - Method in interface org.jheaps.MergeableDoubleEndedAddressableHeap

Meld a heap into the current heap.

meld(MergeableHeap<K>) - Method in interface org.jheaps.MergeableHeap

Meld a heap into the current heap.

meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Meld a heap into the current heap.

meld(MergeableHeap<K>) - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Meld a heap into the current heap.

meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Meld a heap into the current heap.

meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.FibonacciHeap

Meld a heap into the current heap.

meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.PairingHeap

Meld a heap into the current heap.

meld(MergeableDoubleEndedAddressableHeap<K, V>) - Method in class org.jheaps.tree.ReflectedHeap

Meld a heap into the current heap.

meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.SimpleFibonacciHeap

Meld a heap into the current heap.

meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.SkewHeap

MergeableAddressableHeap<K,V> - Interface in org.jheaps

An addressable heap that allows melding with another addressable heap.

MergeableDoubleEndedAddressableHeap<K,V> - Interface in org.jheaps

A double-ended addressable heap that allows melding with another double-ended addressable heap.

MergeableHeap<K> - Interface in org.jheaps

A heap that allows melding with another heap.

MinMaxBinaryArrayDoubleEndedHeap<K> - Class in org.jheaps.array

An array based binary MinMax heap.

MinMaxBinaryArrayDoubleEndedHeap() - Constructor for class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Constructs a new, empty heap, using the natural ordering of its keys.

MinMaxBinaryArrayDoubleEndedHeap(int) - Constructor for class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Constructs a new, empty heap, with a provided initial capacity using the natural ordering of its keys.

MinMaxBinaryArrayDoubleEndedHeap(Comparator<? super K>) - Constructor for class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Constructs a new, empty heap, ordered according to the given comparator.

MinMaxBinaryArrayDoubleEndedHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap

Constructs a new, empty heap, with a provided initial capacity ordered according to the given comparator.

N

NAME - Static variable in class org.jheaps.Constants

Library name

NOT_BENCHMARK - Static variable in class org.jheaps.Constants

Global benchmarking flag.

O

org.jheaps - package org.jheaps

Interfaces

org.jheaps.annotations - package org.jheaps.annotations

Annotation types

org.jheaps.array - package org.jheaps.array

Heaps using an array representation

org.jheaps.monotone - package org.jheaps.monotone

Monotone heaps

org.jheaps.tree - package org.jheaps.tree

Heaps using an explicit "pointer-based" tree representation

P

PairingHeap<K,V> - Class in org.jheaps.tree

Pairing heaps.

PairingHeap() - Constructor for class org.jheaps.tree.PairingHeap

Constructs a new, empty heap, using the natural ordering of its keys.

PairingHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.PairingHeap

Constructs a new, empty heap, ordered according to the given comparator.

R

ReflectedFibonacciHeap<K,V> - Class in org.jheaps.tree

Reflected double ended heaps based on Fibonacci heaps.

ReflectedFibonacciHeap() - Constructor for class org.jheaps.tree.ReflectedFibonacciHeap

Constructs a new, empty heap, using the natural ordering of its keys.

ReflectedFibonacciHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.ReflectedFibonacciHeap

Constructs a new, empty heap, ordered according to the given comparator.

ReflectedHeap<K,V> - Class in org.jheaps.tree

Reflected double ended heaps.

ReflectedHeap(AddressableHeapFactory<K, ?>) - Constructor for class org.jheaps.tree.ReflectedHeap

Constructs a new, empty heap, using the natural ordering of its keys.

ReflectedHeap(AddressableHeapFactory<K, ?>, Comparator<? super K>) - Constructor for class org.jheaps.tree.ReflectedHeap

Constructs a new, empty heap, ordered according to the given comparator.

ReflectedPairingHeap<K,V> - Class in org.jheaps.tree

Reflected double ended heaps based on pairing heaps.

ReflectedPairingHeap() - Constructor for class org.jheaps.tree.ReflectedPairingHeap

Constructs a new, empty heap, using the natural ordering of its keys.

ReflectedPairingHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.ReflectedPairingHeap

Constructs a new, empty heap, ordered according to the given comparator.

S

setValue(V) - Method in interface org.jheaps.AddressableHeap.Handle

Set the value of the element.

SimpleFibonacciHeap<K,V> - Class in org.jheaps.tree

Simple Fibonacci heaps.

SimpleFibonacciHeap() - Constructor for class org.jheaps.tree.SimpleFibonacciHeap

Constructs a new, empty heap, using the natural ordering of its keys.

SimpleFibonacciHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.SimpleFibonacciHeap

Constructs a new, empty heap, ordered according to the given comparator.

size() - Method in interface org.jheaps.AddressableHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap

Returns the number of elements in this heap.

size() - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap

Returns the number of elements in this heap.

size() - Method in interface org.jheaps.Heap

Returns the number of elements in this heap.

size() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.BinaryTreeSoftHeap

Returns the number of elements in this heap.

size() - Method in class org.jheaps.tree.CostlessMeldPairingHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.FibonacciHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.PairingHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.ReflectedHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.SimpleFibonacciHeap

Returns the number of elements in the heap.

size() - Method in class org.jheaps.tree.SkewHeap

Returns the number of elements in the heap.

SkewHeap<K,V> - Class in org.jheaps.tree

Skew heaps.

SkewHeap() - Constructor for class org.jheaps.tree.SkewHeap

Constructs a new, empty heap, using the natural ordering of its keys.

SkewHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.SkewHeap

Constructs a new, empty heap, ordered according to the given comparator.

V

ValueHeap<K,V> - Interface in org.jheaps

A heap with values.

VisibleForTesting - Annotation Type in org.jheaps.annotations

Marker interface to indicate that something is visible as package-private only for testing purposes.

A B C D F G H I L M N O P R S V