@Override public boolean containsValue(Object value) { return containsValue(((Short) value).shortValue()); }
Object cur; keyAbsentFreeSlot: if ((cur = keys[index = SeparateKVObjKeyMixing.mix(keyHashCode(key)) % (capacity = keys.length)]) != FREE) { if (cur == key) { int firstRemoved; if (cur != REMOVED) { if (!keyEquals(key, (K) cur)) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { index = bIndex; break keyAbsentFreeSlot; } else if (cur == key || (keyEquals(key, (K) cur))) { index = fIndex; break keyAbsentFreeSlot; } else if (cur == key || (keyEquals(key, (K) cur))) { if (keyEquals(key, (K) cur)) { if (keyEquals(key, (K) cur)) { incrementModCount(); keys[firstRemoved] = key; values[firstRemoved] = value; postRemovedSlotInsertHook(); return -1;
int valueIndex(short value) { if (this.isEmpty()) return -1; int index = -1; int mc = modCount(); Object[] keys = set; short[] 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;
int firstRemoved; if (cur != REMOVED) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { incrementModCount(); keys[firstRemoved] = null; values[firstRemoved] = value; postRemovedSlotInsertHook(); return -1; incrementModCount(); keys[index] = null; values[index] = value; postFreeSlotInsertHook(); return -1;
@Override final void move(SeparateKVObjShortQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.move(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 copy(SeparateKVObjShortQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
int firstRemoved; if (cur != REMOVED) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { incrementModCount(); keys[firstRemoved] = null; values[firstRemoved] = value; postRemovedSlotInsertHook(); return -1; incrementModCount(); keys[index] = null; values[index] = value; postFreeSlotInsertHook(); return -1;
@Override final void move(SeparateKVObjShortQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.move(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 copy(SeparateKVObjShortQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
Object cur; keyAbsentFreeSlot: if ((cur = keys[index = SeparateKVObjKeyMixing.mix(keyHashCode(key)) % (capacity = keys.length)]) != FREE) { if (cur == key) { int firstRemoved; if (cur != REMOVED) { if (!keyEquals(key, (K) cur)) { if (noRemoved()) { int bIndex = index, fIndex = index, step = 1; while (true) { index = bIndex; break keyAbsentFreeSlot; } else if (cur == key || (keyEquals(key, (K) cur))) { index = fIndex; break keyAbsentFreeSlot; } else if (cur == key || (keyEquals(key, (K) cur))) { if (keyEquals(key, (K) cur)) { if (keyEquals(key, (K) cur)) { incrementModCount(); keys[firstRemoved] = key; values[firstRemoved] = value; postRemovedSlotInsertHook(); return -1;
int valueIndex(short value) { if (this.isEmpty()) return -1; int index = -1; int mc = modCount(); Object[] keys = set; short[] 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(((Short) value).shortValue()); }