All Classes and Interfaces
Class
Description
Abstract implementation of a heap using an array representation.
Abstract implementation of a heap using an array representation.
An abstract weak heap with an array representation.
Base abstract implementation of an addressable radix heap.
Base abstract implementation of a radix heap.
A heap whose elements can be addressed using handles.
A heap element handle.
An addressable heap factory.
Marker interface to indicate that a public API may change or be removed in
the future.
An addressable radix heap for
BigInteger
keys.A radix heap for
BigInteger
keys.An array based binary addressable heap.
An array based binary weak heap using bulk insertion.
An array based binary heap.
An optimized array-based binary heap with integer keys.
An array based binary weak heap.
An explicit binary tree addressable heap.
A binary tree soft addressable heap.
A binary tree soft heap.
Global library configuration flags which affect generated code at compile
time.
Marker interface to indicate that an operation takes constant time.
The costless meld variant of the pairing heaps.
An array based d-ary addressable heap.
An array based d-ary heap.
An explicit d-ary tree addressable heap.
A double-ended heap whose elements can be addressed using handles.
A double-ended heap element handle.
A double-ended heap.
A double-ended heap with values.
An addressable radix heap for double keys.
A radix heap for double keys.
Fibonacci heaps.
A heap.
Hollow heaps.
An addressable radix heap for (signed) integer keys.
A radix heap for (signed) integer keys.
Leftist heaps.
Marker interface to indicate that an operation takes O(n) time where n is the
size of the input.
Marker interface to indicate that an operation takes O(log(n)) time where n
is the size of the input.
Marker interface to indicate that an operation takes O(loglog(n)) time where
n is the size of the input.
An addressable radix heap for (signed) long keys.
A radix heap for (signed) long keys.
An addressable heap that allows melding with another addressable heap.
A double-ended addressable heap that allows melding with another double-ended
addressable heap.
A heap that allows melding with another heap.
An array based binary MinMax heap.
Pairing heaps.
Rank-Pairing heaps.
Reflected double ended heaps based on Fibonacci heaps.
Reflected double ended heaps.
Reflected double ended heaps based on pairing heaps.
Simple Fibonacci heaps.
Skew heaps.
Utilities for unsigned computation
A heap with values.
Marker interface to indicate that something is visible as package-private
only for testing purposes.