@Override public boolean containsValue(Object value) { return containsValue(((Character) value).charValue()); }
int valueIndex(char value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { if ((char) (entry = tab[i]) != free) { if (value == (char) (entry >>> 16)) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
@Override public boolean containsValue(char value) { return valueIndex(value) >= 0; }
int insert(char key, char value) { char free; if (key == (free = freeValue)) { free = changeFree(); incrementModCount(); tab[index] = (((int) key) | (((int) value) << 16)); postInsertHook(); return -1;
final void copy(ParallelKVCharCharQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
final void move(ParallelKVCharCharQHash 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(); }
int insert(char key, char value) { char free; if (key == (free = freeValue)) { free = changeFree(); incrementModCount(); tab[index] = (((int) key) | (((int) value) << 16)); postInsertHook(); return -1;
final void copy(ParallelKVCharCharQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
final void move(ParallelKVCharCharQHash 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(); }
int valueIndex(char value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { if ((char) (entry = tab[i]) != free) { if (value == (char) (entry >>> 16)) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
@Override public boolean containsValue(Object value) { return containsValue(((Character) value).charValue()); }
@Override public boolean containsValue(char value) { return valueIndex(value) >= 0; }