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

T

tag - Variable in class goldman.collection.tagged.TaggedElement
 
TaggedBinaryHeap<T,V> - Class in goldman.collection.tagged.priority
A tagged version of a binary heap.
TaggedBinaryHeap(int, Comparator<? super T>, boolean) - Constructor for class goldman.collection.tagged.priority.TaggedBinaryHeap
 
TaggedBinaryHeap() - Constructor for class goldman.collection.tagged.priority.TaggedBinaryHeap
 
TaggedBinaryHeap(Comparator<? super T>) - Constructor for class goldman.collection.tagged.priority.TaggedBinaryHeap
 
TaggedBinaryHeap(int, boolean) - Constructor for class goldman.collection.tagged.priority.TaggedBinaryHeap
 
TaggedBinarySearchTree<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of a binary search tree.
TaggedBinarySearchTree(Comparator<? super T>) - Constructor for class goldman.collection.tagged.ordered.TaggedBinarySearchTree
 
TaggedBinarySearchTree() - Constructor for class goldman.collection.tagged.ordered.TaggedBinarySearchTree
 
TaggedBPlusTree<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of B+-tree.
TaggedBPlusTree(Comparator<? super T>, int) - Constructor for class goldman.collection.tagged.ordered.TaggedBPlusTree
 
TaggedBPlusTree() - Constructor for class goldman.collection.tagged.ordered.TaggedBPlusTree
 
TaggedBTree<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of a B-tree.
TaggedBTree(Comparator<? super T>, int) - Constructor for class goldman.collection.tagged.ordered.TaggedBTree
 
TaggedBTree() - Constructor for class goldman.collection.tagged.ordered.TaggedBTree
 
TaggedBucketCollection<T,E> - Interface in goldman.collection.tagged.bucket
In a tagged bucket collection, the elements are bucketed into sets based on their tags.
TaggedBucketCollectionWrapper<T,E> - Class in goldman.collection.tagged.bucket
The tagged bucket wrapper is implemented as a wrapper for any tagged collection, where each tag is placed in the wrapped collection only once, and the associated element for each tag is a bucket object of any collection type.
TaggedBucketCollectionWrapper(TaggedCollection<T, Collection<E>>, BucketFactory<E>) - Constructor for class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
TaggedBucketCollectionWrapper(TaggedCollection<T, Collection<E>>, Class) - Constructor for class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
TaggedCollection<T,E> - Interface in goldman.collection.tagged
A tagged collection is a variation of an algorithmically positioned collections (e.g., ordered collection, priority queue, spatial collection) that uses a tag associated with each element to determine their proper placement within the data structure.
TaggedCollectionWrapper<T,E> - Class in goldman.collection.tagged
Rather than implement each of the tagged collections from scratch, we define a tagged collection wrapper that can be used to transform any untagged collection into a tagged collection.
TaggedCollectionWrapper(Collection<TaggedElement<T, E>>) - Constructor for class goldman.collection.tagged.TaggedCollectionWrapper
 
