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

A

A - Static variable in class goldman.collection.set.OpenAddressing
 
A - Static variable in class goldman.collection.set.SeparateChaining
 
AbstractCollection<E> - Class in goldman.collection
The AbstractCollection class implements methods that can be shared by all data structures that implement a collection.
AbstractCollection(Comparator<? super E>) - Constructor for class goldman.collection.AbstractCollection
 
AbstractCollection.AbstractLocator<T extends E> - Class in goldman.collection
 
AbstractCollection.AbstractLocator() - Constructor for class goldman.collection.AbstractCollection.AbstractLocator
 
AbstractCollection.VisitingIterator - Class in goldman.collection
 
AbstractCollection.VisitingIterator() - Constructor for class goldman.collection.AbstractCollection.VisitingIterator
 
AbstractGraph<V,E extends Edge<V>> - Class in goldman.graph
The AbstractGraph class embodies algorithms that perform computations on a graph in terms of the Graph interface.
AbstractGraph(GraphRepresentation<V, E>, boolean) - Constructor for class goldman.graph.AbstractGraph
It creates an abstract graph with the given specification.
AbstractPositionalCollection<E> - Class in goldman.collection.positional
The AbstractPositionalCollection provides a basis for defining concrete positional collections by defining a useful set of methods that can be implemented for any positional collection in terms of the public methods from the PositionalCollection interface.
AbstractPositionalCollection() - Constructor for class goldman.collection.positional.AbstractPositionalCollection
 
AbstractPositionalCollection(Comparator<? super E>) - Constructor for class goldman.collection.positional.AbstractPositionalCollection
 
AbstractSearchTree<E> - Class in goldman.collection.ordered
The AbstractSearchTree class is an abstract class that includes the methods that are shared by all search trees.
AbstractSearchTree() - Constructor for class goldman.collection.ordered.AbstractSearchTree
 
AbstractSearchTree(Comparator<? super E>) - Constructor for class goldman.collection.ordered.AbstractSearchTree
 
AbstractSearchTree.TreeNode - Class in goldman.collection.ordered
 
AbstractSearchTree.TreeNode() - Constructor for class goldman.collection.ordered.AbstractSearchTree.TreeNode
 
AbstractTrieLeafNode<E> - Class in goldman.collection.ordered.digitized
The AbstractTrieLeafNode class implements methods that can be shared by all implementations of a trie leaf node.
AbstractTrieLeafNode() - Constructor for class goldman.collection.ordered.digitized.AbstractTrieLeafNode
 
AbstractTrieNode<E> - Class in goldman.collection.ordered.digitized
The AbstractTrieNode class implements methods that can be shared by all implementations of a trie node.
AbstractTrieNode() - Constructor for class goldman.collection.ordered.digitized.AbstractTrieNode
 
AbstractWeightedGraph<V,E extends WeightedEdge<V>> - Class in goldman.graph
The AbstractWeightedGraph class embodies algorithms that perform computations on a weighted graph in terms of the WeightedGraph interface.
AbstractWeightedGraph(GraphRepresentation<V, E>, boolean) - Constructor for class goldman.graph.AbstractWeightedGraph
 
AbstractWeightedGraph.FlowGraph - Class in goldman.graph
 
accept(Visitor<? super E>) - Method in class goldman.collection.AbstractCollection
Traverses the entire collection on behalf of a visitor.
accept(Visitor<? super E>) - Method in interface goldman.collection.Collection
Traverses each element of this collection, in the iteration order, on behalf of the visitor.
accept(Visitor<TaggedElement<T, Collection<E>>>) - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Traverses each element of this collection, in the iteration order, on behalf of the visitor.
accept(Visitor<TaggedElement<T, Collection<E>>>) - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
Traverses the entire collection on behalf of a visitor.
accept(Visitor<? super TaggedElement<T, E>>) - Method in interface goldman.collection.tagged.TaggedCollection
Traverses each tagged element of this collection, in the iteration order, on behalf of the visitor.
accept(Visitor<? super TaggedElement<T, E>>) - Method in class goldman.collection.tagged.TaggedCollectionWrapper
Traverses the entire collection on behalf of a visitor.
add(E) - Method in interface goldman.collection.Collection
Inserts value into the collection in an arbitrary location.
add(E) - Method in class goldman.collection.ordered.AbstractSearchTree
Inserts element into the collection.
add(E) - Method in class goldman.collection.ordered.digitized.Trie
Inserts element into the collection.
add(E) - Method in class goldman.collection.ordered.SkipList
Inserts element into the collection.
add(E) - Method in class goldman.collection.ordered.SortedArray
Inserts it into the collection.
add(int, E) - Method in class goldman.collection.ordered.SortedArray
 
