public class oadd.com.carrotsearch.hppc.ShortLongHashMap extends java.lang.Object implements oadd.com.carrotsearch.hppc.ShortLongMap, oadd.com.carrotsearch.hppc.Preallocable, java.lang.Cloneable
{
public short[] keys;
public long[] values;
protected int keyMixer;
protected int assigned;
protected int mask;
protected int resizeAt;
protected boolean hasEmptyKey;
protected double loadFactor;
protected oadd.com.carrotsearch.hppc.HashOrderMixingStrategy orderMixer;
static final boolean $assertionsDisabled;
public void <init>()
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void <init>(int)>(4);
return;
}
public void <init>(int)
{
int v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void <init>(int,double)>(v, 0.75);
return;
}
public void <init>(int, double)
{
oadd.com.carrotsearch.hppc.HashOrderMixingStrategy v;
int v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
double v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v := @parameter: double;
v = staticinvoke <oadd.com.carrotsearch.hppc.HashOrderMixing: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy defaultStrategy()>();
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void <init>(int,double,oadd.com.carrotsearch.hppc.HashOrderMixingStrategy)>(v, v, v);
return;
}
public void <init>(int, double, oadd.com.carrotsearch.hppc.HashOrderMixingStrategy)
{
oadd.com.carrotsearch.hppc.HashOrderMixingStrategy v;
int v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
double v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v := @parameter: double;
v := @parameter: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy;
specialinvoke v.<java.lang.Object: void <init>()>();
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy orderMixer> = v;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: double verifyLoadFactor(double)>(v);
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: double loadFactor> = v;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void ensureCapacity(int)>(v);
return;
}
public void <init>(oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer)
{
int v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer: int size()>();
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void <init>(int)>(v);
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int putAll(oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer)>(v);
return;
}
public long put(short, long)
{
long v, v, v;
java.lang.AssertionError v;
short v, v;
long[] v, v, v, v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v;
boolean v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v := @parameter: long;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
if v < v goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
if v != 0 goto label;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 1;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v + 1;
v = v[v];
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v + 1;
v[v] = v;
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v[v];
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v[v] = v;
return v;
label:
v = v + 1;
v = v & v;
goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int resizeAt>;
if v != v goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void allocateThenInsertThenRehash(int,short,long)>(v, v, v);
goto label;
label:
v[v] = v;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v[v] = v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v + 1;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned> = v;
return 0L;
}
public int putAll(oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer)
{
java.util.Iterator v;
oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
short v;
int v, v, v;
java.lang.Object v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ShortLongAssociativeContainer: 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 = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: short key>;
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: long value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long put(short,long)>(v, v);
goto label;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v - v;
return v;
}
public int putAll(java.lang.Iterable)
{
java.util.Iterator v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
java.lang.Iterable v;
short v;
int v, v, v;
java.lang.Object v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: java.lang.Iterable;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
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()>();
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: short key>;
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: long value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long put(short,long)>(v, v);
goto label;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v - v;
return v;
}
public boolean putIfAbsent(short, long)
{
short v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v := @parameter: long;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean containsKey(short)>(v);
if v != 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long put(short,long)>(v, v);
return 1;
label:
return 0;
}
public long putOrAdd(short, long, long)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v, v;
java.lang.AssertionError v;
short v;
int v, v, v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v := @parameter: long;
v := @parameter: long;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
if v < v goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean containsKey(short)>(v);
if v == 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long get(short)>(v);
v = v + v;
label:
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long put(short,long)>(v, v);
return v;
}
public long addTo(short, long)
{
short v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v := @parameter: long;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long putOrAdd(short,long,long)>(v, v, v);
return v;
}
public long remove(short)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v;
short v, v;
long[] v, v, v;
int v, v, v, v, v, v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
if v != 0 goto label;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v + 1;
v = v[v];
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v + 1;
v[v] = 0L;
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v[v];
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void shiftConflictingKeys(int)>(v);
return v;
label:
v = v + 1;
v = v & v;
goto label;
label:
return 0L;
}
public int removeAll(oadd.com.carrotsearch.hppc.ShortContainer)
{
oadd.com.carrotsearch.hppc.ShortContainer v;
short v, v;
long[] v;
int v, v, v, v, v, v, v, v, v;
boolean v, v, v, v, v;
java.util.Iterator v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
java.lang.Object v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.ShortContainer;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ShortContainer: int size()>();
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
if v < v goto label;
v = v instanceof oadd.com.carrotsearch.hppc.ShortLookupContainer;
if v == 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ShortContainer: boolean contains(short)>(0);
if v == 0 goto label;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v[v] = 0L;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
label:
if v > v goto label;
v = v[v];
if v == 0 goto label;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ShortContainer: boolean contains(short)>(v);
if v == 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void shiftConflictingKeys(int)>(v);
goto label;
label:
v = v + 1;
goto label;
label:
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.ShortContainer: 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 = v.<oadd.com.carrotsearch.hppc.cursors.ShortCursor: short value>;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long remove(short)>(v);
goto label;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v - v;
return v;
}
public int removeAll(oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate)
{
long v, v;
short v;
long[] v, v, v;
int v, v, v, v, v, v, v;
boolean v, v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v + 1;
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate: boolean apply(short,long)>(0, v);
if v == 0 goto label;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v + 1;
v[v] = 0L;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = 0;
label:
if v > v goto label;
v = v[v];
if v == 0 goto label;
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate: boolean apply(short,long)>(v, v);
if v == 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void shiftConflictingKeys(int)>(v);
goto label;
label:
v = v + 1;
goto label;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v - v;
return v;
}
public int removeAll(oadd.com.carrotsearch.hppc.predicates.ShortPredicate)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
oadd.com.carrotsearch.hppc.predicates.ShortPredicate v;
short v;
long[] v;
int v, v, v, v, v, v, v;
short[] v;
boolean v, v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.ShortPredicate;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.ShortPredicate: boolean apply(short)>(0);
if v == 0 goto label;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v[v] = 0L;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
label:
if v > v goto label;
v = v[v];
if v == 0 goto label;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.ShortPredicate: boolean apply(short)>(v);
if v == 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void shiftConflictingKeys(int)>(v);
goto label;
label:
v = v + 1;
goto label;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v - v;
return v;
}
public long get(short)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v;
short v, v;
long[] v, v;
int v, v, v, v, v, v;
short[] v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v = v[v];
goto label;
label:
v = 0L;
label:
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v[v];
return v;
label:
v = v + 1;
v = v & v;
goto label;
label:
return 0L;
}
public long getOrDefault(short, long)
{
long v, v, v;
short v, v;
long[] v, v;
int v, v, v, v, v, v;
boolean v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v := @parameter: long;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v = v[v];
goto label;
label:
v = v;
label:
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v[v];
return v;
label:
v = v + 1;
v = v & v;
goto label;
label:
return v;
}
public boolean containsKey(short)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short v, v;
int v, v, v, v;
short[] v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
if v != v goto label;
return 1;
label:
v = v + 1;
v = v & v;
goto label;
label:
return 0;
}
public int indexOf(short)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short v, v;
int v, v, v, v, v, v, v, v, v;
short[] v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = v + 1;
goto label;
label:
v = v + 1;
v = (int) -1;
v = v ^ v;
label:
return v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
if v != v goto label;
return v;
label:
v = v + 1;
v = v & v;
goto label;
label:
v = (int) -1;
v = v ^ v;
return v;
}
public boolean indexExists(int)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
java.lang.AssertionError v;
int v, v, v, v;
boolean v, v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
if v < 0 goto label;
if v < 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
if v <= v goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v != 0 goto label;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
if v < 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public long indexGet(int)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
java.lang.AssertionError v, v;
long[] v;
int v, v, v, v;
boolean v, v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
if v >= 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The index must point at an existing key.");
throw v;
label:
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
if v <= v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v != 0 goto label;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v[v];
return v;
}
public long indexReplace(int, long)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v;
java.lang.AssertionError v, v;
long[] v, v;
int v, v, v, v;
boolean v, v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v := @parameter: long;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
if v >= 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The index must point at an existing key.");
throw v;
label:
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
if v <= v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v != 0 goto label;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v[v];
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v[v] = v;
return v;
}
public void indexInsert(int, short, long)
{
long v;
java.lang.AssertionError v, v, v;
short v, v;
long[] v, v;
int v, v, v, v, v, v, v, v, v;
boolean v, v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v := @parameter: short;
v := @parameter: long;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
if v < 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>(java.lang.Object)>("The index must not point at an existing key.");
throw v;
label:
v = (int) -1;
v = v ^ v;
if v != 0 goto label;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
if v == v goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v[v] = v;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 1;
goto label;
label:
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v[v];
if v == 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int resizeAt>;
if v != v goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void allocateThenInsertThenRehash(int,short,long)>(v, v, v);
goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v[v] = v;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v[v] = v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v + 1;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned> = v;
label:
return;
}
public void clear()
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned> = 0;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
staticinvoke <java.util.Arrays: void fill(short[],short)>(v, 0);
return;
}
public void release()
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned> = 0;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = 0;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys> = null;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values> = null;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void ensureCapacity(int)>(4);
return;
}
public int size()
{
int v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v + v;
return v;
}
public boolean isEmpty()
{
int v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public int hashCode()
{
java.util.Iterator v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
short v;
int v, v, v, v, v;
java.lang.Object v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = -559038737;
goto label;
label:
v = 0;
label:
v = v;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: 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 = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: short key>;
v = staticinvoke <oadd.com.carrotsearch.hppc.BitMixer: int mix(short)>(v);
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: long value>;
v = staticinvoke <oadd.com.carrotsearch.hppc.BitMixer: int mix(long)>(v);
v = v + v;
v = v + v;
goto label;
label:
return v;
}
public boolean equals(java.lang.Object)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
java.lang.Class v, v, v;
java.lang.Object v, v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: java.lang.Object;
if v == null goto label;
v = virtualinvoke v.<java.lang.Object: java.lang.Class getClass()>();
v = virtualinvoke v.<java.lang.Object: java.lang.Class getClass()>();
if v != v goto label;
v = virtualinvoke v.<java.lang.Object: java.lang.Class getClass()>();
v = virtualinvoke v.<java.lang.Class: java.lang.Object cast(java.lang.Object)>(v);
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean equalElements(oadd.com.carrotsearch.hppc.ShortLongHashMap)>(v);
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
protected boolean equalElements(oadd.com.carrotsearch.hppc.ShortLongHashMap)
{
java.util.Iterator v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v, v;
long v, v;
short v;
byte v;
int v, v;
java.lang.Object v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
if v == v goto label;
return 0;
label:
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: 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 = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: short key>;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean containsKey(short)>(v);
if v == 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long get(short)>(v);
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: long value>;
v = v cmp v;
if v == 0 goto label;
label:
return 0;
label:
return 1;
}
public void ensureCapacity(int)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long[] v;
int v, v, v;
short[] v, v;
boolean v;
double v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int resizeAt>;
if v > v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
if v != null goto label;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: double loadFactor>;
v = staticinvoke <oadd.com.carrotsearch.hppc.HashContainers: int minBufferSize(int,double)>(v, v);
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void allocateBuffers(int)>(v);
if v == null goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean isEmpty()>();
if v != 0 goto label;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void rehash(short[],long[])>(v, v);
label:
return;
}
public java.util.Iterator iterator()
{
oadd.com.carrotsearch.hppc.ShortLongHashMap$EntryIterator v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = new oadd.com.carrotsearch.hppc.ShortLongHashMap$EntryIterator;
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap$EntryIterator: void <init>(oadd.com.carrotsearch.hppc.ShortLongHashMap)>(v);
return v;
}
public oadd.com.carrotsearch.hppc.procedures.ShortLongProcedure forEach(oadd.com.carrotsearch.hppc.procedures.ShortLongProcedure)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v;
short v, v;
long[] v;
int v, v, v, v;
short[] v;
oadd.com.carrotsearch.hppc.procedures.ShortLongProcedure v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.procedures.ShortLongProcedure;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v = v[v];
interfaceinvoke v.<oadd.com.carrotsearch.hppc.procedures.ShortLongProcedure: void apply(short,long)>(0, v);
label:
v = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
label:
if v > v goto label;
v = v[v];
if v == 0 goto label;
v = v[v];
v = v[v];
interfaceinvoke v.<oadd.com.carrotsearch.hppc.procedures.ShortLongProcedure: void apply(short,long)>(v, v);
label:
v = v + 1;
goto label;
label:
return v;
}
public oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate forEach(oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v, v;
oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate v;
short v, v;
long[] v;
int v, v, v, v;
short[] v;
boolean v, v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
if v == 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate: boolean apply(short,long)>(0, v);
if v != 0 goto label;
return v;
label:
v = 0;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
label:
if v > v goto label;
v = v[v];
if v == 0 goto label;
v = v[v];
v = v[v];
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.predicates.ShortLongPredicate: boolean apply(short,long)>(v, v);
if v == 0 goto label;
label:
v = v + 1;
goto label;
label:
return v;
}
public oadd.com.carrotsearch.hppc.ShortLongHashMap$KeysContainer keys()
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
oadd.com.carrotsearch.hppc.ShortLongHashMap$KeysContainer v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = new oadd.com.carrotsearch.hppc.ShortLongHashMap$KeysContainer;
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap$KeysContainer: void <init>(oadd.com.carrotsearch.hppc.ShortLongHashMap)>(v);
return v;
}
public oadd.com.carrotsearch.hppc.LongCollection values()
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
oadd.com.carrotsearch.hppc.ShortLongHashMap$ValuesContainer v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = new oadd.com.carrotsearch.hppc.ShortLongHashMap$ValuesContainer;
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap$ValuesContainer: void <init>(oadd.com.carrotsearch.hppc.ShortLongHashMap)>(v);
return v;
}
public oadd.com.carrotsearch.hppc.ShortLongHashMap clone()
{
oadd.com.carrotsearch.hppc.HashOrderMixingStrategy v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
java.lang.RuntimeException v;
java.lang.CloneNotSupportedException v;
long[] v;
java.lang.Object v, v, v;
short[] v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
label:
v = specialinvoke v.<java.lang.Object: java.lang.Object clone()>();
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = virtualinvoke v.<java.lang.Object: java.lang.Object clone()>();
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys> = v;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = virtualinvoke v.<java.lang.Object: java.lang.Object clone()>();
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values> = v;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey>;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean hasEmptyKey> = v;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy orderMixer>;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.HashOrderMixingStrategy: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy clone()>();
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy orderMixer> = v;
label:
return v;
label:
v := @caughtexception;
v = new java.lang.RuntimeException;
specialinvoke v.<java.lang.RuntimeException: void <init>(java.lang.Throwable)>(v);
throw v;
catch java.lang.CloneNotSupportedException from label to label with label;
}
public java.lang.String toString()
{
java.util.Iterator v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
short v;
java.lang.Object v;
java.lang.StringBuilder v;
java.lang.String v;
boolean v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = new java.lang.StringBuilder;
specialinvoke v.<java.lang.StringBuilder: void <init>()>();
virtualinvoke v.<java.lang.StringBuilder: java.lang.StringBuilder append(java.lang.String)>("[");
v = 1;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: 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()>();
if v != 0 goto label;
virtualinvoke v.<java.lang.StringBuilder: java.lang.StringBuilder append(java.lang.String)>(", ");
label:
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: short key>;
virtualinvoke v.<java.lang.StringBuilder: java.lang.StringBuilder append(int)>(v);
virtualinvoke v.<java.lang.StringBuilder: java.lang.StringBuilder append(java.lang.String)>("=>");
v = v.<oadd.com.carrotsearch.hppc.cursors.ShortLongCursor: long value>;
virtualinvoke v.<java.lang.StringBuilder: java.lang.StringBuilder append(long)>(v);
v = 0;
goto label;
label:
virtualinvoke v.<java.lang.StringBuilder: java.lang.StringBuilder append(java.lang.String)>("]");
v = virtualinvoke v.<java.lang.StringBuilder: java.lang.String toString()>();
return v;
}
public java.lang.String visualizeKeyDistribution(int)
{
int v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
java.lang.String v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = staticinvoke <oadd.com.carrotsearch.hppc.ShortBufferVisualizer: java.lang.String visualizeKeyDistribution(short[],int,int)>(v, v, v);
return v;
}
public static oadd.com.carrotsearch.hppc.ShortLongHashMap 'from'(short[], long[])
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
java.lang.IllegalArgumentException v;
short v;
long[] v;
int v, v, v, v, v;
short[] v;
v := @parameter: short[];
v := @parameter: long[];
v = lengthof v;
v = lengthof v;
if v == v goto label;
v = new java.lang.IllegalArgumentException;
specialinvoke v.<java.lang.IllegalArgumentException: void <init>(java.lang.String)>("Arrays of keys and values must have an identical length.");
throw v;
label:
v = new oadd.com.carrotsearch.hppc.ShortLongHashMap;
v = lengthof v;
specialinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void <init>(int)>(v);
v = 0;
label:
v = lengthof v;
if v >= v goto label;
v = v[v];
v = v[v];
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long put(short,long)>(v, v);
v = v + 1;
goto label;
label:
return v;
}
protected int hashKey(short)
{
short v;
int v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
java.lang.AssertionError v;
boolean v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
if v != 0 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int keyMixer>;
v = staticinvoke <oadd.com.carrotsearch.hppc.BitMixer: int mix(short,int)>(v, v);
return v;
}
protected double verifyLoadFactor(double)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
double v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: double;
staticinvoke <oadd.com.carrotsearch.hppc.HashContainers: void checkLoadFactor(double,double,double)>(v, 0.009999999776482582, 0.9900000095367432);
return v;
}
protected void rehash(short[], long[])
{
long v, v;
java.lang.AssertionError v;
short v, v, v;
long[] v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v;
boolean v, v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: short[];
v := @parameter: long[];
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = lengthof v;
v = lengthof v;
if v != v goto label;
v = lengthof v;
v = v - 1;
v = staticinvoke <oadd.com.carrotsearch.hppc.HashContainers: boolean checkPowerOfTwo(int)>(v);
if v != 0 goto label;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = lengthof v;
v = v - 1;
v = lengthof v;
v = v - 1;
v = v[v];
v[v] = v;
v = lengthof v;
v = v - 1;
v = v[v];
v[v] = v;
label:
v = v - 1;
if v < 0 goto label;
v = v[v];
if v == 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v & v;
label:
v = v[v];
if v == 0 goto label;
v = v + 1;
v = v & v;
goto label;
label:
v[v] = v;
v = v[v];
v[v] = v;
goto label;
label:
return;
}
protected void allocateBuffers(int)
{
java.lang.Object[] v;
java.lang.AssertionError v;
java.lang.Integer v, v;
long[] v, v;
int v, v, v, v, v, v, v, v, v;
boolean v;
double v;
oadd.com.carrotsearch.hppc.BufferAllocationException v;
oadd.com.carrotsearch.hppc.HashOrderMixingStrategy v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v, v;
java.lang.OutOfMemoryError v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = staticinvoke <java.lang.Integer: int bitCount(int)>(v);
if v == 1 goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: oadd.com.carrotsearch.hppc.HashOrderMixingStrategy orderMixer>;
v = interfaceinvoke v.<oadd.com.carrotsearch.hppc.HashOrderMixingStrategy: int newKeyMixer(int)>(v);
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
label:
v = v + 1;
v = newarray (short)[v];
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys> = v;
v = v + 1;
v = newarray (long)[v];
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values> = v;
label:
goto label;
label:
v := @caughtexception;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys> = v;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values> = v;
v = new oadd.com.carrotsearch.hppc.BufferAllocationException;
v = newarray (java.lang.Object)[2];
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
v[0] = v;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
v[1] = v;
specialinvoke v.<oadd.com.carrotsearch.hppc.BufferAllocationException: void <init>(java.lang.String,java.lang.Throwable,java.lang.Object[])>("Not enough memory to allocate buffers for rehashing: %,d -> %,d", v, v);
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: double loadFactor>;
v = staticinvoke <oadd.com.carrotsearch.hppc.HashContainers: int expandAtCount(int,double)>(v, v);
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int resizeAt> = v;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int keyMixer> = v;
v = v - 1;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask> = v;
return;
catch java.lang.OutOfMemoryError from label to label with label;
}
protected void allocateThenInsertThenRehash(int, short, long)
{
long v;
java.lang.AssertionError v, v;
short v, v;
long[] v;
int v, v, v, v, v, v, v, v, v;
boolean v, v;
double v;
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
short[] v, v, v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v := @parameter: short;
v := @parameter: long;
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int resizeAt>;
if v != v goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v[v];
if v != 0 goto label;
if v != 0 goto label;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = v + 1;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int size()>();
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: double loadFactor>;
v = staticinvoke <oadd.com.carrotsearch.hppc.HashContainers: int nextBufferSize(int,int,double)>(v, v, v);
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void allocateBuffers(int)>(v);
v = <oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled>;
if v != 0 goto label;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = lengthof v;
v = lengthof v;
if v > v goto label;
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
v[v] = v;
v[v] = v;
virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: void rehash(short[],long[])>(v, v);
return;
}
protected void shiftConflictingKeys(int)
{
oadd.com.carrotsearch.hppc.ShortLongHashMap v;
long v;
short v;
long[] v;
int v, v, v, v, v, v, v, v, v, v;
short[] v;
v := @this: oadd.com.carrotsearch.hppc.ShortLongHashMap;
v := @parameter: int;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: short[] keys>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: long[] values>;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int mask>;
v = 0;
label:
v = v + 1;
v = v + v;
v = v & v;
v = v[v];
if v == 0 goto label;
v = virtualinvoke v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int hashKey(short)>(v);
v = v - v;
v = v & v;
if v < v goto label;
v[v] = v;
v = v[v];
v[v] = v;
v = v;
v = 0;
goto label;
label:
v[v] = 0;
v[v] = 0L;
v = v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned>;
v = v - 1;
v.<oadd.com.carrotsearch.hppc.ShortLongHashMap: int assigned> = v;
return;
}
static void <clinit>()
{
java.lang.Class v;
boolean v, v;
v = class "Loadd/com/carrotsearch/hppc/ShortLongHashMap;";
v = virtualinvoke v.<java.lang.Class: boolean desiredAssertionStatus()>();
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
<oadd.com.carrotsearch.hppc.ShortLongHashMap: boolean $assertionsDisabled> = v;
return;
}
}