class oadd.com.google.common.graph.Traverser$Traversal$4 extends oadd.com.google.common.collect.AbstractIterator
{
final java.util.Deque val$horizon;
final java.util.Deque val$ancestorStack;
final oadd.com.google.common.graph.Traverser$Traversal this$0;
void <init>(oadd.com.google.common.graph.Traverser$Traversal, java.util.Deque, java.util.Deque)
{
oadd.com.google.common.graph.Traverser$Traversal v;
java.util.Deque v, v;
oadd.com.google.common.graph.Traverser$Traversal$4 v;
v := @this: oadd.com.google.common.graph.Traverser$Traversal$4;
v := @parameter: oadd.com.google.common.graph.Traverser$Traversal;
v := @parameter: java.util.Deque;
v := @parameter: java.util.Deque;
v.<oadd.com.google.common.graph.Traverser$Traversal$4: oadd.com.google.common.graph.Traverser$Traversal this$0> = v;
v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$horizon> = v;
v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$ancestorStack> = v;
specialinvoke v.<oadd.com.google.common.collect.AbstractIterator: void <init>()>();
return;
}
protected java.lang.Object computeNext()
{
java.util.Deque v, v, v, v, v, v;
java.lang.Iterable v;
oadd.com.google.common.graph.Traverser$Traversal$4 v;
oadd.com.google.common.graph.Traverser$Traversal v, v, v;
boolean v, v;
java.util.Iterator v;
oadd.com.google.common.graph.SuccessorsFunction v;
java.lang.Object v, v;
v := @this: oadd.com.google.common.graph.Traverser$Traversal$4;
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: oadd.com.google.common.graph.Traverser$Traversal this$0>;
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$horizon>;
v = virtualinvoke v.<oadd.com.google.common.graph.Traverser$Traversal: java.lang.Object visitNext(java.util.Deque)>(v);
label:
if v == null goto label;
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: oadd.com.google.common.graph.Traverser$Traversal this$0>;
v = v.<oadd.com.google.common.graph.Traverser$Traversal: oadd.com.google.common.graph.SuccessorsFunction successorFunction>;
v = interfaceinvoke v.<oadd.com.google.common.graph.SuccessorsFunction: java.lang.Iterable successors(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;
return v;
label:
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$horizon>;
interfaceinvoke v.<java.util.Deque: void addFirst(java.lang.Object)>(v);
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$ancestorStack>;
interfaceinvoke v.<java.util.Deque: void push(java.lang.Object)>(v);
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: oadd.com.google.common.graph.Traverser$Traversal this$0>;
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$horizon>;
v = virtualinvoke v.<oadd.com.google.common.graph.Traverser$Traversal: java.lang.Object visitNext(java.util.Deque)>(v);
goto label;
label:
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$ancestorStack>;
v = interfaceinvoke v.<java.util.Deque: boolean isEmpty()>();
if v == 0 goto label;
v = virtualinvoke v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.lang.Object endOfData()>();
goto label;
label:
v = v.<oadd.com.google.common.graph.Traverser$Traversal$4: java.util.Deque val$ancestorStack>;
v = interfaceinvoke v.<java.util.Deque: java.lang.Object pop()>();
label:
return v;
}
}