@Override public double putIfAbsent(K key, double value) { int index = insert(key, Double.doubleToLongBits(value)); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return Double.longBitsToDouble(values[index]); } }
@Override public double getDouble(Object key) { int index = index(key); if (index >= 0) { // key is present return Double.longBitsToDouble(values[index]); } else { // key is absent return defaultValue(); } }
@Override public double putIfAbsent(K key, double value) { int index = insert(key, Double.doubleToLongBits(value)); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return Double.longBitsToDouble(values[index]); } }
@Override public double getDouble(Object key) { int index = index(key); if (index >= 0) { // key is present return Double.longBitsToDouble(values[index]); } else { // key is absent return defaultValue(); } }
@Override public double put(K key, double value) { int index = insert(key, Double.doubleToLongBits(value)); if (index < 0) { // key was absent return defaultValue(); } else { // key is present long[] vals = values; double prevValue = Double.longBitsToDouble(vals[index]); vals[index] = Double.doubleToLongBits(value); return prevValue; } }
@Override public double replace(K key, double value) { int index = index(key); if (index >= 0) { // key is present long[] vals = values; double oldValue = Double.longBitsToDouble(vals[index]); vals[index] = Double.doubleToLongBits(value); return oldValue; } else { // key is absent return defaultValue(); } }
@Override public double put(K key, double value) { int index = insert(key, Double.doubleToLongBits(value)); if (index < 0) { // key was absent return defaultValue(); } else { // key is present long[] vals = values; double prevValue = Double.longBitsToDouble(vals[index]); vals[index] = Double.doubleToLongBits(value); return prevValue; } }
@Override public double replace(K key, double value) { int index = index(key); if (index >= 0) { // key is present long[] vals = values; double oldValue = Double.longBitsToDouble(vals[index]); vals[index] = Double.doubleToLongBits(value); return oldValue; } else { // key is absent return defaultValue(); } }
@Override public double computeIfPresent(K key, ObjDoubleToDoubleFunction<? super K> remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present long[] vals = values; double newValue = remappingFunction.applyAsDouble(key, Double.longBitsToDouble(vals[index])); vals[index] = Double.doubleToLongBits(newValue); return newValue; } else { // key is absent return defaultValue(); } }
if (cur == FREE) { return defaultValue(); } else { int bIndex = index, fIndex = index, step = 1; } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue();
if (cur == FREE) { return defaultValue(); } else { int bIndex = index, fIndex = index, step = 1; } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue();
@Override public double computeIfPresent(K key, ObjDoubleToDoubleFunction<? super K> remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present long[] vals = values; double newValue = remappingFunction.applyAsDouble(key, Double.longBitsToDouble(vals[index])); vals[index] = Double.doubleToLongBits(newValue); return newValue; } else { // key is absent return defaultValue(); } }
double newValue = defaultValue() + value; incrementModCount(); keys[firstRemoved] = null; double newValue = defaultValue() + value; incrementModCount(); keys[index] = null;
double newValue = defaultValue() + value; incrementModCount(); keys[firstRemoved] = null; double newValue = defaultValue() + value; incrementModCount(); keys[index] = null;
if (cur == FREE) { return defaultValue(); } else { if (cur != REMOVED) { } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue();
if (cur == FREE) { return defaultValue(); } else { if (cur != REMOVED) { } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue(); } else if (cur == FREE) { return defaultValue();
double newValue = remappingFunction.applyAsDouble(null, defaultValue()); incrementModCount(); keys[firstRemoved] = null; double newValue = remappingFunction.applyAsDouble(null, defaultValue()); incrementModCount(); keys[index] = null;
double newValue = remappingFunction.applyAsDouble(null, defaultValue()); incrementModCount(); keys[firstRemoved] = null; double newValue = remappingFunction.applyAsDouble(null, defaultValue()); incrementModCount(); keys[index] = null;
double newValue = defaultValue() + value; incrementModCount(); keys[firstRemoved] = key; double newValue = defaultValue() + value; incrementModCount(); keys[index] = key;
double newValue = remappingFunction.applyAsDouble(key, defaultValue()); incrementModCount(); keys[firstRemoved] = key; double newValue = remappingFunction.applyAsDouble(key, defaultValue()); incrementModCount(); keys[index] = key;