private final class TreeTraverser.PostOrderIterator extends AbstractIterator<T>
| Modifier and Type | Field and Description |
|---|---|
private java.util.ArrayDeque<TreeTraverser.PostOrderNode<T>> |
stack |
| Constructor and Description |
|---|
PostOrderIterator(T root) |
| Modifier and Type | Method and Description |
|---|---|
protected T |
computeNext()
Returns the next element.
|
private TreeTraverser.PostOrderNode<T> |
expand(T t) |
endOfData, hasNext, next, peekremoveprivate final java.util.ArrayDeque<TreeTraverser.PostOrderNode<T>> stack
PostOrderIterator(T root)
@CheckForNull protected T computeNext()
AbstractIteratorAbstractIterator.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<T>endOfData was called during execution,
the return value will be ignored.private TreeTraverser.PostOrderNode<T> expand(T t)