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