Index (JHeaps 0.14 API)

A B C D E F G H I J L M N O P R S U V
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

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.
amortized() - Element in annotation type org.jheaps.annotations.ConstantTime: Whether the running time is amortized or actual.
amortized() - Element in annotation type org.jheaps.annotations.LinearTime: Whether the running time is amortized or actual.
amortized() - Element in annotation type org.jheaps.annotations.LogarithmicTime: Whether the running time is amortized or actual.
amortized() - Element in annotation type org.jheaps.annotations.LogLogTime: Whether the running time is amortized or actual.
array - Variable in class org.jheaps.array.BinaryArrayAddressableHeap: The array use for representing the tree.
array - Variable in class org.jheaps.array.DaryArrayAddressableHeap: The array use for representing the tree.
array - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: The array used for representing the heap.
array - Variable in class org.jheaps.array.BinaryArrayHeap: The array used for representing the heap.
array - Variable in class org.jheaps.array.BinaryArrayWeakHeap: The array used for representing the heap.
array - Variable in class org.jheaps.array.DaryArrayHeap: The array used for representing the heap.
array - Variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: The array used for representing the heap.

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.
buckets - Variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.LongRadixAddressableHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.DoubleRadixHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.IntegerRadixHeap: The buckets as lists.
buckets - Variable in class org.jheaps.monotone.LongRadixHeap: The buckets as lists.
bulkInsert() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Bulk insert from insertion buffer into the weak heap.
bulkInsertWithComparator() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Bulk insert from insertion buffer into the weak heap.

C

