All Classes and Interfaces

Class	Description
ArrayFiller	Utility class for filling integer arrays with consecutive integers.
ArrayLengthEnforcer	Utility class for checking and enforcing that an array has a length equal to a target length.
ArrayMinimumLengthEnforcer	Utility class for checking and enforcing that the length of an array is at least some target minimum length.
BinaryHeap<E>	An implementation of a Binary Heap.
BinaryHeapDouble<E>	An implementation of a Binary Heap.
Copyable<T>	A simple interface for objects that can be copied.
DisjointIntegerSetForest	Disjoint sets of integers from [0, n) implemented with a disjoint set forest.
DisjointSetForest<T>	Represents disjoint sets of objects with a disjoint set forest.
DoubleArray	An object of this class wraps an array of primitive doubles in such a way as to provide some ArrayList-like operations for a primitive array (e.g., using it as a partially-filled array).
DoubleList	This class is an implementation of a partially-filled array of primitive double values.
DoublePriorityQueueNode<E>	Encapsulate an (element, priority) pair for use by the various priority queue classes of the library.
FibonacciHeap<E>	An implementation of a Fibonacci Heap.
FibonacciHeapDouble<E>	An implementation of a Fibonacci Heap.
IntBinaryHeap	An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values also of type int.
IntBinaryHeapDouble	An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.
IntegerArray	An object of this class wraps an array of primitive ints in such a way as to provide some ArrayList-like operations for a primitive array (e.g., using it as a partially-filled array).
IntegerList	This class is an implementation of a partially-filled array of primitive int values.
IntegerPriorityQueueNode<E>	Encapsulate an (element, priority) pair for use by the various priority queue classes of the library.
IntFibonacciHeap	An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type int.
IntFibonacciHeapDouble	An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.
IntPriorityQueue	Interface common to the classes that provide implementations of a priority queue of (element, priority) pairs, such that the elements are int values in the interval [0, n), and priorities are also ints.
IntPriorityQueueDouble	Interface common to the classes that provide implementations of a priority queue of (element, priority) pairs, such that the elements are int values in the interval [0, n), and priorities are doubles.
MergeablePriorityQueue<E,T>	A MergeablePriorityQueue is a PriorityQueue that includes a merge method.
MergeablePriorityQueueDouble<E,T>	A MergeablePriorityQueueDouble is a PriorityQueueDouble that includes a merge method.
PriorityQueue<E>	Interface common to the classes that provide implementations of a priority queue with int valued priorities.
PriorityQueueDouble<E>	Interface common to the classes that provide implementations of a priority queue with double valued priorities.
SimpleBinaryHeap<E>	An implementation of a Binary Heap.
SimpleBinaryHeapDouble<E>	An implementation of a Binary Heap.
SimpleFibonacciHeap<E>	An implementation of a Fibonacci Heap.
SimpleFibonacciHeapDouble<E>	An implementation of a Fibonacci Heap.
SimpleSwapper	A utility class for performing element swaps.
SortingNetwork	Implements sorting networks for sorting small subsets of array elements.
ValidatedSwapper	A utility class for performing element swaps.