Uses of Class
goldman.collection.ordered.digitized.Trie.SearchData

Packages that use Trie.SearchData
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 Trie.SearchData in goldman.collection.ordered.digitized
 

Subclasses of Trie.SearchData in goldman.collection.ordered.digitized
protected  class CompressedTrie.CompressedTrieSearchData
           
protected  class PatriciaTrie.PatriciaSearchData
           
protected  class TernarySearchTrie.TernarySearchTrieSearchData
           
 

Methods in goldman.collection.ordered.digitized that return Trie.SearchData
protected  Trie.SearchData Trie.createSearchData()
           
protected  Trie.SearchData TernarySearchTrie.createSearchData()
           
 

Methods in goldman.collection.ordered.digitized with parameters of type Trie.SearchData
protected  void Trie.addNewNode(TrieNode<E> newNode, Trie.SearchData sd)
          Modifies the trie (excluding the ordered leaf chain) to include newNode
protected  void PatriciaTrie.addNewNode(TrieNode<E> newNode, Trie.SearchData sd)
           
protected  void CompressedTrie.addNewNode(TrieNode<E> newNode, Trie.SearchData sd)
           
protected  void CompactTrie.addNewNode(TrieNode<E> newNode, Trie.SearchData sd)
           
protected  void Trie.moveToLowestCommonAncestor(E prefix, Trie.SearchData sd, Trie.FindResult findStatus)
          This method has the side affect of moving sd to its lowest ancestor for which the associated data is an extension of prefix.
protected  void TernarySearchTrie.moveToLowestCommonAncestor(E prefix, Trie.SearchData sd, Trie.FindResult found)
          This method has the side affect of moving sd so that it is at the lowest common ancestor for which the associated data is an extension of prefix.
protected  boolean Trie.moveToPred(E element, Trie.SearchData sd, Trie.FindResult findStatus)
          If there is some element in the collection less than element then sd is moved to the predecessor.
protected  void Trie.removeImpl(Trie.SearchData sd)
          It calls an internal method that removes sd.ptr from the trie.
protected  void PatriciaTrie.removeImpl(Trie.SearchData sd)
          Call an internal remove method that takes a reference to the node to remove and its leaf parent