Package inf.util

Interface Summary

DoubleKeyMap<E>	This is a Map that maps doubles (keys) to Objects (values).
DoubleKeyMap.DoubleKeyEntry<E>	A node in the Map.
DoublePriorityQueue<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.
IntKeyMap<E>	This is a Map that maps ints (keys) to Objects (values).
IntKeyMap.IntKeyEntry<E>	A node in the Map.
IntPriorityQueue<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.
PriorityQueue<E,N extends Number>	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.

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 non-uniform distribution.
DoubleKeyTreeMap<E>	This is a Red-Black-Tree-based implementation of a SortedMap, mapping doubles (keys) to Objects (values).
DoubleKeyTreeMap.DoubleKeyTreeEntry<E>
HashedList<E>	This class is a linked list implementation of the List interface.
IntKeyTreeMap<E>	This is a Red-Black-Tree-based implementation of a SortedMap, mapping ints (keys) to Objects (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.