|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
CompressedTrieNode<E> | The CompressedTrieNode interface must be supported by any
class defining objects to be used as nodes in a compressed trie. |
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). |
TrieLeafNode<E> | |
TrieNode<E> | The TrieNode interface must be supported by any
class defining objects to be used as nodes in a trie. |
Class Summary | |
---|---|
AbstractTrieLeafNode<E> | The AbstractTrieLeafNode class implements methods that can be shared by all implementations of a trie leaf node. |
AbstractTrieNode<E> | The AbstractTrieNode class implements methods that can be shared by all implementations of a trie node. |
CompactTrie<E> | The compact trie data structure modifies the trie by replacing any leaf that has no siblings by its parent. |
CompressedTrie<E> | The compressed trie performs additional compression on a compact trie. |
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). |
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. |
Trie<E> | The trie data structure is the simplest DigitizedOrderedCollection
implementation. |
Enum Summary | |
---|---|
Trie.FindResult |
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).
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |