A B C D E F G H I K L N P R S T V

D

DoubleKeyMap<E> - Interface in inf.util
This is a Map that maps doubles (keys) to Objects (values).
DoubleKeyMap.DoubleKeyEntry<E> - Interface in inf.util
A node in the Map.
DoubleKeyTreeMap<E> - Class in inf.util
This is a Red-Black-Tree-based implementation of a SortedMap, mapping doubles (keys) to Objects (values).
DoubleKeyTreeMap() - Constructor for class inf.util.DoubleKeyTreeMap
This constructor creates a new, empty DoubleKeyTreeMap.
DoubleKeyTreeMap(Map<? extends Double, ? extends E>) - Constructor for class inf.util.DoubleKeyTreeMap
This constructor creates a new DoubleKeyTreeMap that contains all the associations from the given map.
DoubleKeyTreeMap.DoubleKeyTreeEntry<E> - Class in inf.util
 
DoubleKeyTreeMap.DoubleKeyTreeEntry(double, E, DoubleKeyTreeMap.DoubleKeyTreeEntry<E>) - Constructor for class inf.util.DoubleKeyTreeMap.DoubleKeyTreeEntry
Make a new cell with given key, value, and parent, and with null child links, and BLACK colour.
DoubleKeyTreeMap.DoubleKeyTreeMapIterator<T> - Class in inf.util
 
DoubleKeyTreeMap.DoubleKeyTreeMapIterator() - Constructor for class inf.util.DoubleKeyTreeMap.DoubleKeyTreeMapIterator
 
DoublePriorityQueue<E> - Interface in inf.util
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.

A B C D E F G H I K L N P R S T V