@Override public void clear() { MutableQHashSeparateKVShortIntMapGO.this.clear(); }
@Override public boolean contains(Object o) { return MutableQHashSeparateKVShortIntMapGO.this.containsValue(o); }
@Override public double currentLoad() { return MutableQHashSeparateKVShortIntMapGO.this.currentLoad(); }
@Override public int get(short key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } else { // key is absent return defaultValue(); } }
@Override public int putIfAbsent(short key, int value) { int index = insert(key, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return values[index]; } }
short removed = removedValue; if (key == (free = freeValue)) { free = changeFree(); } else if (key == removed) { removed = changeRemoved(); int firstRemoved; if (cur != removed) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { int newValue = defaultValue() + value; incrementModCount(); keys[firstRemoved] = key; vals[firstRemoved] = newValue; postRemovedSlotInsertHook(); return newValue; int newValue = defaultValue() + value; incrementModCount(); keys[index] = key; vals[index] = newValue; postFreeSlotInsertHook(); return newValue;
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(); incrementModCount(); keys[index] = removed; postRemoveHook(); return val; } else { return defaultValue();
@Override @SuppressWarnings("unchecked") public boolean contains(Object o) { try { Map.Entry<Short, Integer> e = (Map.Entry<Short, Integer>) o; return containsEntry(e.getKey(), e.getValue()); } catch (NullPointerException e) { return false; } catch (ClassCastException e) { return false; } }
@Nonnull @Override public HashConfig hashConfig() { return MutableQHashSeparateKVShortIntMapGO.this.hashConfig(); }
@Override public void clear() { doClear(); }
public int hashCode() { return MutableQHashSeparateKVShortIntMapGO.this.hashCode(); }
short removed = removedValue; if (key == (free = freeValue)) { free = changeFree(); } else if (key == removed) { removed = changeRemoved(); int firstRemoved; if (cur != removed) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { incrementModCount(); keys[firstRemoved] = key; vals[firstRemoved] = newValue; postRemovedSlotInsertHook(); return newValue; incrementModCount(); keys[index] = key; vals[index] = newValue; postFreeSlotInsertHook(); return newValue;
@Override public int get(short key) { int index = index(key); if (index >= 0) { // key is present return values[index]; } 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(); incrementModCount(); keys[index] = removed; postRemoveHook(); return val; } else { return defaultValue();
@Override public int putIfAbsent(short key, int value) { int index = insert(key, value); if (index < 0) { // key was absent return defaultValue(); } else { // key is present return values[index]; } }
@Override @SuppressWarnings("unchecked") public boolean contains(Object o) { try { Map.Entry<Short, Integer> e = (Map.Entry<Short, Integer>) o; return containsEntry(e.getKey(), e.getValue()); } catch (NullPointerException e) { return false; } catch (ClassCastException e) { return false; } }
@Nonnull @Override public HashConfig hashConfig() { return MutableQHashSeparateKVShortIntMapGO.this.hashConfig(); }
@Override public void clear() { doClear(); }
public int hashCode() { return MutableQHashSeparateKVShortIntMapGO.this.hashCode(); }
short removed = removedValue; if (key == (free = freeValue)) { free = changeFree(); } else if (key == removed) { removed = changeRemoved(); int firstRemoved; if (cur != removed) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { int newValue = defaultValue() + value; incrementModCount(); keys[firstRemoved] = key; vals[firstRemoved] = newValue; postRemovedSlotInsertHook(); return newValue; int newValue = defaultValue() + value; incrementModCount(); keys[index] = key; vals[index] = newValue; postFreeSlotInsertHook(); return newValue;