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; values[firstRemoved] = value; postRemovedSlotInsertHook(); return -1; incrementModCount(); keys[index] = key; values[index] = value; postFreeSlotInsertHook(); return -1;
@Override public boolean containsValue(Object value) { return containsValue(((Integer) value).intValue()); }
int valueIndex(int value) { if (this.isEmpty()) return -1; int index = -1; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index;
@Override final void copy(SeparateKVShortIntQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
private void doClear() { int mc = modCount() + 1; super.clear(); if (mc != modCount()) throw new ConcurrentModificationException(); }
@Override final void move(SeparateKVShortIntQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.move(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
@Override final void copy(SeparateKVShortIntQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
private void doClear() { int mc = modCount() + 1; super.clear(); if (mc != modCount()) throw new ConcurrentModificationException(); }
@Override final void move(SeparateKVShortIntQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.move(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
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; values[firstRemoved] = value; postRemovedSlotInsertHook(); return -1; incrementModCount(); keys[index] = key; values[index] = value; postFreeSlotInsertHook(); return -1;
int valueIndex(int value) { if (this.isEmpty()) return -1; int index = -1; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index;
@Override public boolean containsValue(Object value) { return containsValue(((Integer) value).intValue()); }