|
Coinjema 1.7 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.coinjema.collections.TreeSorter<T>
public class TreeSorter<T>
| Constructor Summary | |
|---|---|
TreeSorter()
|
|
TreeSorter(Comparator<T> comper)
|
|
TreeSorter(T key)
|
|
TreeSorter(T key,
Comparator<T> comper)
|
|
| Method Summary | |
|---|---|
void |
addNode(T arg0,
HashTree<T> arg1)
The tree traverses itself depth-first, calling addNode for each object it encounters as it goes. |
void |
processPath()
Process path is called when a leaf is reached. |
void |
subtractNode()
Indicates traversal has moved up a step, and the visitor should remove the top node from its stack structure. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public TreeSorter(T key,
Comparator<T> comper)
public TreeSorter(Comparator<T> comper)
public TreeSorter()
public TreeSorter(T key)
| Method Detail |
|---|
public void addNode(T arg0,
HashTree<T> arg1)
HashTreeTraverser
addNode in interface HashTreeTraverser<T>arg0 - the node currently encounteredarg1 - the HashTree under the node encounteredpublic void subtractNode()
HashTreeTraverser
subtractNode in interface HashTreeTraverser<T>public void processPath()
HashTreeTraverserHashTreeTraverser.subtractNode() call. This is a callback
method, and should not be called except by a HashTree during traversal.
processPath in interface HashTreeTraverser<T>
|
Coinjema 1.7 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||