checkCapacity(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
checkCapacity(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap
checkCapacity(int) - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Check that a capacity is valid.
checkCapacity(int) - Method in class org.jheaps.array.BinaryArrayHeap: Check that a capacity is valid.
checkCapacity(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap: Check that a capacity is valid.
checkCapacity(int) - Method in class org.jheaps.array.DaryArrayHeap: Check that a capacity is valid.
checkCapacity(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Check that a capacity is valid.
clear() - Method in interface org.jheaps.AddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.array.BinaryArrayAddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.array.DaryArrayAddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.array.BinaryArrayHeap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.array.BinaryArrayWeakHeap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.array.DaryArrayHeap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Clear all the elements of this 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 class org.jheaps.dag.HollowHeap: Clear all the elements of the heap.
clear() - Method in interface org.jheaps.Heap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Clear all the elements of the heap.
clear() - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.monotone.DoubleRadixHeap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.monotone.IntegerRadixHeap: Clear all the elements of this heap.
clear() - Method in class org.jheaps.monotone.LongRadixHeap: 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.DaryTreeAddressableHeap
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.RankPairingHeap: 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 - Variable in class org.jheaps.array.BinaryArrayAddressableHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.array.DaryArrayAddressableHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.array.BinaryArrayHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.array.BinaryArrayWeakHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.array.DaryArrayHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
comparator - Variable in class org.jheaps.tree.SkewHeap: The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
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.BinaryArrayAddressableHeap: 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.DaryArrayAddressableHeap: 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.BinaryArrayBulkInsertWeakHeap: 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.array.BinaryArrayHeap: 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.array.BinaryArrayWeakHeap: 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.array.DaryArrayHeap: 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.array.MinMaxBinaryArrayDoubleEndedHeap: 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.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 class org.jheaps.dag.HollowHeap: 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 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.monotone.BigIntegerRadixAddressableHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.DoubleRadixHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.IntegerRadixHeap: Always returns null since this heap uses the natural ordering of its keys.
comparator() - Method in class org.jheaps.monotone.LongRadixHeap: Always returns null since 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.DaryTreeAddressableHeap
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.RankPairingHeap: 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.
compare(Double, Double) - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Compares its two arguments for order.
compare(Double, Double) - Method in class org.jheaps.monotone.DoubleRadixHeap: Compares its two arguments for order.
compare(Integer, Integer) - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Compares its two arguments for order.
compare(Integer, Integer) - Method in class org.jheaps.monotone.IntegerRadixHeap: Compares its two arguments for order.
compare(Long, Long) - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Compares its two arguments for order.
compare(Long, Long) - Method in class org.jheaps.monotone.LongRadixHeap: Compares its two arguments for order.
compare(BigInteger, BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Compares its two arguments for order.
compare(BigInteger, BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Compares its two arguments for order.
computeBucket(BigInteger, BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Compute the bucket of a key based on a minimum key.
computeBucket(Double, Double) - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Compute the bucket of a key based on a minimum key.
computeBucket(Integer, Integer) - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Compute the bucket of a key based on a minimum key.
computeBucket(Long, Long) - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Compute the bucket of a key based on a minimum key.
computeBucket(BigInteger, BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Compute the bucket of a key based on a minimum key.
computeBucket(Double, Double) - Method in class org.jheaps.monotone.DoubleRadixHeap: Compute the bucket of a key based on a minimum key.
computeBucket(Integer, Integer) - Method in class org.jheaps.monotone.IntegerRadixHeap: Compute the bucket of a key based on a minimum key.
computeBucket(Long, Long) - Method in class org.jheaps.monotone.LongRadixHeap: Compute the bucket of a key based on a minimum key.
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.
createNode(K, V) - Method in class org.jheaps.tree.LeftistHeap: Factory method for new node creation
createNode(K, V) - Method in class org.jheaps.tree.SkewHeap: Create a new node.
currentMin - Variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.LongRadixAddressableHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.DoubleRadixHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.IntegerRadixHeap: The current minimum value (cached)
currentMin - Variable in class org.jheaps.monotone.LongRadixHeap: The current minimum value (cached)
currentMinBucket - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: The current minimum value bucket (cached)
currentMinBucket - Variable in class org.jheaps.monotone.DoubleRadixHeap: The current minimum value bucket (cached)
currentMinBucket - Variable in class org.jheaps.monotone.IntegerRadixHeap: The current minimum value bucket (cached)
currentMinBucket - Variable in class org.jheaps.monotone.LongRadixHeap: The current minimum value bucket (cached)
currentMinPos - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: The current minimum value position in bucket (cached)
currentMinPos - Variable in class org.jheaps.monotone.DoubleRadixHeap: The current minimum value position in bucket (cached)
currentMinPos - Variable in class org.jheaps.monotone.IntegerRadixHeap: The current minimum value position in bucket (cached)
currentMinPos - Variable in class org.jheaps.monotone.LongRadixHeap: The current minimum value position in bucket (cached)

D

d - Variable in class org.jheaps.array.DaryArrayAddressableHeap: Degree
d - Variable in class org.jheaps.array.DaryArrayHeap: Degree
dancestor(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap: Return the distinguished ancestor of an element.
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.
DaryTreeAddressableHeap<K,V> - Class in org.jheaps.tree: An explicit d-ary tree addressable heap.
DaryTreeAddressableHeap(int) - Constructor for class org.jheaps.tree.DaryTreeAddressableHeap: Constructs a new, empty heap, using the natural ordering of its keys.
DaryTreeAddressableHeap(int, Comparator<? super K>) - Constructor for class org.jheaps.tree.DaryTreeAddressableHeap: Constructs a new, empty heap, 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.
delete(SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.SkewHeap: Delete a node from the heap.
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.BinaryArrayAddressableHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.array.DaryArrayAddressableHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.array.BinaryArrayHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.array.DaryArrayHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: 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 class org.jheaps.dag.HollowHeap: 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.monotone.BigIntegerRadixAddressableHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.DoubleRadixHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.IntegerRadixHeap: Delete and return an element with the minimum key.
deleteMin() - Method in class org.jheaps.monotone.LongRadixHeap: 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.DaryTreeAddressableHeap
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.RankPairingHeap: 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).
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayAddressableHeap: Limit for the heap capacity when down-sizing.
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayAddressableHeap: Limit for the heap capacity when down-sizing.
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Limit for the heap capacity when down-sizing.
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayHeap: Limit for the heap capacity when down-sizing.
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayWeakHeap: Limit for the heap capacity when down-sizing.
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayHeap: Limit for the heap capacity when down-sizing.
DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Limit for the heap capacity when down-sizing.

E

EMPTY - Static variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.LongRadixAddressableHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.BigIntegerRadixHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.DoubleRadixHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.IntegerRadixHeap: Denotes that a key does not belong to a bucket
EMPTY - Static variable in class org.jheaps.monotone.LongRadixHeap: Denotes that a key does not belong to a bucket
ensureCapacity(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap: Ensure that the array representation has the necessary capacity.
ensureCapacity(int) - Method in class org.jheaps.array.BinaryArrayHeap: Ensure that the array representation has the necessary capacity.
ensureCapacity(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap: Ensure that the array representation has the necessary capacity.
ensureCapacity(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap: Ensure that the array representation has the necessary capacity.
ensureCapacity(int) - Method in class org.jheaps.array.DaryArrayHeap: Ensure that the array representation has the necessary capacity.
ensureCapacity(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Ensure that the array representation has the necessary capacity.

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.BinaryArrayAddressableHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.array.DaryArrayAddressableHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.array.BinaryArrayHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.array.DaryArrayHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: 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 class org.jheaps.dag.HollowHeap: 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.monotone.BigIntegerRadixAddressableHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.DoubleRadixHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.IntegerRadixHeap: Find an element with the minimum key.
findMin() - Method in class org.jheaps.monotone.LongRadixHeap: 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.DaryTreeAddressableHeap
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.RankPairingHeap: 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.
fixdown(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
fixdown(int) - Method in class org.jheaps.array.BinaryArrayHeap
fixdown(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap
fixdown(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap
fixdown(int) - Method in class org.jheaps.array.DaryArrayHeap
fixdown(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Downwards fix starting from a particular element.
fixdownWithComparator(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
fixdownWithComparator(int) - Method in class org.jheaps.array.BinaryArrayHeap
fixdownWithComparator(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap
fixdownWithComparator(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap
fixdownWithComparator(int) - Method in class org.jheaps.array.DaryArrayHeap
fixdownWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Downwards fix starting from a particular element.
fixup(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
fixup(int) - Method in class org.jheaps.array.BinaryArrayHeap
fixup(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap
fixup(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap
fixup(int) - Method in class org.jheaps.array.DaryArrayHeap
fixup(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Upwards fix starting from a particular element
fixupWithComparator(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
fixupWithComparator(int) - Method in class org.jheaps.array.BinaryArrayHeap
fixupWithComparator(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap
fixupWithComparator(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap
fixupWithComparator(int) - Method in class org.jheaps.array.DaryArrayHeap
fixupWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Upwards fix starting from a particular element
forceFixup(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
forceFixup(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap

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.
getParent(SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.SkewHeap: Get the parent node of a given node.
getValue() - Method in interface org.jheaps.AddressableHeap.Handle: Return the value of the element.

H

handlesIterator() - Method in class org.jheaps.array.BinaryArrayAddressableHeap: Get an iterator for all handles currently in the heap.
handlesIterator() - Method in class org.jheaps.array.DaryArrayAddressableHeap: Get an iterator for all handles currently in the heap.
Heap<K> - Interface in org.jheaps: A heap.
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(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(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[]) - Static method in class org.jheaps.array.BinaryArrayWeakHeap: 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.BinaryArrayBulkInsertWeakHeap: 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[], Comparator<? super 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.MinMaxBinaryArrayDoubleEndedHeap: Create a heap from an array of elements.
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.
HollowHeap<K,V> - Class in org.jheaps.dag: Hollow heaps.
HollowHeap() - Constructor for class org.jheaps.dag.HollowHeap: Constructs a new, empty heap, using the natural ordering of its keys.
HollowHeap(Comparator<? super K>) - Constructor for class org.jheaps.dag.HollowHeap: Constructs a new, empty heap, ordered according to the given comparator.

I

increaseKey(K) - Method in interface org.jheaps.DoubleEndedAddressableHeap.Handle: Increase the key of the element.
initCapacity(int) - Method in class org.jheaps.array.BinaryArrayHeap: Initialize the array representation
initCapacity(int) - Method in class org.jheaps.array.DaryArrayHeap: Initialize the array representation
initCapacity(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Initialize the array representation
initCapacity(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap
insert(Integer) - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap: Insert a key into the heap.
insert(Integer, V) - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap: Insert an 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.BinaryArrayAddressableHeap: Insert a new element into the heap with a null value.
insert(K) - Method in class org.jheaps.array.DaryArrayAddressableHeap: Insert a new element into the heap with a null value.
insert(K) - Method in class org.jheaps.array.BinaryArrayHeap: Insert a key into the heap.
insert(K) - Method in class org.jheaps.array.DaryArrayHeap: Insert a key into the heap.
insert(K) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Insert a key into the heap.
insert(K) - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Insert a key into the heap.
insert(K) - Method in class org.jheaps.array.BinaryArrayWeakHeap: Insert a key into the heap.
insert(K) - Method in class org.jheaps.dag.HollowHeap: Insert a new element into the heap with a null value.
insert(K) - Method in interface org.jheaps.DoubleEndedAddressableHeap: Insert a new element into the heap with a null value.
insert(K) - Method in interface org.jheaps.Heap: Insert a key into the heap.
insert(BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Insert a new element into the heap with a null value.
insert(Double) - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Insert a new element into the heap with a null value.
insert(Integer) - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Insert a new element into the heap with a null value.
insert(Long) - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Insert a new element into the heap with a null value.
insert(BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Insert a key into the heap.
insert(Double) - Method in class org.jheaps.monotone.DoubleRadixHeap: Insert a key into the heap.
insert(Integer) - Method in class org.jheaps.monotone.IntegerRadixHeap: Insert a key into the heap.
insert(Long) - Method in class org.jheaps.monotone.LongRadixHeap: 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) - 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) - Method in class org.jheaps.tree.CostlessMeldPairingHeap: Insert a new element into the heap with a null value.
insert(K) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
insert(K) - Method in class org.jheaps.tree.FibonacciHeap: Insert a new element into the heap with a null value.
insert(K) - Method in class org.jheaps.tree.PairingHeap: Insert a new element into the heap with a null value.
insert(K) - Method in class org.jheaps.tree.RankPairingHeap: Insert a new element into the heap with a null value.
insert(K) - Method in class org.jheaps.tree.ReflectedHeap: Insert a new element into the heap with a null value.
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 interface org.jheaps.AddressableHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.array.BinaryArrayAddressableHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.array.DaryArrayAddressableHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.dag.HollowHeap: Insert a new element into the heap.
insert(K, V) - Method in interface org.jheaps.DoubleEndedAddressableHeap: Insert a new element into the heap.
insert(K, V) - Method in interface org.jheaps.DoubleEndedValueHeap: Insert an element into the heap.
insert(BigInteger, V) - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Insert a new element into the heap.
insert(Double, V) - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Insert a new element into the heap.
insert(Integer, V) - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Insert a new element into the heap.
insert(Long, V) - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Insert a new element into the heap.
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, V) - Method in class org.jheaps.tree.CostlessMeldPairingHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
insert(K, V) - Method in class org.jheaps.tree.FibonacciHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.tree.PairingHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.tree.RankPairingHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.tree.ReflectedHeap: Insert a new element into the heap.
insert(K, V) - Method in class org.jheaps.tree.SimpleFibonacciHeap: Insert a new element into the heap.
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.
INSERTION_BUFFER_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Insertion buffer capacity for integer size since we are using Java arrays to store elements.
insertionBuffer - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: The insertion buffer
insertionBufferMinPos - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Position of minimum in the insertion buffer
insertionBufferSize - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Number of elements in the insertion buffer
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).
isBulkInsertionBufferFull() - Method in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Check if the bulk insertion buffer is full.
isEmpty() - Method in interface org.jheaps.AddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.array.BinaryArrayAddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.array.DaryArrayAddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.array.BinaryArrayHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.array.BinaryArrayWeakHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.array.DaryArrayHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: 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 class org.jheaps.dag.HollowHeap: 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.monotone.BigIntegerRadixAddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.DoubleRadixHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.IntegerRadixHeap: Returns true if this heap is empty.
isEmpty() - Method in class org.jheaps.monotone.LongRadixHeap: 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.DaryTreeAddressableHeap
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.RankPairingHeap: 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.

J

join(int, int) - Method in class org.jheaps.array.BinaryArrayWeakHeap: Join two weak heaps into one.
joinWithComparator(int, int) - Method in class org.jheaps.array.BinaryArrayWeakHeap: Join two weak heaps into one.

L

lastDeletedKey - Variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.LongRadixAddressableHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.DoubleRadixHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.IntegerRadixHeap: Last deleted key.
lastDeletedKey - Variable in class org.jheaps.monotone.LongRadixHeap: Last deleted key.
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

MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayAddressableHeap: The maximum heap capacity.
MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayAddressableHeap: The maximum heap capacity.
MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: The maximum heap capacity.
MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayHeap: The maximum heap capacity.
MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayWeakHeap: The maximum heap capacity.
MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayHeap: The maximum heap capacity.
MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: The maximum heap capacity.
maxKey - Variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.LongRadixAddressableHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.DoubleRadixHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.IntegerRadixHeap: Maximum key allowed
maxKey - Variable in class org.jheaps.monotone.LongRadixHeap: Maximum key allowed
meld(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.dag.HollowHeap: Meld a heap into the current heap.
meld(MergeableAddressableHeap<K, V>) - Method in interface org.jheaps.MergeableAddressableHeap: 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(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(MergeableAddressableHeap<K, V>) - Method in class org.jheaps.tree.RankPairingHeap: 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
meld(MergeableDoubleEndedAddressableHeap<K, V>) - Method in interface org.jheaps.MergeableDoubleEndedAddressableHeap: 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(MergeableHeap<K>) - Method in interface org.jheaps.MergeableHeap: Meld a heap into the current heap.
meld(MergeableHeap<K>) - Method in class org.jheaps.tree.BinaryTreeSoftHeap: Meld a heap into the current heap.
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.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayAddressableHeap: The minimum heap capacity.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayAddressableHeap: The minimum heap capacity.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: The minimum heap capacity.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayHeap: The minimum heap capacity.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayWeakHeap: The minimum heap capacity.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.DaryArrayHeap: The minimum heap capacity.
MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: The minimum heap capacity.
minCapacity - Variable in class org.jheaps.array.BinaryArrayAddressableHeap: Minimum capacity due to initially requested capacity.
minCapacity - Variable in class org.jheaps.array.DaryArrayAddressableHeap: Minimum capacity due to initially requested capacity.
minCapacity - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Minimum capacity due to initially requested capacity.
minCapacity - Variable in class org.jheaps.array.BinaryArrayHeap: Minimum capacity due to initially requested capacity.
minCapacity - Variable in class org.jheaps.array.BinaryArrayWeakHeap: Minimum capacity due to initially requested capacity.
minCapacity - Variable in class org.jheaps.array.DaryArrayHeap: Minimum capacity due to initially requested capacity.
minCapacity - Variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Minimum capacity due to initially requested capacity.
minKey - Variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.LongRadixAddressableHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.DoubleRadixHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.IntegerRadixHeap: Minimum key allowed
minKey - Variable in class org.jheaps.monotone.LongRadixHeap: Minimum key allowed
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.
msd(Double, Double) - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(Double, Double) - Method in class org.jheaps.monotone.DoubleRadixHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(Integer, Integer) - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(Integer, Integer) - Method in class org.jheaps.monotone.IntegerRadixHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(Long, Long) - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(Long, Long) - Method in class org.jheaps.monotone.LongRadixHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(BigInteger, BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
msd(BigInteger, BigInteger) - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.

N

NAME - Static variable in class org.jheaps.Constants: Library name
NO_INDEX - Static variable in class org.jheaps.array.BinaryArrayAddressableHeap: Denotes that a handle is not in the array
NO_INDEX - Static variable in class org.jheaps.array.DaryArrayAddressableHeap: Denotes that a handle is not in the array
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.dag - package org.jheaps.dag: Heaps using an explicit "pointer-based" dag 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
other - Variable in class org.jheaps.tree.FibonacciHeap: Used to reference the current heap or some other heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them.
other - Variable in class org.jheaps.tree.SimpleFibonacciHeap: Used to reference the current heap or some other heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them.
other - Variable in class org.jheaps.tree.SkewHeap: Used to reference the current heap or some other heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them.

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

RankPairingHeap<K,V> - Class in org.jheaps.tree: Rank-Pairing heaps.
RankPairingHeap() - Constructor for class org.jheaps.tree.RankPairingHeap: Constructs a new, empty heap, using the natural ordering of its keys.
RankPairingHeap(Comparator<? super K>) - Constructor for class org.jheaps.tree.RankPairingHeap: Constructs a new, empty heap, ordered according to the given comparator.
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.
reverse - Variable in class org.jheaps.array.BinaryArrayWeakHeap: Reverse bits
root - Variable in class org.jheaps.tree.SkewHeap: Root node of the heap

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 - Variable in class org.jheaps.array.BinaryArrayAddressableHeap: Number of elements in the heap.
size - Variable in class org.jheaps.array.DaryArrayAddressableHeap: Number of elements in the heap.
size - Variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap: Number of elements in the heap.
size - Variable in class org.jheaps.array.BinaryArrayHeap: Number of elements in the heap.
size - Variable in class org.jheaps.array.BinaryArrayWeakHeap: Number of elements in the heap.
size - Variable in class org.jheaps.array.DaryArrayHeap: Number of elements in the heap.
size - Variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Number of elements in the heap.
size - Variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Number of elements
size - Variable in class org.jheaps.monotone.DoubleRadixAddressableHeap: Number of elements
size - Variable in class org.jheaps.monotone.IntegerRadixAddressableHeap: Number of elements
size - Variable in class org.jheaps.monotone.LongRadixAddressableHeap: Number of elements
size - Variable in class org.jheaps.monotone.BigIntegerRadixHeap: Number of elements
size - Variable in class org.jheaps.monotone.DoubleRadixHeap: Number of elements
size - Variable in class org.jheaps.monotone.IntegerRadixHeap: Number of elements
size - Variable in class org.jheaps.monotone.LongRadixHeap: Number of elements
size - Variable in class org.jheaps.tree.SkewHeap: Size of the heap
size() - Method in interface org.jheaps.AddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.array.BinaryArrayAddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.array.DaryArrayAddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.array.BinaryArrayHeap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.array.BinaryArrayWeakHeap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.array.DaryArrayHeap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap: Returns the number of elements in this 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 class org.jheaps.dag.HollowHeap: Returns the number of elements in the heap.
size() - Method in interface org.jheaps.Heap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.monotone.BigIntegerRadixAddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.monotone.DoubleRadixAddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.monotone.IntegerRadixAddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.monotone.LongRadixAddressableHeap: Returns the number of elements in the heap.
size() - Method in class org.jheaps.monotone.BigIntegerRadixHeap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.monotone.DoubleRadixHeap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.monotone.IntegerRadixHeap: Returns the number of elements in this heap.
size() - Method in class org.jheaps.monotone.LongRadixHeap: 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.DaryTreeAddressableHeap
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.RankPairingHeap: 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.
swapChildren(SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.LeftistHeap: Swap the children of a node.

U

union(SkewHeap.Node<K, V>, SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.LeftistHeap: Top-down union two skew heaps
union(SkewHeap.Node<K, V>, SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.SkewHeap: Top-down union of two skew heaps.
unionWithComparator(SkewHeap.Node<K, V>, SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.LeftistHeap: Top-down union of two leftist heaps with comparator.
unionWithComparator(SkewHeap.Node<K, V>, SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.SkewHeap: Top-down union of two skew heaps with comparator.
unlinkAndUnionChildren(SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.SkewHeap: Unlink the two children of a node and union them forming a new tree.
unlinkRightChild(SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.SkewHeap: Unlink the right child of a node.

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 E F G H I J L M N O P R S U V
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form