add(E) - Method in class goldman.collection.ordered.SplayTree
Inserts element into the ordered collection and then uses splay to bring the new element to the root of the tree.
add(int, E) - Method in class goldman.collection.positional.Array
Inserts value at position p and increments the position number for the elements that were at positions p, ..., size-1.
add(E) - Method in class goldman.collection.positional.Array
Inserts it at the end of the collection.
add(int, E) - Method in interface goldman.collection.positional.PositionalCollection
Inserts value into position p.
add(int, E) - Method in class goldman.collection.positional.SinglyLinkedList
Inserts value at position p and increments the position number for the elements that were at positions p to size-1.
add(E) - Method in class goldman.collection.positional.SinglyLinkedList
Inserts it at the end of the positional collection.
add(E) - Method in class goldman.collection.priority.BinaryHeap
 
add(E) - Method in class goldman.collection.priority.LeftistHeap
 
add(E) - Method in class goldman.collection.priority.PairingHeap
Adds it to the heap
add(E) - Method in class goldman.collection.set.DirectAddressing
If an equivalent element x is in the set, then element replaces x
add(E) - Method in class goldman.collection.set.OpenAddressing
 
add(E) - Method in class goldman.collection.set.SeparateChaining
 
add(E) - Method in class goldman.collection.spatial.KDTree
 
addAfter(TrieLeafNode<E>) - Method in class goldman.collection.ordered.digitized.AbstractTrieLeafNode
 
addAfter(TrieLeafNode<E>) - Method in interface goldman.collection.ordered.digitized.TrieLeafNode
The TrieLeafNode interface must be supported by any class defining objects to be used as leaf nodes in a trie.
addAfter(E) - Method in class goldman.collection.positional.Array.Marker
Adds value to the collection after the marker location
addAfter(E) - Method in interface goldman.collection.positional.PositionalCollectionLocator
Inserts value immediately after the object referenced by this locator and returns a fresh locator at the position of insertion.
addAfter(E) - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
Adds the new element after the tracked element
addAfter(E) - Method in class goldman.collection.positional.TrackedArray.Tracker
Adds to the collection after the tracker location If the tracker is between positions p-1, and p then the new element is inserted at position p.
addAll(Collection<? extends E>) - Method in class goldman.collection.AbstractCollection
Adds all elements in c to the collection.
addAll(Collection<? extends E>) - Method in interface goldman.collection.Collection
Adds all elements in c to this collection.
addAll(Collection<? extends E>) - Method in class goldman.collection.ordered.SkipList
Iterates through c and adds each element in c to the collection
addAll(Collection<? extends E>) - Method in class goldman.collection.ordered.SortedArray
Adds all elements in c to the collection.
addAll(Collection<? extends E>) - Method in class goldman.collection.priority.BinaryHeap
 
addEdge(E) - Method in class goldman.graph.AbstractGraph
 
addEdge(E) - Method in class goldman.graph.AdjacencyListRepresentation
 
addEdge(int, int, E) - Method in class goldman.graph.AdjacencyMatrixRepresentation
 
addEdge(E) - Method in class goldman.graph.AdjacencyMatrixRepresentation
 
addEdge(E) - Method in interface goldman.graph.Graph
Adds the given edge to this graph.
addEdge(E) - Method in interface goldman.graph.GraphRepresentation
Adds the given edge to this graph.
addFirst(E) - Method in class goldman.collection.positional.AbstractPositionalCollection
Inserts it at the front (position 0) of the collection
addFirst(E) - Method in class goldman.collection.positional.Buffer
 
addFirst(E) - Method in interface goldman.collection.positional.PositionalCollection
Inserts value at the front (position 0) of this collection.
addImpl(int, Object) - Method in class goldman.collection.positional.DynamicArray
Inserts object value at position p and increments the position number for the elements that were at positions p, ..., size-1.
addImpl(int, Object) - Method in class goldman.collection.positional.DynamicCircularArray
 
