final class com.google.common.collect.TreeTraverser$PreOrderIterator extends com.google.common.collect.UnmodifiableIterator
{
private final java.util.Deque stack;
final com.google.common.collect.TreeTraverser this$0;
void <init>(com.google.common.collect.TreeTraverser, java.lang.Object)
{
com.google.common.collect.TreeTraverser v;
com.google.common.collect.TreeTraverser$PreOrderIterator v;
java.lang.Object v, v;
com.google.common.collect.UnmodifiableIterator v;
java.util.ArrayDeque v;
java.util.Deque v;
v := @this: com.google.common.collect.TreeTraverser$PreOrderIterator;
v := @parameter: com.google.common.collect.TreeTraverser;
v := @parameter: java.lang.Object;
v.<com.google.common.collect.TreeTraverser$PreOrderIterator: com.google.common.collect.TreeTraverser this$0> = v;
specialinvoke v.<com.google.common.collect.UnmodifiableIterator: void <init>()>();
v = new java.util.ArrayDeque;
specialinvoke v.<java.util.ArrayDeque: void <init>()>();
v.<com.google.common.collect.TreeTraverser$PreOrderIterator: java.util.Deque stack> = v;
v = v.<com.google.common.collect.TreeTraverser$PreOrderIterator: java.util.Deque stack>;
v = staticinvoke <com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <com.google.common.collect.Iterators: com.google.common.collect.UnmodifiableIterator singletonIterator(java.lang.Object)>(v);
interfaceinvoke v.<java.util.Deque: void addLast(java.lang.Object)>(v);
return;
}
public boolean hasNext()
{
com.google.common.collect.TreeTraverser$PreOrderIterator v;
java.util.Deque v;
boolean v, v;
v := @this: com.google.common.collect.TreeTraverser$PreOrderIterator;
v = v.<com.google.common.collect.TreeTraverser$PreOrderIterator: java.util.Deque stack>;
v = interfaceinvoke v.<java.util.Deque: boolean isEmpty()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public java.lang.Object next()
{
java.util.Iterator v;
java.util.Deque v, v, v;
java.lang.Iterable v;
com.google.common.collect.TreeTraverser v;
com.google.common.collect.TreeTraverser$PreOrderIterator v;
java.lang.Object v, v, v;
boolean v, v;
v := @this: com.google.common.collect.TreeTraverser$PreOrderIterator;
v = v.<com.google.common.collect.TreeTraverser$PreOrderIterator: java.util.Deque stack>;
v = interfaceinvoke v.<java.util.Deque: java.lang.Object getLast()>();
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = staticinvoke <com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v != 0 goto label;
v = v.<com.google.common.collect.TreeTraverser$PreOrderIterator: java.util.Deque stack>;
interfaceinvoke v.<java.util.Deque: java.lang.Object removeLast()>();
label:
v = v.<com.google.common.collect.TreeTraverser$PreOrderIterator: com.google.common.collect.TreeTraverser this$0>;
v = virtualinvoke v.<com.google.common.collect.TreeTraverser: java.lang.Iterable children(java.lang.Object)>(v);
v = interfaceinvoke v.<java.lang.Iterable: java.util.Iterator iterator()>();
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = v.<com.google.common.collect.TreeTraverser$PreOrderIterator: java.util.Deque stack>;
interfaceinvoke v.<java.util.Deque: void addLast(java.lang.Object)>(v);
label:
return v;
}
}