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

C

cancel() - Method in class goldman.collection.AbstractCollection.VisitingIterator
Aborts iteration to terminate the visiting iterator thread when iteration to completion is not required.
capacity() - Method in class goldman.collection.ordered.AbstractSearchTree.TreeNode
 
capacity() - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
check(int) - Method in class goldman.collection.Version
 
checkRep() - Method in class goldman.collection.AbstractCollection
Checks, for the purposes of checking correctness, that the correctness properties are preserved.
checkRep() - Method in interface goldman.collection.Collection
 
checkRep() - Method in class goldman.collection.ordered.RedBlackTree
This method is used for testing the invariants.
checkRep() - Method in class goldman.collection.spatial.KDTree
 
checkRep() - Method in class goldman.collection.spatial.QuadTree
 
checkValidity() - Method in class goldman.collection.AbstractCollection.AbstractLocator
Compares the version number held by the locator with the current version number of the data structure object.
child(int) - Method in class goldman.collection.ordered.AbstractSearchTree.TreeNode
 
child(int) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
child(int) - Method in class goldman.collection.ordered.digitized.AbstractTrieNode
 
child(int) - Method in class goldman.collection.ordered.digitized.PatriciaTrie.Node
 
child(int) - Method in class goldman.collection.ordered.digitized.Trie.InternalNode
 
child(int) - Method in interface goldman.collection.ordered.digitized.TrieNode
Returns a reference to the ith child.
child(int) - Method in interface goldman.collection.ordered.TreeNode
Returns the ith child of this node.
childIndex(E, int) - Method in class goldman.collection.ordered.digitized.PatriciaTrie.Node
 
childIndex(E, int) - Method in class goldman.collection.ordered.digitized.TernarySearchTrie.InternalNode
 
childIndex(E, int) - Method in class goldman.collection.ordered.digitized.Trie.InternalNode
 
childIndex(E) - Method in class goldman.collection.ordered.digitized.Trie.SearchData
 
