public abstract class oadd.org.apache.curator.shaded.com.google.common.graph.Traverser extends java.lang.Object
{
public static oadd.org.apache.curator.shaded.com.google.common.graph.Traverser forGraph(oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction)
{
oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction v;
oadd.org.apache.curator.shaded.com.google.common.graph.Traverser$GraphTraverser v;
v := @parameter: oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = new oadd.org.apache.curator.shaded.com.google.common.graph.Traverser$GraphTraverser;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.Traverser$GraphTraverser: void <init>(oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction)>(v);
return v;
}
public static oadd.org.apache.curator.shaded.com.google.common.graph.Traverser forTree(oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction)
{
oadd.org.apache.curator.shaded.com.google.common.graph.Traverser$TreeTraverser v;
oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction v;
boolean v, v, v, v;
v := @parameter: oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph;
if v == 0 goto label;
v = interfaceinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.BaseGraph: boolean isDirected()>();
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: void checkArgument(boolean,java.lang.Object)>(v, "Undirected graphs can never be trees.");
label:
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.Network;
if v == 0 goto label;
v = interfaceinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.Network: boolean isDirected()>();
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: void checkArgument(boolean,java.lang.Object)>(v, "Undirected networks can never be trees.");
label:
v = new oadd.org.apache.curator.shaded.com.google.common.graph.Traverser$TreeTraverser;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.Traverser$TreeTraverser: void <init>(oadd.org.apache.curator.shaded.com.google.common.graph.SuccessorsFunction)>(v);
return v;
}
public abstract java.lang.Iterable breadthFirst(java.lang.Object);
public abstract java.lang.Iterable breadthFirst(java.lang.Iterable);
public abstract java.lang.Iterable depthFirstPreOrder(java.lang.Object);
public abstract java.lang.Iterable depthFirstPreOrder(java.lang.Iterable);
public abstract java.lang.Iterable depthFirstPostOrder(java.lang.Object);
public abstract java.lang.Iterable depthFirstPostOrder(java.lang.Iterable);
private void <init>()
{
oadd.org.apache.curator.shaded.com.google.common.graph.Traverser v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.Traverser;
specialinvoke v.<java.lang.Object: void <init>()>();
return;
}
}