Uses of Interface
goldman.collection.ordered.digitized.TrieNode

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

Subinterfaces of TrieNode in goldman.collection.ordered.digitized
 interface CompressedTrieNode<E>
          The CompressedTrieNode interface must be supported by any class defining objects to be used as nodes in a compressed trie.
 interface TrieLeafNode<E>
           
 

Classes in goldman.collection.ordered.digitized that implement TrieNode
 class AbstractTrieLeafNode<E>
          The AbstractTrieLeafNode class implements methods that can be shared by all implementations of a trie leaf node.
 class AbstractTrieNode<E>
          The AbstractTrieNode class implements methods that can be shared by all implementations of a trie node.
protected  class CompressedTrie.InternalNode
           
protected  class CompressedTrie.LeafNode
           
protected  class PatriciaTrie.Node
           
protected  class TernarySearchTrie.InternalNode
           
protected  class Trie.InternalNode
           
protected  class Trie.LeafNode
           
 

Methods in goldman.collection.ordered.digitized that return TrieNode
 TrieNode<E> TrieNode.child(int i)
          Returns a reference to the ith child.
 TrieNode<E> Trie.InternalNode.child(int i)
           
 TrieNode<E> PatriciaTrie.Node.child(int i)
           
 TrieNode<E> AbstractTrieNode.child(int i)
           
protected  TrieNode<E> TernarySearchTrie.newInternalNode(Object o)
           
protected  TrieNode<E> CompactTrie.newInternalNode(Object o)
           
 TrieNode<E> TrieNode.parent()
          Returns a reference to the parent (or null for the root).
 TrieNode<E> AbstractTrieNode.parent()
           
 

Methods in goldman.collection.ordered.digitized with parameters of type TrieNode
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  int Trie.SearchData.extendPath(E element, TrieNode<E> newChild)
           
protected  void PatriciaTrie.remove(TrieNode<E> x)
           
protected  void CompressedTrie.remove(TrieNode<E> node)
           
protected  void PatriciaTrie.remove(TrieNode<E> x, PatriciaTrie.Node leafParent)
           
protected  void CompressedTrie.InternalNode.setChild(TrieNode<E> child)
          It adds child as a child of this node.
protected  int Trie.InternalNode.setChild(TrieNode<E> child, E element, int bp)
          Sets the associated child for element to child.
 void TrieNode.setParent(TrieNode<E> parent)
          Sets the parent reference to be the given trie node.
 void AbstractTrieNode.setParent(TrieNode<E> parent)