public class BasicNodeTreeIterator extends com.google.common.collect.UnmodifiableIterator<AbstractNode> implements BidiTreeIterator<AbstractNode>
Modifier | Constructor and Description |
---|---|
protected |
BasicNodeTreeIterator(AbstractNode 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.
|
AbstractNode |
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. |
AbstractNode |
previous()
Returns the previous element.
|
void |
prune() |
protected BasicNodeTreeIterator(AbstractNode root)
public boolean hasNext()
hasNext
in interface java.util.Iterator<AbstractNode>
public AbstractNode next()
BidiTreeIterator
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.
next
in interface java.util.Iterator<AbstractNode>
next
in interface BidiTreeIterator<AbstractNode>
protected void afterAdvance()
public boolean hasPrevious()
BidiIterator
hasPrevious
in interface BidiIterator<AbstractNode>
public AbstractNode previous()
BidiTreeIterator
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.
previous
in interface BidiIterator<AbstractNode>
previous
in interface BidiTreeIterator<AbstractNode>
public void prune()
prune
in interface org.eclipse.emf.common.util.TreeIterator<AbstractNode>