/guava/guava/src/com/google/common/collect/TreeTraverser.java
T result = checkNotNull( itr.next( ) ) ; Iterator<T> itr = stack.getLast( ) ;
Iterator<T> itr = stack.getLast ( ) ; T result = checkNotNull ( itr.next ( ) ) ;
@Override public boolean hasNext() { return !stack.isEmpty(); } @Override public T next() { <extra_id_0> if (!itr.hasNext()) { stack.removeLast(); } Iterator<T> childItr = children(result).iterator(); if (childItr.hasNext()) { stack.addLast(childItr);