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