package it.unimi.dsi.fastutil.shorts;
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.objects.ReferenceCollection;
import it.unimi.dsi.fastutil.objects.AbstractReferenceCollection;
import it.unimi.dsi.fastutil.objects.AbstractObjectSet;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
public class Short2ReferenceOpenCustomHashMap<V> extends AbstractShort2ReferenceMap<V>
implements
java.io.Serializable,
Cloneable,
Hash {
private static final long serialVersionUID = 0L;
private static final boolean ASSERTS = false;
protected transient short[] key;
protected transient V[] value;
protected transient int mask;
protected transient boolean containsNullKey;
protected it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy;
protected transient int n;
protected transient int maxFill;
protected final transient int minN;
protected int size;
protected final float f;
protected transient FastEntrySet<V> entries;
protected transient ShortSet keys;
protected transient ReferenceCollection<V> values;
@SuppressWarnings("unchecked")
public Short2ReferenceOpenCustomHashMap(final int expected, final float f,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this.strategy = strategy;
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 = new short[n + 1];
value = (V[]) new Object[n + 1];
}
public Short2ReferenceOpenCustomHashMap(final int expected,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(expected, DEFAULT_LOAD_FACTOR, strategy);
}
public Short2ReferenceOpenCustomHashMap(final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, strategy);
}
public Short2ReferenceOpenCustomHashMap(final Map<? extends Short, ? extends V> m, final float f,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(m.size(), f, strategy);
putAll(m);
}
public Short2ReferenceOpenCustomHashMap(final Map<? extends Short, ? extends V> m,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(m, DEFAULT_LOAD_FACTOR, strategy);
}
public Short2ReferenceOpenCustomHashMap(final Short2ReferenceMap<V> m, final float f,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(m.size(), f, strategy);
putAll(m);
}
public Short2ReferenceOpenCustomHashMap(final Short2ReferenceMap<V> m,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(m, DEFAULT_LOAD_FACTOR, strategy);
}
public Short2ReferenceOpenCustomHashMap(final short[] k, final V[] v, final float f,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(k.length, f, strategy);
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 Short2ReferenceOpenCustomHashMap(final short[] k, final V[] v,
final it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy) {
this(k, v, DEFAULT_LOAD_FACTOR, strategy);
}
public it.unimi.dsi.fastutil.shorts.ShortHash.Strategy strategy() {
return strategy;
}
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 V removeEntry(final int pos) {
final V oldValue = value[pos];
value[pos] = null;
size--;
shiftKeys(pos);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return oldValue;
}
private V removeNullEntry() {
containsNullKey = false;
final V oldValue = value[n];
value[n] = null;
size--;
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return oldValue;
}
@Override
public void putAll(Map<? extends Short, ? extends V> m) {
if (f <= .5)
ensureCapacity(m.size());
else
tryCapacity(size() + m.size());
super.putAll(m);
}
private int find(final short k) {
if ((strategy.equals((k), ((short) 0))))
return containsNullKey ? n : -(n + 1);
short curr;
final short[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask]) == ((short) 0)))
return -(pos + 1);
if ((strategy.equals((k), (curr))))
return pos;
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return -(pos + 1);
if ((strategy.equals((k), (curr))))
return pos;
}
}
private void insert(final int pos, final short k, final V v) {
if (pos == n)
containsNullKey = true;
key[pos] = k;
value[pos] = v;
if (size++ >= maxFill)
rehash(arraySize(size + 1, f));
if (ASSERTS)
checkTable();
}
@Override
public V put(final short k, final V v) {
final int pos = find(k);
if (pos < 0) {
insert(-pos - 1, k, v);
return defRetValue;
}
final V oldValue = value[pos];
value[pos] = v;
return oldValue;
}
protected final void shiftKeys(int pos) {
int last, slot;
short curr;
final short[] key = this.key;
for (;;) {
pos = ((last = pos) + 1) & mask;
for (;;) {
if (((curr = key[pos]) == ((short) 0))) {
key[last] = ((short) 0);
value[last] = null;
return;
}
slot = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(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];
}
}
@Override
public V remove(final short k) {
if ((strategy.equals((k), ((short) 0)))) {
if (containsNullKey)
return removeNullEntry();
return defRetValue;
}
short curr;
final short[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask]) == ((short) 0)))
return defRetValue;
if ((strategy.equals((k), (curr))))
return removeEntry(pos);
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return defRetValue;
if ((strategy.equals((k), (curr))))
return removeEntry(pos);
}
}
@Override
public V get(final short k) {
if ((strategy.equals((k), ((short) 0))))
return containsNullKey ? value[n] : defRetValue;
short curr;
final short[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask]) == ((short) 0)))
return defRetValue;
if ((strategy.equals((k), (curr))))
return value[pos];
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return defRetValue;
if ((strategy.equals((k), (curr))))
return value[pos];
}
}
@Override
public boolean containsKey(final short k) {
if ((strategy.equals((k), ((short) 0))))
return containsNullKey;
short curr;
final short[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask]) == ((short) 0)))
return false;
if ((strategy.equals((k), (curr))))
return true;
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return false;
if ((strategy.equals((k), (curr))))
return true;
}
}
@Override
public boolean containsValue(final Object v) {
final V value[] = this.value;
final short key[] = this.key;
if (containsNullKey && ((value[n]) == (v)))
return true;
for (int i = n; i-- != 0;)
if (!((key[i]) == ((short) 0)) && ((value[i]) == (v)))
return true;
return false;
}
@Override
public V getOrDefault(final short k, final V defaultValue) {
if ((strategy.equals((k), ((short) 0))))
return containsNullKey ? value[n] : defaultValue;
short curr;
final short[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask]) == ((short) 0)))
return defaultValue;
if ((strategy.equals((k), (curr))))
return value[pos];
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return defaultValue;
if ((strategy.equals((k), (curr))))
return value[pos];
}
}
@Override
public V putIfAbsent(final short k, final V v) {
final int pos = find(k);
if (pos >= 0)
return value[pos];
insert(-pos - 1, k, v);
return defRetValue;
}
@Override
public boolean remove(final short k, final Object v) {
if ((strategy.equals((k), ((short) 0)))) {
if (containsNullKey && ((v) == (value[n]))) {
removeNullEntry();
return true;
}
return false;
}
short curr;
final short[] key = this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask]) == ((short) 0)))
return false;
if ((strategy.equals((k), (curr))) && ((v) == (value[pos]))) {
removeEntry(pos);
return true;
}
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return false;
if ((strategy.equals((k), (curr))) && ((v) == (value[pos]))) {
removeEntry(pos);
return true;
}
}
}
@Override
public boolean replace(final short k, final V oldValue, final V v) {
final int pos = find(k);
if (pos < 0 || !((oldValue) == (value[pos])))
return false;
value[pos] = v;
return true;
}
@Override
public V replace(final short k, final V v) {
final int pos = find(k);
if (pos < 0)
return defRetValue;
final V oldValue = value[pos];
value[pos] = v;
return oldValue;
}
@Override
public V computeIfAbsent(final short k, final java.util.function.IntFunction<? extends V> mappingFunction) {
java.util.Objects.requireNonNull(mappingFunction);
final int pos = find(k);
if (pos >= 0)
return value[pos];
final V newValue = mappingFunction.apply(k);
insert(-pos - 1, k, newValue);
return newValue;
}
@Override
public V computeIfPresent(final short k,
final java.util.function.BiFunction<? super Short, ? super V, ? extends V> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
if (pos < 0)
return defRetValue;
final V newValue = remappingFunction.apply(Short.valueOf(k), (value[pos]));
if (newValue == null) {
if ((strategy.equals((k), ((short) 0))))
removeNullEntry();
else
removeEntry(pos);
return defRetValue;
}
return value[pos] = (newValue);
}
@Override
public V compute(final short k,
final java.util.function.BiFunction<? super Short, ? super V, ? extends V> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
final V newValue = remappingFunction.apply(Short.valueOf(k), pos >= 0 ? (value[pos]) : null);
if (newValue == null) {
if (pos >= 0) {
if ((strategy.equals((k), ((short) 0))))
removeNullEntry();
else
removeEntry(pos);
}
return defRetValue;
}
V newVal = (newValue);
if (pos < 0) {
insert(-pos - 1, k, newVal);
return newVal;
}
return value[pos] = newVal;
}
@Override
public V merge(final short k, final V v,
final java.util.function.BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
if (pos < 0 || value[pos] == null) {
if (v == null)
return defRetValue;
insert(-pos - 1, k, v);
return v;
}
final V newValue = remappingFunction.apply((value[pos]), (v));
if (newValue == null) {
if ((strategy.equals((k), ((short) 0))))
removeNullEntry();
else
removeEntry(pos);
return defRetValue;
}
return value[pos] = (newValue);
}
@Override
public void clear() {
if (size == 0)
return;
size = 0;
containsNullKey = false;
Arrays.fill(key, ((short) 0));
Arrays.fill(value, null);
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
final class MapEntry implements Short2ReferenceMap.Entry<V>, Map.Entry<Short, V> {
int index;
MapEntry(final int index) {
this.index = index;
}
MapEntry() {
}
@Override
public short getShortKey() {
return key[index];
}
@Override
public V getValue() {
return value[index];
}
@Override
public V setValue(final V v) {
final V oldValue = value[index];
value[index] = v;
return oldValue;
}
@Deprecated
@Override
public Short getKey() {
return Short.valueOf(key[index]);
}
@SuppressWarnings("unchecked")
@Override
public boolean equals(final Object o) {
if (!(o instanceof Map.Entry))
return false;
Map.Entry<Short, V> e = (Map.Entry<Short, V>) o;
return (strategy.equals((key[index]), ((e.getKey()).shortValue()))) && ((value[index]) == ((e.getValue())));
}
@Override
public int hashCode() {
return (strategy.hashCode(key[index]))
^ ((value[index]) == null ? 0 : System.identityHashCode(value[index]));
}
@Override
public String toString() {
return key[index] + "=>" + value[index];
}
}
private class MapIterator {
int pos = n;
int last = -1;
int c = size;
boolean mustReturnNullKey = Short2ReferenceOpenCustomHashMap.this.containsNullKey;
ShortArrayList wrapped;
public boolean hasNext() {
return c != 0;
}
public int nextEntry() {
if (!hasNext())
throw new NoSuchElementException();
c--;
if (mustReturnNullKey) {
mustReturnNullKey = false;
return last = n;
}
final short key[] = Short2ReferenceOpenCustomHashMap.this.key;
for (;;) {
if (--pos < 0) {
last = Integer.MIN_VALUE;
final short k = wrapped.getShort(-pos - 1);
int p = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask;
while (!(strategy.equals((k), (key[p]))))
p = (p + 1) & mask;
return p;
}
if (!((key[pos]) == ((short) 0)))
return last = pos;
}
}
private void shiftKeys(int pos) {
int last, slot;
short curr;
final short[] key = Short2ReferenceOpenCustomHashMap.this.key;
for (;;) {
pos = ((last = pos) + 1) & mask;
for (;;) {
if (((curr = key[pos]) == ((short) 0))) {
key[last] = ((short) 0);
value[last] = null;
return;
}
slot = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(curr))) & mask;
if (last <= pos ? last >= slot || slot > pos : last >= slot && slot > pos)
break;
pos = (pos + 1) & mask;
}
if (pos < last) {
if (wrapped == null)
wrapped = new ShortArrayList(2);
wrapped.add(key[pos]);
}
key[last] = curr;
value[last] = value[pos];
}
}
public void remove() {
if (last == -1)
throw new IllegalStateException();
if (last == n) {
containsNullKey = false;
value[n] = null;
} else if (pos >= 0)
shiftKeys(last);
else {
Short2ReferenceOpenCustomHashMap.this.remove(wrapped.getShort(-pos - 1));
last = -1;
return;
}
size--;
last = -1;
if (ASSERTS)
checkTable();
}
public int skip(final int n) {
int i = n;
while (i-- != 0 && hasNext())
nextEntry();
return n - i - 1;
}
}
private class EntryIterator extends MapIterator implements ObjectIterator<Short2ReferenceMap.Entry<V>> {
private MapEntry entry;
@Override
public MapEntry next() {
return entry = new MapEntry(nextEntry());
}
@Override
public void remove() {
super.remove();
entry.index = -1;
}
}
private class FastEntryIterator extends MapIterator implements ObjectIterator<Short2ReferenceMap.Entry<V>> {
private final MapEntry entry = new MapEntry();
@Override
public MapEntry next() {
entry.index = nextEntry();
return entry;
}
}
private final class MapEntrySet extends AbstractObjectSet<Short2ReferenceMap.Entry<V>> implements FastEntrySet<V> {
@Override
public ObjectIterator<Short2ReferenceMap.Entry<V>> iterator() {
return new EntryIterator();
}
@Override
public ObjectIterator<Short2ReferenceMap.Entry<V>> fastIterator() {
return new FastEntryIterator();
}
@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.getKey() == null || !(e.getKey() instanceof Short))
return false;
final short k = ((Short) (e.getKey())).shortValue();
final V v = ((V) e.getValue());
if ((strategy.equals((k), ((short) 0))))
return Short2ReferenceOpenCustomHashMap.this.containsNullKey && ((value[n]) == (v));
short curr;
final short[] key = Short2ReferenceOpenCustomHashMap.this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k)))
& mask]) == ((short) 0)))
return false;
if ((strategy.equals((k), (curr))))
return ((value[pos]) == (v));
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return false;
if ((strategy.equals((k), (curr))))
return ((value[pos]) == (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.getKey() == null || !(e.getKey() instanceof Short))
return false;
final short k = ((Short) (e.getKey())).shortValue();
final V v = ((V) e.getValue());
if ((strategy.equals((k), ((short) 0)))) {
if (containsNullKey && ((value[n]) == (v))) {
removeNullEntry();
return true;
}
return false;
}
short curr;
final short[] key = Short2ReferenceOpenCustomHashMap.this.key;
int pos;
if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k)))
& mask]) == ((short) 0)))
return false;
if ((strategy.equals((curr), (k)))) {
if (((value[pos]) == (v))) {
removeEntry(pos);
return true;
}
return false;
}
while (true) {
if (((curr = key[pos = (pos + 1) & mask]) == ((short) 0)))
return false;
if ((strategy.equals((curr), (k)))) {
if (((value[pos]) == (v))) {
removeEntry(pos);
return true;
}
}
}
}
@Override
public int size() {
return size;
}
@Override
public void clear() {
Short2ReferenceOpenCustomHashMap.this.clear();
}
@Override
public void forEach(final Consumer<? super Short2ReferenceMap.Entry<V>> consumer) {
if (containsNullKey)
consumer.accept(new AbstractShort2ReferenceMap.BasicEntry<V>(key[n], value[n]));
for (int pos = n; pos-- != 0;)
if (!((key[pos]) == ((short) 0)))
consumer.accept(new AbstractShort2ReferenceMap.BasicEntry<V>(key[pos], value[pos]));
}
@Override
public void fastForEach(final Consumer<? super Short2ReferenceMap.Entry<V>> consumer) {
final AbstractShort2ReferenceMap.BasicEntry<V> entry = new AbstractShort2ReferenceMap.BasicEntry<>();
if (containsNullKey) {
entry.key = key[n];
entry.value = value[n];
consumer.accept(entry);
}
for (int pos = n; pos-- != 0;)
if (!((key[pos]) == ((short) 0))) {
entry.key = key[pos];
entry.value = value[pos];
consumer.accept(entry);
}
}
}
@Override
public FastEntrySet<V> short2ReferenceEntrySet() {
if (entries == null)
entries = new MapEntrySet();
return entries;
}
private final class KeyIterator extends MapIterator implements ShortIterator {
public KeyIterator() {
super();
}
@Override
public short nextShort() {
return key[nextEntry()];
}
}
private final class KeySet extends AbstractShortSet {
@Override
public ShortIterator iterator() {
return new KeyIterator();
}
@Override
public void forEach(final java.util.function.IntConsumer consumer) {
if (containsNullKey)
consumer.accept(key[n]);
for (int pos = n; pos-- != 0;) {
final short k = key[pos];
if (!((k) == ((short) 0)))
consumer.accept(k);
}
}
@Override
public int size() {
return size;
}
@Override
public boolean contains(short k) {
return containsKey(k);
}
@Override
public boolean remove(short k) {
final int oldSize = size;
Short2ReferenceOpenCustomHashMap.this.remove(k);
return size != oldSize;
}
@Override
public void clear() {
Short2ReferenceOpenCustomHashMap.this.clear();
}
}
@Override
public ShortSet keySet() {
if (keys == null)
keys = new KeySet();
return keys;
}
private final class ValueIterator extends MapIterator implements ObjectIterator<V> {
public ValueIterator() {
super();
}
@Override
public V next() {
return value[nextEntry()];
}
}
@Override
public ReferenceCollection<V> values() {
if (values == null)
values = new AbstractReferenceCollection<V>() {
@Override
public ObjectIterator<V> iterator() {
return new ValueIterator();
}
@Override
public int size() {
return size;
}
@Override
public boolean contains(Object v) {
return containsValue(v);
}
@Override
public void clear() {
Short2ReferenceOpenCustomHashMap.this.clear();
}
@Override
public void forEach(final Consumer<? super V> consumer) {
if (containsNullKey)
consumer.accept(value[n]);
for (int pos = n; pos-- != 0;)
if (!((key[pos]) == ((short) 0)))
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 short key[] = this.key;
final V value[] = this.value;
final int mask = newN - 1;
final short newKey[] = new short[newN + 1];
final V newValue[] = (V[]) new Object[newN + 1];
int i = n, pos;
for (int j = realSize(); j-- != 0;) {
while (((key[--i]) == ((short) 0)));
if (!((newKey[pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(key[i])))
& mask]) == ((short) 0)))
while (!((newKey[pos = (pos + 1) & mask]) == ((short) 0)));
newKey[pos] = key[i];
newValue[pos] = value[i];
}
newValue[newN] = value[n];
n = newN;
this.mask = mask;
maxFill = maxFill(n, f);
this.key = newKey;
this.value = newValue;
}
@Override
@SuppressWarnings("unchecked")
public Short2ReferenceOpenCustomHashMap<V> clone() {
Short2ReferenceOpenCustomHashMap<V> c;
try {
c = (Short2ReferenceOpenCustomHashMap<V>) 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.strategy = strategy;
return c;
}
@Override
public int hashCode() {
int h = 0;
for (int j = realSize(), i = 0, t = 0; j-- != 0;) {
while (((key[i]) == ((short) 0)))
i++;
t = (strategy.hashCode(key[i]));
if (this != value[i])
t ^= ((value[i]) == null ? 0 : System.identityHashCode(value[i]));
h += t;
i++;
}
if (containsNullKey)
h += ((value[n]) == null ? 0 : System.identityHashCode(value[n]));
return h;
}
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException {
final short key[] = this.key;
final V value[] = this.value;
final MapIterator i = new MapIterator();
s.defaultWriteObject();
for (int j = size, e; j-- != 0;) {
e = i.nextEntry();
s.writeShort(key[e]);
s.writeObject(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 short key[] = this.key = new short[n + 1];
final V value[] = this.value = (V[]) new Object[n + 1];
short k;
V v;
for (int i = size, pos; i-- != 0;) {
k = s.readShort();
v = (V) s.readObject();
if ((strategy.equals((k), ((short) 0)))) {
pos = n;
containsNullKey = true;
} else {
pos = (it.unimi.dsi.fastutil.HashCommon.mix(strategy.hashCode(k))) & mask;
while (!((key[pos]) == ((short) 0)))
pos = (pos + 1) & mask;
}
key[pos] = k;
value[pos] = v;
}
if (ASSERTS)
checkTable();
}
private void checkTable() {
}
}