Uses of Class
goldman.collection.tagged.TaggedCollectionWrapper

Packages that use TaggedCollectionWrapper
goldman.collection.tagged.ordered A tagged ordered collection is the tagged variation of an ordered collection. 
goldman.collection.tagged.ordered.digitized A tagged digitized ordered collection is the tagged variation of a digitized ordered collection. 
goldman.collection.tagged.priority A tagged priority queue is the tagged version of a priority queue. 
goldman.collection.tagged.set A mapping is the tagged variation of a set. 
goldman.collection.tagged.spatial A tagged spatial collection is the tagged variation of a spatial collection. 
goldman.graph A graph represents general relationships between pairs of elements from among a set of elements. 
 

Uses of TaggedCollectionWrapper in goldman.collection.tagged.ordered
 

Subclasses of TaggedCollectionWrapper in goldman.collection.tagged.ordered
 class TaggedBinarySearchTree<T,E>
          A tagged version of a binary search tree.
 class TaggedBPlusTree<T,E>
          A tagged version of B+-tree.
 class TaggedBTree<T,E>
          A tagged version of a B-tree.
 class TaggedOrderedCollectionWrapper<T,E>
          The tagged ordered collection wrapper can wrap any ordered collection implementation, where each element in the collection is a tagged element.
 class TaggedRedBlackTree<T,E>
          A tagged version of a red-black tree.
 class TaggedSkipList<T,E>
          A tagged version of a skiplist.
 class TaggedSortedArray<T,E>
          A tagged version of a sorted array.
 class TaggedSplayTree<T,E>
          A tagged version of a splay tree.
 

Uses of TaggedCollectionWrapper in goldman.collection.tagged.ordered.digitized
 

Subclasses of TaggedCollectionWrapper in goldman.collection.tagged.ordered.digitized
 class TaggedCompactTrie<T,E>
          A tagged version of a compact trie.
 class TaggedCompressedTrie<T,E>
          A tagged version of a compressed trie.
 class TaggedDigitizedOrderedCollectionWrapper<T,E>
          The tagged ordered collection wrapper can wrap any digitized ordered collection implementation, where each element in the collection is a tagged element.
 class TaggedPatriciaTrie<T,E>
          A tagged version of a Patricia trie.
 class TaggedTernarySearchTrie<T,E>
          A tagged version of a ternary search trie.
 class TaggedTrie<T,E>
          A tagged version of a trie.
 

Uses of TaggedCollectionWrapper in goldman.collection.tagged.priority
 

Subclasses of TaggedCollectionWrapper in goldman.collection.tagged.priority
 class TaggedBinaryHeap<T,V>
          A tagged version of a binary heap.
 class TaggedFibonacciHeap<T,V>
          A tagged version of a Fibonacci heap.
 class TaggedLeftistHeap<T,V>
          A tagged version of a leftist heap.
 class TaggedPairingHeap<T,V>
          A tagged version of a pairing heap.
 class TaggedPriorityQueueWrapper<T,E>
          The tagged priority queue wrapper can wrap any priority queue implementation, where each element in the priority queue is a tagged element.
 

Uses of TaggedCollectionWrapper in goldman.collection.tagged.set
 

Subclasses of TaggedCollectionWrapper in goldman.collection.tagged.set
 class DirectAddressingMapping<K,V>
          A tagged version of a directed addressing.
 class OpenAddressingMapping<K,V>
          A tagged version of a open addressing.
 class SeparateChainingMapping<K,V>
          A tagged version of a separate chaining.
 

Uses of TaggedCollectionWrapper in goldman.collection.tagged.spatial
 

Subclasses of TaggedCollectionWrapper in goldman.collection.tagged.spatial
 class TaggedKDTree<T,E>
          A tagged version of a kd-tree.
 class TaggedQuadTree<T extends XYPoint,E>
          A tagged version of a quad tree.
 class TaggedSpatialCollectionWrapper<T,E>
          The tagged spatial collection wrapper can wrap any spatial collection implementation, where each element in the collection is a tagged element.
 

Uses of TaggedCollectionWrapper in goldman.graph
 

Subclasses of TaggedCollectionWrapper in goldman.graph
 class InTree<V,E extends Edge<V>>
          The InTree class provides an implementation of an in-tree that stores a parent edge associated with each vertex of the graph (possibly null).
 class ShortestPathMatrix<V,E extends WeightedEdge<V>>
          The ShortestPathMatrix class is used to store the result from an all-pairs shortest path algorithm.