|
Joda System API | ||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Object | +--org.joda.util.ArrayTreeNode.DepthFirstTreeIterator
Implementation of TreeIterator that navigates through the nodes in a depth first order. The tree is traversed when the iterator is constructed, so concurrent modification is possible.
| Nested Class Summary | |
protected static class |
ArrayTreeNode.DepthFirstTreeIterator.Entry
|
| Constructor Summary | |
ArrayTreeNode.DepthFirstTreeIterator(TreeNode node)
Constructor |
|
| Method Summary | |
protected void |
addEntries(TreeNode node,
java.util.List list)
Recursive method to populate list |
TreeNode |
getParent()
Get the parent of the last retrieved node |
boolean |
hasNext()
Is there another node in the list |
java.lang.Object |
next()
Get the next node |
TreeNode |
nextNode()
Get the next node typecast |
void |
remove()
Remove the last node |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public ArrayTreeNode.DepthFirstTreeIterator(TreeNode node)
| Method Detail |
protected void addEntries(TreeNode node,
java.util.List list)
public boolean hasNext()
hasNext in interface java.util.Iteratorpublic java.lang.Object next()
next in interface java.util.Iteratorpublic void remove()
remove in interface java.util.Iteratorpublic TreeNode nextNode()
nextNode in interface TreeIteratorpublic TreeNode getParent()
getParent in interface TreeIterator
|
Joda System API | ||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||