class com.google.common.collect.CompactLinkedHashMap extends com.google.common.collect.CompactHashMap
{
private static final int ENDPOINT;
transient long[] links;
private transient int firstEntry;
private transient int lastEntry;
private final boolean accessOrder;
public static com.google.common.collect.CompactLinkedHashMap create()
{
com.google.common.collect.CompactLinkedHashMap v;
v = new com.google.common.collect.CompactLinkedHashMap;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void <init>()>();
return v;
}
public static com.google.common.collect.CompactLinkedHashMap createWithExpectedSize(int)
{
int v;
com.google.common.collect.CompactLinkedHashMap v;
v := @parameter: int;
v = new com.google.common.collect.CompactLinkedHashMap;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void <init>(int)>(v);
return v;
}
void <init>()
{
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void <init>(int)>(3);
return;
}
void <init>(int)
{
int v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void <init>(int,boolean)>(v, 0);
return;
}
void <init>(int, boolean)
{
int v;
com.google.common.collect.CompactLinkedHashMap v;
boolean v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: boolean;
specialinvoke v.<com.google.common.collect.CompactHashMap: void <init>(int)>(v);
v.<com.google.common.collect.CompactLinkedHashMap: boolean accessOrder> = v;
return;
}
void init(int)
{
int v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashMap: void init(int)>(v);
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashMap: int firstEntry> = v;
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashMap: int lastEntry> = v;
return;
}
int allocArrays()
{
int v;
com.google.common.collect.CompactLinkedHashMap v;
long[] v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = specialinvoke v.<com.google.common.collect.CompactHashMap: int allocArrays()>();
v = newarray (long)[v];
v.<com.google.common.collect.CompactLinkedHashMap: long[] links> = v;
return v;
}
java.util.Map createHashFloodingResistantDelegate(int)
{
java.util.LinkedHashMap v;
int v;
com.google.common.collect.CompactLinkedHashMap v;
boolean v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v = new java.util.LinkedHashMap;
v = v.<com.google.common.collect.CompactLinkedHashMap: boolean accessOrder>;
specialinvoke v.<java.util.LinkedHashMap: void <init>(int,float,boolean)>(v, 1.0F, v);
return v;
}
java.util.Map convertToHashFloodingResistantImplementation()
{
com.google.common.collect.CompactLinkedHashMap v;
java.util.Map v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = specialinvoke v.<com.google.common.collect.CompactHashMap: java.util.Map convertToHashFloodingResistantImplementation()>();
v.<com.google.common.collect.CompactLinkedHashMap: long[] links> = null;
return v;
}
private int getPredecessor(int)
{
int v, v;
long v, v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long link(int)>(v);
v = v >>> 32;
v = v - 1;
return v;
}
int getSuccessor(int)
{
int v, v;
long v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long link(int)>(v);
v = v - 1;
return v;
}
private void setSuccessor(int, int)
{
long v, v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
int v, v, v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long link(int)>(v);
v = v & -4294967296L;
v = v + 1;
v = v & 4294967295L;
v = v | v;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setLink(int,long)>(v, v);
return;
}
private void setPredecessor(int, int)
{
long v, v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
int v, v, v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long link(int)>(v);
v = v & 4294967295L;
v = v + 1;
v = v << 32;
v = v | v;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setLink(int,long)>(v, v);
return;
}
private void setSucceeds(int, int)
{
int v, v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: int;
v = (int) -2;
if v != v goto label;
v.<com.google.common.collect.CompactLinkedHashMap: int firstEntry> = v;
goto label;
label:
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSuccessor(int,int)>(v, v);
label:
v = (int) -2;
if v != v goto label;
v.<com.google.common.collect.CompactLinkedHashMap: int lastEntry> = v;
goto label;
label:
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setPredecessor(int,int)>(v, v);
label:
return;
}
void insertEntry(int, java.lang.Object, java.lang.Object, int, int)
{
com.google.common.collect.CompactLinkedHashMap v;
int v, v, v, v, v;
java.lang.Object v, v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: java.lang.Object;
v := @parameter: java.lang.Object;
v := @parameter: int;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashMap: void insertEntry(int,java.lang.Object,java.lang.Object,int,int)>(v, v, v, v, v);
v = v.<com.google.common.collect.CompactLinkedHashMap: int lastEntry>;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
v = (int) -2;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
return;
}
void accessEntry(int)
{
int v, v, v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
boolean v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v = v.<com.google.common.collect.CompactLinkedHashMap: boolean accessOrder>;
if v == 0 goto label;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: int getPredecessor(int)>(v);
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: int getSuccessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
v = v.<com.google.common.collect.CompactLinkedHashMap: int lastEntry>;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
v = (int) -2;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: void incrementModCount()>();
label:
return;
}
void moveLastEntry(int, int)
{
com.google.common.collect.CompactLinkedHashMap v;
int v, v, v, v, v, v, v, v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: int;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: int size()>();
v = v - 1;
specialinvoke v.<com.google.common.collect.CompactHashMap: void moveLastEntry(int,int)>(v, v);
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: int getPredecessor(int)>(v);
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: int getSuccessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
if v >= v goto label;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: int getPredecessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: int getSuccessor(int)>(v);
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setSucceeds(int,int)>(v, v);
label:
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: void setLink(int,long)>(v, 0L);
return;
}
void resizeEntries(int)
{
long[] v, v;
int v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
specialinvoke v.<com.google.common.collect.CompactHashMap: void resizeEntries(int)>(v);
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long[] requireLinks()>();
v = staticinvoke <java.util.Arrays: long[] copyOf(long[],int)>(v, v);
v.<com.google.common.collect.CompactLinkedHashMap: long[] links> = v;
return;
}
int firstEntryIndex()
{
int v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = v.<com.google.common.collect.CompactLinkedHashMap: int firstEntry>;
return v;
}
int adjustAfterRemove(int, int)
{
int v, v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: int;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: int size()>();
if v < v goto label;
v = v;
goto label;
label:
v = v;
label:
return v;
}
java.util.Set createEntrySet()
{
com.google.common.collect.CompactLinkedHashMap v;
com.google.common.collect.CompactLinkedHashMap$1EntrySetImpl v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = new com.google.common.collect.CompactLinkedHashMap$1EntrySetImpl;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap$1EntrySetImpl: void <init>(com.google.common.collect.CompactLinkedHashMap)>(v);
return v;
}
java.util.Set createKeySet()
{
com.google.common.collect.CompactLinkedHashMap v;
com.google.common.collect.CompactLinkedHashMap$1KeySetImpl v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = new com.google.common.collect.CompactLinkedHashMap$1KeySetImpl;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap$1KeySetImpl: void <init>(com.google.common.collect.CompactLinkedHashMap)>(v);
return v;
}
java.util.Collection createValues()
{
com.google.common.collect.CompactLinkedHashMap v;
com.google.common.collect.CompactLinkedHashMap$1ValuesImpl v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = new com.google.common.collect.CompactLinkedHashMap$1ValuesImpl;
specialinvoke v.<com.google.common.collect.CompactLinkedHashMap$1ValuesImpl: void <init>(com.google.common.collect.CompactLinkedHashMap)>(v);
return v;
}
public void clear()
{
long[] v, v;
int v, v, v;
com.google.common.collect.CompactLinkedHashMap v;
boolean v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: boolean needsAllocArrays()>();
if v == 0 goto label;
return;
label:
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashMap: int firstEntry> = v;
v = (int) -2;
v.<com.google.common.collect.CompactLinkedHashMap: int lastEntry> = v;
v = v.<com.google.common.collect.CompactLinkedHashMap: long[] links>;
if v == null goto label;
v = v.<com.google.common.collect.CompactLinkedHashMap: long[] links>;
v = virtualinvoke v.<com.google.common.collect.CompactLinkedHashMap: int size()>();
staticinvoke <java.util.Arrays: void fill(long[],int,int,long)>(v, 0, v, 0L);
label:
specialinvoke v.<com.google.common.collect.CompactHashMap: void clear()>();
return;
}
private long[] requireLinks()
{
java.lang.Object v;
com.google.common.collect.CompactLinkedHashMap v;
long[] v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v = v.<com.google.common.collect.CompactLinkedHashMap: long[] links>;
v = staticinvoke <java.util.Objects: java.lang.Object requireNonNull(java.lang.Object)>(v);
return v;
}
private long link(int)
{
long[] v;
int v;
long v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long[] requireLinks()>();
v = v[v];
return v;
}
private void setLink(int, long)
{
long[] v;
int v;
long v;
com.google.common.collect.CompactLinkedHashMap v;
v := @this: com.google.common.collect.CompactLinkedHashMap;
v := @parameter: int;
v := @parameter: long;
v = specialinvoke v.<com.google.common.collect.CompactLinkedHashMap: long[] requireLinks()>();
v[v] = v;
return;
}
}