addImpl(int, Object) - Method in class goldman.collection.positional.TrackedArray
Inserts element at position p, incrementing the position for the elements that were at positions p to size-1
addItemLast(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
addLast(E) - Method in class goldman.collection.positional.AbstractPositionalCollection
Inserts it at the end (position size) of the collection
addLast(E) - Method in class goldman.collection.positional.Buffer
 
addLast(E) - Method in interface goldman.collection.positional.PositionalCollection
Inserts value at the end of this collection (position size).
addNewNode(TrieNode<E>, Trie<E>.SearchData) - Method in class goldman.collection.ordered.digitized.CompactTrie
 
addNewNode(TrieNode<E>, Trie<E>.SearchData) - Method in class goldman.collection.ordered.digitized.CompressedTrie
 
addNewNode(TrieNode<E>, Trie<E>.SearchData) - Method in class goldman.collection.ordered.digitized.PatriciaTrie
 
addNewNode(TrieNode<E>, Trie<E>.SearchData) - Method in class goldman.collection.ordered.digitized.Trie
Modifies the trie (excluding the ordered leaf chain) to include newNode
addTracked(E) - Method in class goldman.collection.ordered.BinarySearchTree
Inserts element into the collection.
addTracked(E) - Method in class goldman.collection.ordered.digitized.Trie
Inserts element into the collection.
addTracked(E) - Method in class goldman.collection.ordered.SkipList
Inserts element into the collection.
addTracked(E) - Method in class goldman.collection.ordered.SplayTree
Inserts element into the collection.
addTracked(E) - Method in class goldman.collection.positional.SinglyLinkedList
Inserts value into the collection at an arbitrary position.
addTracked(E) - Method in class goldman.collection.positional.TrackedArray
Inserts value it at the end of the collection.
addTracked(int, E) - Method in class goldman.collection.positional.TrackedArray
Inserts the new element at position p and increments the position number for the elements that were at positions p, ..., size-1.
addTracked(E) - Method in class goldman.collection.priority.BinaryHeap
 
addTracked(E) - Method in class goldman.collection.priority.LeftistHeap
 
addTracked(E) - Method in class goldman.collection.priority.PairingHeap
 
addTracked(E) - Method in class goldman.collection.spatial.KDTree
 
addTracked(E) - Method in interface goldman.collection.Tracked
Inserts o into the collection in an arbitrary location and returns a tracker to the inserted element.
addVertex(V) - Method in class goldman.graph.AbstractGraph
 
addVertex(V) - Method in class goldman.graph.AdjacencyListRepresentation
It adds the given vertex unless it is already in the graph
addVertex(V) - Method in class goldman.graph.AdjacencyMatrixRepresentation
It adds the given vertex unless it is already in the graph
addVertex(V) - Method in interface goldman.graph.Graph
Adds the given vertex to this graph.
addVertex(V) - Method in interface goldman.graph.GraphRepresentation
Adds the given vertex to this graph unless it is already in the graph.
AdjacencyList<V,E extends Edge<V>> - Class in goldman.graph
The AdjacencyList class provides an implementation for the adjacency list representation of a graph.
AdjacencyList(boolean, boolean, boolean) - Constructor for class goldman.graph.AdjacencyList
 
AdjacencyList() - Constructor for class goldman.graph.AdjacencyList
 
AdjacencyListRepresentation<V,E extends Edge<V>> - Class in goldman.graph
The AdjacencyListRepresentation class implements the adjacency list representation of a graph.
AdjacencyListRepresentation(boolean, boolean) - Constructor for class goldman.graph.AdjacencyListRepresentation
Observe that no parameter is needed to indicate whether the graph allows multi-edges, since the underlying representation of an adjacency list is not affected by this choice.
AdjacencyMatrix<V,E extends Edge<V>> - Class in goldman.graph
The AdjacencyMatrix class provides an implementation for the adjacency matrix representation of a graph.
AdjacencyMatrix(boolean, boolean) - Constructor for class goldman.graph.AdjacencyMatrix
 
AdjacencyMatrix() - Constructor for class goldman.graph.AdjacencyMatrix
 
AdjacencyMatrixRepresentation<V,E extends Edge<V>> - Class in goldman.graph
The AdjacencyMatrixRepresentation class implements the adjacency matrix representation of a graph.
AdjacencyMatrixRepresentation(boolean) - Constructor for class goldman.graph.AdjacencyMatrixRepresentation
 
advance() - Method in class goldman.collection.AbstractCollection.VisitingIterator
 
advance() - Method in interface goldman.collection.Locator
Advances to the next element in the collection (if there is one) and returns true.
advance() - Method in class goldman.collection.ordered.BinarySearchTree.Tracker
Moves the tracker to the next element in the iteration order, or AFT if the last element is currently tracked
advance() - Method in class goldman.collection.ordered.BTree.Marker
Moves the tracker to the next element in the iteration order, or {\texttt AFT} if the last element is currently tracked.
advance() - Method in class goldman.collection.ordered.digitized.Trie.Tracker
Moves this tracker to the next element in the iteration order (or {\texttt AFT} if the tracker is currently at the last element).
advance() - Method in class goldman.collection.ordered.SkipList.Tracker
Moves the tracker to the next element in the iteration order (or tail if the last element is currently tracked).
advance() - Method in class goldman.collection.positional.Array.BasicMarker
Moves the locator forward by one position
advance() - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
Moves the tracker to the next location
advance() - Method in class goldman.collection.positional.TrackedArray.Tracker
Moves the tracker to the next position
advance() - Method in class goldman.collection.priority.BinaryHeap.BinaryHeapLocator
Moves the locator to the next element in the iteration order (or {\texttt AFT} if it is currently at the last element).
advance() - Method in class goldman.collection.priority.LeftistHeap.Tracker
 
advance() - Method in class goldman.collection.priority.PairingHeap.Tracker
Moves the tracker to the next element in the iteration order (or {\texttt AFT} if the last element is currently tracked).
advance() - Method in class goldman.collection.set.DirectAddressing.Marker
Moves the marker to the next slot in use
advance() - Method in class goldman.collection.set.SeparateChaining.Marker
 
allocate() - Method in class goldman.Pool
Returns an available object from the pool, or creates one if the pool is empty.
allowsMultiEdges() - Method in class goldman.graph.AbstractGraph
 
allowsMultiEdges() - Method in interface goldman.graph.Graph
Returns true if and only if this graph allows multi-edges.
allPairsShortestPaths() - Method in class goldman.graph.AbstractWeightedGraph
 
allPairsShortestPaths() - Method in interface goldman.graph.WeightedGraph
Uses the Floyd-Warshall all-pairs shortest path algorithm to compute and return a shortest path matrix.
AlternatingComparator<E> - Class in goldman.collection.spatial
The alternating comparator manages the various comparators used by the k-d tree.
AlternatingComparator(Comparator<? super E>...) - Constructor for class goldman.collection.spatial.AlternatingComparator
 
anchor - Variable in class goldman.collection.tagged.spatial.TaggedSpatialCollectionWrapper
Since a target region is specified by two corners (each a d-dimensional point), we use a second mutable tagged element anchor to specify the second corner of a bounding box in an orthogonal range query where target specifies the other corner.
Array<E> - Class in goldman.collection.positional
The simplest of the positional collections, Array provides space for a fixed number of elements, which are stored in an underlying Java primitive array.
Array(int, Comparator<? super E>) - Constructor for class goldman.collection.positional.Array
Creates an array with the given capacity that uses the provided equivalence tester
Array() - Constructor for class goldman.collection.positional.Array
Creates an array with a default initial capacity that uses the default equivalence tester.
Array(int) - Constructor for class goldman.collection.positional.Array
Creates an array with the given capacity that uses the default equivalence tester
Array.BasicMarker - Class in goldman.collection.positional
 
Array.BasicMarker(int) - Constructor for class goldman.collection.positional.Array.BasicMarker
 
Array.Marker - Class in goldman.collection.positional
 
Array.Marker(int) - Constructor for class goldman.collection.positional.Array.Marker
 
AtBoundaryException - Exception in goldman.collection
An AtBoundaryException is thrown when advance is called from a locator at AFT or retreat is called from a locator at FORE.
AtBoundaryException() - Constructor for exception goldman.collection.AtBoundaryException
 
AtBoundaryException(String) - Constructor for exception goldman.collection.AtBoundaryException
 
AtCapacityException - Exception in goldman.collection
An AtCapacityException is thrown when there is an attempt to insert a new element into a non-elastic collection that is already at its maximum capacity.
AtCapacityException() - Constructor for exception goldman.collection.AtCapacityException
 
AtCapacityException(int) - Constructor for exception goldman.collection.AtCapacityException
 
atLeaf() - Method in class goldman.collection.ordered.digitized.PatriciaTrie.PatriciaSearchData
 
atLeaf() - Method in class goldman.collection.ordered.digitized.Trie.SearchData
 
atRoot() - Method in class goldman.collection.ordered.digitized.PatriciaTrie.PatriciaSearchData
 
atRoot() - Method in class goldman.collection.ordered.digitized.Trie.SearchData
 

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