@Override public boolean containsEntry(short key, int value) { int index = index(key); if (index >= 0) { // key is present return values[index] == value; } else { // key is absent return false; } }
@Override public boolean containsEntry(short key, int value) { int index = index(key); if (index >= 0) { // key is present return values[index] == value; } else { // key is absent return false; } }
@Override public Integer getOrDefault(Object key, Integer defaultValue) { int index = index((Short) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public int getOrDefault(short key, int defaultValue) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public Integer get(Object key) { int index = index((Short) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return null; } }
@Override public Integer getOrDefault(Object key, Integer defaultValue) { int index = index((Short) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public int getOrDefault(short key, int defaultValue) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue; } }
@Override public Integer get(Object key) { int index = index((Short) key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return null; } }
@Override public Integer replace(Short key, Integer value) { int index = index(key); if (index >= 0) { // key is present int[] vals = values; int oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return null; } }
@Override public Integer replace(Short key, Integer value) { int index = index(key); if (index >= 0) { // key is present int[] vals = values; int oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return null; } }
@Override public boolean replace(short key, int oldValue, int newValue) { int index = index(key); if (index >= 0) { // key is present int[] vals = values; if (vals[index] == oldValue) { vals[index] = newValue; return true; } else { return false; } } else { // key is absent return false; } }
@Override public boolean replace(short key, int oldValue, int newValue) { int index = index(key); if (index >= 0) { // key is present int[] vals = values; if (vals[index] == oldValue) { vals[index] = newValue; return true; } else { return false; } } else { // key is absent return false; } }
@Override public int get(short key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public int get(short key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public int replace(short key, int value) { int index = index(key); if (index >= 0) { // key is present int[] vals = values; int oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return defaultValue(); } }
@Override public int replace(short key, int value) { int index = index(key); if (index >= 0) { // key is present int[] vals = values; int oldValue = vals[index]; vals[index] = value; return oldValue; } else { // key is absent return defaultValue(); } }
@Override public int computeIfPresent(short key, ShortIntToIntFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present int[] vals = values; int newValue = remappingFunction.applyAsInt(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public int computeIfPresent(short key, ShortIntToIntFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present int[] vals = values; int newValue = remappingFunction.applyAsInt(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public Integer computeIfPresent(Short key, BiFunction<? super Short, ? super Integer, ? extends Integer> remappingFunction) { short k = key; if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(k); if (index >= 0) { // key is present int[] vals = values; Integer 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 Integer computeIfPresent(Short key, BiFunction<? super Short, ? super Integer, ? extends Integer> remappingFunction) { short k = key; if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(k); if (index >= 0) { // key is present int[] vals = values; Integer 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; } }