All Classes and Interfaces

Class	Description
AbstractArrayAddressableHeap<K,V>	Abstract implementation of a heap using an array representation.
AbstractArrayHeap<K>	Abstract implementation of a heap using an array representation.
AbstractArrayWeakHeap<K>	An abstract weak heap with an array representation.
AbstractRadixAddressableHeap<K,V>	Base abstract implementation of an addressable radix heap.
AbstractRadixHeap<K>	Base abstract implementation of a radix heap.
AddressableHeap<K,V>	A heap whose elements can be addressed using handles.
AddressableHeap.Handle<K,V>	A heap element handle.
AddressableHeapFactory<K,V>	An addressable heap factory.
Beta	Marker interface to indicate that a public API may change or be removed in the future.
BigIntegerRadixAddressableHeap<V>	An addressable radix heap for BigInteger keys.
BigIntegerRadixHeap	A radix heap for BigInteger keys.
BinaryArrayAddressableHeap<K,V>	An array based binary addressable heap.
BinaryArrayBulkInsertWeakHeap<K>	An array based binary weak heap using bulk insertion.
BinaryArrayHeap<K>	An array based binary heap.
BinaryArrayIntegerValueHeap<V>	An optimized array-based binary heap with integer keys.
BinaryArrayIntegerValueHeap.Elem<V>
BinaryArrayWeakHeap<K>	An array based binary weak heap.
BinaryTreeAddressableHeap<K,V>	An explicit binary tree addressable heap.
BinaryTreeSoftAddressableHeap<K,V>	A binary tree soft addressable heap.
BinaryTreeSoftAddressableHeap.RootList<K,V>
BinaryTreeSoftAddressableHeap.RootListNode<K,V>
BinaryTreeSoftAddressableHeap.SoftHandle<K,V>
BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftHeap<K>	A binary tree soft heap.
BinaryTreeSoftHeap.RootList<K>
BinaryTreeSoftHeap.RootListNode<K>
BinaryTreeSoftHeap.SoftHandle<K>
BinaryTreeSoftHeap.TreeNode<K>
Constants	Global library configuration flags which affect generated code at compile time.
ConstantTime	Marker interface to indicate that an operation takes constant time.
CostlessMeldPairingHeap<K,V>	The costless meld variant of the pairing heaps.
CostlessMeldPairingHeap.Node<K,V>
DaryArrayAddressableHeap<K,V>	An array based d-ary addressable heap.
DaryArrayHeap<K>	An array based d-ary heap.
DaryTreeAddressableHeap<K,V>	An explicit d-ary tree addressable heap.
DoubleEndedAddressableHeap<K,V>	A double-ended heap whose elements can be addressed using handles.
DoubleEndedAddressableHeap.Handle<K,V>	A double-ended heap element handle.
DoubleEndedHeap<K>	A double-ended heap.
DoubleEndedValueHeap<K,V>	A double-ended heap with values.
DoubleRadixAddressableHeap<V>	An addressable radix heap for double keys.
DoubleRadixHeap	A radix heap for double keys.
FibonacciHeap<K,V>	Fibonacci heaps.
FibonacciHeap.Node<K,V>
Heap<K>	A heap.
HollowHeap<K,V>	Hollow heaps.
HollowHeap.HollowNode<K,V>
HollowHeap.Item<K,V>
IntegerRadixAddressableHeap<V>	An addressable radix heap for (signed) integer keys.
IntegerRadixHeap	A radix heap for (signed) integer keys.
LeftistHeap<K,V>	Leftist heaps.
LeftistHeap.LeftistNode<K,V>
LinearTime	Marker interface to indicate that an operation takes O(n) time where n is the size of the input.
LogarithmicTime	Marker interface to indicate that an operation takes O(log(n)) time where n is the size of the input.
LogLogTime	Marker interface to indicate that an operation takes O(loglog(n)) time where n is the size of the input.
LongRadixAddressableHeap<V>	An addressable radix heap for (signed) long keys.
LongRadixHeap	A radix heap for (signed) long keys.
MergeableAddressableHeap<K,V>	An addressable heap that allows melding with another addressable heap.
MergeableDoubleEndedAddressableHeap<K,V>	A double-ended addressable heap that allows melding with another double-ended addressable heap.
MergeableHeap<K>	A heap that allows melding with another heap.
MinMaxBinaryArrayDoubleEndedHeap<K>	An array based binary MinMax heap.
PairingHeap<K,V>	Pairing heaps.
PairingHeap.Node<K,V>
RankPairingHeap<K,V>	Rank-Pairing heaps.
RankPairingHeap.Node<K,V>
ReflectedFibonacciHeap<K,V>	Reflected double ended heaps based on Fibonacci heaps.
ReflectedFibonacciHeap.Factory<K,V>
ReflectedHeap<K,V>	Reflected double ended heaps.
ReflectedHeap.HandleMap<K,V>
ReflectedHeap.ReflectedHandle<K,V>
ReflectedPairingHeap<K,V>	Reflected double ended heaps based on pairing heaps.
ReflectedPairingHeap.Factory<K,V>
SimpleFibonacciHeap<K,V>	Simple Fibonacci heaps.
SimpleFibonacciHeap.Node<K,V>
SkewHeap<K,V>	Skew heaps.
SkewHeap.Node<K,V>
UnsignedUtils	Utilities for unsigned computation
ValueHeap<K,V>	A heap with values.
VisibleForTesting	Marker interface to indicate that something is visible as package-private only for testing purposes.