package it.unimi.dsi.fastutil.doubles;
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.ObjectCollection;
import it.unimi.dsi.fastutil.objects.AbstractObjectCollection;
import java.util.Comparator;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
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 Double2ObjectLinkedOpenHashMap<V> extends AbstractDouble2ObjectSortedMap<V>
implements
java.io.Serializable,
Cloneable,
Hash {
private static final long serialVersionUID = 0L;
private static final boolean ASSERTS = false;
protected transient double[] key;
protected transient V[] 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<V> entries;
protected transient DoubleSortedSet keys;
protected transient ObjectCollection<V> values;
@SuppressWarnings("unchecked")
public Double2ObjectLinkedOpenHashMap(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 = new double[n + 1];
value = (V[]) new Object[n + 1];
link = new long[n + 1];
}
public Double2ObjectLinkedOpenHashMap(final int expected) {
this(expected, DEFAULT_LOAD_FACTOR);
}
public Double2ObjectLinkedOpenHashMap() {
this(DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR);
}
public Double2ObjectLinkedOpenHashMap(final Map<? extends Double, ? extends V> m, final float f) {
this(m.size(), f);
putAll(m);
}
public Double2ObjectLinkedOpenHashMap(final Map<? extends Double, ? extends V> m) {
this(m, DEFAULT_LOAD_FACTOR);
}
public Double2ObjectLinkedOpenHashMap(final Double2ObjectMap<V> m, final float f) {
this(m.size(), f);
putAll(m);
}
public Double2ObjectLinkedOpenHashMap(final Double2ObjectMap<V> m) {
this(m, DEFAULT_LOAD_FACTOR);
}
public Double2ObjectLinkedOpenHashMap(final double[] k, final V[] 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 Double2ObjectLinkedOpenHashMap(final double[] k, final V[] 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 V removeEntry(final int pos) {
final V oldValue = value[pos];
value[pos] = null;
size--;
fixPointers(pos);
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--;
fixPointers(n);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return oldValue;
}
@Override
public void putAll(Map<? extends Double, ? extends V> m) {
if (f <= .5)
ensureCapacity(m.size());
else
tryCapacity(size() + m.size());
super.putAll(m);
}
private int find(final double k) {
if ((Double.doubleToLongBits(k) == 0))
return containsNullKey ? n : -(n + 1);
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return -(pos + 1);
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return pos;
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return -(pos + 1);
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return pos;
}
}
private void insert(final int pos, final double k, final V 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 V put(final double 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;
double curr;
final double[] key = this.key;
for (;;) {
pos = ((last = pos) + 1) & mask;
for (;;) {
if ((Double.doubleToLongBits(curr = key[pos]) == 0)) {
key[last] = (0);
value[last] = null;
return;
}
slot = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(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
public V remove(final double k) {
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey)
return removeNullEntry();
return defRetValue;
}
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return removeEntry(pos);
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return removeEntry(pos);
}
}
private V setValue(final int pos, final V v) {
final V oldValue = value[pos];
value[pos] = v;
return oldValue;
}
public V removeFirst() {
if (size == 0)
throw new NoSuchElementException();
final int pos = first;
first = (int) link[pos];
if (0 <= first) {
link[first] |= (-1 & 0xFFFFFFFFL) << 32;
}
size--;
final V v = value[pos];
if (pos == n) {
containsNullKey = false;
value[n] = null;
} else
shiftKeys(pos);
if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE)
rehash(n / 2);
return v;
}
public V removeLast() {
if (size == 0)
throw new NoSuchElementException();
final int pos = last;
last = (int) (link[pos] >>> 32);
if (0 <= last) {
link[last] |= -1 & 0xFFFFFFFFL;
}
size--;
final V v = value[pos];
if (pos == n) {
containsNullKey = false;
value[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 V getAndMoveToFirst(final double k) {
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey) {
moveIndexToFirst(n);
return value[n];
}
return defRetValue;
}
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr))) {
moveIndexToFirst(pos);
return value[pos];
}
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr))) {
moveIndexToFirst(pos);
return value[pos];
}
}
}
public V getAndMoveToLast(final double k) {
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey) {
moveIndexToLast(n);
return value[n];
}
return defRetValue;
}
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr))) {
moveIndexToLast(pos);
return value[pos];
}
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr))) {
moveIndexToLast(pos);
return value[pos];
}
}
}
public V putAndMoveToFirst(final double k, final V v) {
int pos;
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey) {
moveIndexToFirst(n);
return setValue(n, v);
}
containsNullKey = true;
pos = n;
} else {
double curr;
final double[] key = this.key;
if (!(Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0)) {
if ((Double.doubleToLongBits(curr) == Double.doubleToLongBits(k))) {
moveIndexToFirst(pos);
return setValue(pos, v);
}
while (!(Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
if ((Double.doubleToLongBits(curr) == Double.doubleToLongBits(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 V putAndMoveToLast(final double k, final V v) {
int pos;
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey) {
moveIndexToLast(n);
return setValue(n, v);
}
containsNullKey = true;
pos = n;
} else {
double curr;
final double[] key = this.key;
if (!(Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0)) {
if ((Double.doubleToLongBits(curr) == Double.doubleToLongBits(k))) {
moveIndexToLast(pos);
return setValue(pos, v);
}
while (!(Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
if ((Double.doubleToLongBits(curr) == Double.doubleToLongBits(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
public V get(final double k) {
if ((Double.doubleToLongBits(k) == 0))
return containsNullKey ? value[n] : defRetValue;
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return value[pos];
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return defRetValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return value[pos];
}
}
@Override
public boolean containsKey(final double k) {
if ((Double.doubleToLongBits(k) == 0))
return containsNullKey;
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return false;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return true;
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return false;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return true;
}
}
@Override
public boolean containsValue(final Object v) {
final V value[] = this.value;
final double key[] = this.key;
if (containsNullKey && java.util.Objects.equals(value[n], v))
return true;
for (int i = n; i-- != 0;)
if (!(Double.doubleToLongBits(key[i]) == 0) && java.util.Objects.equals(value[i], v))
return true;
return false;
}
@Override
public V getOrDefault(final double k, final V defaultValue) {
if ((Double.doubleToLongBits(k) == 0))
return containsNullKey ? value[n] : defaultValue;
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return defaultValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return value[pos];
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return defaultValue;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return value[pos];
}
}
@Override
public V putIfAbsent(final double 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 double k, final Object v) {
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey && java.util.Objects.equals(v, value[n])) {
removeNullEntry();
return true;
}
return false;
}
double curr;
final double[] key = this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return false;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)) && java.util.Objects.equals(v, value[pos])) {
removeEntry(pos);
return true;
}
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return false;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr))
&& java.util.Objects.equals(v, value[pos])) {
removeEntry(pos);
return true;
}
}
}
@Override
public boolean replace(final double k, final V oldValue, final V v) {
final int pos = find(k);
if (pos < 0 || !java.util.Objects.equals(oldValue, value[pos]))
return false;
value[pos] = v;
return true;
}
@Override
public V replace(final double 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 double k, final java.util.function.DoubleFunction<? 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 double k,
final java.util.function.BiFunction<? super Double, ? 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(Double.valueOf(k), (value[pos]));
if (newValue == null) {
if ((Double.doubleToLongBits(k) == 0))
removeNullEntry();
else
removeEntry(pos);
return defRetValue;
}
return value[pos] = (newValue);
}
@Override
public V compute(final double k,
final java.util.function.BiFunction<? super Double, ? super V, ? extends V> remappingFunction) {
java.util.Objects.requireNonNull(remappingFunction);
final int pos = find(k);
final V newValue = remappingFunction.apply(Double.valueOf(k), pos >= 0 ? (value[pos]) : null);
if (newValue == null) {
if (pos >= 0) {
if ((Double.doubleToLongBits(k) == 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 double 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 ((Double.doubleToLongBits(k) == 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, (0));
Arrays.fill(value, null);
first = last = -1;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
final class MapEntry implements Double2ObjectMap.Entry<V>, Map.Entry<Double, V> {
int index;
MapEntry(final int index) {
this.index = index;
}
MapEntry() {
}
@Override
public double getDoubleKey() {
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 Double getKey() {
return Double.valueOf(key[index]);
}
@SuppressWarnings("unchecked")
@Override
public boolean equals(final Object o) {
if (!(o instanceof Map.Entry))
return false;
Map.Entry<Double, V> e = (Map.Entry<Double, V>) o;
return (Double.doubleToLongBits(key[index]) == Double.doubleToLongBits((e.getKey()).doubleValue()))
&& java.util.Objects.equals(value[index], (e.getValue()));
}
@Override
public int hashCode() {
return it.unimi.dsi.fastutil.HashCommon.double2int(key[index])
^ ((value[index]) == null ? 0 : (value[index]).hashCode());
}
@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 double firstDoubleKey() {
if (size == 0)
throw new NoSuchElementException();
return key[first];
}
@Override
public double lastDoubleKey() {
if (size == 0)
throw new NoSuchElementException();
return key[last];
}
@Override
public Double2ObjectSortedMap<V> tailMap(double from) {
throw new UnsupportedOperationException();
}
@Override
public Double2ObjectSortedMap<V> headMap(double to) {
throw new UnsupportedOperationException();
}
@Override
public Double2ObjectSortedMap<V> subMap(double from, double to) {
throw new UnsupportedOperationException();
}
@Override
public DoubleComparator 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 double from) {
if ((Double.doubleToLongBits(from) == 0)) {
if (Double2ObjectLinkedOpenHashMap.this.containsNullKey) {
next = (int) link[n];
prev = n;
return;
} else
throw new NoSuchElementException("The key " + from + " does not belong to this map.");
}
if ((Double.doubleToLongBits(key[last]) == Double.doubleToLongBits(from))) {
prev = last;
index = size;
return;
}
int pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(from)) & mask;
while (!(Double.doubleToLongBits(key[pos]) == 0)) {
if ((Double.doubleToLongBits(key[pos]) == Double.doubleToLongBits(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) {
Double2ObjectLinkedOpenHashMap.this.containsNullKey = false;
value[n] = null;
} else {
double curr;
final double[] key = Double2ObjectLinkedOpenHashMap.this.key;
for (;;) {
pos = ((last = pos) + 1) & mask;
for (;;) {
if ((Double.doubleToLongBits(curr = key[pos]) == 0)) {
key[last] = (0);
value[last] = null;
return;
}
slot = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(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") Double2ObjectMap.Entry<V> ok) {
throw new UnsupportedOperationException();
}
public void add(@SuppressWarnings("unused") Double2ObjectMap.Entry<V> ok) {
throw new UnsupportedOperationException();
}
}
private class EntryIterator extends MapIterator implements ObjectListIterator<Double2ObjectMap.Entry<V>> {
private MapEntry entry;
public EntryIterator() {
}
public EntryIterator(double 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<Double2ObjectMap.Entry<V>> {
final MapEntry entry = new MapEntry();
public FastEntryIterator() {
}
public FastEntryIterator(double 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<Double2ObjectMap.Entry<V>>
implements
FastSortedEntrySet<V> {
@Override
public ObjectBidirectionalIterator<Double2ObjectMap.Entry<V>> iterator() {
return new EntryIterator();
}
@Override
public Comparator<? super Double2ObjectMap.Entry<V>> comparator() {
return null;
}
@Override
public ObjectSortedSet<Double2ObjectMap.Entry<V>> subSet(Double2ObjectMap.Entry<V> fromElement,
Double2ObjectMap.Entry<V> toElement) {
throw new UnsupportedOperationException();
}
@Override
public ObjectSortedSet<Double2ObjectMap.Entry<V>> headSet(Double2ObjectMap.Entry<V> toElement) {
throw new UnsupportedOperationException();
}
@Override
public ObjectSortedSet<Double2ObjectMap.Entry<V>> tailSet(Double2ObjectMap.Entry<V> fromElement) {
throw new UnsupportedOperationException();
}
@Override
public Double2ObjectMap.Entry<V> first() {
if (size == 0)
throw new NoSuchElementException();
return new MapEntry(Double2ObjectLinkedOpenHashMap.this.first);
}
@Override
public Double2ObjectMap.Entry<V> last() {
if (size == 0)
throw new NoSuchElementException();
return new MapEntry(Double2ObjectLinkedOpenHashMap.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.getKey() == null || !(e.getKey() instanceof Double))
return false;
final double k = ((Double) (e.getKey())).doubleValue();
final V v = ((V) e.getValue());
if ((Double.doubleToLongBits(k) == 0))
return Double2ObjectLinkedOpenHashMap.this.containsNullKey && java.util.Objects.equals(value[n], v);
double curr;
final double[] key = Double2ObjectLinkedOpenHashMap.this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return false;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return java.util.Objects.equals(value[pos], v);
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return false;
if ((Double.doubleToLongBits(k) == Double.doubleToLongBits(curr)))
return java.util.Objects.equals(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 Double))
return false;
final double k = ((Double) (e.getKey())).doubleValue();
final V v = ((V) e.getValue());
if ((Double.doubleToLongBits(k) == 0)) {
if (containsNullKey && java.util.Objects.equals(value[n], v)) {
removeNullEntry();
return true;
}
return false;
}
double curr;
final double[] key = Double2ObjectLinkedOpenHashMap.this.key;
int pos;
if ((Double.doubleToLongBits(
curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k))
& mask]) == 0))
return false;
if ((Double.doubleToLongBits(curr) == Double.doubleToLongBits(k))) {
if (java.util.Objects.equals(value[pos], v)) {
removeEntry(pos);
return true;
}
return false;
}
while (true) {
if ((Double.doubleToLongBits(curr = key[pos = (pos + 1) & mask]) == 0))
return false;
if ((Double.doubleToLongBits(curr) == Double.doubleToLongBits(k))) {
if (java.util.Objects.equals(value[pos], v)) {
removeEntry(pos);
return true;
}
}
}
}
@Override
public int size() {
return size;
}
@Override
public void clear() {
Double2ObjectLinkedOpenHashMap.this.clear();
}
@Override
public ObjectListIterator<Double2ObjectMap.Entry<V>> iterator(final Double2ObjectMap.Entry<V> from) {
return new EntryIterator(from.getDoubleKey());
}
@Override
public ObjectListIterator<Double2ObjectMap.Entry<V>> fastIterator() {
return new FastEntryIterator();
}
@Override
public ObjectListIterator<Double2ObjectMap.Entry<V>> fastIterator(final Double2ObjectMap.Entry<V> from) {
return new FastEntryIterator(from.getDoubleKey());
}
@Override
public void forEach(final Consumer<? super Double2ObjectMap.Entry<V>> consumer) {
for (int i = size, curr, next = first; i-- != 0;) {
curr = next;
next = (int) link[curr];
consumer.accept(new AbstractDouble2ObjectMap.BasicEntry<V>(key[curr], value[curr]));
}
}
@Override
public void fastForEach(final Consumer<? super Double2ObjectMap.Entry<V>> consumer) {
final AbstractDouble2ObjectMap.BasicEntry<V> entry = new AbstractDouble2ObjectMap.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<V> double2ObjectEntrySet() {
if (entries == null)
entries = new MapEntrySet();
return entries;
}
private final class KeyIterator extends MapIterator implements DoubleListIterator {
public KeyIterator(final double k) {
super(k);
}
@Override
public double previousDouble() {
return key[previousEntry()];
}
public KeyIterator() {
super();
}
@Override
public double nextDouble() {
return key[nextEntry()];
}
}
private final class KeySet extends AbstractDoubleSortedSet {
@Override
public DoubleListIterator iterator(final double from) {
return new KeyIterator(from);
}
@Override
public DoubleListIterator iterator() {
return new KeyIterator();
}
@Override
public void forEach(final java.util.function.DoubleConsumer consumer) {
if (containsNullKey)
consumer.accept(key[n]);
for (int pos = n; pos-- != 0;) {
final double k = key[pos];
if (!(Double.doubleToLongBits(k) == 0))
consumer.accept(k);
}
}
@Override
public int size() {
return size;
}
@Override
public boolean contains(double k) {
return containsKey(k);
}
@Override
public boolean remove(double k) {
final int oldSize = size;
Double2ObjectLinkedOpenHashMap.this.remove(k);
return size != oldSize;
}
@Override
public void clear() {
Double2ObjectLinkedOpenHashMap.this.clear();
}
@Override
public double firstDouble() {
if (size == 0)
throw new NoSuchElementException();
return key[first];
}
@Override
public double lastDouble() {
if (size == 0)
throw new NoSuchElementException();
return key[last];
}
@Override
public DoubleComparator comparator() {
return null;
}
@Override
public DoubleSortedSet tailSet(double from) {
throw new UnsupportedOperationException();
}
@Override
public DoubleSortedSet headSet(double to) {
throw new UnsupportedOperationException();
}
@Override
public DoubleSortedSet subSet(double from, double to) {
throw new UnsupportedOperationException();
}
}
@Override
public DoubleSortedSet keySet() {
if (keys == null)
keys = new KeySet();
return keys;
}
private final class ValueIterator extends MapIterator implements ObjectListIterator<V> {
@Override
public V previous() {
return value[previousEntry()];
}
public ValueIterator() {
super();
}
@Override
public V next() {
return value[nextEntry()];
}
}
@Override
public ObjectCollection<V> values() {
if (values == null)
values = new AbstractObjectCollection<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() {
Double2ObjectLinkedOpenHashMap.this.clear();
}
@Override
public void forEach(final Consumer<? super V> consumer) {
if (containsNullKey)
consumer.accept(value[n]);
for (int pos = n; pos-- != 0;)
if (!(Double.doubleToLongBits(key[pos]) == 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 double key[] = this.key;
final V value[] = this.value;
final int mask = newN - 1;
final double newKey[] = new double[newN + 1];
final V newValue[] = (V[]) new Object[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 ((Double.doubleToLongBits(key[i]) == 0))
pos = newN;
else {
pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(key[i])) & mask;
while (!(Double.doubleToLongBits(newKey[pos]) == 0))
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 Double2ObjectLinkedOpenHashMap<V> clone() {
Double2ObjectLinkedOpenHashMap<V> c;
try {
c = (Double2ObjectLinkedOpenHashMap<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.link = link.clone();
return c;
}
@Override
public int hashCode() {
int h = 0;
for (int j = realSize(), i = 0, t = 0; j-- != 0;) {
while ((Double.doubleToLongBits(key[i]) == 0))
i++;
t = it.unimi.dsi.fastutil.HashCommon.double2int(key[i]);
if (this != value[i])
t ^= ((value[i]) == null ? 0 : (value[i]).hashCode());
h += t;
i++;
}
if (containsNullKey)
h += ((value[n]) == null ? 0 : (value[n]).hashCode());
return h;
}
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException {
final double 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.writeDouble(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 double key[] = this.key = new double[n + 1];
final V value[] = this.value = (V[]) new Object[n + 1];
final long link[] = this.link = new long[n + 1];
int prev = -1;
first = last = -1;
double k;
V v;
for (int i = size, pos; i-- != 0;) {
k = s.readDouble();
v = (V) s.readObject();
if ((Double.doubleToLongBits(k) == 0)) {
pos = n;
containsNullKey = true;
} else {
pos = (int) it.unimi.dsi.fastutil.HashCommon.mix(Double.doubleToRawLongBits(k)) & mask;
while (!(Double.doubleToLongBits(key[pos]) == 0))
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() {
}
}