final class oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected extends oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator
{
private java.util.Set visitedNodes;
private void <init>(oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph)
{
java.util.HashSet v;
oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected v;
int v;
java.util.Set v;
oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected;
v := @parameter: oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator: void <init>(oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph)>(v);
v = interfaceinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph: java.util.Set nodes()>();
v = interfaceinvoke v.<java.util.Set: int size()>();
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.collect.Sets: java.util.HashSet newHashSetWithExpectedSize(int)>(v);
v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.util.Set visitedNodes> = v;
return;
}
protected oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPair computeNext()
{
oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPair v;
java.util.Iterator v, v;
java.util.Set v, v;
oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected v;
java.lang.Object v, v, v, v;
boolean v, v, v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected;
label:
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.util.Iterator successorIterator>;
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.util.Iterator successorIterator>;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.util.Set visitedNodes>;
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v != 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.lang.Object node>;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPair: oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPair unordered(java.lang.Object,java.lang.Object)>(v, v);
return v;
label:
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.util.Set visitedNodes>;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.lang.Object node>;
interfaceinvoke v.<java.util.Set: boolean add(java.lang.Object)>(v);
v = virtualinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: boolean advance()>();
if v != 0 goto label;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.util.Set visitedNodes> = null;
v = virtualinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.EndpointPairIterator$Undirected: java.lang.Object endOfData()>();
return v;
}
}