|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use OrderedCollection | |
---|---|
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.tagged.ordered | A tagged ordered collection is the tagged variation of an ordered collection. |
Uses of OrderedCollection in goldman.collection.ordered |
---|
Classes in goldman.collection.ordered that implement OrderedCollection | |
---|---|
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 OrderedCollection in goldman.collection.ordered.digitized |
---|
Subinterfaces of OrderedCollection in goldman.collection.ordered.digitized | |
---|---|
interface |
DigitizedOrderedCollection<E>
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). |
Classes in goldman.collection.ordered.digitized that implement OrderedCollection | |
---|---|
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 OrderedCollection in goldman.collection.tagged.ordered |
---|
Constructors in goldman.collection.tagged.ordered with parameters of type OrderedCollection | |
---|---|
TaggedOrderedCollectionWrapper(OrderedCollection<TaggedElement<T,E>> pairs)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |