@Override public boolean containsValue(Object value) { return containsValue(((Long) value).longValue()); }
int valueIndex(long value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { if (value == tab[i + 1]) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
@Override public boolean containsValue(long value) { return valueIndex(value) >= 0; }
incrementModCount(); tab[index] = key; tab[index + 1] = value; postInsertHook(); return -1;
final void move(ParallelKVDoubleLongQHash 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(ParallelKVDoubleLongQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
incrementModCount(); tab[index] = key; tab[index + 1] = value; postInsertHook(); return -1;
final void move(ParallelKVDoubleLongQHash 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(ParallelKVDoubleLongQHash hash) { int myMC = modCount(), hashMC = hash.modCount(); super.copy(hash); if (myMC != modCount() || hashMC != hash.modCount()) throw new ConcurrentModificationException(); }
int valueIndex(long value) { if (isEmpty()) return -1; int index = -1; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { if (value == tab[i + 1]) { index = i; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return index; }
@Override public boolean containsValue(long value) { return valueIndex(value) >= 0; }
@Override public boolean containsValue(Object value) { return containsValue(((Long) value).longValue()); }