A B C D E F G H I K L M N O P Q R S T U V W X Y

D

data(int) - Method in class goldman.collection.ordered.AbstractSearchTree.TreeNode
 
data - Variable in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
data(int) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
data() - Method in class goldman.collection.ordered.digitized.AbstractTrieNode
 
data() - Method in class goldman.collection.ordered.digitized.CompressedTrie.InternalNode
 
data() - Method in class goldman.collection.ordered.digitized.TernarySearchTrie.InternalNode
 
data() - Method in class goldman.collection.ordered.digitized.Trie.LeafNode
 
data() - Method in interface goldman.collection.ordered.digitized.TrieNode
Returns the data (if any) associated with this trie node.
decreasePriority(E) - Method in class goldman.collection.priority.BinaryHeap.BinaryHeapLocator
Replaces the tracked element by element
REQUIRES: the given parameter is less than e, or that e is the parameter being passed and its value has been mutated to have a lower priority than it had previously.
decreasePriority(E) - Method in class goldman.collection.priority.LeftistHeap.Tracker
Replaces the tracked element by element
REQUIRES: the given parameter is less than e, or that e is the parameter being passed and its value has been mutated to have a lower priority than it had previously.
decreasePriority(E) - Method in class goldman.collection.priority.PairingHeap.Tracker
Replaces the tracked element by element
REQUIRES: the given parameter is less than e, or that e is the parameter being passed and its value has been mutated to have a lower priority than it had previously.
decreasePriority(E) - Method in interface goldman.collection.priority.PriorityQueueLocator
Replaces the element associated with this priority queue locator by the given lower priority element.
DEFAULT_CAPACITY - Static variable in class goldman.collection.AbstractCollection
 
DEFAULT_COMPARATOR - Static variable in class goldman.Objects
 
DEFAULT_EQUIVALENCE_TESTER - Static variable in class goldman.Objects
 
DEFAULT_HEIGHT - Static variable in class goldman.collection.ordered.SkipList
 
DEFAULT_INITIAL_CAPACITY - Static variable in class goldman.graph.AdjacencyMatrixRepresentation
 
DEFAULT_LOAD - Static variable in class goldman.collection.set.OpenAddressing
 
DEFAULT_LOAD - Static variable in class goldman.collection.set.SeparateChaining
 
DefaultBucketizer<T> - Class in goldman.collection
This class illustrates an implementation of the Bucketizer interface.
DefaultBucketizer(Collection<T>, Quantizer<? super T>) - Constructor for class goldman.collection.DefaultBucketizer
 
DefaultXYComparator<E extends XYPoint> - Class in goldman.collection.spatial
The DefaultXYComparator class provides an implementation of the XYComparator interface that simply uses the x and y coordinates.
DefaultXYComparator() - Constructor for class goldman.collection.spatial.DefaultXYComparator
 
deleteAndReplaceBy(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
Replaces T(this) by T(x)
deleteAndReplaceBy(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.RedBlackTree.RBNode
Replaces T(this) by T(x)
DELETED - Static variable in class goldman.Objects
 
dequeue() - Method in class goldman.collection.positional.Queue
Removes the element from the front of the queue.
dest() - Method in interface goldman.graph.Edge
Returns the destination (head) of this edge.
dest() - Method in class goldman.graph.SimpleEdge
 
DigitizedOrderedCollection<E> - Interface in goldman.collection.ordered.digitized
A digitized ordered collection is an untagged algorithmically positioned collection whose elements can each be viewed as a sequence of digits (e.g., bit string, character string).
Digitizer<T> - Interface in goldman.collection
The Digitizer interface provides a mechanism for any algorithm or data structure to treat each element in a collection as a sequence of digits where each digit is mapped to an integer from 0 to b-1 where b is the base of the digit.
DirectAddressing<E> - Class in goldman.collection.set
This data structure provides excellent performance, but O(|U|) space is required.
DirectAddressing(int, double, Comparator<? super E>, Hasher<? super E>) - Constructor for class goldman.collection.set.DirectAddressing
Creates a hash table with the specified capacity (plus one to handle null values), and with the given comparator and hasher
DirectAddressing(int, Comparator<? super E>) - Constructor for class goldman.collection.set.DirectAddressing
Creates a hash table with the specified capacity (plus one to handle null values), and with the given comparator and default direct addressing hasher
DirectAddressing(int) - Constructor for class goldman.collection.set.DirectAddressing
Creates a hash table with the specified capacity (plus one to handle null values), and with the default comparator and direct addressing hasher
DirectAddressing.DirectAddressingHasher<E> - Class in goldman.collection.set
The direct addressing hasher allocates slot 0 for the null element and adds one to each of the naturally computed hash codes for the elements.
DirectAddressing.DirectAddressingHasher() - Constructor for class goldman.collection.set.DirectAddressing.DirectAddressingHasher
 
DirectAddressing.Marker - Class in goldman.collection.set
 
DirectAddressingMapping<K,V> - Class in goldman.collection.tagged.set
A tagged version of a directed addressing.
DirectAddressingMapping(int) - Constructor for class goldman.collection.tagged.set.DirectAddressingMapping
 
DisconnectedGraphException - Exception in goldman.graph
The DisconnectedGraphException is thrown when a graph algorithm that should only be applied on a connected graph (e.g., a spanning tree algorithm) is applied to a graph that is composed of more than one connected component.
DisconnectedGraphException() - Constructor for exception goldman.graph.DisconnectedGraphException
 
DisconnectedGraphException(String) - Constructor for exception goldman.graph.DisconnectedGraphException
 
DoublyLinkedList<E> - Class in goldman.collection.positional
The doubly linked list is the only positional collection data structure that provides amortized constant time methods for all of the PositionalCollectionLocator methods except getCurrentPosition.
DoublyLinkedList() - Constructor for class goldman.collection.positional.DoublyLinkedList
 
DoublyLinkedList.DLListItem<E> - Class in goldman.collection.positional
 
DynamicArray<E> - Class in goldman.collection.positional
This array-based data structure provides space for a fixed number of elements, which are stored in an underlying Java primitive array.
DynamicArray(int, Comparator<? super E>) - Constructor for class goldman.collection.positional.DynamicArray
Creates a dynamic array with the given capacity that uses the provided equivalence tester
DynamicArray() - Constructor for class goldman.collection.positional.DynamicArray
Creates an underlying array a with a default initial capacity.
DynamicArray(int) - Constructor for class goldman.collection.positional.DynamicArray
Creates an underlying array a with the given capacity.
DynamicCircularArray<E> - Class in goldman.collection.positional
This array-based data structure allows element 0 of the positional collection to be in any slot of the underlying array, with the range of underlying indices wrapping around as needed, and also performs automatic resizing.
DynamicCircularArray(int, Comparator<? super E>) - Constructor for class goldman.collection.positional.DynamicCircularArray
 
DynamicCircularArray() - Constructor for class goldman.collection.positional.DynamicCircularArray
 
DynamicCircularArray(int) - Constructor for class goldman.collection.positional.DynamicCircularArray
 

A B C D E F G H I K L M N O P Q R S T U V W X Y