TaggedCompactTrie<T,E> - Class in goldman.collection.tagged.ordered.digitized
A tagged version of a compact trie.
TaggedCompactTrie(Digitizer<? super T>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedCompactTrie
 
TaggedCompressedTrie<T,E> - Class in goldman.collection.tagged.ordered.digitized
A tagged version of a compressed trie.
TaggedCompressedTrie(Digitizer<? super T>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedCompressedTrie
 
TaggedDigitizedOrderedCollection<T,E> - Interface in goldman.collection.tagged.ordered.digitized
The TaggedDigitizedOrderedCollection ADT is a tagged variation of the DigitizedOrderedCollection ADT.
TaggedDigitizedOrderedCollectionWrapper<T,E> - Class in goldman.collection.tagged.ordered.digitized
The tagged ordered collection wrapper can wrap any digitized ordered collection implementation, where each element in the collection is a tagged element.
TaggedDigitizedOrderedCollectionWrapper(DigitizedOrderedCollection<TaggedElement<T, E>>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedDigitizedOrderedCollectionWrapper
 
TaggedElement<T,E> - Class in goldman.collection.tagged
Each element and its associated tag is stored in a tagged collection as a tagged element.
TaggedElement(T, E) - Constructor for class goldman.collection.tagged.TaggedElement
Initializes the tagged element to hold these values
TaggedElement() - Constructor for class goldman.collection.tagged.TaggedElement
 
TaggedElementComparator<T> - Class in goldman.collection.tagged
We compare tagged elements by wrapping a provided comparator defined over only the tags.
TaggedElementComparator(Comparator<? super T>) - Constructor for class goldman.collection.tagged.TaggedElementComparator
 
TaggedElementDigitizer<T> - Class in goldman.collection.tagged.ordered.digitized
The tagged digitized ordered collection data structures require digitizers for tagged elements that depend only on the tags.
TaggedElementDigitizer(Digitizer<? super T>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedElementDigitizer
 
TaggedElementXYComparator<T extends XYPoint> - Class in goldman.collection.tagged.spatial
The TaggedElementXYComparator used by the quad tree is defined over tags that are two-dimensional points.
TaggedElementXYComparator(XYComparator<? super T>) - Constructor for class goldman.collection.tagged.spatial.TaggedElementXYComparator
 
TaggedFibonacciHeap<T,V> - Class in goldman.collection.tagged.priority
A tagged version of a Fibonacci heap.
TaggedFibonacciHeap(Comparator<? super T>) - Constructor for class goldman.collection.tagged.priority.TaggedFibonacciHeap
 
TaggedFibonacciHeap() - Constructor for class goldman.collection.tagged.priority.TaggedFibonacciHeap
 
TaggedKDTree<T,E> - Class in goldman.collection.tagged.spatial
A tagged version of a kd-tree.
TaggedKDTree(Comparator<? super T>...) - Constructor for class goldman.collection.tagged.spatial.TaggedKDTree
 
TaggedLeftistHeap<T,V> - Class in goldman.collection.tagged.priority
A tagged version of a leftist heap.
TaggedLeftistHeap(Comparator<? super T>) - Constructor for class goldman.collection.tagged.priority.TaggedLeftistHeap
 
TaggedLeftistHeap() - Constructor for class goldman.collection.tagged.priority.TaggedLeftistHeap
 
TaggedOrderedCollection<T,E> - Interface in goldman.collection.tagged.ordered
A tagged variation of the OrderedCollection ADT
TaggedOrderedCollectionWrapper<T,E> - Class in goldman.collection.tagged.ordered
The tagged ordered collection wrapper can wrap any ordered collection implementation, where each element in the collection is a tagged element.
TaggedOrderedCollectionWrapper(OrderedCollection<TaggedElement<T, E>>) - Constructor for class goldman.collection.tagged.ordered.TaggedOrderedCollectionWrapper
 
TaggedPairingHeap<T,V> - Class in goldman.collection.tagged.priority
A tagged version of a pairing heap.
TaggedPairingHeap(Comparator<? super T>) - Constructor for class goldman.collection.tagged.priority.TaggedPairingHeap
 
TaggedPairingHeap() - Constructor for class goldman.collection.tagged.priority.TaggedPairingHeap
 
TaggedPatriciaTrie<T,E> - Class in goldman.collection.tagged.ordered.digitized
A tagged version of a Patricia trie.
TaggedPatriciaTrie(Digitizer<? super T>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedPatriciaTrie
 
TaggedPriorityQueue<T,E> - Interface in goldman.collection.tagged.priority
The TaggedPriorityQueue ADT is a tagged version of the priority queue ADT.
TaggedPriorityQueueWrapper<T,E> - Class in goldman.collection.tagged.priority
The tagged priority queue wrapper can wrap any priority queue implementation, where each element in the priority queue is a tagged element.
TaggedPriorityQueueWrapper(Collection<TaggedElement<T, E>>) - Constructor for class goldman.collection.tagged.priority.TaggedPriorityQueueWrapper
 
TaggedQuadTree<T extends XYPoint,E> - Class in goldman.collection.tagged.spatial
A tagged version of a quad tree.
TaggedQuadTree(XYComparator<? super T>) - Constructor for class goldman.collection.tagged.spatial.TaggedQuadTree
 
TaggedQuadTree() - Constructor for class goldman.collection.tagged.spatial.TaggedQuadTree
 
TaggedRedBlackTree<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of a red-black tree.
TaggedRedBlackTree(Comparator<? super T>) - Constructor for class goldman.collection.tagged.ordered.TaggedRedBlackTree
 
TaggedRedBlackTree() - Constructor for class goldman.collection.tagged.ordered.TaggedRedBlackTree
 
TaggedSkipList<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of a skiplist.
TaggedSkipList(int, Comparator<? super T>) - Constructor for class goldman.collection.tagged.ordered.TaggedSkipList
 
TaggedSkipList() - Constructor for class goldman.collection.tagged.ordered.TaggedSkipList
 
TaggedSortedArray<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of a sorted array.
TaggedSortedArray(Comparator<? super T>) - Constructor for class goldman.collection.tagged.ordered.TaggedSortedArray
 
TaggedSortedArray() - Constructor for class goldman.collection.tagged.ordered.TaggedSortedArray
 
TaggedSpatialCollection<T,E> - Interface in goldman.collection.tagged.spatial
In this section we present the TaggedSpatialCollection ADT, which is a tagged variation of the SpatialCollection ADT.
TaggedSpatialCollectionWrapper<T,E> - Class in goldman.collection.tagged.spatial
The tagged spatial collection wrapper can wrap any spatial collection implementation, where each element in the collection is a tagged element.
TaggedSpatialCollectionWrapper(Collection<TaggedElement<T, E>>) - Constructor for class goldman.collection.tagged.spatial.TaggedSpatialCollectionWrapper
 
TaggedSplayTree<T,E> - Class in goldman.collection.tagged.ordered
A tagged version of a splay tree.
TaggedSplayTree(Comparator<? super T>) - Constructor for class goldman.collection.tagged.ordered.TaggedSplayTree
 
TaggedSplayTree() - Constructor for class goldman.collection.tagged.ordered.TaggedSplayTree
 
TaggedTernarySearchTrie<T,E> - Class in goldman.collection.tagged.ordered.digitized
A tagged version of a ternary search trie.
TaggedTernarySearchTrie(Digitizer<? super T>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedTernarySearchTrie
 
TaggedTrie<T,E> - Class in goldman.collection.tagged.ordered.digitized
A tagged version of a trie.
TaggedTrie(Digitizer<? super T>) - Constructor for class goldman.collection.tagged.ordered.digitized.TaggedTrie
 
tags() - Method in interface goldman.collection.tagged.TaggedCollection
Returns an iterator over the tags that has been initialized to just before the first tag in the iteration order.
tags() - Method in class goldman.collection.tagged.TaggedCollectionWrapper
 
target - Variable in class goldman.collection.tagged.TaggedCollectionWrapper
 
tc - Variable in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
TernarySearchTrie<E> - Class in goldman.collection.ordered.digitized
The ternary search trie (often referred to as a TST) is a hybrid between a trie and a binary search tree that combines the time efficiency of a trie with the space efficiency of a binary search tree.
TernarySearchTrie(Digitizer<? super E>) - Constructor for class goldman.collection.ordered.digitized.TernarySearchTrie
Creates an empty ternary search trie that uses the given digitizer.
TernarySearchTrie.InternalNode - Class in goldman.collection.ordered.digitized
 
TernarySearchTrie.TernarySearchTrieSearchData - Class in goldman.collection.ordered.digitized
 
TernarySearchTrie.TernarySearchTrieSearchData() - Constructor for class goldman.collection.ordered.digitized.TernarySearchTrie.TernarySearchTrieSearchData
 
toArray() - Method in class goldman.collection.AbstractCollection
 
toArray(E[]) - Method in class goldman.collection.AbstractCollection
 
toArray() - Method in interface goldman.collection.Collection
Returns a Java primitive array of length n that holds the elements in this collection in the iteration order.
toArray(E[]) - Method in interface goldman.collection.Collection
Fills a Java array with the elements in this collection in the iteration order, and returns the array that was filled.
TopDownBTree<E> - Class in goldman.collection.ordered
The top down B-tree implements a variation of a B-tree that uses top-down (versus bottom-up) insertion and deletion.
TopDownBTree() - Constructor for class goldman.collection.ordered.TopDownBTree
 
TopDownBTree(int) - Constructor for class goldman.collection.ordered.TopDownBTree
 
TopDownBTree(Comparator<? super E>, int) - Constructor for class goldman.collection.ordered.TopDownBTree
 
topologicalOrder() - Method in class goldman.graph.AbstractGraph
The hasCycle method can be called first to find out if the graph has a cycle.
topologicalOrder() - Method in interface goldman.graph.Graph
Returns a positional collection that holds a permutation of the vertices of a directed graph in a valid topological order.
toString() - Method in class goldman.collection.AbstractCollection
 
toString() - Method in interface goldman.collection.Collection
Returns a string that includes each element in this collection (as produced by the toString method for that element), in the iteration order.
toString() - Method in class goldman.collection.IndexedNumber
 
toString() - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
toString() - Method in class goldman.collection.ordered.digitized.Trie.LeafNode
 
toString() - Method in class goldman.collection.positional.AbstractPositionalCollection
 
toString() - Method in class goldman.collection.positional.Buffer
 
toString() - Method in class goldman.collection.positional.Queue
Returns a string representation of the elements in the queue.
toString() - Method in class goldman.collection.positional.SinglyLinkedList.ListItem
 
toString() - Method in class goldman.collection.positional.Stack
Returns a string representation of the elements in the stack.
toString() - Method in class goldman.collection.spatial.QuadTree
 
toString() - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Returns a string that describes each tagged element in the collection, as produced by the toString method for that element, in the iteration order.
toString() - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
toString() - Method in interface goldman.collection.tagged.TaggedCollection
Returns a string that describes each tagged element in the collection, in the iteration order.
toString() - Method in class goldman.collection.tagged.TaggedCollectionWrapper
 
toString() - Method in class goldman.collection.tagged.TaggedElement
 
toString() - Method in class goldman.graph.AbstractGraph
 
toString() - Method in class goldman.graph.SimpleEdge
 
toString() - Method in class goldman.graph.SimpleWeightedEdge
 
toString() - Method in interface goldman.partition.PartitionElement
 
toString() - Method in class goldman.partition.UnionFindNode
 
Tracked<E> - Interface in goldman.collection
The Tracked interface adds a single method to the Collection interface that allows the user to obtain a tracker when an element is inserted.
TrackedArray<E> - Class in goldman.collection.positional
This array-based data structure can wrap any of the other array-based data structures to create a tracked implementation of the wrapped data structure.
TrackedArray(int, Comparator<? super E>) - Constructor for class goldman.collection.positional.TrackedArray
Creates a tracked array with the given capacity that uses the provided equivalence tester
TrackedArray() - Constructor for class goldman.collection.positional.TrackedArray
Creates an underlying array a with a default initial capacity.
TrackedArray(int) - Constructor for class goldman.collection.positional.TrackedArray
 
TrackedArray.Tracker - Class in goldman.collection.positional
 
TrackedArray.Tracker(TrackedArray.Node<E>) - Constructor for class goldman.collection.positional.TrackedArray.Tracker
 
trackedNode - Variable in class goldman.collection.positional.TrackedArray.Tracker
 
TrackedTagged<T,E> - Interface in goldman.collection.tagged
Similar to the Tagged interface, the TrackedTagged interface includes a method to insert a tagged element into a tagged collection that returns a tracker for it.
traverseForVisitor(Visitor<? super E>) - Method in class goldman.collection.AbstractCollection
Traverses the collection applying v to each element
traverseForVisitor(Visitor<? super E>) - Method in class goldman.collection.ordered.AbstractSearchTree
Applies the visitor to each element of the collection in sorted order
traverseForVisitor(Visitor<? super E>) - Method in class goldman.collection.ordered.BPlusTree
Traverses the collection applying v to each element
traverseForVisitor(Visitor<? super E>) - Method in class goldman.collection.positional.Array
Traverses the entire collection on behalf of v.
traverseForVisitor(Visitor<? super E>) - Method in class goldman.collection.priority.LeftistHeap
Applies the visitor from the root of the leftist heap
traverseForVisitor(Visitor<? super E>) - Method in class goldman.collection.spatial.QuadTree
 
TreeIterator<E> - Class in goldman.collection.ordered
The TreeIterator class is an abstract class that implements the Iterator interface for any search tree.
TreeIterator(TreeNode<E>) - Constructor for class goldman.collection.ordered.TreeIterator
 
TreeNode<E> - Interface in goldman.collection.ordered
The TreeNode interface must be supported by any class defining objects to be used as nodes in a search tree.
treesort() - Method in class goldman.collection.positional.Array
Sorts this collection using the tree sort algorithm and the default comparator
treesort(Comparator<? super E>) - Method in class goldman.collection.positional.Array
Sorts this collection using the tree sort algorithm and the provided comparator
treesort() - Method in interface goldman.collection.positional.PositionalCollection
Sorts this collection with tree sort using the default comparator.
treesort(Comparator<? super E>) - Method in interface goldman.collection.positional.PositionalCollection
Sorts this collection with tree sort using the provided comparator.
treesort() - Method in class goldman.collection.positional.SinglyLinkedList
Uses the default comparator to order the elements
treesort(Comparator<? super E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
treesort(Comparator<? super E>) - Method in class goldman.collection.positional.TrackedArray
 
treesortImpl(Comparator) - Method in class goldman.collection.positional.SinglyLinkedList
Is the implementation of tree sort
Trie<E> - Class in goldman.collection.ordered.digitized
The trie data structure is the simplest DigitizedOrderedCollection implementation.
Trie(Digitizer<? super E>) - Constructor for class goldman.collection.ordered.digitized.Trie
Creates an empty trie that uses the given digitizer.
Trie.FindResult - Enum in goldman.collection.ordered.digitized
 
Trie.InternalNode - Class in goldman.collection.ordered.digitized
 
Trie.LeafNode - Class in goldman.collection.ordered.digitized
 
Trie.SearchData - Class in goldman.collection.ordered.digitized
 
Trie.SearchData() - Constructor for class goldman.collection.ordered.digitized.Trie.SearchData
 
Trie.Tracker - Class in goldman.collection.ordered.digitized
 
TrieLeafNode<E> - Interface in goldman.collection.ordered.digitized
 
TrieNode<E> - Interface in goldman.collection.ordered.digitized
The TrieNode interface must be supported by any class defining objects to be used as nodes in a trie.
trimToSize() - Method in class goldman.collection.AbstractCollection
Trims the capacity of this collection to be its current size.
trimToSize() - Method in interface goldman.collection.Collection
Trims the capacity of an oversized collection to exactly hold its current elements.
trimToSize() - Method in class goldman.collection.ordered.SortedArray
 
trimToSize() - Method in class goldman.collection.positional.Array
Reduces the capacity of the array to the current number of elements in the collection
trimToSize() - Method in class goldman.collection.set.DirectAddressing
 
trimToSize() - Method in class goldman.collection.set.OpenAddressing
Adjusts the size of the hash table so that the desired load factor is met as long as this does not increase the hash table size.
trimToSize() - Method in class goldman.collection.set.SeparateChaining
Adjust the size of the hash table so it is the minimum size needed to maintain the desired load factor.
trimToSize() - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Trims the capacity of this tagged bucket collection to be its current size.
trimToSize() - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
trimToSize() - Method in interface goldman.collection.tagged.TaggedCollection
Trims the capacity of this tagged collection to be its current size.
trimToSize() - Method in class goldman.collection.tagged.TaggedCollectionWrapper
Trims the capacity of this collection to be its current size.

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