Class Summary 
ArrayOfHashedListsIntPriorityQueue<E> 
This class represents a priority queue, that is a queue in which elements can
be held and from which they can be retrieved by priority. 
ArrayOfListsIntPriorityQueue<E> 
This class represents a priority queue, that is a queue in which elements can
be held and from which they can be retrieved by priority. 
BiasedRandom 
This class represents a source of randomness that, unlike
java.util.Random , returns random numbers according to a
nonuniform distribution. 
DoubleKeyTreeMap<E> 
This is a RedBlackTreebased implementation of a SortedMap ,
mapping double s (keys) to Object s (values). 
DoubleKeyTreeMap.DoubleKeyTreeEntry<E> 

HashedList<E> 
This class is a linked list implementation of the List
interface. 
IntKeyTreeMap<E> 
This is a RedBlackTreebased implementation of a SortedMap ,
mapping int s (keys) to Object s (values). 
IntKeyTreeMap.IntKeyTreeEntry<E> 

Pair<C1,C2> 
This class represents a typed, ordered pair of two Objects. 
RandomAccessIntPriorityQueue<E> 
This class represents a priority queue, that is a queue in which elements can
be held and from which they can be retrieved by priority. 
RandomAccessIntPriorityQueue.RAIntKeyTreeEntry<E> 

SingletonSet<T> 
This class represents a Set that contains either zero or one element of the
type T. 
TreeOfListsDoublePriorityQueue<E> 
This class represents a priority queue, that is a queue in which elements can
be held and from which they can be retrieved by priority. 
TupleEnumerator<E> 
This class can be used to enumerate all possible tuples of a given length
n over a given domain D. 