@Override public boolean containsValue(Object value) { return containsValue(((Byte) value).byteValue()); }
int valueIndex(byte value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { if ((byte) (entry = tab[i]) != free) { if (value == (byte) (entry >>> 8)) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
@Override public boolean containsValue(byte value) { return valueIndex(value) >= 0; }
int insert(byte key, byte value) { byte free; if (key == (free = freeValue)) { free = changeFree(); incrementModCount(); tab[index] = (char) ((((int) key) & BYTE_MASK) | (((int) value) << 8)); postInsertHook(); return -1;
final void move(ParallelKVByteByteQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.move(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
@Override public void clear() { int mc = modCount() + 1; super.clear(); if (mc != modCount()) throw new ConcurrentModificationException(); }
final void copy(ParallelKVByteByteQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
int insert(byte key, byte value) { byte free; if (key == (free = freeValue)) { free = changeFree(); incrementModCount(); tab[index] = (char) ((((int) key) & BYTE_MASK) | (((int) value) << 8)); postInsertHook(); return -1;
final void move(ParallelKVByteByteQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.move(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
@Override public void clear() { int mc = modCount() + 1; super.clear(); if (mc != modCount()) throw new ConcurrentModificationException(); }
final void copy(ParallelKVByteByteQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
int valueIndex(byte value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { if ((byte) (entry = tab[i]) != free) { if (value == (byte) (entry >>> 8)) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
@Override public boolean containsValue(byte value) { return valueIndex(value) >= 0; }
@Override public boolean containsValue(Object value) { return containsValue(((Byte) value).byteValue()); }