@Override public short putIfAbsent(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return values[index]; } }
@Override public short getShort(Object key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public short getShort(Object key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public short putIfAbsent(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return values[index]; } }
@Override public short put(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present short[] vals = values; short prevValue = vals[index]; vals[index] = value; return prevValue; } }
@Override public short replace(K 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 put(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present short[] vals = values; short prevValue = vals[index]; vals[index] = value; return prevValue; } }
@Override public short replace(K 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(); } }
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 short computeIfPresent(K key, ObjShortToShortFunction<? super K> 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(K key, ObjShortToShortFunction<? super K> 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(); } }
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();
short newValue = (short) (defaultValue() + value); incrementModCount(); keys[firstRemoved] = null; short newValue = (short) (defaultValue() + value); incrementModCount(); keys[index] = null;
short newValue = (short) (defaultValue() + value); incrementModCount(); keys[firstRemoved] = null; short newValue = (short) (defaultValue() + value); incrementModCount(); keys[index] = null;
short newValue = remappingFunction.applyAsShort(null, defaultValue()); incrementModCount(); keys[firstRemoved] = null; short newValue = remappingFunction.applyAsShort(null, defaultValue()); incrementModCount(); keys[index] = null;
short newValue = remappingFunction.applyAsShort(null, defaultValue()); incrementModCount(); keys[firstRemoved] = null; short newValue = remappingFunction.applyAsShort(null, defaultValue()); incrementModCount(); keys[index] = null;
short newValue = remappingFunction.applyAsShort(key, defaultValue()); incrementModCount(); keys[firstRemoved] = key; short newValue = remappingFunction.applyAsShort(key, defaultValue()); incrementModCount(); keys[index] = key;
short newValue = remappingFunction.applyAsShort(key, defaultValue()); incrementModCount(); keys[firstRemoved] = key; short newValue = remappingFunction.applyAsShort(key, defaultValue()); incrementModCount(); keys[index] = key;