final class org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser extends org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser
{
private final org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction tree;
void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction)
{
java.lang.Object v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser 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;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser: void <init>()>();
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(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;
return;
}
public java.lang.Iterable breadthFirst(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet v;
java.lang.Object 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;
v := @parameter: java.lang.Object;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet of(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: java.lang.Iterable breadthFirst(java.lang.Iterable)>(v);
return v;
}
public java.lang.Iterable breadthFirst(java.lang.Iterable)
{
java.util.Iterator v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet 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.Traverser$TreeTraverser$1 v;
java.lang.Object v;
boolean v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser;
v := @parameter: java.lang.Iterable;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.Iterables: boolean isEmpty(java.lang.Iterable)>(v);
if v == 0 goto label;
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet of()>();
return v;
label:
v = interfaceinvoke v.<java.lang.Iterable: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: void checkThatNodeIsInTree(java.lang.Object)>(v);
goto label;
label:
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$1;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$1: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser,java.lang.Iterable)>(v, v);
return v;
}
public java.lang.Iterable depthFirstPreOrder(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet v;
java.lang.Object 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;
v := @parameter: java.lang.Object;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet of(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: java.lang.Iterable depthFirstPreOrder(java.lang.Iterable)>(v);
return v;
}
public java.lang.Iterable depthFirstPreOrder(java.lang.Iterable)
{
java.util.Iterator v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet 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.Traverser$TreeTraverser$2 v;
java.lang.Object v;
boolean v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser;
v := @parameter: java.lang.Iterable;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.Iterables: boolean isEmpty(java.lang.Iterable)>(v);
if v == 0 goto label;
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet of()>();
return v;
label:
v = interfaceinvoke v.<java.lang.Iterable: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: void checkThatNodeIsInTree(java.lang.Object)>(v);
goto label;
label:
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$2;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$2: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser,java.lang.Iterable)>(v, v);
return v;
}
public java.lang.Iterable depthFirstPostOrder(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet v;
java.lang.Object 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;
v := @parameter: java.lang.Object;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet of(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: java.lang.Iterable depthFirstPostOrder(java.lang.Iterable)>(v);
return v;
}
public java.lang.Iterable depthFirstPostOrder(java.lang.Iterable)
{
java.util.Iterator v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet 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.Traverser$TreeTraverser$3 v;
java.lang.Object v;
boolean v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser;
v := @parameter: java.lang.Iterable;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.Iterables: boolean isEmpty(java.lang.Iterable)>(v);
if v == 0 goto label;
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.collect.ImmutableSet of()>();
return v;
label:
v = interfaceinvoke v.<java.lang.Iterable: java.util.Iterator iterator()>();
label:
v = interfaceinvoke v.<java.util.Iterator: boolean hasNext()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Iterator: java.lang.Object next()>();
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser: void checkThatNodeIsInTree(java.lang.Object)>(v);
goto label;
label:
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$3;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser$3: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser,java.lang.Iterable)>(v, v);
return v;
}
private void checkThatNodeIsInTree(java.lang.Object)
{
java.lang.Object v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.Traverser$TreeTraverser 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;
v := @parameter: java.lang.Object;
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>;
interfaceinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.SuccessorsFunction: java.lang.Iterable successors(java.lang.Object)>(v);
return;
}
}