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