abstract class org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph extends java.lang.Object implements org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.BaseGraph
{
void <init>()
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
specialinvoke v.<java.lang.Object: void <init>()>();
return;
}
protected long edgeCount()
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
java.util.Iterator v;
java.util.Set v;
long v, v, v;
byte v;
int v;
java.lang.Object v;
boolean v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v = 0L;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set nodes()>();
v = interfaceinvoke v.<java.util.Set: 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()>();
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: int degree(java.lang.Object)>(v);
v = v + v;
goto label;
label:
v = v & 1L;
v = v cmp 0L;
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: void checkState(boolean)>(v);
v = v >>> 1;
return v;
}
public java.util.Set edges()
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph$1 v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph$1;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph$1: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph)>(v);
return v;
}
public java.util.Set incidentEdges(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
java.util.Set v;
java.lang.Object v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph$2 v;
boolean v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
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 = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set nodes()>();
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: void checkArgument(boolean,java.lang.String,java.lang.Object)>(v, "Node %s is not an element of this graph.", v);
v = new org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph$2;
specialinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph$2: void <init>(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph,org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.BaseGraph,java.lang.Object)>(v, v, v);
return v;
}
public int degree(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
java.util.Set v, v, v;
byte v;
int v, v, v, v, v;
java.lang.Object v;
boolean v, v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: java.lang.Object;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean isDirected()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set predecessors(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Set: int size()>();
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set successors(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Set: int size()>();
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.math.IntMath: int saturatedAdd(int,int)>(v, v);
return v;
label:
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set adjacentNodes(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean allowsSelfLoops()>();
if v == 0 goto label;
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = interfaceinvoke v.<java.util.Set: int size()>();
v = staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.math.IntMath: int saturatedAdd(int,int)>(v, v);
return v;
}
public int inDegree(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
int v;
java.util.Set v;
java.lang.Object v;
boolean v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: java.lang.Object;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean isDirected()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set predecessors(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Set: int size()>();
goto label;
label:
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: int degree(java.lang.Object)>(v);
label:
return v;
}
public int outDegree(java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
int v;
java.util.Set v;
java.lang.Object v;
boolean v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: java.lang.Object;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean isDirected()>();
if v == 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set successors(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Set: int size()>();
goto label;
label:
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: int degree(java.lang.Object)>(v);
label:
return v;
}
public boolean hasEdgeConnecting(java.lang.Object, java.lang.Object)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
java.util.Set v, v;
java.lang.Object v, v;
boolean v, v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: java.lang.Object;
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);
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set nodes()>();
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v == 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set successors(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public boolean hasEdgeConnecting(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
java.util.Set v, v;
java.lang.Object v, v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair v;
boolean v, v, v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean isOrderingCompatible(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair)>(v);
if v != 0 goto label;
return 0;
label:
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair: java.lang.Object nodeU()>();
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair: java.lang.Object nodeV()>();
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set nodes()>();
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v == 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: java.util.Set successors(java.lang.Object)>(v);
v = interfaceinvoke v.<java.util.Set: boolean contains(java.lang.Object)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
protected final void validateEndpoints(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair v;
boolean v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair;
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean isOrderingCompatible(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair)>(v);
staticinvoke <org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.base.Preconditions: void checkArgument(boolean,java.lang.Object)>(v, "Mismatch: unordered endpoints cannot be used with directed graphs");
return;
}
protected final boolean isOrderingCompatible(org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair)
{
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph v;
org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair v;
boolean v, v, v;
v := @this: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph;
v := @parameter: org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.EndpointPair: boolean isOrdered()>();
if v != 0 goto label;
v = virtualinvoke v.<org.apache.hive.kudu.org.apache.kudu.shaded.com.google.common.graph.AbstractBaseGraph: boolean isDirected()>();
if v != 0 goto label;
label:
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
}