com.google.common.graph

Class Traverser.TreeTraverser.DepthFirstPostOrderIterator

java.lang.Object

com.google.common.collect.UnmodifiableIterator<T>

com.google.common.collect.AbstractIterator<N>

com.google.common.graph.Traverser.TreeTraverser.DepthFirstPostOrderIterator

All Implemented Interfaces:

java.util.Iterator<N>

Enclosing class:

Traverser.TreeTraverser<N>

private final class Traverser.TreeTraverser.DepthFirstPostOrderIterator
extends AbstractIterator<N>

Nested Class Summary

Nested Classes

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.

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.ArrayDeque<Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren>	stack

Constructor Summary

Constructors

Constructor and Description
DepthFirstPostOrderIterator(java.lang.Iterable<? extends N> roots)

Method Summary

Modifier and Type	Method and Description
protected N	computeNext() Returns the next element.
(package private) Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren	withChildren(N node)

Methods inherited from class com.google.common.collect.AbstractIterator

endOfData, hasNext, next, peek

Methods inherited from class com.google.common.collect.UnmodifiableIterator

remove

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator

forEachRemaining

Field Detail

stack

private final java.util.ArrayDeque<Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren> stack

Constructor Detail

DepthFirstPostOrderIterator

DepthFirstPostOrderIterator(java.lang.Iterable<? extends N> roots)

Method Detail

computeNext

protected N computeNext()

Description copied from class: AbstractIterator

Returns the next element. Note: the implementation must call 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.

Specified by:

computeNext in class AbstractIterator<N>

Returns:

the next element if there was one. If endOfData was called during execution, the return value will be ignored.

withChildren

Traverser.TreeTraverser.DepthFirstPostOrderIterator.NodeAndChildren withChildren(N node)