@Override public Short get(Object key) { int index = index((Long) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return null; } }
@Override public boolean containsEntry(long key, short value) { int index = index(key); if (index >= 0) { // key is present return values[index] == value; } else { // key is absent return false; } }
@Override public Short getOrDefault(Object key, Short defaultValue) { int index = index((Long) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public boolean containsEntry(long key, short value) { int index = index(key); if (index >= 0) { // key is present return values[index] == value; } else { // key is absent return false; } }
@Override public Short get(Object key) { int index = index((Long) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return null; } }
@Override public short getOrDefault(long key, short defaultValue) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public Short getOrDefault(Object key, Short defaultValue) { int index = index((Long) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public short getOrDefault(long key, short defaultValue) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public Short replace(Long key, Short value) { int index = index(key); if (index >= 0) { // key is present short[] vals = values; short oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return null; } }
@Override public Short replace(Long key, Short value) { int index = index(key); if (index >= 0) { // key is present short[] vals = values; short oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return null; } }
@Override public boolean replace(long key, short oldValue, short newValue) { int index = index(key); if (index >= 0) { // key is present short[] vals = values; if (vals[index] == oldValue) { vals[index] = newValue; return true; } else { return false; } } else { // key is absent return false; } }
@Override public boolean replace(long key, short oldValue, short newValue) { int index = index(key); if (index >= 0) { // key is present short[] vals = values; if (vals[index] == oldValue) { vals[index] = newValue; return true; } else { return false; } } else { // key is absent return false; } }
@Override public short get(long key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public short get(long key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public short replace(long key, short value) { int index = index(key); if (index >= 0) { // key is present short[] vals = values; short oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return defaultValue(); } }
@Override public short replace(long key, short value) { int index = index(key); if (index >= 0) { // key is present short[] vals = values; short oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return defaultValue(); } }
@Override public short computeIfPresent(long key, LongShortToShortFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present short[] vals = values; short newValue = remappingFunction.applyAsShort(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public short computeIfPresent(long key, LongShortToShortFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present short[] vals = values; short newValue = remappingFunction.applyAsShort(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public Short computeIfPresent(Long key, BiFunction<? super Long, ? super Short, ? extends Short> remappingFunction) { long k = key; if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(k); if (index >= 0) { // key is present short[] vals = values; Short newValue = remappingFunction.apply(k, vals[index]); if (newValue != null) { vals[index] = newValue; return newValue; } else { incrementModCount(); set[index] = removedValue; postRemoveHook(); return null; } } else { // key is absent return null; } }
public Short computeIfPresent(Long key, BiFunction<? super Long, ? super Short, ? extends Short> remappingFunction) { long k = key; if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(k); if (index >= 0) { // key is present short[] vals = values; Short newValue = remappingFunction.apply(k, vals[index]); if (newValue != null) { vals[index] = newValue; return newValue; } else { incrementModCount(); set[index] = removedValue; postRemoveHook(); return null; } } else { // key is absent return null; } }