public class NodeTreeIterator extends com.google.common.collect.UnmodifiableIterator<INode> implements BidiTreeIterator<INode>
| Constructor and Description | 
|---|
NodeTreeIterator(INode root)  | 
| Modifier and Type | Method and Description | 
|---|---|
protected void | 
afterAdvance()  | 
boolean | 
hasNext()  | 
boolean | 
hasPrevious()
Returns true if this bidi iterator has more elements when
 traversing in the reverse direction. 
 | 
INode | 
next()
 
 Intermixed calls to  
BidiTreeIterator.next() and BidiTreeIterator.previous() may not lead
 to the very same element since the iterator does not return the parent element
 when its done with its children but the next sibling of the parent. | 
INode | 
previous()
Returns the previous element. 
 | 
void | 
prune()  | 
public NodeTreeIterator(INode root)
public boolean hasNext()
hasNext in interface java.util.Iterator<INode>public INode next()
BidiTreeIteratorIntermixed calls to BidiTreeIterator.next() and BidiTreeIterator.previous() may not lead
 to the very same element since the iterator does not return the parent element
 when its done with its children but the next sibling of the parent.
next in interface java.util.Iterator<INode>next in interface BidiTreeIterator<INode>protected void afterAdvance()
public boolean hasPrevious()
BidiIteratorhasPrevious in interface BidiIterator<INode>public INode previous()
BidiTreeIteratorIntermixed calls to BidiTreeIterator.next() and BidiTreeIterator.previous() may not lead
 to the very same element since the iterator does not return the parent element
 when its done with its children but the next sibling of the parent.
previous in interface BidiIterator<INode>previous in interface BidiTreeIterator<INode>public void prune()
prune in interface org.eclipse.emf.common.util.TreeIterator<INode>