Uses of Package
inf.util

Classes in inf.util used by inf.util
ArrayOfHashedListsIntPriorityQueue
           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
           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.
DoubleKeyMap
           This is a Map that maps doubles (keys) to Objects (values).
DoubleKeyMap.DoubleKeyEntry
           A node in the Map.
DoubleKeyTreeMap
           This is a Red-Black-Tree-based implementation of a SortedMap, mapping doubles (keys) to Objects (values).
DoubleKeyTreeMap.DoubleKeyTreeEntry
           
DoublePriorityQueue
           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.
HashedList
           This class is a linked list implementation of the List interface.
IntKeyMap
           This is a Map that maps ints (keys) to Objects (values).
IntKeyMap.IntKeyEntry
           A node in the Map.
IntKeyTreeMap
           This is a Red-Black-Tree-based implementation of a SortedMap, mapping ints (keys) to Objects (values).
IntKeyTreeMap.IntKeyTreeEntry
           
IntPriorityQueue
           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.
Pair
           This class represents a typed, ordered pair of two Objects.
PriorityQueue
           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
           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
           
SingletonSet
           This class represents a Set that contains either zero or one element of the type T.
TreeOfListsDoublePriorityQueue
           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.