final class org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator extends org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.AbstractIterator
{
private final java.util.Deque stack;
private final java.util.Set visited;
private final org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order order;
final org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser this$0;
void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser, java.lang.Iterable, org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order)
{
java.util.Deque v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors v;
java.lang.Iterable v;
java.util.HashSet v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser v;
java.util.ArrayDeque v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser;
v := @parameter: java.lang.Iterable;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order;
v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser 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$GraphTraverser$DepthFirstIterator: java.util.Deque stack> = v;
v = new java.util.HashSet;
specialinvoke v.<java.util.HashSet: void <init>()>();
v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Set visited> = v;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Deque stack>;
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator,java.lang.Object,java.lang.Iterable)>(v, null, v);
interfaceinvoke v.<java.util.Deque: void push(java.lang.Object)>(v);
v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order order> = v;
return;
}
protected java.lang.Object computeNext()
{
java.util.Deque v, v, v, v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order v, v, v, v;
boolean v, v, v, v, v, v, v, v;
java.util.Iterator v, v;
java.util.Set v, v;
java.lang.Object v, v, v, v, v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator;
label:
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Deque stack>;
v = interfaceinvoke v.<java.util.Deque: boolean isEmpty()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.lang.Object endOfData()>();
return v;
label:
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Deque stack>;
v = interfaceinvoke v.<java.util.Deque: java.lang.Object getFirst()>();
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Set visited>;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: java.lang.Object node>;
v = interfaceinvoke v.<java.util.Set: boolean add(java.lang.Object)>(v);
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: java.util.Iterator successorIterator>;
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v;
if v == 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order order>;
v = <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order PREORDER>;
if v == v goto label;
label:
if v == 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order order>;
v = <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$Order POSTORDER>;
if v != v goto label;
label:
v = 1;
goto label;
label:
v = 0;
label:
v = v;
if v == 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Deque stack>;
interfaceinvoke v.<java.util.Deque: java.lang.Object pop()>();
goto label;
label:
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: java.util.Iterator successorIterator>;
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$GraphTraverser$DepthFirstIterator: java.util.Set visited>;
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v != 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: java.util.Deque stack>;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors withSuccessors(java.lang.Object)>(v);
interfaceinvoke v.<java.util.Deque: void push(java.lang.Object)>(v);
label:
if v == 0 goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: java.lang.Object node>;
if v == null goto label;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: java.lang.Object node>;
return v;
}
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors withSuccessors(java.lang.Object)
{
java.lang.Object v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors 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$GraphTraverser$DepthFirstIterator;
v := @parameter: java.lang.Object;
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser this$0>;
v = v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction graph>;
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$GraphTraverser$DepthFirstIterator$NodeAndSuccessors: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator,java.lang.Object,java.lang.Iterable)>(v, v, v);
return v;
}
}