final class org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator extends org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.AbstractIterator
{
private final java.util.ArrayDeque stack;
final org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser this$0;
void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser, java.lang.Iterable)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator v;
java.util.ArrayDeque v, v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser v;
java.lang.Iterable v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser;
v := @parameter: java.lang.Iterable;
v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser this$0> = v;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.AbstractIterator: void <init>()>();
v = new java.util.ArrayDeque;
specialinvoke v.<java.util.ArrayDeque: void <init>()>();
v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.util.ArrayDeque stack> = v;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.util.ArrayDeque stack>;
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator,java.lang.Object,java.lang.Iterable)>(v, null, v);
virtualinvoke v.<java.util.ArrayDeque: void addLast(java.lang.Object)>(v);
return;
}
protected java.lang.Object computeNext()
{
java.util.Iterator v, v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator v;
java.lang.Object v, v, v, v, v;
java.util.ArrayDeque v, v, v, v;
boolean v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator;
label:
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.util.ArrayDeque stack>;
v = virtualinvoke v.<java.util.ArrayDeque: boolean isEmpty()>();
if v != 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.util.ArrayDeque stack>;
v = virtualinvoke v.<java.util.ArrayDeque: java.lang.Object getLast()>();
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren: java.util.Iterator childIterator>;
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren: java.util.Iterator childIterator>;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.util.ArrayDeque stack>;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren withChildren(java.lang.Object)>(v);
virtualinvoke v.<java.util.ArrayDeque: void addLast(java.lang.Object)>(v);
goto label;
label:
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.util.ArrayDeque stack>;
virtualinvoke v.<java.util.ArrayDeque: java.lang.Object removeLast()>();
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren: java.lang.Object node>;
if v == null goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren: java.lang.Object node>;
return v;
label:
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: java.lang.Object endOfData()>();
return v;
}
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren withChildren(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator v;
java.lang.Object v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser v;
java.lang.Iterable v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator;
v := @parameter: java.lang.Object;
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser this$0>;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction tree>;
v = interfaceinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction: java.lang.Iterable successors(java.lang.Object)>(v);
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator,java.lang.Object,java.lang.Iterable)>(v, v, v);
return v;
}
}