Index
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form
A
- AbstractArrayAddressableHeap<K,
V> - Class in org.jheaps.array -
Abstract implementation of a heap using an array representation.
- AbstractArrayAddressableHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.AbstractArrayAddressableHeap
- AbstractArrayAddressableHeap.ArrayHandle - Class in org.jheaps.array
- AbstractArrayHeap<K> - Class in org.jheaps.array
-
Abstract implementation of a heap using an array representation.
- AbstractArrayHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.AbstractArrayHeap
-
Construct a new heap
- AbstractArrayWeakHeap<K> - Class in org.jheaps.array
-
An abstract weak heap with an array representation.
- AbstractArrayWeakHeap(Comparator<? super K>, int) - Constructor for class org.jheaps.array.AbstractArrayWeakHeap
-
Constructor
- AbstractRadixAddressableHeap<K,
V> - Class in org.jheaps.monotone -
Base abstract implementation of an addressable radix heap.
- AbstractRadixAddressableHeap() - Constructor for class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Constructor
- AbstractRadixAddressableHeap.Node - Class in org.jheaps.monotone
-
List Node
- AbstractRadixHeap<K> - Class in org.jheaps.monotone
-
Base abstract implementation of a radix heap.
- AbstractRadixHeap() - Constructor for class org.jheaps.monotone.AbstractRadixHeap
-
Constructor
- addPool(CostlessMeldPairingHeap.Node<K, V>, boolean) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Append to decrease pool.
- 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.
- addToRootList(FibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.FibonacciHeap
- 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.AbstractArrayAddressableHeap
-
The array use for representing the tree.
- array - Variable in class org.jheaps.array.AbstractArrayWeakHeap
-
The array used for representing the heap.
- array - Variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
The array used for representing the heap.
- ArrayHandle(K, V) - Constructor for class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- aux - Variable in class org.jheaps.dag.HollowHeap
-
Auxiliary array for performing links.
- aux - Variable in class org.jheaps.tree.DaryTreeAddressableHeap
-
Auxiliary for swapping children.
- aux - Variable in class org.jheaps.tree.FibonacciHeap
-
Auxiliary array for consolidation
- aux - Variable in class org.jheaps.tree.RankPairingHeap
-
Auxiliary array for consolidation.
- aux - Variable in class org.jheaps.tree.SimpleFibonacciHeap
-
Auxiliary array for consolidation
- AUX_BUCKET_ARRAY_SIZE - Static variable in class org.jheaps.dag.HollowHeap
-
Size of bucket array.
- AUX_BUCKET_ARRAY_SIZE - Static variable in class org.jheaps.tree.RankPairingHeap
-
Size of bucket array.
- AUX_CONSOLIDATE_ARRAY_SIZE - Static variable in class org.jheaps.tree.FibonacciHeap
-
Size of consolidation auxiliary array.
- AUX_CONSOLIDATE_ARRAY_SIZE - Static variable in class org.jheaps.tree.SimpleFibonacciHeap
-
Size of consolidation auxiliary array.
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.
- BinaryArrayIntegerValueHeap.Elem<V> - Class in org.jheaps.array
- 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.
- BinaryTreeAddressableHeap.Node - Class in org.jheaps.tree
- 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.
- BinaryTreeSoftAddressableHeap.RootList<K,
V> - Class in org.jheaps.tree - BinaryTreeSoftAddressableHeap.RootListNode<K,
V> - Class in org.jheaps.tree - BinaryTreeSoftAddressableHeap.SoftHandle<K,
V> - Class in org.jheaps.tree - BinaryTreeSoftAddressableHeap.TreeNode<K,
V> - Class in org.jheaps.tree - 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.
- BinaryTreeSoftHeap.RootList<K> - Class in org.jheaps.tree
- BinaryTreeSoftHeap.RootListNode<K> - Class in org.jheaps.tree
- BinaryTreeSoftHeap.SoftHandle<K> - Class in org.jheaps.tree
- BinaryTreeSoftHeap.TreeNode<K> - Class in org.jheaps.tree
- bucket - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- buckets - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
The buckets as lists.
- buckets - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
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
- cascadingCut(FibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.FibonacciHeap
- cascadingRankChange(SimpleFibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.SimpleFibonacciHeap
- cHead - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- cHead - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- checkCapacity(int) - Method in class org.jheaps.array.AbstractArrayAddressableHeap
- checkCapacity(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
Check that a capacity is valid.
- checkCapacity(int) - Method in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
Check that a capacity is valid.
- checkInvalid() - Method in class org.jheaps.dag.HollowHeap.Item
- child - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- child - Variable in class org.jheaps.tree.FibonacciHeap.Node
- child - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- children - Variable in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- cKey - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- cKey - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- clear() - Method in interface org.jheaps.AddressableHeap
-
Clear all the elements of the heap.
- clear() - Method in class org.jheaps.array.AbstractArrayAddressableHeap
-
Clear all the elements of the heap.
- clear() - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
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.AbstractRadixAddressableHeap
-
Clear all the elements of the heap.
- clear() - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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.
- combine(BinaryTreeSoftAddressableHeap.TreeNode<K, V>, BinaryTreeSoftAddressableHeap.TreeNode<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Combine two trees into a new tree.
- combine(BinaryTreeSoftHeap.TreeNode<K>, BinaryTreeSoftHeap.TreeNode<K>) - Method in class org.jheaps.tree.BinaryTreeSoftHeap
-
Combine two trees into a new tree.
- combine(CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Two pass pair and compute root.
- combine(PairingHeap.Node<K, V>) - Method in class org.jheaps.tree.PairingHeap
- comparableDecreaseKey(SimpleFibonacciHeap.Node<K, V>, K) - Method in class org.jheaps.tree.SimpleFibonacciHeap
- comparableDeleteMin() - Method in class org.jheaps.tree.SimpleFibonacciHeap
- comparator - Variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
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.AbstractArrayWeakHeap
-
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.dag.HollowHeap
-
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.BinaryTreeAddressableHeap
-
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.BinaryTreeSoftAddressableHeap
-
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.BinaryTreeSoftHeap
-
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.CostlessMeldPairingHeap
-
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.DaryTreeAddressableHeap
-
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.FibonacciHeap
-
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.PairingHeap
-
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.RankPairingHeap
-
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.ReflectedHeap
-
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.SimpleFibonacciHeap
-
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.AbstractArrayAddressableHeap
-
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.AbstractArrayWeakHeap
-
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.AbstractRadixAddressableHeap
-
Always returns
null
since this heap uses the natural ordering of its keys. - comparator() - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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. - comparatorDecreaseKey(SimpleFibonacciHeap.Node<K, V>, K) - Method in class org.jheaps.tree.SimpleFibonacciHeap
- comparatorDeleteMin() - Method in class org.jheaps.tree.SimpleFibonacciHeap
- 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.
- compare(K, K) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Compares its two arguments for order.
- compare(K, K) - Method in class org.jheaps.monotone.AbstractRadixHeap
-
Compares its two arguments for order.
- computeBucket(K, K) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Compute the bucket of a key based on a minimum key.
- computeBucket(K, K) - Method in class org.jheaps.monotone.AbstractRadixHeap
-
Compute the bucket of a key based on a minimum key.
- consolidate() - Method in class org.jheaps.tree.CostlessMeldPairingHeap
- consolidate() - Method in class org.jheaps.tree.FibonacciHeap
- Constants - Class in org.jheaps
-
Global library configuration flags which affect generated code at compile time.
- Constants() - Constructor for class org.jheaps.Constants
- 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.
- CostlessMeldPairingHeap.Node<K,
V> - Class in org.jheaps.tree - 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.
- cSize - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- cSize - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- cTail - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- cTail - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- currentMin - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
The current minimum value (cached)
- currentMin - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
The current minimum value (cached)
- currentMinBucket - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
The current minimum value bucket (cached)
- currentMinPos - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
The current minimum value position in bucket (cached)
- cut(FibonacciHeap.Node<K, V>, FibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.FibonacciHeap
- cut(RankPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.RankPairingHeap
- cut(SimpleFibonacciHeap.Node<K, V>, SimpleFibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.SimpleFibonacciHeap
- cutChildren(CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Cut the children of a node and return the list.
- cutChildren(PairingHeap.Node<K, V>) - Method in class org.jheaps.tree.PairingHeap
-
Cut the children of a node and return the list.
- cutFromParent(CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Cut a node from its parent.
- cutOldestChild(CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Cut the oldest child of a node.
D
- d - Variable in class org.jheaps.array.DaryArrayAddressableHeap
-
Degree
- d - Variable in class org.jheaps.array.DaryArrayHeap
-
Degree
- d - Variable in class org.jheaps.tree.DaryTreeAddressableHeap
-
Branching factor.
- D_ARY_HEAPS_MUST_HAVE_AT_LEAST_2_CHILDREN_PER_NODE - Static variable in class org.jheaps.array.DaryArrayAddressableHeap
- 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.
- DaryTreeAddressableHeap.Node - Class in org.jheaps.tree
- 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.
- decreaseKey(K) - Method in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- decreaseKey(K) - Method in class org.jheaps.dag.HollowHeap.Item
- decreaseKey(K) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- decreaseKey(K) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- decreaseKey(K) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.CostlessMeldPairingHeap.Node
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- decreaseKey(K) - Method in class org.jheaps.tree.FibonacciHeap.Node
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.PairingHeap.Node
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.RankPairingHeap.Node
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.SimpleFibonacciHeap.Node
-
Decrease the key of the element.
- decreaseKey(K) - Method in class org.jheaps.tree.SkewHeap.Node
- decreaseKey(HollowHeap.Item<K, V>, K) - Method in class org.jheaps.dag.HollowHeap
-
Decrease the key of an item.
- decreaseKey(CostlessMeldPairingHeap.Node<K, V>, K) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
- decreaseKey(FibonacciHeap.Node<K, V>, K) - Method in class org.jheaps.tree.FibonacciHeap
- decreaseKey(PairingHeap.Node<K, V>, K) - Method in class org.jheaps.tree.PairingHeap
-
Decrease the key of a node.
- decreaseKey(RankPairingHeap.Node<K, V>, K) - Method in class org.jheaps.tree.RankPairingHeap
-
Decrease the key of a node.
- decreaseKey(ReflectedHeap.ReflectedHandle<K, V>, K) - Method in class org.jheaps.tree.ReflectedHeap
-
Decrease the key of an element.
- decreaseKey(SkewHeap.Node<K, V>, K) - Method in class org.jheaps.tree.SkewHeap
- decreaseKeyWithComparator(FibonacciHeap.Node<K, V>, K) - Method in class org.jheaps.tree.FibonacciHeap
- decreasePool - Variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
The decrease pool
- decreasePoolComparator - Variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
Comparator for nodes in the decrease pool.
- decreasePoolMinPos - Variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
Index of node with minimum key in the decrease pool.
- decreasePoolSize - Variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
How many elements are valid in the decrease pool
- DEFAULT_DECREASE_POOL_SIZE - Static variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
Maximum length of decrease pool for long type.
- 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.
- degree - Variable in class org.jheaps.tree.FibonacciHeap.Node
- delete() - Method in interface org.jheaps.AddressableHeap.Handle
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- delete() - Method in class org.jheaps.dag.HollowHeap.Item
- delete() - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- delete() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- delete() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.CostlessMeldPairingHeap.Node
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- delete() - Method in class org.jheaps.tree.FibonacciHeap.Node
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.PairingHeap.Node
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.RankPairingHeap.Node
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.SimpleFibonacciHeap.Node
-
Delete the element from the heap that it belongs.
- delete() - Method in class org.jheaps.tree.SkewHeap.Node
- delete(HollowHeap.Item<K, V>) - Method in class org.jheaps.dag.HollowHeap
-
Delete an item
- delete(BinaryTreeSoftAddressableHeap.RootListNode<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Delete a node from the root list.
- delete(BinaryTreeSoftAddressableHeap.SoftHandle<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Delete an element.
- delete(CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Delete a node.
- delete(PairingHeap.Node<K, V>) - Method in class org.jheaps.tree.PairingHeap
- delete(ReflectedHeap.ReflectedHandle<K, V>) - Method in class org.jheaps.tree.ReflectedHeap
-
Delete an element
- 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.AbstractArrayAddressableHeap
-
Delete and return an element with the minimum key.
- deleteMin() - Method in class org.jheaps.array.AbstractArrayHeap
-
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.AbstractRadixAddressableHeap
-
Delete and return an element with the minimum key.
- deleteMin() - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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.
- doRankedLinks(HollowHeap.HollowNode<K, V>) - Method in class org.jheaps.dag.HollowHeap
- 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).
- doUnrankedLinks(int) - Method in class org.jheaps.dag.HollowHeap
- DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
Limit for the heap capacity when down-sizing.
- DOWNSIZING_MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.AbstractArrayWeakHeap
-
Limit for the heap capacity when down-sizing.
E
- Elem(Integer, V) - Constructor for class org.jheaps.array.BinaryArrayIntegerValueHeap.Elem
- EMPTY - Static variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Denotes that a key does not belong to a bucket
- EMPTY - Static variable in class org.jheaps.monotone.AbstractRadixHeap
-
Denotes that a key does not belong to a bucket
- ensureCapacity(int) - Method in class org.jheaps.array.AbstractArrayAddressableHeap
- ensureCapacity(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
Make sure the array representation can hold a certain number of elements.
- 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.BinaryArrayIntegerValueHeap
-
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
- Factory() - Constructor for class org.jheaps.tree.ReflectedFibonacciHeap.Factory
- Factory() - Constructor for class org.jheaps.tree.ReflectedPairingHeap.Factory
- 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.
- FibonacciHeap.Node<K,
V> - Class in org.jheaps.tree - findAndCacheMinimum(int) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Helper method for finding and caching the minimum.
- findAndCacheMinimum(int) - Method in class org.jheaps.monotone.AbstractRadixHeap
-
Helper method for finding and caching the minimum.
- 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.AbstractArrayAddressableHeap
-
Find an element with the minimum key.
- findMin() - Method in class org.jheaps.array.AbstractArrayHeap
-
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.AbstractRadixAddressableHeap
-
Find an element with the minimum key.
- findMin() - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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.
- findNode(long) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
-
Start at the root and traverse the tree in order to find a particular node based on its numbering on a level-order traversal of the tree.
- findParentNode(long) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap
- fixdown(int) - Method in class org.jheaps.array.AbstractArrayAddressableHeap
- fixdown(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
Downwards fix starting from a particular element
- 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.
- fixdown(BinaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap
- fixdown(DaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
- fixdownMax(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Downwards fix starting from a particular element at a maximum level.
- fixdownMaxWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Downwards fix starting from a particular element at a maximum level.
- fixdownMin(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Downwards fix starting from a particular element at a minimum level.
- fixdownMinWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Downwards fix starting from a particular element at a minimum level.
- fixdownWithComparator(int) - Method in class org.jheaps.array.AbstractArrayAddressableHeap
- fixdownWithComparator(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
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.AbstractArrayAddressableHeap
- fixup(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
Upwards 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
- fixup(BinaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap
- fixup(DaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
- fixupMax(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Upwards fix starting from a particular element at a maximum level
- fixupMaxWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Upwards fix starting from a particular element at a maximum level.
- fixupMin(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Upwards fix starting from a particular element at a minimum level
- fixupMinWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Upwards fix starting from a particular element at a minimum level.
- fixupWithComparator(int) - Method in class org.jheaps.array.AbstractArrayAddressableHeap
- fixupWithComparator(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
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
- forceDecreaseKeyToMinimum(FibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.FibonacciHeap
- forceDecreaseKeyToMinimum(RankPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.RankPairingHeap
- forceDecreaseKeyToMinimum(SimpleFibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.SimpleFibonacciHeap
- forceFixup(int) - Method in class org.jheaps.array.AbstractArrayAddressableHeap
- forceFixup(int) - Method in class org.jheaps.array.BinaryArrayAddressableHeap
- forceFixup(int) - Method in class org.jheaps.array.DaryArrayAddressableHeap
- free - Variable in class org.jheaps.tree.ReflectedHeap
-
A free element in case the size is odd
G
- get(Comparator<? super K>) - Method in interface org.jheaps.AddressableHeapFactory
-
Get a new heap.
- get(Comparator<? super K>) - Method in class org.jheaps.tree.ReflectedFibonacciHeap.Factory
- get(Comparator<? super K>) - Method in class org.jheaps.tree.ReflectedPairingHeap.Factory
- getKey() - Method in interface org.jheaps.AddressableHeap.Handle
-
Return the key of the element.
- getKey() - Method in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- getKey() - Method in class org.jheaps.dag.HollowHeap.Item
- getKey() - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- getKey() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- getKey() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.CostlessMeldPairingHeap.Node
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- getKey() - Method in class org.jheaps.tree.FibonacciHeap.Node
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.PairingHeap.Node
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.RankPairingHeap.Node
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.SimpleFibonacciHeap.Node
-
Return the key of the element.
- getKey() - Method in class org.jheaps.tree.SkewHeap.Node
- getOwner() - Method in class org.jheaps.dag.HollowHeap.HollowNode
- getOwner() - Method in class org.jheaps.dag.HollowHeap.Item
- getOwner() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- getOwner() - Method in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- getOwner() - Method in class org.jheaps.tree.FibonacciHeap.Node
- getOwner() - Method in class org.jheaps.tree.PairingHeap.Node
- getOwner() - Method in class org.jheaps.tree.RankPairingHeap.Node
- getOwner() - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- getOwner() - Method in class org.jheaps.tree.SimpleFibonacciHeap.Node
- getOwner() - Method in class org.jheaps.tree.SkewHeap.Node
- getParent(BinaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap
- 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.
- getValue() - Method in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- getValue() - Method in class org.jheaps.dag.HollowHeap.Item
- getValue() - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- getValue() - Method in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- getValue() - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.CostlessMeldPairingHeap.Node
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- getValue() - Method in class org.jheaps.tree.FibonacciHeap.Node
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.PairingHeap.Node
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.RankPairingHeap.Node
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.SimpleFibonacciHeap.Node
-
Return the value of the element.
- getValue() - Method in class org.jheaps.tree.SkewHeap.Node
H
- HandleMap(ReflectedHeap.ReflectedHandle<K, V>, AddressableHeap.Handle<K, ReflectedHeap.HandleMap<K, V>>) - Constructor for class org.jheaps.tree.ReflectedHeap.HandleMap
- 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.
- head - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootList
- head - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootList
- heap - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- heap - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- heap - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- heap - Variable in class org.jheaps.tree.FibonacciHeap.Node
- heap - Variable in class org.jheaps.tree.PairingHeap.Node
- heap - Variable in class org.jheaps.tree.RankPairingHeap.Node
- heap - Variable in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- heap - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- heap - Variable in class org.jheaps.tree.SkewHeap.Node
- 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.
- HollowHeap.HollowNode<K,
V> - Class in org.jheaps.dag - HollowHeap.Item<K,
V> - Class in org.jheaps.dag - HollowNode(HollowHeap<K, V>, K) - Constructor for class org.jheaps.dag.HollowHeap.HollowNode
I
- increaseKey(K) - Method in interface org.jheaps.DoubleEndedAddressableHeap.Handle
-
Increase the key of the element.
- increaseKey(K) - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
-
Increase the key of the element.
- increaseKey(ReflectedHeap.ReflectedHandle<K, V>, K) - Method in class org.jheaps.tree.ReflectedHeap
-
Increase the key of an element.
- index - Variable in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- INF_KEY - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
Infimum
- initCapacity(int) - Method in class org.jheaps.array.AbstractArrayHeap
-
Initialize the array representation
- initCapacity(int) - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
Initialize array representation.
- initCapacity(int) - Method in class org.jheaps.array.BinaryArrayWeakHeap
- inner - Variable in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- 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.AbstractArrayAddressableHeap
-
Insert a new element into the heap with a null value.
- insert(K) - Method in class org.jheaps.array.AbstractArrayHeap
-
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(K) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Insert a new element into the heap with a null value.
- insert(K) - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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.AbstractArrayAddressableHeap
-
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(K, V) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
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
- insertPair(ReflectedHeap.ReflectedHandle<K, V>, ReflectedHeap.ReflectedHandle<K, V>) - Method in class org.jheaps.tree.ReflectedHeap
-
Insert a pair of elements, one in the min heap and one in the max 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).
- 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.AbstractArrayAddressableHeap
-
Returns
true
if this heap is empty. - isEmpty() - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
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.AbstractRadixAddressableHeap
-
Returns
true
if this heap is empty. - isEmpty() - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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. - item - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- Item(K, V) - Constructor for class org.jheaps.dag.HollowHeap.Item
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.
K
- key - Variable in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- key - Variable in class org.jheaps.array.BinaryArrayIntegerValueHeap.Elem
- key - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- key - Variable in class org.jheaps.dag.HollowHeap.Item
- key - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- key - Variable in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- key - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- key - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.SoftHandle
- key - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- key - Variable in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- key - Variable in class org.jheaps.tree.FibonacciHeap.Node
- key - Variable in class org.jheaps.tree.PairingHeap.Node
- key - Variable in class org.jheaps.tree.RankPairingHeap.Node
- key - Variable in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- key - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- key - Variable in class org.jheaps.tree.SkewHeap.Node
L
- l - Variable in class org.jheaps.tree.RankPairingHeap.Node
- lastDeletedKey - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Last deleted key.
- lastDeletedKey - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
Last deleted key.
- left - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- left - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- 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.
- LeftistHeap.LeftistNode<K,
V> - Class in org.jheaps.tree - LeftistNode(LeftistHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.LeftistHeap.LeftistNode
- less(RankPairingHeap.Node<K, V>, RankPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.RankPairingHeap
- 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.
- link(HollowHeap.HollowNode<K, V>, HollowHeap.HollowNode<K, V>) - Method in class org.jheaps.dag.HollowHeap
- link(CostlessMeldPairingHeap.Node<K, V>, CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
- link(FibonacciHeap.Node<K, V>, FibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.FibonacciHeap
- link(PairingHeap.Node<K, V>, PairingHeap.Node<K, V>) - Method in class org.jheaps.tree.PairingHeap
- link(RankPairingHeap.Node<K, V>, RankPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.RankPairingHeap
- link(SimpleFibonacciHeap.Node<K, V>, SimpleFibonacciHeap.Node<K, V>) - Method in class org.jheaps.tree.SimpleFibonacciHeap
- linkInPlace(CostlessMeldPairingHeap.Node<K, V>, CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
-
Put an orphan node into the position of another node.
- linkWithComparator(CostlessMeldPairingHeap.Node<K, V>, CostlessMeldPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.CostlessMeldPairingHeap
- linkWithComparator(PairingHeap.Node<K, V>, PairingHeap.Node<K, V>) - Method in class org.jheaps.tree.PairingHeap
- log2(long) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
-
Calculate the floor of the binary logarithm of n.
- log2d - Variable in class org.jheaps.tree.DaryTreeAddressableHeap
-
Base 2 logarithm of branching factor.
- 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
- mark - Variable in class org.jheaps.tree.FibonacciHeap.Node
- mark - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
The maximum heap capacity.
- MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.AbstractArrayWeakHeap
-
The maximum heap capacity.
- MAX_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
The maximum heap capacity.
- maxChildOrGrandchild(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Given a node at a maximum level, find its child or grandchild with the maximum key.
- maxChildOrGrandchildWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Given a node at a maximum level, find its child or grandchild with the maximum key.
- maxHeap - Variable in class org.jheaps.tree.ReflectedHeap
-
A maximum heap
- maxKey - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Maximum key allowed
- maxKey - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
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.
- mergeInto(BinaryTreeSoftAddressableHeap.RootListNode<K, V>, BinaryTreeSoftAddressableHeap.RootListNode<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Merge a list into the root list.
- mergeInto(BinaryTreeSoftHeap.RootListNode<K>, BinaryTreeSoftHeap.RootListNode<K>) - Method in class org.jheaps.tree.BinaryTreeSoftHeap
-
Merge a list into the root list.
- MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
The minimum heap capacity.
- MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.AbstractArrayWeakHeap
-
The minimum heap capacity.
- MIN_HEAP_CAPACITY - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
The minimum heap capacity.
- minCapacity - Variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
Minimum capacity due to initially requested capacity.
- minCapacity - Variable in class org.jheaps.array.AbstractArrayWeakHeap
-
Minimum capacity due to initially requested capacity.
- minCapacity - Variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
Minimum capacity due to initially requested capacity.
- minChildOrGrandchild(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Given a node at a minimum level, find its child or grandchild with the minimum key.
- minChildOrGrandchildWithComparator(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Given a node at a minimum level, find its child or grandchild with the minimum key.
- minHeap - Variable in class org.jheaps.tree.ReflectedHeap
-
A minimum heap
- minKey - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Minimum key allowed
- minKey - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
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.
- minNotMax - Variable in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- minRoot - Variable in class org.jheaps.tree.FibonacciHeap
-
The root with the minimum key
- minRoot - Variable in class org.jheaps.tree.RankPairingHeap
-
The last node in the root list
- 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.
- msd(K, K) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Compute the most significant digit which is different in the binary representation of two values, or -1 if numbers are equal.
- msd(K, K) - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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
- next - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- next - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- next - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
- next - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- next - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootListNode
- next - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.SoftHandle
- next - Variable in class org.jheaps.tree.FibonacciHeap.Node
- next - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- NO_INDEX - Static variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
Denotes that a handle is not in the array
- NO_INDEX - Static variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- node - Variable in class org.jheaps.dag.HollowHeap.Item
- Node(K, V) - Constructor for class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- Node(K, V) - Constructor for class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- Node(K, V, int) - Constructor for class org.jheaps.tree.DaryTreeAddressableHeap.Node
- Node(CostlessMeldPairingHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.CostlessMeldPairingHeap.Node
- Node(FibonacciHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.FibonacciHeap.Node
- Node(PairingHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.PairingHeap.Node
- Node(RankPairingHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.RankPairingHeap.Node
- Node(SimpleFibonacciHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.SimpleFibonacciHeap.Node
- Node(SkewHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.SkewHeap.Node
- nodes - Variable in class org.jheaps.dag.HollowHeap
-
Number of nodes (hollow or not).
- NOT_BENCHMARK - Static variable in class org.jheaps.Constants
-
Global benchmarking flag.
- npl - Variable in class org.jheaps.tree.LeftistHeap.LeftistNode
O
- o_c - Variable in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- o_c - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- o_c - Variable in class org.jheaps.tree.PairingHeap.Node
- o_c - Variable in class org.jheaps.tree.SkewHeap.Node
- o_s - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- o_s - Variable in class org.jheaps.tree.PairingHeap.Node
- onMinLevel(int) - Method in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
-
Return true if on a minimum level, false otherwise.
- 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.dag.HollowHeap
-
Used to reference the current heap or some other pairing 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.BinaryTreeSoftAddressableHeap
-
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.CostlessMeldPairingHeap
-
Used to reference the current heap or some other pairing 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.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.PairingHeap
-
Used to reference the current heap or some other pairing 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.RankPairingHeap
-
Used to reference the current heap or some other pairing 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.ReflectedHeap
-
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.
- otherInner - Variable in class org.jheaps.tree.ReflectedHeap.HandleMap
- outer - Variable in class org.jheaps.tree.ReflectedHeap.HandleMap
P
- p - Variable in class org.jheaps.tree.RankPairingHeap.Node
- 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.
- PairingHeap.Node<K,
V> - Class in org.jheaps.tree - parent - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- parent - Variable in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- parent - Variable in class org.jheaps.tree.FibonacciHeap.Node
- parent - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- poolIndex - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- prev - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- prev - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
- prev - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- prev - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootListNode
- prev - Variable in class org.jheaps.tree.FibonacciHeap.Node
- prev - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
R
- r - Variable in class org.jheaps.tree.RankPairingHeap.Node
- rank - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- rank - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- rank - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- rank - Variable in class org.jheaps.tree.RankPairingHeap.Node
- rank - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- rankLimit - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Tree nodes with less or equal than this rank will have no corrupted keys.
- rankLimit - Variable in class org.jheaps.tree.BinaryTreeSoftHeap
-
Tree nodes with less or equal than this rank will have no corrupted keys.
- 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.
- RankPairingHeap.Node<K,
V> - Class in org.jheaps.tree - 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.
- ReflectedFibonacciHeap.Factory<K,
V> - Class in org.jheaps.tree - ReflectedHandle(ReflectedHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- 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.
- ReflectedHeap.HandleMap<K,
V> - Class in org.jheaps.tree - ReflectedHeap.ReflectedHandle<K,
V> - Class in org.jheaps.tree - 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.
- ReflectedPairingHeap.Factory<K,
V> - Class in org.jheaps.tree - restoreType1Ranks(RankPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.RankPairingHeap
- reverse - Variable in class org.jheaps.array.BinaryArrayWeakHeap
-
Reverse bits
- right - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- right - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- root - Variable in class org.jheaps.dag.HollowHeap
-
The last node in the root list
- root - Variable in class org.jheaps.tree.BinaryTreeAddressableHeap
-
Root node of the heap
- root - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
- root - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootListNode
- root - Variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
The root of the pairing heap
- root - Variable in class org.jheaps.tree.DaryTreeAddressableHeap
-
Root node of the heap
- root - Variable in class org.jheaps.tree.PairingHeap
-
The root of the pairing heap
- root - Variable in class org.jheaps.tree.SimpleFibonacciHeap
-
The root
- root - Variable in class org.jheaps.tree.SkewHeap
-
Root node of the heap
- rootList - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
The root list, in non-decreasing rank order.
- rootList - Variable in class org.jheaps.tree.BinaryTreeSoftHeap
-
The root list, in non-decreasing rank order.
- RootList() - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootList
- RootList() - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap.RootList
- RootListNode(BinaryTreeSoftAddressableHeap.TreeNode<K, V>) - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
- RootListNode(BinaryTreeSoftHeap.TreeNode<K>) - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap.RootListNode
- roots - Variable in class org.jheaps.tree.FibonacciHeap
-
Number of roots in the root list
S
- serialVersionUID - Static variable in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- serialVersionUID - Static variable in class org.jheaps.array.AbstractArrayAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.array.AbstractArrayHeap
- serialVersionUID - Static variable in class org.jheaps.array.AbstractArrayWeakHeap
- serialVersionUID - Static variable in class org.jheaps.array.BinaryArrayAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.array.BinaryArrayBulkInsertWeakHeap
- serialVersionUID - Static variable in class org.jheaps.array.BinaryArrayHeap
- serialVersionUID - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap.Elem
- serialVersionUID - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
- serialVersionUID - Static variable in class org.jheaps.array.BinaryArrayWeakHeap
- serialVersionUID - Static variable in class org.jheaps.array.DaryArrayAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.array.DaryArrayHeap
- serialVersionUID - Static variable in class org.jheaps.array.MinMaxBinaryArrayDoubleEndedHeap
- serialVersionUID - Static variable in class org.jheaps.dag.HollowHeap.HollowNode
- serialVersionUID - Static variable in class org.jheaps.dag.HollowHeap.Item
- serialVersionUID - Static variable in class org.jheaps.dag.HollowHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- serialVersionUID - Static variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.AbstractRadixHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.BigIntegerRadixAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.BigIntegerRadixHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.DoubleRadixAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.DoubleRadixHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.IntegerRadixAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.IntegerRadixHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.LongRadixAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.monotone.LongRadixHeap
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootList
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootList
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootListNode
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftHeap
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftHeap.SoftHandle
- serialVersionUID - Static variable in class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- serialVersionUID - Static variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.CostlessMeldPairingHeap
- serialVersionUID - Static variable in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.DaryTreeAddressableHeap
- serialVersionUID - Static variable in class org.jheaps.tree.FibonacciHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.FibonacciHeap
- serialVersionUID - Static variable in class org.jheaps.tree.LeftistHeap.LeftistNode
- serialVersionUID - Static variable in class org.jheaps.tree.LeftistHeap
- serialVersionUID - Static variable in class org.jheaps.tree.PairingHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.PairingHeap
- serialVersionUID - Static variable in class org.jheaps.tree.RankPairingHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.RankPairingHeap
- serialVersionUID - Static variable in class org.jheaps.tree.ReflectedFibonacciHeap
- serialVersionUID - Static variable in class org.jheaps.tree.ReflectedHeap.HandleMap
- serialVersionUID - Static variable in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- serialVersionUID - Static variable in class org.jheaps.tree.ReflectedHeap
- serialVersionUID - Static variable in class org.jheaps.tree.ReflectedPairingHeap
- serialVersionUID - Static variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.SimpleFibonacciHeap
- serialVersionUID - Static variable in class org.jheaps.tree.SkewHeap.Node
- serialVersionUID - Static variable in class org.jheaps.tree.SkewHeap
- setValue(V) - Method in interface org.jheaps.AddressableHeap.Handle
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- setValue(V) - Method in class org.jheaps.dag.HollowHeap.Item
- setValue(V) - Method in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- setValue(V) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- setValue(V) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.CostlessMeldPairingHeap.Node
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- setValue(V) - Method in class org.jheaps.tree.FibonacciHeap.Node
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.PairingHeap.Node
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.RankPairingHeap.Node
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.SimpleFibonacciHeap.Node
-
Set the value of the element.
- setValue(V) - Method in class org.jheaps.tree.SkewHeap.Node
- severSpine(RankPairingHeap.Node<K, V>) - Method in class org.jheaps.tree.RankPairingHeap
- sift(BinaryTreeSoftAddressableHeap.TreeNode<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Sift elements from children nodes until the current node has enough elements in its list.
- sift(BinaryTreeSoftHeap.TreeNode<K>) - Method in class org.jheaps.tree.BinaryTreeSoftHeap
-
Sift elements from children nodes until the current node has enough elements in its list.
- 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.
- SimpleFibonacciHeap.Node<K,
V> - Class in org.jheaps.tree - size - Variable in class org.jheaps.array.AbstractArrayAddressableHeap
-
Number of elements in the heap.
- size - Variable in class org.jheaps.array.AbstractArrayWeakHeap
-
Number of elements in the heap.
- size - Variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
Number of elements in the heap.
- size - Variable in class org.jheaps.dag.HollowHeap
-
Size of the heap
- size - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap
-
Number of elements
- size - Variable in class org.jheaps.monotone.AbstractRadixHeap
-
Number of elements
- size - Variable in class org.jheaps.tree.BinaryTreeAddressableHeap
-
Size of the heap
- size - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Size of the heap.
- size - Variable in class org.jheaps.tree.BinaryTreeSoftHeap
-
Size of the heap.
- size - Variable in class org.jheaps.tree.CostlessMeldPairingHeap
-
Size of the pairing heap
- size - Variable in class org.jheaps.tree.DaryTreeAddressableHeap
-
Size of the heap
- size - Variable in class org.jheaps.tree.FibonacciHeap
-
Size of the heap
- size - Variable in class org.jheaps.tree.PairingHeap
-
Size of the pairing heap
- size - Variable in class org.jheaps.tree.RankPairingHeap
-
Size of the pairing heap
- size - Variable in class org.jheaps.tree.ReflectedHeap
-
Size of the heap
- size - Variable in class org.jheaps.tree.SimpleFibonacciHeap
-
Size of the heap
- 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.AbstractArrayAddressableHeap
-
Returns the number of elements in the heap.
- size() - Method in class org.jheaps.array.AbstractArrayWeakHeap
-
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.AbstractRadixAddressableHeap
-
Returns the number of elements in the heap.
- size() - Method in class org.jheaps.monotone.AbstractRadixHeap
-
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.
- SkewHeap.Node<K,
V> - Class in org.jheaps.tree - SoftHandle(K) - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap.SoftHandle
- SoftHandle(BinaryTreeSoftAddressableHeap<K, V>, K, V) - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- sp - Variable in class org.jheaps.dag.HollowHeap.HollowNode
- suffixMin - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
- suffixMin - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootListNode
- SUP_KEY - Static variable in class org.jheaps.array.BinaryArrayIntegerValueHeap
-
Supremum
- swap(BinaryTreeAddressableHeap.Node, BinaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap
- swap(BinaryTreeAddressableHeap.Node, BinaryTreeAddressableHeap.Node, BinaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.BinaryTreeAddressableHeap
- swap(DaryTreeAddressableHeap.Node, DaryTreeAddressableHeap.Node) - Method in class org.jheaps.tree.DaryTreeAddressableHeap
-
Swap two nodes
- swapChildren(SkewHeap.Node<K, V>) - Method in class org.jheaps.tree.LeftistHeap
-
Swap the children of a node.
T
- tail - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootList
- tail - Variable in class org.jheaps.tree.BinaryTreeSoftHeap.RootList
- TARGET_SIZE - Static variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Already computed values for target sizes.
- TARGET_SIZE - Static variable in class org.jheaps.tree.BinaryTreeSoftHeap
-
Already computed values for target sizes.
- targetSize(int) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Compute the target size for a particular rank.
- targetSize(int) - Method in class org.jheaps.tree.BinaryTreeSoftHeap
-
Compute the target size for a particular rank.
- tree - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- TreeNode() - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- TreeNode() - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
- TreeNode(BinaryTreeSoftAddressableHeap.SoftHandle<K, V>) - Constructor for class org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
- TreeNode(BinaryTreeSoftHeap.SoftHandle<K>) - Constructor for class org.jheaps.tree.BinaryTreeSoftHeap.TreeNode
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.
- UNSIGNED_MASK - Static variable in class org.jheaps.monotone.UnsignedUtils
- unsignedLongToBigInt(long) - Static method in class org.jheaps.monotone.UnsignedUtils
- unsignedLongToDouble(long) - Static method in class org.jheaps.monotone.UnsignedUtils
- UnsignedUtils - Class in org.jheaps.monotone
-
Utilities for unsigned computation
- UnsignedUtils() - Constructor for class org.jheaps.monotone.UnsignedUtils
- updateSuffixMin(BinaryTreeSoftAddressableHeap.RootListNode<K, V>) - Method in class org.jheaps.tree.BinaryTreeSoftAddressableHeap
-
Update all suffix minimum pointers for a node and all its predecessors in the root list.
- updateSuffixMin(BinaryTreeSoftHeap.RootListNode<K>) - Method in class org.jheaps.tree.BinaryTreeSoftHeap
-
Update all suffix minimum pointers for a node and all its predecessors in the root list.
V
- value - Variable in class org.jheaps.array.AbstractArrayAddressableHeap.ArrayHandle
- value - Variable in class org.jheaps.array.BinaryArrayIntegerValueHeap.Elem
- value - Variable in class org.jheaps.dag.HollowHeap.Item
- value - Variable in class org.jheaps.monotone.AbstractRadixAddressableHeap.Node
- value - Variable in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- value - Variable in class org.jheaps.tree.BinaryTreeSoftAddressableHeap.SoftHandle
- value - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- value - Variable in class org.jheaps.tree.DaryTreeAddressableHeap.Node
- value - Variable in class org.jheaps.tree.FibonacciHeap.Node
- value - Variable in class org.jheaps.tree.PairingHeap.Node
- value - Variable in class org.jheaps.tree.RankPairingHeap.Node
- value - Variable in class org.jheaps.tree.ReflectedHeap.ReflectedHandle
- value - Variable in class org.jheaps.tree.SimpleFibonacciHeap.Node
- value - Variable in class org.jheaps.tree.SkewHeap.Node
- 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.
Y
- y_s - Variable in class org.jheaps.tree.BinaryTreeAddressableHeap.Node
- y_s - Variable in class org.jheaps.tree.CostlessMeldPairingHeap.Node
- y_s - Variable in class org.jheaps.tree.PairingHeap.Node
- y_s - Variable in class org.jheaps.tree.SkewHeap.Node
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form