|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use goldman.collection.ordered.digitized | |
---|---|
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. |
Classes in goldman.collection.ordered.digitized used by goldman.collection.ordered.digitized | |
---|---|
AbstractTrieLeafNode
The AbstractTrieLeafNode class implements methods that can be shared by all implementations of a trie leaf node. |
|
AbstractTrieNode
The AbstractTrieNode class implements methods that can be shared by all implementations of a trie node. |
|
CompactTrie
The compact trie data structure modifies the trie by replacing any leaf that has no siblings by its parent. |
|
CompressedTrie
The compressed trie performs additional compression on a compact trie. |
|
CompressedTrie.CompressedTrieSearchData
|
|
CompressedTrie.LeafNode
|
|
CompressedTrieNode
The CompressedTrieNode interface must be supported by any
class defining objects to be used as nodes in a compressed trie. |
|
DigitizedOrderedCollection
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). |
|
PatriciaTrie.Node
|
|
PatriciaTrie.PatriciaSearchData
|
|
Trie
The trie data structure is the simplest DigitizedOrderedCollection
implementation. |
|
Trie.FindResult
|
|
Trie.InternalNode
|
|
Trie.LeafNode
|
|
Trie.SearchData
|
|
TrieLeafNode
|
|
TrieNode
The TrieNode interface must be supported by any
class defining objects to be used as nodes in a trie. |
Classes in goldman.collection.ordered.digitized used by goldman.collection.tagged.ordered.digitized | |
---|---|
DigitizedOrderedCollection
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 NEXT | FRAMES NO FRAMES |