@Override public int hashCode() { int hashCode = 0; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { hashCode += nullableKeyHashCode(key) ^ nullableValueHashCode((V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { hashCode += nullableKeyHashCode(key) ^ nullableValueHashCode((V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { hashCode += nullableKeyHashCode(key) ^ nullableValueHashCode((V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { hashCode += nullableKeyHashCode(key) ^ nullableValueHashCode((V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
int index; if ((K) newTab[index = ParallelKVObjKeyMixing.mix(nullableKeyHashCode(key)) % capacity] != FREE) { int bIndex = index, fIndex = index, step = 2; while (true) { int index; if ((K) newTab[index = ParallelKVObjKeyMixing.mix(nullableKeyHashCode(key)) % capacity] != FREE) { int bIndex = index, fIndex = index, step = 2; while (true) {
int index; if ((K) newTab[index = ParallelKVObjKeyMixing.mix(nullableKeyHashCode(key)) % capacity] != FREE) { int bIndex = index, fIndex = index, step = 2; while (true) { int index; if ((K) newTab[index = ParallelKVObjKeyMixing.mix(nullableKeyHashCode(key)) % capacity] != FREE) { int bIndex = index, fIndex = index, step = 2; while (true) {