@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public char computeIfPresent(byte key, ByteCharToCharFunction remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present char[] vals = values; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue; } else { // key is absent return defaultValue(); } }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte removed = removedValue; byte[] keys = set; char[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.applyAsChar(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte removed = removedValue; byte[] keys = set; char[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.applyAsChar(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteCharToCharFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); byte free = freeValue; byte[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { byte key; if ((key = keys[i]) != free) { vals[i] = function.applyAsChar(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
char newValue = remappingFunction.applyAsChar(key, defaultValue()); incrementModCount(); keys[index] = key; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue;
char newValue = remappingFunction.applyAsChar(key, defaultValue()); incrementModCount(); keys[index] = key; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue;
char newValue = remappingFunction.applyAsChar(key, defaultValue()); incrementModCount(); keys[index] = key; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue;
char newValue = remappingFunction.applyAsChar(key, defaultValue()); incrementModCount(); keys[index] = key; char newValue = remappingFunction.applyAsChar(key, vals[index]); vals[index] = newValue; return newValue;