final class oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections extends java.lang.Object implements oadd.org.apache.curator.shaded.com.google.common.graph.GraphConnections
{
private static final java.lang.Object PRED;
private final java.util.Map adjacentNodeValues;
private int predecessorCount;
private int successorCount;
private void <init>(java.util.Map, int, int)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.Map v;
int v, v, v, v, v, v;
java.lang.Object v;
boolean v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v := @parameter: java.util.Map;
v := @parameter: int;
v := @parameter: int;
specialinvoke v.<java.lang.Object: void <init>()>();
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues> = v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkNonNegative(int)>(v);
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount> = v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkNonNegative(int)>(v);
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount> = v;
v = interfaceinvoke v.<java.util.Map: int size()>();
if v > v goto label;
v = interfaceinvoke v.<java.util.Map: int size()>();
if v > v goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: void checkState(boolean)>(v);
return;
}
static oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections of()
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.HashMap v;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v = new java.util.HashMap;
specialinvoke v.<java.util.HashMap: void <init>(int,float)>(4, 1.0F);
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: void <init>(java.util.Map,int,int)>(v, 0, 0);
return v;
}
static oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections ofImmutable(java.util.Set, java.util.Map)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc v;
java.util.Iterator v;
java.util.Set v;
java.util.HashMap v;
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
oadd.org.apache.curator.shaded.com.google.common.collect.ImmutableMap v;
java.util.Map v;
int v, v;
java.lang.Object v, v, v;
boolean v;
v := @parameter: java.util.Set;
v := @parameter: java.util.Map;
v = new java.util.HashMap;
specialinvoke v.<java.util.HashMap: void <init>()>();
interfaceinvoke v.<java.util.Map: void putAll(java.util.Map)>(v);
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 = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
if v == null goto label;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: void <init>(java.lang.Object)>(v);
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
goto label;
label:
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.collect.ImmutableMap: oadd.org.apache.curator.shaded.com.google.common.collect.ImmutableMap copyOf(java.util.Map)>(v);
v = interfaceinvoke v.<java.util.Set: int size()>();
v = interfaceinvoke v.<java.util.Map: int size()>();
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: void <init>(java.util.Map,int,int)>(v, v, v);
return v;
}
public java.util.Set adjacentNodes()
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.Map v;
java.util.Set v, v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = interfaceinvoke v.<java.util.Map: java.util.Set keySet()>();
v = staticinvoke <java.util.Collections: java.util.Set unmodifiableSet(java.util.Set)>(v);
return v;
}
public java.util.Set predecessors()
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$1 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$1;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$1: void <init>(oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections)>(v);
return v;
}
public java.util.Set successors()
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$2 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$2;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$2: void <init>(oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections)>(v);
return v;
}
public java.lang.Object value(java.lang.Object)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.Map v;
java.lang.Object v, v, v, v;
boolean v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v := @parameter: java.lang.Object;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object get(java.lang.Object)>(v);
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v != v goto label;
return null;
label:
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
if v == 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: java.lang.Object successorValue>;
return v;
label:
return v;
}
public void removePredecessor(java.lang.Object)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.Map v, v, v;
int v, v, v, v;
java.lang.Object v, v, v, v;
boolean v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v := @parameter: java.lang.Object;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object get(java.lang.Object)>(v);
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v != v goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
interfaceinvoke v.<java.util.Map: java.lang.Object remove(java.lang.Object)>(v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount>;
v = v - 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkNonNegative(int)>(v);
goto label;
label:
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
if v == 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: java.lang.Object successorValue>;
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount>;
v = v - 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkNonNegative(int)>(v);
label:
return;
}
public java.lang.Object removeSuccessor(java.lang.Object)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.Map v, v, v;
int v, v, v, v;
java.lang.Object v, v, v, v, v;
boolean v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v := @parameter: java.lang.Object;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object get(java.lang.Object)>(v);
if v == null goto label;
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v != v goto label;
label:
return null;
label:
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
if v == 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount>;
v = v - 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkNonNegative(int)>(v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: java.lang.Object successorValue>;
return v;
label:
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
interfaceinvoke v.<java.util.Map: java.lang.Object remove(java.lang.Object)>(v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount>;
v = v - 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkNonNegative(int)>(v);
return v;
}
public void addPredecessor(java.lang.Object, java.lang.Object)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc v;
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.util.Map v, v, v;
int v, v, v, v;
java.lang.Object v, v, v, v, v;
boolean v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v := @parameter: java.lang.Object;
v := @parameter: java.lang.Object;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
if v != null goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount>;
v = v + 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkPositive(int)>(v);
goto label;
label:
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
if v == 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
goto label;
label:
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v == v goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: void <init>(java.lang.Object)>(v);
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount>;
v = v + 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int predecessorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkPositive(int)>(v);
label:
return;
}
public java.lang.Object addSuccessor(java.lang.Object, java.lang.Object)
{
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc v, v;
java.util.Map v, v, v;
int v, v, v, v;
boolean v;
oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections v;
java.lang.Object v, v, v, v, v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections;
v := @parameter: java.lang.Object;
v := @parameter: java.lang.Object;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
if v != null goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount>;
v = v + 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkPositive(int)>(v);
return null;
label:
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
if v == 0 goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: void <init>(java.lang.Object)>(v);
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: java.lang.Object successorValue>;
return v;
label:
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v != v goto label;
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.util.Map adjacentNodeValues>;
v = new oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc: void <init>(java.lang.Object)>(v);
interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
v = v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount>;
v = v + 1;
v.<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: int successorCount> = v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.graph.Graphs: int checkPositive(int)>(v);
return null;
label:
return v;
}
private static boolean isPredecessor(java.lang.Object)
{
java.lang.Object v, v;
boolean v, v;
v := @parameter: java.lang.Object;
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v == v goto label;
v = v instanceof oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections$PredAndSucc;
if v == 0 goto label;
label:
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
private static boolean isSuccessor(java.lang.Object)
{
java.lang.Object v, v;
boolean v;
v := @parameter: java.lang.Object;
v = <oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED>;
if v == v goto label;
if v == null goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
static void <clinit>()
{
java.lang.Object v;
v = new java.lang.Object;
specialinvoke v.<java.lang.Object: void <init>()>();
<oadd.org.apache.curator.shaded.com.google.common.graph.DirectedGraphConnections: java.lang.Object PRED> = v;
return;
}
}