Uses of Class
goldman.collection.ordered.digitized.CompactTrie

Packages that use CompactTrie
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). 
 

Uses of CompactTrie in goldman.collection.ordered.digitized
 

Subclasses of CompactTrie in goldman.collection.ordered.digitized
 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.