private final class Traverser.TreeTraverser.DepthFirstPostOrderIterator extends AbstractIterator<N>
Modifier and Type | Class and Description |
---|---|
private class |
Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren
A simple tuple of a node and a partially iterated
Iterator of its children. |
Modifier and Type | Field and Description |
---|---|
private java.util.ArrayDeque<Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren> |
stack |
Constructor and Description |
---|
DepthFirstPostOrderIterator(java.lang.Iterable<? extends N> roots) |
Modifier and Type | Method and Description |
---|---|
protected N |
computeNext()
Returns the next element.
|
(package private) Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren |
withChildren(N node) |
endOfData, hasNext, next, peek
remove
private final java.util.ArrayDeque<Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren> stack
DepthFirstPostOrderIterator(java.lang.Iterable<? extends N> roots)
protected N computeNext()
AbstractIterator
AbstractIterator.endOfData()
when
there are no elements left in the iteration. Failure to do so could result in an infinite loop.
The initial invocation of AbstractIterator.hasNext()
or AbstractIterator.next()
calls this method, as does
the first invocation of hasNext
or next
following each successful call to
next
. Once the implementation either invokes endOfData
or throws an exception,
computeNext
is guaranteed to never be called again.
If this method throws an exception, it will propagate outward to the hasNext
or
next
invocation that invoked this method. Any further attempts to use the iterator will
result in an IllegalStateException
.
The implementation of this method may not invoke the hasNext
, next
, or
AbstractIterator.peek()
methods on this instance; if it does, an IllegalStateException
will
result.
computeNext
in class AbstractIterator<N>
endOfData
was called during execution,
the return value will be ignored.Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren withChildren(N node)