@Override public Short putIfAbsent(K key, Short value) { int index = insert(key, value); if (index < 0) { // key was absent return null; } else { // key is present return values[index]; } }
@Override public void justPut(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return; } else { // key is present values[index] = value; return; } }
@Override public short addValue(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return value; } else { // key is present short[] vals = values; short newValue = (short) (vals[index] + value); vals[index] = newValue; return newValue; } }
@Override public Short putIfAbsent(K key, Short value) { int index = insert(key, value); if (index < 0) { // key was absent return null; } else { // key is present return values[index]; } }
@Override public void justPut(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return; } else { // key is present values[index] = value; return; } }
@Override public Short put(K key, Short value) { int index = insert(key, value); if (index < 0) { // key was absent return null; } else { // key is present short[] vals = values; short prevValue = vals[index]; vals[index] = value; return prevValue; } }
@Override public Short put(K key, Short value) { int index = insert(key, value); if (index < 0) { // key was absent return null; } else { // key is present short[] vals = values; short prevValue = vals[index]; vals[index] = value; return prevValue; } }
@Override public short addValue(K key, short value) { int index = insert(key, value); if (index < 0) { // key was absent return value; } else { // key is present short[] vals = values; short newValue = (short) (vals[index] + value); vals[index] = newValue; return newValue; } }
@Override public short addValue(K key, short addition, short defaultValue) { short value = (short) (defaultValue + addition); int index = insert(key, value); if (index < 0) { // key was absent return value; } else { // key is present short[] vals = values; short newValue = (short) (vals[index] + addition); vals[index] = newValue; return newValue; } }
@Override public short addValue(K key, short addition, short defaultValue) { short value = (short) (defaultValue + addition); int index = insert(key, value); if (index < 0) { // key was absent return value; } else { // key is present short[] vals = values; short newValue = (short) (vals[index] + addition); vals[index] = newValue; return newValue; } }
@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 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 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; } }