CircularArray<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.
CircularArray(int, Comparator<? super E>) - Constructor for class goldman.collection.positional.CircularArray
Creates a circular array with the given capacity that uses the provided equivalence tester
CircularArray() - Constructor for class goldman.collection.positional.CircularArray
Creates a circular array with a default initial capacity that uses the default equivalence tester.
CircularArray(int) - Constructor for class goldman.collection.positional.CircularArray
Creates a circular array with the given capacity that uses the default equivalence tester
clear() - Method in class goldman.collection.AbstractCollection
Removes all items from the collection.
clear() - Method in interface goldman.collection.Collection
Removes all elements from this collection.
clear() - Method in class goldman.collection.ordered.BinarySearchTree
Removes all elements from the collection
clear() - Method in class goldman.collection.ordered.BPlusTree
Removes all elements from the collection
clear() - Method in class goldman.collection.ordered.BTree
Removes all elements from the collection
clear() - Method in class goldman.collection.positional.Array
Removes all elements from the collection.
clear() - Method in class goldman.collection.positional.Buffer
Removes all elements from the buffer.
clear() - Method in class goldman.collection.positional.Queue
Removes all elements from the queue.
clear() - Method in class goldman.collection.positional.SinglyLinkedList
Removes all elements from the collection.
clear() - Method in class goldman.collection.positional.Stack
Removes all elements from the stack.
clear() - Method in class goldman.collection.positional.TrackedArray
Removes all elements from the collection.
clear() - Method in class goldman.collection.priority.BinaryHeap
Removes all elements from the collection
clear() - Method in class goldman.collection.priority.LeftistHeap
Removes all elements from the collection
clear() - Method in class goldman.collection.set.DirectAddressing
Removes all elements from the collection.
clear() - Method in class goldman.collection.set.OpenAddressing
Removes all elements from the collection.
clear() - Method in class goldman.collection.set.SeparateChaining
Removes all elements from the collection.
clear() - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Removes all tagged elements from this tagged bucket collection.
clear() - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
Removes all elements from this collection.
clear() - Method in interface goldman.collection.tagged.TaggedCollection
Removes all tagged elements from this collection.
clear() - Method in class goldman.collection.tagged.TaggedCollectionWrapper
Removes all elements from this collection.
clearNodes(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.BinarySearchTree
 
closeGap(int, int) - Method in class goldman.collection.positional.Array
Moves the elements that were at positions toPos+1, ..., size-1 to positions fromPos, ..., size-1 - (toPos - fromPos + 1).
closeGap(int, int) - Method in class goldman.collection.positional.CircularArray
Moves elements to decrement the position number for elements that were at positions toPos+1, ..., size-1 to positions fromPos, ..., size-1 - (toPos - fromPos + 1).
Collection<E> - Interface in goldman.collection
The Collection interface contains the operations that must be supported by all data structures that maintain a collection of elements.
comp - Variable in class goldman.collection.AbstractCollection
 
CompactTrie<E> - Class in goldman.collection.ordered.digitized
The compact trie data structure modifies the trie by replacing any leaf that has no siblings by its parent.
CompactTrie(Digitizer<? super E>) - Constructor for class goldman.collection.ordered.digitized.CompactTrie
Creates an empty compact trie that uses the given digitizer.
comparators - Variable in class goldman.collection.spatial.AlternatingComparator
 
compare(E, E) - Method in class goldman.collection.AbstractCollection
 
compare(T, T) - Method in class goldman.collection.DefaultBucketizer
 
compare(E, E) - Method in class goldman.collection.spatial.AlternatingComparator
Calling the compare method has the side-effect of advancing this alternating comparator to the next dimension in the cycle, wrapping around to dimension 0 as needed.
compare(E, E, int) - Method in class goldman.collection.spatial.AlternatingComparator
 
compare(E, E) - Method in class goldman.collection.spatial.DefaultXYComparator
 
compare(E, E) - Method in class goldman.collection.spatial.KDTree
Because the data set is multidimensional, the inherited compare method does not make sense.
compare(Point, Point) - Method in class goldman.collection.spatial.XComparator
 
compare(Point, Point) - Method in class goldman.collection.spatial.YComparator
 
compare(TaggedElement<T, ?>, TaggedElement<T, ?>) - Method in class goldman.collection.tagged.spatial.TaggedElementXYComparator
 
compare(TaggedElement<T, ?>, TaggedElement<T, ?>) - Method in class goldman.collection.tagged.TaggedElementComparator
 
compare(E, E) - Method in class goldman.Objects.DefaultEquivalenceTester
 
compare(T, T) - Method in class goldman.ReverseComparator
 
compareX(E, E) - Method in class goldman.collection.spatial.DefaultXYComparator
 
compareX(T, T) - Method in interface goldman.collection.spatial.XYComparator
Compares a and b according to their x-coordinates.
compareX(TaggedElement<T, ?>, TaggedElement<T, ?>) - Method in class goldman.collection.tagged.spatial.TaggedElementXYComparator
 
compareY(E, E) - Method in class goldman.collection.spatial.DefaultXYComparator
 
compareY(T, T) - Method in interface goldman.collection.spatial.XYComparator
Compares a and b according to their y-coordinates.
compareY(TaggedElement<T, ?>, TaggedElement<T, ?>) - Method in class goldman.collection.tagged.spatial.TaggedElementXYComparator
 
completions(E, Collection<? super E>) - Method in interface goldman.collection.ordered.digitized.DigitizedOrderedCollection
Appends all elements in this collection that have the given prefix to the given collection c.
completions(E, Collection<? super E>) - Method in class goldman.collection.ordered.digitized.Trie
 
completions(T, Collection<? super TaggedElement<T, E>>) - Method in interface goldman.collection.tagged.ordered.digitized.TaggedDigitizedOrderedCollection
Adds to the provided tagged collection, tc, all tagged elements for which the tag has the given prefix.
completions(T, Collection<? super TaggedElement<T, E>>) - Method in class goldman.collection.tagged.ordered.digitized.TaggedDigitizedOrderedCollectionWrapper
 
CompressedTrie<E> - Class in goldman.collection.ordered.digitized
The compressed trie performs additional compression on a compact trie.
CompressedTrie(Digitizer<? super E>) - Constructor for class goldman.collection.ordered.digitized.CompressedTrie
Creates an empty compressed trie that uses the given digitizer.
CompressedTrie.CompressedTrieSearchData - Class in goldman.collection.ordered.digitized
 
CompressedTrie.CompressedTrieSearchData() - Constructor for class goldman.collection.ordered.digitized.CompressedTrie.CompressedTrieSearchData
 
CompressedTrie.InternalNode - Class in goldman.collection.ordered.digitized
 
CompressedTrie.LeafNode - Class in goldman.collection.ordered.digitized
 
CompressedTrieNode<E> - Interface in goldman.collection.ordered.digitized
The CompressedTrieNode interface must be supported by any class defining objects to be used as nodes in a compressed trie.
computeRange() - Method in class goldman.collection.DefaultBucketizer
Computes the range of values created by the quantizer and stores the minimum value in min and the maximum value in max to avoid the need to recompute these values.
contains(E) - Method in class goldman.collection.AbstractCollection
This implementation for contains takes linear time, so it is overridden by a more efficient method in most data structure implementations.
contains(E) - Method in interface goldman.collection.Collection
Returns true if an element equivalent to target exists in this collection.
contains(E) - Method in class goldman.collection.ordered.AbstractSearchTree
 
contains(E) - Method in class goldman.collection.ordered.digitized.Trie
 
contains(E) - Method in class goldman.collection.ordered.SkipList
 
contains(E) - Method in class goldman.collection.ordered.SortedArray
 
contains(E) - Method in class goldman.collection.ordered.SplayTree
If element is in the collection, it is brought to the root using the splay method.
contains(E) - Method in class goldman.collection.positional.Array
 
contains(E) - Method in class goldman.collection.positional.Buffer
 
contains(E) - Method in class goldman.collection.positional.Queue
Returns true if and only if the given value is contained within the queue.
contains(E) - Method in class goldman.collection.positional.SinglyLinkedList
 
contains(E) - Method in class goldman.collection.positional.Stack
Returns true if and only if the given value is contained within the stack.
contains(E) - Method in class goldman.collection.priority.BinaryHeap
 
contains(E, LeftistHeap.LeftistHeapNode<E>) - Method in class goldman.collection.priority.LeftistHeap
 
contains(E) - Method in class goldman.collection.priority.LeftistHeap
 
contains(E) - Method in class goldman.collection.set.DirectAddressing
 
contains(E) - Method in class goldman.collection.set.SeparateChaining
 
contains(E) - Method in class goldman.collection.spatial.KDTree
 
contains(T) - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Returns true if an equivalent tag exists in this tagged bucket collection.
contains(T) - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
contains(T) - Method in interface goldman.collection.tagged.TaggedCollection
Returns true if a tagged element with an equivalent tag exists in this collection.
contains(T) - Method in class goldman.collection.tagged.TaggedCollectionWrapper
 
containsEdge(V, V) - Method in class goldman.graph.AbstractGraph
 
containsEdge(V, V) - Method in class goldman.graph.AdjacencyListRepresentation
 
containsEdge(V, V) - Method in class goldman.graph.AdjacencyMatrixRepresentation
 
containsEdge(V, V) - Method in interface goldman.graph.Graph
Returns true if and only if there is an edge from source to dest in this graph.
containsEdge(V, V) - Method in interface goldman.graph.GraphRepresentation
Returns true if and only if there is an edge in the graph from the source vertex to the destination vertex.
containsVertex(V) - Method in class goldman.graph.AbstractGraph
 
containsVertex(V) - Method in class goldman.graph.AdjacencyListRepresentation
 
containsVertex(V) - Method in class goldman.graph.AdjacencyMatrixRepresentation
 
containsVertex(V) - Method in interface goldman.graph.Graph
Returns true if and only if the given vertex is in this graph.
containsVertex(V) - Method in interface goldman.graph.GraphRepresentation
Returns true if and only if the give vertex is in the graph.
create() - Method in class goldman.Pool
 
createBucket() - Method in interface goldman.collection.tagged.bucket.BucketFactory
 
createFrontierNode() - Method in class goldman.collection.ordered.BinarySearchTree
 
createFrontierNode() - Method in class goldman.collection.ordered.RedBlackTree
 
createGap(int) - Method in class goldman.collection.positional.Array
Moves elements at positions p, ..., size-1 to positions p+1, ..., size.
createGap(int) - Method in class goldman.collection.positional.CircularArray
Moves elements in such a way to increment the position number for the elements that were at positions p, ..., size-1 to be at positions p+1, ..., size.
createRoot() - Method in class goldman.collection.ordered.BPlusTree
Creates and initializes a new empty root node
createRoot() - Method in class goldman.collection.ordered.BTree
Creates and initializes a new empty root node
createSearchData() - Method in class goldman.collection.ordered.digitized.CompressedTrie
 
createSearchData() - Method in class goldman.collection.ordered.digitized.PatriciaTrie
 
createSearchData() - Method in class goldman.collection.ordered.digitized.TernarySearchTrie
 
createSearchData() - Method in class goldman.collection.ordered.digitized.Trie
 
createTreeNode(E) - Method in class goldman.collection.ordered.BinarySearchTree
 
createTreeNode(E) - Method in class goldman.collection.ordered.RedBlackTree
 
createTreeNode(E) - Method in class goldman.collection.spatial.QuadTree
 
CUTOFF - Variable in class goldman.collection.positional.SinglyLinkedList
Quicksort is only applied to a subcollection with a size greater than the constant CUTOFF.

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