Coinjema
1.7

Uses of Class
org.coinjema.collections.HashTree

Packages that use HashTree
org.coinjema.collections   
 

Uses of HashTree in org.coinjema.collections
 

Subclasses of HashTree in org.coinjema.collections
 class ListedHashTree<T>
          ListedHashTree is a different implementation of the HashTree collection class.
 class SortedHashTree<T>
          SortedHashTree is a different implementation of the HashTree collection class.
 

Fields in org.coinjema.collections with type parameters of type HashTree
protected  Map<T,HashTree<T>> HashTree.data
           
 

Methods in org.coinjema.collections that return HashTree
 HashTree<T> HashTree.add(Collection<? extends T> treePath, T value)
          Adds a series of nodes into the HashTree using the given path.
 HashTree<T> ListedHashTree.add(T key)
           
 HashTree<T> HashTree.add(T key)
          Adds an key into the HashTree at the current level.
 HashTree<T> HashTree.add(T[] treePath, T value)
           
 HashTree<T> HashTree.add(T key, T value)
          Adds a key and it's value in the HashTree.
protected  HashTree<T> HashTree.addTreePath(Collection<? extends T> treePath)
           
 HashTree<T> SortedHashTree.clone()
           
 HashTree<T> ListedHashTree.clone()
           
 HashTree<T> HashTree.clone()
          Create a clone of this HashTree.
protected  HashTree<T> SortedHashTree.createNewTree()
           
 HashTree<T> ListedHashTree.createNewTree()
           
protected  HashTree<T> HashTree.createNewTree()
          Creates a new tree.
protected  HashTree<T> SortedHashTree.createNewTree(Collection<? extends T> values)
           
 HashTree<T> ListedHashTree.createNewTree(Collection<? extends T> values)
           
protected  HashTree<T> HashTree.createNewTree(Collection<? extends T> values)
          Creates a new tree.
protected  HashTree<T> SortedHashTree.createNewTree(T key)
           
 HashTree<T> ListedHashTree.createNewTree(T key)
           
protected  HashTree<T> HashTree.createNewTree(T key)
          Creates a new tree.
 HashTree<T> HashTree.get(Object key)
           
 HashTree<T> SearchByClass.getSubTree(T root)
          Given a specific found node, this method will return the sub tree of that node.
 HashTree<T> HashTree.getTree(Collection<?> treePath)
          Gets the HashTree object mapped to the last key in the SortedSet by recursing through the HashTree structure one key at a time.
 HashTree<T> HashTree.getTree(Object key)
          Gets the HashTree mapped to the given key.
 HashTree<T> HashTree.getTree(Object[] treePath)
          Gets the HashTree object mapped to the last key in the array by recursing through the HashTree structure one key at a time.
protected  HashTree<T> HashTree.getTreePath(Collection<?> treePath)
           
 HashTree<T> HashTree.put(T key, HashTree<T> val)
           
 HashTree<T> ListedHashTree.remove(Object key)
           
 HashTree<T> HashTree.remove(Object key)
          Removes the entire branch specified by the given key.
 HashTree<T> HashTree.remove(Object[] path)
           
 HashTree<T> HashTree.search(Object key)
          Searches the HashTree structure for the given key.
 

Methods in org.coinjema.collections that return types with arguments of type HashTree
 Set<Map.Entry<T,HashTree<T>>> HashTree.entrySet()
           
 Collection<HashTree<T>> HashTree.values()
           
 

Methods in org.coinjema.collections with parameters of type HashTree
 void HashTree.add(HashTree<? extends T> newTree)
          Adds all the nodes and branches of the given tree to this tree.
 void HashTree.add(T[] treePath, HashTree<? extends T> subTree)
           
 void HashTree.add(T key, HashTree<? extends T> subTree)
          Adds a key as a node at the current level and then adds the given HashTree to that new node.
 void TreeSorter.addNode(T arg0, HashTree<T> arg1)
           
 void SearchByClass.addNode(T node, HashTree<T> subTree)
           
 void HashTreeTraverser.addNode(T node, HashTree<T> subTree)
          The tree traverses itself depth-first, calling addNode for each object it encounters as it goes.
protected  void HashTree.cloneTree(HashTree<T> newTree)
           
 HashTree<T> HashTree.put(T key, HashTree<T> val)
           
 void HashTree.set(Collection<? extends T> treePath, HashTree<T> t)
           
 void ListedHashTree.set(HashTree<T> t)
           
 void HashTree.set(HashTree<T> t)
           
 void HashTree.set(T[] path, HashTree<T> t)
           
 void ListedHashTree.set(T key, HashTree<T> t)
           
 void HashTree.set(T key, HashTree<T> t)
          Sets a key into the current tree and assigns it a HashTree as its subtree.
 

Method parameters in org.coinjema.collections with type arguments of type HashTree
 void HashTree.putAll(Map<? extends T,? extends HashTree<T>> input)
           
 


Coinjema
1.7

Public Domain Software.