package it.unimi.dsi.fastutil.objects;
import it.unimi.dsi.fastutil.Hash;
import it.unimi.dsi.fastutil.HashCommon;
import static it.unimi.dsi.fastutil.HashCommon.arraySize;
import static it.unimi.dsi.fastutil.HashCommon.maxFill;
import java.util.Map;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.function.Consumer;
import it.unimi.dsi.fastutil.floats.FloatCollection;
import it.unimi.dsi.fastutil.floats.AbstractFloatCollection;
import it.unimi.dsi.fastutil.floats.FloatIterator;
import java.util.Comparator;
import it.unimi.dsi.fastutil.floats.FloatListIterator;
import it.unimi.dsi.fastutil.objects.AbstractObjectSortedSet;
import it.unimi.dsi.fastutil.objects.ObjectListIterator;
import it.unimi.dsi.fastutil.objects.ObjectBidirectionalIterator;
import it.unimi.dsi.fastutil.objects.ObjectSortedSet;
public class Reference2FloatLinkedOpenHashMap<K> extends AbstractReference2FloatSortedMap<K>
implements
java.io.Serializable,
Cloneable,
Hash {
private static final long serialVersionUID = 0L;
private static final boolean ASSERTS = false;
protected transient K[] key;
protected transient float[] value;
protected transient int mask;
protected transient boolean containsNullKey;
protected transient int first = -1;
protected transient int last = -1;
protected transient long[] link;
protected transient int n;
protected transient int maxFill;
protected final transient int minN;
protected int size;
protected final float f;
protected transient FastSortedEntrySet<K> entries;
protected transient ReferenceSortedSet<K> keys;
protected transient FloatCollection values;
@SuppressWarnings("unchecked")
public Reference2FloatLinkedOpenHashMap(final int expected, final float f) {
if (f <= 0 || f > 1)
throw new IllegalArgumentException("Load factor must be greater than 0 and smaller than or equal to 1");
if (expected < 0)
throw new IllegalArgumentException("The expected number of elements must be nonnegative");
this.f = f;
minN = n = arraySize(expected, f);
mask = n - 1;
maxFill = maxFill(n, f);
key = (K[]) new Object[n + 1];
value = new float[n + 1];
link = new long[n + 1];
}
public Reference2FloatLinkedOpenHashMap(final int expected) {
this(expected, DEFAULT_LOAD_FACTOR);
}
public Reference2FloatLinkedOpenHashMap() {
this(DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR);
}
public Reference2FloatLinkedOpenHashMap(final Map<? extends K, ? extends Float> m, final float f) {
this(m.size(), f);
putAll(m);
}
public Reference2FloatLinkedOpenHashMap(final Map<? extends K, ? extends Float> m) {
this(m, DEFAULT_LOAD_FACTOR);
}
public Reference2FloatLinkedOpenHashMap(final Reference2FloatMap<K> m, final float f) {
this(m.size(), f);
putAll(m);
}
public Reference2FloatLinkedOpenHashMap(final Reference2FloatMap<K> m) {
this(m, DEFAULT_LOAD_FACTOR);
}
public Reference2FloatLinkedOpenHashMap(final K[] k, final float[] v, final float f) {
this(k.length, f);
if (k.length != v.length)
throw new IllegalArgumentException(
"The key array and the value array have different lengths (" + k.length + " and " + v.length + ")");
for (int i = 0; i < k.length; i++)
this.put(k[i], v[i]);
}
public Reference2FloatLinkedOpenHashMap(final K[] k, final float[] v) {
this(k, v, DEFAULT_LOAD_FACTOR);
}
private int realSize() {
return containsNullKey ? size - 1 : size;
}
private void ensureCapacity(final int capacity) {
final int needed = arraySize(capacity, f);
if (needed > n)
rehash(needed);
}
private void tryCapacity(final long capacity) {
final int needed = (int) Math.min(1 << 30,
Math.max(2, HashCommon.nextPowerOfTwo((long) Math.ceil(capacity / f))));
if (needed > n)
rehash(needed);
}
private float removeEntry(final int pos) {
final float oldValue = value[pos];
size--;
fixPointers(pos);
shiftKeys(pos);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return oldValue;
}
private float removeNullEntry() {
containsNullKey = false;
key[n] = null;
final float oldValue = value[n];
size--;
fixPointers(n);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return oldValue;
}
@Override
public void putAll(Map<? extends K, ? extends Float> m) {
if (f <= .5)
ensureCapacity(m.size());
else
tryCapacity(size() + m.size());
super.putAll(m);
}
@SuppressWarnings("unchecked")
private int find(final K k) {
if (((k) == (null)))
return containsNullKey ? n : -(n + 1);
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return -(pos + 1);
if (((k) == (curr)))
return pos;
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return -(pos + 1);
if (((k) == (curr)))
return pos;
}
}
private void insert(final int pos, final K k, final float v) {
if (pos == n)
containsNullKey = true;
key[pos] = k;
value[pos] = v;
if (size == 0) {
first = last = pos;
link[pos] = -1L;
} else {
link[last] ^= ((link[last] ^ (pos & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[pos] = ((last & 0xFFFFFFFFL) << 32) | (-1 & 0xFFFFFFFFL);
last = pos;
}
if (size++ >= maxFill)
rehash(arraySize(size + 1, f));
if (ASSERTS)
checkTable();
}
@Override
public float put(final K k, final float v) {
final int pos = find(k);
if (pos < 0) {
insert(-pos - 1, k, v);
return defRetValue;
}
final float oldValue = value[pos];
value[pos] = v;
return oldValue;
}
private float addToValue(final int pos, final float incr) {
final float oldValue = value[pos];
value[pos] = oldValue + incr;
return oldValue;
}
public float addTo(final K k, final float incr) {
int pos;
if (((k) == (null))) {
if (containsNullKey)
return addToValue(n, incr);
pos = n;
containsNullKey = true;
} else {
K curr;
final K[] key = this.key;
if (!((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k)))
& mask]) == (null))) {
if (((curr) == (k)))
return addToValue(pos, incr);
while (!((curr = key[pos = (pos + 1) & mask]) == (null)))
if (((curr) == (k)))
return addToValue(pos, incr);
}
}
key[pos] = k;
value[pos] = defRetValue + incr;
if (size == 0) {
first = last = pos;
link[pos] = -1L;
} else {
link[last] ^= ((link[last] ^ (pos & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[pos] = ((last & 0xFFFFFFFFL) << 32) | (-1 & 0xFFFFFFFFL);
last = pos;
}
if (size++ >= maxFill)
rehash(arraySize(size + 1, f));
if (ASSERTS)
checkTable();
return defRetValue;
}
protected final void shiftKeys(int pos) {
int last, slot;
K curr;
final K[] key = this.key;
for (;;) {
pos = ((last = pos) + 1) & mask;
for (;;) {
if (((curr = key[pos]) == (null))) {
key[last] = (null);
return;
}
slot = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(curr))) & mask;
if (last <= pos ? last >= slot || slot > pos : last >= slot && slot > pos)
break;
pos = (pos + 1) & mask;
}
key[last] = curr;
value[last] = value[pos];
fixPointers(pos, last);
}
}
@Override
@SuppressWarnings("unchecked")
public float removeFloat(final Object k) {
if ((((K) k) == (null))) {
if (containsNullKey)
return removeNullEntry();
return defRetValue;
}
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return defRetValue;
if (((k) == (curr)))
return removeEntry(pos);
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return defRetValue;
if (((k) == (curr)))
return removeEntry(pos);
}
}
private float setValue(final int pos, final float v) {
final float oldValue = value[pos];
value[pos] = v;
return oldValue;
}
public float removeFirstFloat() {
if (size == 0)
throw new NoSuchElementException();
final int pos = first;
first = (int) link[pos];
if (0 <= first) {
link[first] |= (-1 & 0xFFFFFFFFL) << 32;
}
size--;
final float v = value[pos];
if (pos == n) {
containsNullKey = false;
key[n] = null;
} else
shiftKeys(pos);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return v;
}
public float removeLastFloat() {
if (size == 0)
throw new NoSuchElementException();
final int pos = last;
last = (int) (link[pos] >>> 32);
if (0 <= last) {
link[last] |= -1 & 0xFFFFFFFFL;
}
size--;
final float v = value[pos];
if (pos == n) {
containsNullKey = false;
key[n] = null;
} else
shiftKeys(pos);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return v;
}
private void moveIndexToFirst(final int i) {
if (size == 1 || first == i)
return;
if (last == i) {
last = (int) (link[i] >>> 32);
link[last] |= -1 & 0xFFFFFFFFL;
} else {
final long linki = link[i];
final int prev = (int) (linki >>> 32);
final int next = (int) linki;
link[prev] ^= ((link[prev] ^ (linki & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[next] ^= ((link[next] ^ (linki & 0xFFFFFFFF00000000L)) & 0xFFFFFFFF00000000L);
}
link[first] ^= ((link[first] ^ ((i & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
link[i] = ((-1 & 0xFFFFFFFFL) << 32) | (first & 0xFFFFFFFFL);
first = i;
}
private void moveIndexToLast(final int i) {
if (size == 1 || last == i)
return;
if (first == i) {
first = (int) link[i];
link[first] |= (-1 & 0xFFFFFFFFL) << 32;
} else {
final long linki = link[i];
final int prev = (int) (linki >>> 32);
final int next = (int) linki;
link[prev] ^= ((link[prev] ^ (linki & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[next] ^= ((link[next] ^ (linki & 0xFFFFFFFF00000000L)) & 0xFFFFFFFF00000000L);
}
link[last] ^= ((link[last] ^ (i & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[i] = ((last & 0xFFFFFFFFL) << 32) | (-1 & 0xFFFFFFFFL);
last = i;
}
public float getAndMoveToFirst(final K k) {
if (((k) == (null))) {
if (containsNullKey) {
moveIndexToFirst(n);
return value[n];
}
return defRetValue;
}
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return defRetValue;
if (((k) == (curr))) {
moveIndexToFirst(pos);
return value[pos];
}
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return defRetValue;
if (((k) == (curr))) {
moveIndexToFirst(pos);
return value[pos];
}
}
}
public float getAndMoveToLast(final K k) {
if (((k) == (null))) {
if (containsNullKey) {
moveIndexToLast(n);
return value[n];
}
return defRetValue;
}
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return defRetValue;
if (((k) == (curr))) {
moveIndexToLast(pos);
return value[pos];
}
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return defRetValue;
if (((k) == (curr))) {
moveIndexToLast(pos);
return value[pos];
}
}
}
public float putAndMoveToFirst(final K k, final float v) {
int pos;
if (((k) == (null))) {
if (containsNullKey) {
moveIndexToFirst(n);
return setValue(n, v);
}
containsNullKey = true;
pos = n;
} else {
K curr;
final K[] key = this.key;
if (!((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k)))
& mask]) == (null))) {
if (((curr) == (k))) {
moveIndexToFirst(pos);
return setValue(pos, v);
}
while (!((curr = key[pos = (pos + 1) & mask]) == (null)))
if (((curr) == (k))) {
moveIndexToFirst(pos);
return setValue(pos, v);
}
}
}
key[pos] = k;
value[pos] = v;
if (size == 0) {
first = last = pos;
link[pos] = -1L;
} else {
link[first] ^= ((link[first] ^ ((pos & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
link[pos] = ((-1 & 0xFFFFFFFFL) << 32) | (first & 0xFFFFFFFFL);
first = pos;
}
if (size++ >= maxFill)
rehash(arraySize(size, f));
if (ASSERTS)
checkTable();
return defRetValue;
}
public float putAndMoveToLast(final K k, final float v) {
int pos;
if (((k) == (null))) {
if (containsNullKey) {
moveIndexToLast(n);
return setValue(n, v);
}
containsNullKey = true;
pos = n;
} else {
K curr;
final K[] key = this.key;
if (!((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k)))
& mask]) == (null))) {
if (((curr) == (k))) {
moveIndexToLast(pos);
return setValue(pos, v);
}
while (!((curr = key[pos = (pos + 1) & mask]) == (null)))
if (((curr) == (k))) {
moveIndexToLast(pos);
return setValue(pos, v);
}
}
}
key[pos] = k;
value[pos] = v;
if (size == 0) {
first = last = pos;
link[pos] = -1L;
} else {
link[last] ^= ((link[last] ^ (pos & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[pos] = ((last & 0xFFFFFFFFL) << 32) | (-1 & 0xFFFFFFFFL);
last = pos;
}
if (size++ >= maxFill)
rehash(arraySize(size, f));
if (ASSERTS)
checkTable();
return defRetValue;
}
@Override
@SuppressWarnings("unchecked")
public float getFloat(final Object k) {
if ((((K) k) == (null)))
return containsNullKey ? value[n] : defRetValue;
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return defRetValue;
if (((k) == (curr)))
return value[pos];
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return defRetValue;
if (((k) == (curr)))
return value[pos];
}
}
@Override
@SuppressWarnings("unchecked")
public boolean containsKey(final Object k) {
if ((((K) k) == (null)))
return containsNullKey;
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return false;
if (((k) == (curr)))
return true;
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return false;
if (((k) == (curr)))
return true;
}
}
@Override
public boolean containsValue(final float v) {
final float value[] = this.value;
final K key[] = this.key;
if (containsNullKey && (Float.floatToIntBits(value[n]) == Float.floatToIntBits(v)))
return true;
for (int i = n; i-- != 0;)
if (!((key[i]) == (null)) && (Float.floatToIntBits(value[i]) == Float.floatToIntBits(v)))
return true;
return false;
}
@Override
@SuppressWarnings("unchecked")
public float getOrDefault(final Object k, final float defaultValue) {
if ((((K) k) == (null)))
return containsNullKey ? value[n] : defaultValue;
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return defaultValue;
if (((k) == (curr)))
return value[pos];
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return defaultValue;
if (((k) == (curr)))
return value[pos];
}
}
@Override
public float putIfAbsent(final K k, final float v) {
final int pos = find(k);
if (pos >= 0)
return value[pos];
insert(-pos - 1, k, v);
return defRetValue;
}
@Override
@SuppressWarnings("unchecked")
public boolean remove(final Object k, final float v) {
if ((((K) k) == (null))) {
if (containsNullKey && (Float.floatToIntBits(v) == Float.floatToIntBits(value[n]))) {
removeNullEntry();
return true;
}
return false;
}
K curr;
final K[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null)))
return false;
if (((k) == (curr)) && (Float.floatToIntBits(v) == Float.floatToIntBits(value[pos]))) {
removeEntry(pos);
return true;
}
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return false;
if (((k) == (curr)) && (Float.floatToIntBits(v) == Float.floatToIntBits(value[pos]))) {
removeEntry(pos);
return true;
}
}
}
@Override
public boolean replace(final K k, final float oldValue, final float v) {
final int pos = find(k);
if (pos < 0 || !(Float.floatToIntBits(oldValue) == Float.floatToIntBits(value[pos])))
return false;
value[pos] = v;
return true;
}
@Override
public float replace(final K k, final float v) {
final int pos = find(k);
if (pos < 0)
return defRetValue;
final float oldValue = value[pos];
value[pos] = v;
return oldValue;
}
@Override
public float computeFloatIfAbsent(final K k, final java.util.function.ToDoubleFunction<? super K> mappingFunction) {
java.util.Objects.requireNonNull(mappingFunction);
final int pos = find(k);
if (pos >= 0)
return value[pos];
final float newValue = it.unimi.dsi.fastutil.SafeMath.safeDoubleToFloat(mappingFunction.applyAsDouble(k));
insert(-pos - 1, k, newValue);
return newValue;
}
@Override
public float computeFloatIfPresent(final K k,
final java.util.function.BiFunction<? super K, ? super Float, ? extends Float> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
if (pos < 0)
return defRetValue;
final Float newValue = remappingFunction.apply((k), Float.valueOf(value[pos]));
if (newValue == null) {
if (((k) == (null)))
removeNullEntry();
else
removeEntry(pos);
return defRetValue;
}
return value[pos] = (newValue).floatValue();
}
@Override
public float computeFloat(final K k,
final java.util.function.BiFunction<? super K, ? super Float, ? extends Float> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
final Float newValue = remappingFunction.apply((k), pos >= 0 ? Float.valueOf(value[pos]) : null);
if (newValue == null) {
if (pos >= 0) {
if (((k) == (null)))
removeNullEntry();
else
removeEntry(pos);
}
return defRetValue;
}
float newVal = (newValue).floatValue();
if (pos < 0) {
insert(-pos - 1, k, newVal);
return newVal;
}
return value[pos] = newVal;
}
@Override
public float mergeFloat(final K k, final float v,
final java.util.function.BiFunction<? super Float, ? super Float, ? extends Float> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
if (pos < 0) {
insert(-pos - 1, k, v);
return v;
}
final Float newValue = remappingFunction.apply(Float.valueOf(value[pos]), Float.valueOf(v));
if (newValue == null) {
if (((k) == (null)))
removeNullEntry();
else
removeEntry(pos);
return defRetValue;
}
return value[pos] = (newValue).floatValue();
}
@Override
public void clear() {
if (size == 0)
return;
size = 0;
containsNullKey = false;
Arrays.fill(key, (null));
first = last = -1;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
final class MapEntry implements Reference2FloatMap.Entry<K>, Map.Entry<K, Float> {
int index;
MapEntry(final int index) {
this.index = index;
}
MapEntry() {
}
@Override
public K getKey() {
return key[index];
}
@Override
public float getFloatValue() {
return value[index];
}
@Override
public float setValue(final float v) {
final float oldValue = value[index];
value[index] = v;
return oldValue;
}
@Deprecated
@Override
public Float getValue() {
return Float.valueOf(value[index]);
}
@Deprecated
@Override
public Float setValue(final Float v) {
return Float.valueOf(setValue((v).floatValue()));
}
@SuppressWarnings("unchecked")
@Override
public boolean equals(final Object o) {
if (!(o instanceof Map.Entry))
return false;
Map.Entry<K, Float> e = (Map.Entry<K, Float>) o;
return ((key[index]) == ((e.getKey())))
&& (Float.floatToIntBits(value[index]) == Float.floatToIntBits((e.getValue()).floatValue()));
}
@Override
public int hashCode() {
return (System.identityHashCode(key[index])) ^ it.unimi.dsi.fastutil.HashCommon.float2int(value[index]);
}
@Override
public String toString() {
return key[index] + "=>" + value[index];
}
}
protected void fixPointers(final int i) {
if (size == 0) {
first = last = -1;
return;
}
if (first == i) {
first = (int) link[i];
if (0 <= first) {
link[first] |= (-1 & 0xFFFFFFFFL) << 32;
}
return;
}
if (last == i) {
last = (int) (link[i] >>> 32);
if (0 <= last) {
link[last] |= -1 & 0xFFFFFFFFL;
}
return;
}
final long linki = link[i];
final int prev = (int) (linki >>> 32);
final int next = (int) linki;
link[prev] ^= ((link[prev] ^ (linki & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[next] ^= ((link[next] ^ (linki & 0xFFFFFFFF00000000L)) & 0xFFFFFFFF00000000L);
}
protected void fixPointers(int s, int d) {
if (size == 1) {
first = last = d;
link[d] = -1L;
return;
}
if (first == s) {
first = d;
link[(int) link[s]] ^= ((link[(int) link[s]] ^ ((d & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
link[d] = link[s];
return;
}
if (last == s) {
last = d;
link[(int) (link[s] >>> 32)] ^= ((link[(int) (link[s] >>> 32)] ^ (d & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[d] = link[s];
return;
}
final long links = link[s];
final int prev = (int) (links >>> 32);
final int next = (int) links;
link[prev] ^= ((link[prev] ^ (d & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[next] ^= ((link[next] ^ ((d & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
link[d] = links;
}
@Override
public K firstKey() {
if (size == 0)
throw new NoSuchElementException();
return key[first];
}
@Override
public K lastKey() {
if (size == 0)
throw new NoSuchElementException();
return key[last];
}
@Override
public Reference2FloatSortedMap<K> tailMap(K from) {
throw new UnsupportedOperationException();
}
@Override
public Reference2FloatSortedMap<K> headMap(K to) {
throw new UnsupportedOperationException();
}
@Override
public Reference2FloatSortedMap<K> subMap(K from, K to) {
throw new UnsupportedOperationException();
}
@Override
public Comparator<? super K> comparator() {
return null;
}
private class MapIterator {
int prev = -1;
int next = -1;
int curr = -1;
int index = -1;
protected MapIterator() {
next = first;
index = 0;
}
private MapIterator(final K from) {
if (((from) == (null))) {
if (Reference2FloatLinkedOpenHashMap.this.containsNullKey) {
next = (int) link[n];
prev = n;
return;
} else
throw new NoSuchElementException("The key " + from + " does not belong to this map.");
}
if (((key[last]) == (from))) {
prev = last;
index = size;
return;
}
int pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(from))) & mask;
while (!((key[pos]) == (null))) {
if (((key[pos]) == (from))) {
next = (int) link[pos];
prev = pos;
return;
}
pos = (pos + 1) & mask;
}
throw new NoSuchElementException("The key " + from + " does not belong to this map.");
}
public boolean hasNext() {
return next != -1;
}
public boolean hasPrevious() {
return prev != -1;
}
private final void ensureIndexKnown() {
if (index >= 0)
return;
if (prev == -1) {
index = 0;
return;
}
if (next == -1) {
index = size;
return;
}
int pos = first;
index = 1;
while (pos != prev) {
pos = (int) link[pos];
index++;
}
}
public int nextIndex() {
ensureIndexKnown();
return index;
}
public int previousIndex() {
ensureIndexKnown();
return index - 1;
}
public int nextEntry() {
if (!hasNext())
throw new NoSuchElementException();
curr = next;
next = (int) link[curr];
prev = curr;
if (index >= 0)
index++;
return curr;
}
public int previousEntry() {
if (!hasPrevious())
throw new NoSuchElementException();
curr = prev;
prev = (int) (link[curr] >>> 32);
next = curr;
if (index >= 0)
index--;
return curr;
}
public void remove() {
ensureIndexKnown();
if (curr == -1)
throw new IllegalStateException();
if (curr == prev) {
index--;
prev = (int) (link[curr] >>> 32);
} else
next = (int) link[curr];
size--;
if (prev == -1)
first = next;
else
link[prev] ^= ((link[prev] ^ (next & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
if (next == -1)
last = prev;
else
link[next] ^= ((link[next] ^ ((prev & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
int last, slot, pos = curr;
curr = -1;
if (pos == n) {
Reference2FloatLinkedOpenHashMap.this.containsNullKey = false;
key[n] = null;
} else {
K curr;
final K[] key = Reference2FloatLinkedOpenHashMap.this.key;
for (;;) {
pos = ((last = pos) + 1) & mask;
for (;;) {
if (((curr = key[pos]) == (null))) {
key[last] = (null);
return;
}
slot = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(curr))) & mask;
if (last <= pos ? last >= slot || slot > pos : last >= slot && slot > pos)
break;
pos = (pos + 1) & mask;
}
key[last] = curr;
value[last] = value[pos];
if (next == pos)
next = last;
if (prev == pos)
prev = last;
fixPointers(pos, last);
}
}
}
public int skip(final int n) {
int i = n;
while (i-- != 0 && hasNext())
nextEntry();
return n - i - 1;
}
public int back(final int n) {
int i = n;
while (i-- != 0 && hasPrevious())
previousEntry();
return n - i - 1;
}
public void set(@SuppressWarnings("unused") Reference2FloatMap.Entry<K> ok) {
throw new UnsupportedOperationException();
}
public void add(@SuppressWarnings("unused") Reference2FloatMap.Entry<K> ok) {
throw new UnsupportedOperationException();
}
}
private class EntryIterator extends MapIterator implements ObjectListIterator<Reference2FloatMap.Entry<K>> {
private MapEntry entry;
public EntryIterator() {
}
public EntryIterator(K from) {
super(from);
}
@Override
public MapEntry next() {
return entry = new MapEntry(nextEntry());
}
@Override
public MapEntry previous() {
return entry = new MapEntry(previousEntry());
}
@Override
public void remove() {
super.remove();
entry.index = -1;
}
}
private class FastEntryIterator extends MapIterator implements ObjectListIterator<Reference2FloatMap.Entry<K>> {
final MapEntry entry = new MapEntry();
public FastEntryIterator() {
}
public FastEntryIterator(K from) {
super(from);
}
@Override
public MapEntry next() {
entry.index = nextEntry();
return entry;
}
@Override
public MapEntry previous() {
entry.index = previousEntry();
return entry;
}
}
private final class MapEntrySet extends AbstractObjectSortedSet<Reference2FloatMap.Entry<K>>
implements
FastSortedEntrySet<K> {
@Override
public ObjectBidirectionalIterator<Reference2FloatMap.Entry<K>> iterator() {
return new EntryIterator();
}
@Override
public Comparator<? super Reference2FloatMap.Entry<K>> comparator() {
return null;
}
@Override
public ObjectSortedSet<Reference2FloatMap.Entry<K>> subSet(Reference2FloatMap.Entry<K> fromElement,
Reference2FloatMap.Entry<K> toElement) {
throw new UnsupportedOperationException();
}
@Override
public ObjectSortedSet<Reference2FloatMap.Entry<K>> headSet(Reference2FloatMap.Entry<K> toElement) {
throw new UnsupportedOperationException();
}
@Override
public ObjectSortedSet<Reference2FloatMap.Entry<K>> tailSet(Reference2FloatMap.Entry<K> fromElement) {
throw new UnsupportedOperationException();
}
@Override
public Reference2FloatMap.Entry<K> first() {
if (size == 0)
throw new NoSuchElementException();
return new MapEntry(Reference2FloatLinkedOpenHashMap.this.first);
}
@Override
public Reference2FloatMap.Entry<K> last() {
if (size == 0)
throw new NoSuchElementException();
return new MapEntry(Reference2FloatLinkedOpenHashMap.this.last);
}
@Override
@SuppressWarnings("unchecked")
public boolean contains(final Object o) {
if (!(o instanceof Map.Entry))
return false;
final Map.Entry<?, ?> e = (Map.Entry<?, ?>) o;
if (e.getValue() == null || !(e.getValue() instanceof Float))
return false;
final K k = ((K) e.getKey());
final float v = ((Float) (e.getValue())).floatValue();
if (((k) == (null)))
return Reference2FloatLinkedOpenHashMap.this.containsNullKey
&& (Float.floatToIntBits(value[n]) == Float.floatToIntBits(v));
K curr;
final K[] key = Reference2FloatLinkedOpenHashMap.this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k)))
& mask]) == (null)))
return false;
if (((k) == (curr)))
return (Float.floatToIntBits(value[pos]) == Float.floatToIntBits(v));
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return false;
if (((k) == (curr)))
return (Float.floatToIntBits(value[pos]) == Float.floatToIntBits(v));
}
}
@Override
@SuppressWarnings("unchecked")
public boolean remove(final Object o) {
if (!(o instanceof Map.Entry))
return false;
final Map.Entry<?, ?> e = (Map.Entry<?, ?>) o;
if (e.getValue() == null || !(e.getValue() instanceof Float))
return false;
final K k = ((K) e.getKey());
final float v = ((Float) (e.getValue())).floatValue();
if (((k) == (null))) {
if (containsNullKey && (Float.floatToIntBits(value[n]) == Float.floatToIntBits(v))) {
removeNullEntry();
return true;
}
return false;
}
K curr;
final K[] key = Reference2FloatLinkedOpenHashMap.this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k)))
& mask]) == (null)))
return false;
if (((curr) == (k))) {
if ((Float.floatToIntBits(value[pos]) == Float.floatToIntBits(v))) {
removeEntry(pos);
return true;
}
return false;
}
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == (null)))
return false;
if (((curr) == (k))) {
if ((Float.floatToIntBits(value[pos]) == Float.floatToIntBits(v))) {
removeEntry(pos);
return true;
}
}
}
}
@Override
public int size() {
return size;
}
@Override
public void clear() {
Reference2FloatLinkedOpenHashMap.this.clear();
}
@Override
public ObjectListIterator<Reference2FloatMap.Entry<K>> iterator(final Reference2FloatMap.Entry<K> from) {
return new EntryIterator(from.getKey());
}
@Override
public ObjectListIterator<Reference2FloatMap.Entry<K>> fastIterator() {
return new FastEntryIterator();
}
@Override
public ObjectListIterator<Reference2FloatMap.Entry<K>> fastIterator(final Reference2FloatMap.Entry<K> from) {
return new FastEntryIterator(from.getKey());
}
@Override
public void forEach(final Consumer<? super Reference2FloatMap.Entry<K>> consumer) {
for (int i = size, curr, next = first; i-- != 0;) {
curr = next;
next = (int) link[curr];
consumer.accept(new AbstractReference2FloatMap.BasicEntry<K>(key[curr], value[curr]));
}
}
@Override
public void fastForEach(final Consumer<? super Reference2FloatMap.Entry<K>> consumer) {
final AbstractReference2FloatMap.BasicEntry<K> entry = new AbstractReference2FloatMap.BasicEntry<>();
for (int i = size, curr, next = first; i-- != 0;) {
curr = next;
next = (int) link[curr];
entry.key = key[curr];
entry.value = value[curr];
consumer.accept(entry);
}
}
}
@Override
public FastSortedEntrySet<K> reference2FloatEntrySet() {
if (entries == null)
entries = new MapEntrySet();
return entries;
}
private final class KeyIterator extends MapIterator implements ObjectListIterator<K> {
public KeyIterator(final K k) {
super(k);
}
@Override
public K previous() {
return key[previousEntry()];
}
public KeyIterator() {
super();
}
@Override
public K next() {
return key[nextEntry()];
}
}
private final class KeySet extends AbstractReferenceSortedSet<K> {
@Override
public ObjectListIterator<K> iterator(final K from) {
return new KeyIterator(from);
}
@Override
public ObjectListIterator<K> iterator() {
return new KeyIterator();
}
@Override
public void forEach(final Consumer<? super K> consumer) {
if (containsNullKey)
consumer.accept(key[n]);
for (int pos = n; pos-- != 0;) {
final K k = key[pos];
if (!((k) == (null)))
consumer.accept(k);
}
}
@Override
public int size() {
return size;
}
@Override
public boolean contains(Object k) {
return containsKey(k);
}
@Override
public boolean remove(Object k) {
final int oldSize = size;
Reference2FloatLinkedOpenHashMap.this.removeFloat(k);
return size != oldSize;
}
@Override
public void clear() {
Reference2FloatLinkedOpenHashMap.this.clear();
}
@Override
public K first() {
if (size == 0)
throw new NoSuchElementException();
return key[first];
}
@Override
public K last() {
if (size == 0)
throw new NoSuchElementException();
return key[last];
}
@Override
public Comparator<? super K> comparator() {
return null;
}
@Override
public ReferenceSortedSet<K> tailSet(K from) {
throw new UnsupportedOperationException();
}
@Override
public ReferenceSortedSet<K> headSet(K to) {
throw new UnsupportedOperationException();
}
@Override
public ReferenceSortedSet<K> subSet(K from, K to) {
throw new UnsupportedOperationException();
}
}
@Override
public ReferenceSortedSet<K> keySet() {
if (keys == null)
keys = new KeySet();
return keys;
}
private final class ValueIterator extends MapIterator implements FloatListIterator {
@Override
public float previousFloat() {
return value[previousEntry()];
}
public ValueIterator() {
super();
}
@Override
public float nextFloat() {
return value[nextEntry()];
}
}
@Override
public FloatCollection values() {
if (values == null)
values = new AbstractFloatCollection() {
@Override
public FloatIterator iterator() {
return new ValueIterator();
}
@Override
public int size() {
return size;
}
@Override
public boolean contains(float v) {
return containsValue(v);
}
@Override
public void clear() {
Reference2FloatLinkedOpenHashMap.this.clear();
}
@Override
public void forEach(final java.util.function.DoubleConsumer consumer) {
if (containsNullKey)
consumer.accept(value[n]);
for (int pos = n; pos-- != 0;)
if (!((key[pos]) == (null)))
consumer.accept(value[pos]);
}
};
return values;
}
public boolean trim() {
return trim(size);
}
public boolean trim(final int n) {
final int l = HashCommon.nextPowerOfTwo((int) Math.ceil(n / f));
if (l >= this.n || size > maxFill(l, f))
return true;
try {
rehash(l);
} catch (OutOfMemoryError cantDoIt) {
return false;
}
return true;
}
@SuppressWarnings("unchecked")
protected void rehash(final int newN) {
final K key[] = this.key;
final float value[] = this.value;
final int mask = newN - 1;
final K newKey[] = (K[]) new Object[newN + 1];
final float newValue[] = new float[newN + 1];
int i = first, prev = -1, newPrev = -1, t, pos;
final long link[] = this.link;
final long newLink[] = new long[newN + 1];
first = -1;
for (int j = size; j-- != 0;) {
if (((key[i]) == (null)))
pos = newN;
else {
pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(key[i]))) & mask;
while (!((newKey[pos]) == (null)))
pos = (pos + 1) & mask;
}
newKey[pos] = key[i];
newValue[pos] = value[i];
if (prev != -1) {
newLink[newPrev] ^= ((newLink[newPrev] ^ (pos & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
newLink[pos] ^= ((newLink[pos] ^ ((newPrev & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
newPrev = pos;
} else {
newPrev = first = pos;
newLink[pos] = -1L;
}
t = i;
i = (int) link[i];
prev = t;
}
this.link = newLink;
this.last = newPrev;
if (newPrev != -1)
newLink[newPrev] |= -1 & 0xFFFFFFFFL;
n = newN;
this.mask = mask;
maxFill = maxFill(n, f);
this.key = newKey;
this.value = newValue;
}
@Override
@SuppressWarnings("unchecked")
public Reference2FloatLinkedOpenHashMap<K> clone() {
Reference2FloatLinkedOpenHashMap<K> c;
try {
c = (Reference2FloatLinkedOpenHashMap<K>) super.clone();
} catch (CloneNotSupportedException cantHappen) {
throw new InternalError();
}
c.keys = null;
c.values = null;
c.entries = null;
c.containsNullKey = containsNullKey;
c.key = key.clone();
c.value = value.clone();
c.link = link.clone();
return c;
}
@Override
public int hashCode() {
int h = 0;
for (int j = realSize(), i = 0, t = 0; j-- != 0;) {
while (((key[i]) == (null)))
i++;
if (this != key[i])
t = (System.identityHashCode(key[i]));
t ^= it.unimi.dsi.fastutil.HashCommon.float2int(value[i]);
h += t;
i++;
}
if (containsNullKey)
h += it.unimi.dsi.fastutil.HashCommon.float2int(value[n]);
return h;
}
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException {
final K key[] = this.key;
final float value[] = this.value;
final MapIterator i = new MapIterator();
s.defaultWriteObject();
for (int j = size, e; j-- != 0;) {
e = i.nextEntry();
s.writeObject(key[e]);
s.writeFloat(value[e]);
}
}
@SuppressWarnings("unchecked")
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, ClassNotFoundException {
s.defaultReadObject();
n = arraySize(size, f);
maxFill = maxFill(n, f);
mask = n - 1;
final K key[] = this.key = (K[]) new Object[n + 1];
final float value[] = this.value = new float[n + 1];
final long link[] = this.link = new long[n + 1];
int prev = -1;
first = last = -1;
K k;
float v;
for (int i = size, pos; i-- != 0;) {
k = (K) s.readObject();
v = s.readFloat();
if (((k) == (null))) {
pos = n;
containsNullKey = true;
} else {
pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask;
while (!((key[pos]) == (null)))
pos = (pos + 1) & mask;
}
key[pos] = k;
value[pos] = v;
if (first != -1) {
link[prev] ^= ((link[prev] ^ (pos & 0xFFFFFFFFL)) & 0xFFFFFFFFL);
link[pos] ^= ((link[pos] ^ ((prev & 0xFFFFFFFFL) << 32)) & 0xFFFFFFFF00000000L);
prev = pos;
} else {
prev = first = pos;
link[pos] |= (-1L & 0xFFFFFFFFL) << 32;
}
}
last = prev;
if (prev != -1)
link[prev] |= -1 & 0xFFFFFFFFL;
if (ASSERTS)
checkTable();
}
private void checkTable() {
}
}