|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use AbstractCollection | |
---|---|
goldman.collection.ordered | An ordered collection is an untagged algorithmically positioned collection of comparable elements that may contain duplicates. |
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). |
goldman.collection.positional | A positional collection is a manually positioned collection in which elements are accessed via their position in a line (with 0 being the position of the first element in the line) or via their location relative to other elements in the line. |
goldman.collection.priority | A priority queue is an untagged algorithmically positioned collection of comparable elements in which there can be equivalent elements. |
goldman.collection.set | A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent. |
goldman.collection.spatial | A spatial collection is an untagged algorithmically positioned collection that organizes its elements by their location in a multidimensional space. |
Uses of AbstractCollection in goldman.collection.ordered |
---|
Subclasses of AbstractCollection in goldman.collection.ordered | |
---|---|
class |
AbstractSearchTree<E>
The AbstractSearchTree class is an abstract class that includes the methods that are shared by all search trees. |
class |
BalancedBinarySearchTree<E>
A balanced binary search tree uses rotations to maintain balance when one path to a leaf becomes "to much longer" than another. |
class |
BinarySearchTree<E>
This class implements a standard binary search tree. |
class |
BPlusTree<E>
The B+-tree is variation of a B-tree in which the internal nodes are used only for navigation. |
class |
BTree<E>
A B-tree is a balanced binary search tree in which each node can hold between t-1 and 2t-1 elements, where integer t > 1 is provided as a parameter to the constructor. |
class |
RedBlackTree<E>
The red-black tree is a balanced binary search tree in which a single bit (a color of red or black) associated with each tree node is used to ensure that the number of comparisons made when searching for any element is at most 2 log2 n. |
class |
SkipList<E>
The skip list is a sorted list with additional structure that supports finding an element in expected logarithmic time. |
class |
SortedArray<E>
The sorted array provides very efficient use of space and the fastest search time independent of the access pattern. |
class |
SplayTree<E>
A splay tree is a form of a balanced binary search tree in which the nodes store no explicit information to enforce a balancing condition. |
class |
TopDownBTree<E>
The top down B-tree implements a variation of a B-tree that uses top-down (versus bottom-up) insertion and deletion. |
Uses of AbstractCollection in goldman.collection.ordered.digitized |
---|
Subclasses of AbstractCollection in goldman.collection.ordered.digitized | |
---|---|
class |
CompactTrie<E>
The compact trie data structure modifies the trie by replacing any leaf that has no siblings by its parent. |
class |
CompressedTrie<E>
The compressed trie performs additional compression on a compact trie. |
class |
PatriciaTrie<E>
The Patricia trie is a variation of a compressed trie that can be used when the digitizer has base 2 and the collection is naturally prefix-free (without adding an end of string character). |
class |
TernarySearchTrie<E>
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. |
class |
Trie<E>
The trie data structure is the simplest DigitizedOrderedCollection
implementation. |
Uses of AbstractCollection in goldman.collection.positional |
---|
Subclasses of AbstractCollection in goldman.collection.positional | |
---|---|
class |
AbstractPositionalCollection<E>
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. |
class |
Array<E>
The simplest of the positional collections, Array provides space for a fixed number of elements, which are stored in an underlying Java primitive array. |
class |
CircularArray<E>
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. |
class |
DoublyLinkedList<E>
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 . |
class |
DynamicArray<E>
This array-based data structure provides space for a fixed number of elements, which are stored in an underlying Java primitive array. |
class |
DynamicCircularArray<E>
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. |
class |
SinglyLinkedList<E>
The simplest of the list-based positional collections, SinglyLinkedList maintains a linked list where each list node only references the next element in the list. |
class |
TrackedArray<E>
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. |
Uses of AbstractCollection in goldman.collection.priority |
---|
Subclasses of AbstractCollection in goldman.collection.priority | |
---|---|
class |
BinaryHeap<E>
The binary heap is a very simple data structure that has worst-case logarithmic cost for add , extractMax , and update (through
a locator). |
class |
FibonacciHeap<E>
The Fibonacci heap is a more complex self-organizing data structure. |
class |
LeftistHeap<E>
The leftist heap is a fairly simple implementation that supports merge in logarithmic time. |
class |
PairingHeap<E>
The pairing heap is a simple self-organizing data structure in which the amortized cost for add , merge , and
remove through a tracker are all logarithmic. |
Uses of AbstractCollection in goldman.collection.set |
---|
Subclasses of AbstractCollection in goldman.collection.set | |
---|---|
class |
DirectAddressing<E>
This data structure provides excellent performance, but O(|U|) space is required. |
class |
OpenAddressing<E>
This data structure should also be considered when only a small fraction of the elements in the universe will be stored in the collection. |
class |
SeparateChaining<E>
This data structure should be considered when only a small fraction of the elements in U will be stored in the collection. |
Uses of AbstractCollection in goldman.collection.spatial |
---|
Subclasses of AbstractCollection in goldman.collection.spatial | |
---|---|
class |
KDTree<E>
The k-d tree cycles among the k dimensions, dividing each region by a halfspace with respect to the dimensions associated with that level. |
class |
QuadTree<E>
A quad tree divides the subdomain into four regions at each internal node. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |