com.webmethods.caf.faces.data.tree.object
Class LazyNodeTreeContentProvider.BreadthFirstTreeWalker

java.lang.Object
  extended by com.webmethods.caf.faces.data.tree.object.LazyNodeTreeContentProvider.BreadthFirstTreeWalker
All Implemented Interfaces:
Iterator
Enclosing class:
LazyNodeTreeContentProvider

protected class LazyNodeTreeContentProvider.BreadthFirstTreeWalker
extends Object
implements Iterator

Iterates over the tree in breadth-first order, returning INodes.


Field Summary
protected  boolean m_checkedNext
           
protected  INode m_next
           
 
Constructor Summary
LazyNodeTreeContentProvider.BreadthFirstTreeWalker()
          New tree walker starting from the first root (inclusive).
LazyNodeTreeContentProvider.BreadthFirstTreeWalker(INode node)
          New tree walker starting from the specified node (inclusive).
 
Method Summary
protected  INode findNext(INode current, int currentDepth, int targetDepth)
          Find next node at targetDepth.
 boolean hasNext()
           
 Object next()
           
 void remove()
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

m_checkedNext

protected boolean m_checkedNext

m_next

protected INode m_next
Constructor Detail

LazyNodeTreeContentProvider.BreadthFirstTreeWalker

public LazyNodeTreeContentProvider.BreadthFirstTreeWalker()
New tree walker starting from the first root (inclusive).


LazyNodeTreeContentProvider.BreadthFirstTreeWalker

public LazyNodeTreeContentProvider.BreadthFirstTreeWalker(INode node)
New tree walker starting from the specified node (inclusive).

Method Detail

hasNext

public boolean hasNext()
Specified by:
hasNext in interface Iterator

next

public Object next()
Specified by:
next in interface Iterator

remove

public void remove()
Specified by:
remove in interface Iterator

findNext

protected INode findNext(INode current,
                         int currentDepth,
                         int targetDepth)
Find next node at targetDepth.