class com.google.common.collect.CompactLinkedHashSet extends com.google.common.collect.CompactHashSet
{
private static final int ENDPOINT;
private transient int[] predecessor;
private transient int[] successor;
private transient int firstEntry;
private transient int lastEntry;
public static com.google.common.collect.CompactLinkedHashSet create()
{
com.google.common.collect.CompactLinkedHashSet v;
v = new com.google.common.collect.CompactLinkedHashSet;
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void <init>()>();
return v;
}
public static com.google.common.collect.CompactLinkedHashSet create(java.util.Collection)
{
int v;
com.google.common.collect.CompactLinkedHashSet v;
java.util.Collection v;
v := @parameter: java.util.Collection;
v = interfaceinvoke v.<java.util.Collection: int size()>();
v = staticinvoke <com.google.common.collect.CompactLinkedHashSet: com.google.common.collect.CompactLinkedHashSet createWithExpectedSize(int)>(v);
virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: boolean addAll(java.util.Collection)>(v);
return v;
}
public static transient com.google.common.collect.CompactLinkedHashSet create(java.lang.Object[])
{
int v;
java.lang.Object[] v;
com.google.common.collect.CompactLinkedHashSet v;
v := @parameter: java.lang.Object[];
v = lengthof v;
v = staticinvoke <com.google.common.collect.CompactLinkedHashSet: com.google.common.collect.CompactLinkedHashSet createWithExpectedSize(int)>(v);
staticinvoke <java.util.Collections: boolean addAll(java.util.Collection,java.lang.Object[])>(v, v);
return v;
}
public static com.google.common.collect.CompactLinkedHashSet createWithExpectedSize(int)
{
int v;
com.google.common.collect.CompactLinkedHashSet v;
v := @parameter: int;
v = new com.google.common.collect.CompactLinkedHashSet;
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void <init>(int)>(v);
return v;
}
void <init>()
{
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
specialinvoke v.<com.google.common.collect.CompactHashSet: void <init>()>();
return;
}
void <init>(int)
{
int v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashSet: void <init>(int)>(v);
return;
}
void init(int)
{
int v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashSet: void init(int)>(v);
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashSet: int firstEntry> = v;
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashSet: int lastEntry> = v;
return;
}
int allocArrays()
{
int[] v, v;
int v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = specialinvoke v.<com.google.common.collect.CompactHashSet: int allocArrays()>();
v = newarray (int)[v];
v.<com.google.common.collect.CompactLinkedHashSet: int[] predecessor> = v;
v = newarray (int)[v];
v.<com.google.common.collect.CompactLinkedHashSet: int[] successor> = v;
return v;
}
java.util.Set convertToHashFloodingResistantImplementation()
{
java.util.Set v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = specialinvoke v.<com.google.common.collect.CompactHashSet: java.util.Set convertToHashFloodingResistantImplementation()>();
v.<com.google.common.collect.CompactLinkedHashSet: int[] predecessor> = null;
v.<com.google.common.collect.CompactLinkedHashSet: int[] successor> = null;
return v;
}
private int getPredecessor(int)
{
int[] v;
int v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requirePredecessors()>();
v = v[v];
v = v - 1;
return v;
}
int getSuccessor(int)
{
int[] v;
int v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requireSuccessors()>();
v = v[v];
v = v - 1;
return v;
}
private void setSuccessor(int, int)
{
int[] v;
int v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requireSuccessors()>();
v = v + 1;
v[v] = v;
return;
}
private void setPredecessor(int, int)
{
int[] v;
int v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requirePredecessors()>();
v = v + 1;
v[v] = v;
return;
}
private void setSucceeds(int, int)
{
int v, v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v := @parameter: int;
v = (int) -2;
if v != v goto label;
v.<com.google.common.collect.CompactLinkedHashSet: int firstEntry> = v;
goto label;
label:
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setSuccessor(int,int)>(v, v);
label:
v = (int) -2;
if v != v goto label;
v.<com.google.common.collect.CompactLinkedHashSet: int lastEntry> = v;
goto label;
label:
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setPredecessor(int,int)>(v, v);
label:
return;
}
void insertEntry(int, java.lang.Object, int, int)
{
int v, v, v, v, v;
java.lang.Object v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v := @parameter: java.lang.Object;
v := @parameter: int;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashSet: void insertEntry(int,java.lang.Object,int,int)>(v, v, v, v);
v = v.<com.google.common.collect.CompactLinkedHashSet: int lastEntry>;
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setSucceeds(int,int)>(v, v);
v = (int) -2;
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setSucceeds(int,int)>(v, v);
return;
}
void moveLastEntry(int, int)
{
com.google.common.collect.CompactLinkedHashSet v;
int[] v, v;
int v, v, v, v, v, v, v, v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v := @parameter: int;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: int size()>();
v = v - 1;
specialinvoke v.<com.google.common.collect.CompactHashSet: void moveLastEntry(int,int)>(v, v);
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int getPredecessor(int)>(v);
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: int getSuccessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setSucceeds(int,int)>(v, v);
if v >= v goto label;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int getPredecessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setSucceeds(int,int)>(v, v);
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: int getSuccessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: void setSucceeds(int,int)>(v, v);
label:
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requirePredecessors()>();
v[v] = 0;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requireSuccessors()>();
v[v] = 0;
return;
}
void resizeEntries(int)
{
int[] v, v, v, v;
int v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashSet: void resizeEntries(int)>(v);
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requirePredecessors()>();
v = staticinvoke <java.util.Arrays: int[] copyOf(int[],int)>(v, v);
v.<com.google.common.collect.CompactLinkedHashSet: int[] predecessor> = v;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashSet: int[] requireSuccessors()>();
v = staticinvoke <java.util.Arrays: int[] copyOf(int[],int)>(v, v);
v.<com.google.common.collect.CompactLinkedHashSet: int[] successor> = v;
return;
}
int firstEntryIndex()
{
int v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = v.<com.google.common.collect.CompactLinkedHashSet: int firstEntry>;
return v;
}
int adjustAfterRemove(int, int)
{
int v, v, v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: int;
v := @parameter: int;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: int size()>();
if v < v goto label;
v = v;
goto label;
label:
v = v;
label:
return v;
}
public java.lang.Object[] toArray()
{
java.lang.Object[] v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = staticinvoke <com.google.common.collect.ObjectArrays: java.lang.Object[] toArrayImpl(java.util.Collection)>(v);
return v;
}
public java.lang.Object[] toArray(java.lang.Object[])
{
java.lang.Object[] v, v;
com.google.common.collect.CompactLinkedHashSet v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v := @parameter: java.lang.Object[];
v = staticinvoke <com.google.common.collect.ObjectArrays: java.lang.Object[] toArrayImpl(java.util.Collection,java.lang.Object[])>(v, v);
return v;
}
public java.util.Spliterator spliterator()
{
com.google.common.collect.CompactLinkedHashSet v;
java.util.Spliterator v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = staticinvoke <java.util.Spliterators: java.util.Spliterator spliterator(java.util.Collection,int)>(v, 17);
return v;
}
public void clear()
{
com.google.common.collect.CompactLinkedHashSet v;
int[] v, v, v, v;
int v, v, v, v;
boolean v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: boolean needsAllocArrays()>();
if v == 0 goto label;
return;
label:
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashSet: int firstEntry> = v;
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashSet: int lastEntry> = v;
v = v.<com.google.common.collect.CompactLinkedHashSet: int[] predecessor>;
if v == null goto label;
v = v.<com.google.common.collect.CompactLinkedHashSet: int[] successor>;
if v == null goto label;
v = v.<com.google.common.collect.CompactLinkedHashSet: int[] predecessor>;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: int size()>();
staticinvoke <java.util.Arrays: void fill(int[],int,int,int)>(v, 0, v, 0);
v = v.<com.google.common.collect.CompactLinkedHashSet: int[] successor>;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashSet: int size()>();
staticinvoke <java.util.Arrays: void fill(int[],int,int,int)>(v, 0, v, 0);
label:
specialinvoke v.<com.google.common.collect.CompactHashSet: void clear()>();
return;
}
private int[] requirePredecessors()
{
java.lang.Object v;
com.google.common.collect.CompactLinkedHashSet v;
int[] v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = v.<com.google.common.collect.CompactLinkedHashSet: int[] predecessor>;
v = staticinvoke <java.util.Objects: java.lang.Object requireNonNull(java.lang.Object)>(v);
return v;
}
private int[] requireSuccessors()
{
java.lang.Object v;
com.google.common.collect.CompactLinkedHashSet v;
int[] v;
v := @this: com.google.common.collect.CompactLinkedHashSet;
v = v.<com.google.common.collect.CompactLinkedHashSet: int[] successor>;
v = staticinvoke <java.util.Objects: java.lang.Object requireNonNull(java.lang.Object)>(v);
return v;
}
}