com.koloboke.collect.impl.hash.MutableQHashParallelKVShortShortMapGO Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of koloboke-impl-jdk8 Show documentation
Show all versions of koloboke-impl-jdk8 Show documentation
Carefully designed and efficient extension of the Java Collections Framework with primitive specializations and more, built for Java 8 (Implementation)
The newest version!
/*
* Copyright 2014 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.koloboke.collect.impl.hash;
import com.koloboke.collect.*;
import com.koloboke.collect.hash.HashConfig;
import com.koloboke.collect.impl.*;
import com.koloboke.collect.map.*;
import com.koloboke.collect.map.hash.*;
import com.koloboke.collect.set.*;
import com.koloboke.collect.set.hash.*;
import java.util.function.BiConsumer;
import java.util.function.BiFunction;
import com.koloboke.function.ShortPredicate;
import com.koloboke.function.ShortShortConsumer;
import com.koloboke.function.ShortShortPredicate;
import com.koloboke.function.ShortShortToShortFunction;
import com.koloboke.function.ShortUnaryOperator;
import java.util.function.Consumer;
import java.util.function.Function;
import java.util.function.Predicate;
import com.koloboke.function.ShortBinaryOperator;
import com.koloboke.function.ShortConsumer;
import com.koloboke.function.ShortPredicate;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import javax.annotation.Nonnull;
import java.util.*;
public class MutableQHashParallelKVShortShortMapGO
extends MutableQHashParallelKVShortShortMapSO {
final void copy(ParallelKVShortShortQHash hash) {
int myMC = modCount(),
hashMC = hash.modCount();
super.copy(hash);
if (myMC != modCount() ||
hashMC != hash.modCount())
throw new ConcurrentModificationException();
}
final void move(ParallelKVShortShortQHash hash) {
int myMC = modCount(),
hashMC = hash.modCount();
super.move(hash);
if (myMC != modCount() ||
hashMC != hash.modCount())
throw new ConcurrentModificationException();
}
@Override
public short defaultValue() {
return (short) 0;
}
@Override
public boolean containsEntry(short key, short value) {
short free;
if (key != (free = freeValue) && key != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) == key) {
// key is present
return (short) (entry >>> 16) == value;
} else {
if (cur == free) {
// key is absent, free slot
return false;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
// key is present
return (short) (entry >>> 16) == value;
} else if (cur == free) {
// key is absent, free slot
return false;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
// key is present
return (short) (entry >>> 16) == value;
} else if (cur == free) {
// key is absent, free slot
return false;
}
step += 2;
}
}
}
} else {
// key is absent
return false;
}
}
@Override
public Short get(Object key) {
short k = (Short) key;
short free;
if (k != (free = freeValue) && k != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) == k) {
// key is present
return (short) (entry >>> 16);
} else {
if (cur == free) {
// key is absent, free slot
return null;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return null;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return null;
}
step += 2;
}
}
}
} else {
// key is absent
return null;
}
}
@Override
public short get(short key) {
short free;
if (key != (free = freeValue) && key != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) == key) {
// key is present
return (short) (entry >>> 16);
} else {
if (cur == free) {
// key is absent, free slot
return defaultValue();
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
step += 2;
}
}
}
} else {
// key is absent
return defaultValue();
}
}
@Override
public Short getOrDefault(Object key, Short defaultValue) {
short k = (Short) key;
short free;
if (k != (free = freeValue) && k != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) == k) {
// key is present
return (short) (entry >>> 16);
} else {
if (cur == free) {
// key is absent, free slot
return defaultValue;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return defaultValue;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return defaultValue;
}
step += 2;
}
}
}
} else {
// key is absent
return defaultValue;
}
}
@Override
public short getOrDefault(short key, short defaultValue) {
short free;
if (key != (free = freeValue) && key != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) == key) {
// key is present
return (short) (entry >>> 16);
} else {
if (cur == free) {
// key is absent, free slot
return defaultValue;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return defaultValue;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
// key is absent, free slot
return defaultValue;
}
step += 2;
}
}
}
} else {
// key is absent
return defaultValue;
}
}
@Override
public void forEach(BiConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(key, (short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept(key, (short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public void forEach(ShortShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(key, (short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept(key, (short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public boolean forEachWhile(ShortShortPredicate predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (!predicate.test(key, (short) (entry >>> 16))) {
terminated = true;
break;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!predicate.test(key, (short) (entry >>> 16))) {
terminated = true;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
@Nonnull
@Override
public ShortShortCursor cursor() {
int mc = modCount();
if (!noRemoved())
return new SomeRemovedMapCursor(
mc);
return new NoRemovedMapCursor(mc);
}
@SuppressWarnings("unchecked")
@Override
public boolean containsAllEntries(Map m) {
return CommonShortShortMapOps.containsAllEntries(this, m);
}
@Override
public boolean allEntriesContainingIn(InternalShortShortMapOps m) {
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (!m.containsEntry(key, (short) (entry >>> 16))) {
containsAll = false;
break;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!m.containsEntry(key, (short) (entry >>> 16))) {
containsAll = false;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
@Override
public void reversePutAllTo(InternalShortShortMapOps m) {
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
m.justPut(key, (short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
m.justPut(key, (short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
@Nonnull
public HashObjSet> entrySet() {
return new EntryView();
}
@Override
@Nonnull
public ShortCollection values() {
return new ValueView();
}
@Override
public boolean equals(Object o) {
return CommonMapOps.equals(this, o);
}
@Override
public int hashCode() {
int hashCode = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
hashCode += key ^ (short) (entry >>> 16);
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
hashCode += key ^ (short) (entry >>> 16);
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return hashCode;
}
@Override
public String toString() {
if (this.isEmpty())
return "{}";
StringBuilder sb = new StringBuilder();
int elementCount = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
sb.append(' ');
sb.append(key);
sb.append('=');
sb.append((short) (entry >>> 16));
sb.append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
sb.append(' ');
sb.append(key);
sb.append('=');
sb.append((short) (entry >>> 16));
sb.append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
sb.setCharAt(0, '{');
sb.setCharAt(sb.length() - 1, '}');
return sb.toString();
}
@Override
void rehash(int newCapacity) {
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
initForRehash(newCapacity);
mc++; // modCount is incremented in initForRehash()
int[] newTab = table;
int capacity = newTab.length;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
int index;
if (U.getShort(newTab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index = ParallelKVShortKeyMixing.mix(key) % capacity)) << INT_SCALE_SHIFT)) != free) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if (U.getShort(newTab, INT_BASE + SHORT_KEY_OFFSET + (((long) (bIndex)) << INT_SCALE_SHIFT)) == free) {
index = bIndex;
break;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if (U.getShort(newTab, INT_BASE + SHORT_KEY_OFFSET + (((long) (fIndex)) << INT_SCALE_SHIFT)) == free) {
index = fIndex;
break;
}
step += 2;
}
}
newTab[index] = entry;
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
int index;
if (U.getShort(newTab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index = ParallelKVShortKeyMixing.mix(key) % capacity)) << INT_SCALE_SHIFT)) != free) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if (U.getShort(newTab, INT_BASE + SHORT_KEY_OFFSET + (((long) (bIndex)) << INT_SCALE_SHIFT)) == free) {
index = bIndex;
break;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if (U.getShort(newTab, INT_BASE + SHORT_KEY_OFFSET + (((long) (fIndex)) << INT_SCALE_SHIFT)) == free) {
index = fIndex;
break;
}
step += 2;
}
}
newTab[index] = entry;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public Short put(Short key, Short value) {
short k = key;
short free;
short removed = removedValue;
if (k == (free = freeValue)) {
free = changeFree();
} else if (k == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) == free) {
// key is absent, free slot
incrementModCount();
tab[index] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else {
keyPresent:
if (cur != k) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else if (cur == k) {
index = bIndex;
break keyPresent;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else if (cur == k) {
index = fIndex;
break keyPresent;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return null;
}
} else if (cur == k) {
index = bIndex;
break keyPresent;
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return null;
}
} else if (cur == k) {
index = fIndex;
break keyPresent;
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is present
short prevValue = (short) (entry >>> 16);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
return prevValue;
}
}
@Override
public short put(short key, short value) {
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) == free) {
// key is absent, free slot
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else {
keyPresent:
if (cur != key) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else if (cur == key) {
index = bIndex;
break keyPresent;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else if (cur == key) {
index = fIndex;
break keyPresent;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return defaultValue();
}
} else if (cur == key) {
index = bIndex;
break keyPresent;
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return defaultValue();
}
} else if (cur == key) {
index = fIndex;
break keyPresent;
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is present
short prevValue = (short) (entry >>> 16);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
return prevValue;
}
}
@Override
public Short putIfAbsent(Short key, Short value) {
short k = key;
short free;
short removed = removedValue;
if (k == (free = freeValue)) {
free = changeFree();
} else if (k == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) == free) {
// key is absent, free slot
incrementModCount();
tab[index] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else {
if (cur == k) {
// key is present
return (short) (entry >>> 16);
} else {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else if (cur == k) {
// key is present
return (short) (entry >>> 16);
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else if (cur == k) {
// key is present
return (short) (entry >>> 16);
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return null;
}
} else if (cur == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return null;
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return null;
}
} else if (cur == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
}
}
@Override
public short putIfAbsent(short key, short value) {
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) == free) {
// key is absent, free slot
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else {
if (cur == key) {
// key is present
return (short) (entry >>> 16);
} else {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else if (cur == key) {
// key is present
return (short) (entry >>> 16);
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else if (cur == key) {
// key is present
return (short) (entry >>> 16);
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[bIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return defaultValue();
}
} else if (cur == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == free) {
if (firstRemoved < 0) {
// key is absent, free slot
incrementModCount();
tab[fIndex] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return defaultValue();
} else {
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return defaultValue();
}
} else if (cur == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
}
}
@Override
public void justPut(short key, short value) {
int index = insert(key, value);
if (index < 0) {
// key was absent
return;
} else {
// key is present
U.putShort(table, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
return;
}
}
@Override
public Short compute(Short key,
BiFunction remappingFunction) {
short k = key;
if (remappingFunction == null)
throw new java.lang.NullPointerException();
short free;
short removed = removedValue;
if (k == (free = freeValue)) {
free = changeFree();
} else if (k == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) != k) {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
Short newValue = remappingFunction.apply(k, null);
if (newValue != null) {
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) newValue) << 16));
postRemovedSlotInsertHook();
return newValue;
} else {
return null;
}
}
// key is absent, free slot
Short newValue = remappingFunction.apply(k, null);
if (newValue != null) {
incrementModCount();
tab[index] = ((((int) k) & SHORT_MASK) | (((int) newValue) << 16));
postFreeSlotInsertHook();
return newValue;
} else {
return null;
}
}
// key is present
Short newValue = remappingFunction.apply(k, (short) (entry >>> 16));
if (newValue != null) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
} else {
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return null;
}
}
@Override
public short compute(short key, ShortShortToShortFunction remappingFunction) {
if (remappingFunction == null)
throw new java.lang.NullPointerException();
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
short newValue = remappingFunction.applyAsShort(key, defaultValue());
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) newValue) << 16));
postRemovedSlotInsertHook();
return newValue;
}
// key is absent, free slot
short newValue = remappingFunction.applyAsShort(key, defaultValue());
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) newValue) << 16));
postFreeSlotInsertHook();
return newValue;
}
// key is present
short newValue = remappingFunction.applyAsShort(key, (short) (entry >>> 16));
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
}
@Override
public Short computeIfAbsent(Short key,
Function mappingFunction) {
short k = key;
if (mappingFunction == null)
throw new java.lang.NullPointerException();
short free;
short removed = removedValue;
if (k == (free = freeValue)) {
free = changeFree();
} else if (k == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) == k) {
// key is present
return (short) (entry >>> 16);
} else {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
Short value = mappingFunction.apply(k);
if (value != null) {
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return value;
} else {
return null;
}
}
// key is absent, free slot
Short value = mappingFunction.apply(k);
if (value != null) {
incrementModCount();
tab[index] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return value;
} else {
return null;
}
}
}
@Override
public short computeIfAbsent(short key, ShortUnaryOperator mappingFunction) {
if (mappingFunction == null)
throw new java.lang.NullPointerException();
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) == key) {
// key is present
return (short) (entry >>> 16);
} else {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
// key is present
return (short) (entry >>> 16);
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
short value = mappingFunction.applyAsShort(key);
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return value;
}
// key is absent, free slot
short value = mappingFunction.applyAsShort(key);
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return value;
}
}
@Override
public Short computeIfPresent(Short key,
BiFunction remappingFunction) {
short k = key;
if (remappingFunction == null)
throw new java.lang.NullPointerException();
short free, removed;
if (k != (free = freeValue) && k != (removed = removedValue)) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) != k) {
if (cur == free) {
// key is absent, free slot
return null;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return null;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return null;
}
step += 2;
}
}
}
// key is present
Short newValue = remappingFunction.apply(k, (short) (entry >>> 16));
if (newValue != null) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
} else {
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return null;
}
} else {
// key is absent
return null;
}
}
@Override
public short computeIfPresent(short key, ShortShortToShortFunction remappingFunction) {
if (remappingFunction == null)
throw new java.lang.NullPointerException();
short free;
if (key != (free = freeValue) && key != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
if (cur == free) {
// key is absent, free slot
return defaultValue();
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
step += 2;
}
}
}
// key is present
short newValue = remappingFunction.applyAsShort(key, (short) (entry >>> 16));
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
} else {
// key is absent
return defaultValue();
}
}
@Override
public Short merge(Short key, Short value,
BiFunction remappingFunction) {
short k = key;
if (value == null)
throw new java.lang.NullPointerException();
if (remappingFunction == null)
throw new java.lang.NullPointerException();
short free;
short removed = removedValue;
if (k == (free = freeValue)) {
free = changeFree();
} else if (k == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) != k) {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return value;
}
// key is absent, free slot
incrementModCount();
tab[index] = ((((int) k) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return value;
}
// key is present
Short newValue = remappingFunction.apply((short) (entry >>> 16), value);
if (newValue != null) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
} else {
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return null;
}
}
@Override
public short merge(short key, short value, ShortBinaryOperator remappingFunction) {
if (remappingFunction == null)
throw new java.lang.NullPointerException();
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postRemovedSlotInsertHook();
return value;
}
// key is absent, free slot
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) value) << 16));
postFreeSlotInsertHook();
return value;
}
// key is present
short newValue = remappingFunction.applyAsShort((short) (entry >>> 16), value);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
}
@Override
public short addValue(short key, short value) {
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
short newValue = (short) (defaultValue() + value);
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) newValue) << 16));
postRemovedSlotInsertHook();
return newValue;
}
// key is absent, free slot
short newValue = (short) (defaultValue() + value);
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) newValue) << 16));
postFreeSlotInsertHook();
return newValue;
}
// key is present
short newValue = (short) ((short) (entry >>> 16) + value);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
}
@Override
public short addValue(short key, short addition, short initialValue) {
short free;
short removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
keyAbsentFreeSlot:
if (cur != free) {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
index = bIndex;
break keyAbsentFreeSlot;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
index = fIndex;
break keyAbsentFreeSlot;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
short newValue = (short) (initialValue + addition);
incrementModCount();
tab[firstRemoved] = ((((int) key) & SHORT_MASK) | (((int) newValue) << 16));
postRemovedSlotInsertHook();
return newValue;
}
// key is absent, free slot
short newValue = (short) (initialValue + addition);
incrementModCount();
tab[index] = ((((int) key) & SHORT_MASK) | (((int) newValue) << 16));
postFreeSlotInsertHook();
return newValue;
}
// key is present
short newValue = (short) ((short) (entry >>> 16) + addition);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return newValue;
}
@Override
public void putAll(@Nonnull Map m) {
CommonShortShortMapOps.putAll(this, m);
}
@Override
public Short replace(Short key, Short value) {
short k = key;
short free;
if (k != (free = freeValue) && k != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) != k) {
if (cur == free) {
// key is absent, free slot
return null;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return null;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return null;
}
step += 2;
}
}
}
// key is present
short oldValue = (short) (entry >>> 16);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
return oldValue;
} else {
// key is absent
return null;
}
}
@Override
public short replace(short key, short value) {
short free;
if (key != (free = freeValue) && key != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
if (cur == free) {
// key is absent, free slot
return defaultValue();
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
step += 2;
}
}
}
// key is present
short oldValue = (short) (entry >>> 16);
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
return oldValue;
} else {
// key is absent
return defaultValue();
}
}
@Override
public boolean replace(Short key, Short oldValue, Short newValue) {
return replace(key.shortValue(),
oldValue.shortValue(),
newValue.shortValue());
}
@Override
public boolean replace(short key, short oldValue, short newValue) {
short free;
if (key != (free = freeValue) && key != removedValue) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
if (cur == free) {
// key is absent, free slot
return false;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return false;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return false;
}
step += 2;
}
}
}
// key is present
if ((short) (entry >>> 16) == oldValue) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), newValue);
return true;
} else {
return false;
}
} else {
// key is absent
return false;
}
}
@Override
public void replaceAll(
BiFunction function) {
if (function == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), function.apply(key, (short) (entry >>> 16)));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), function.apply(key, (short) (entry >>> 16)));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public void replaceAll(ShortShortToShortFunction function) {
if (function == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), function.applyAsShort(key, (short) (entry >>> 16)));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), function.applyAsShort(key, (short) (entry >>> 16)));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public void clear() {
doClear();
}
private void doClear() {
int mc = modCount() + 1;
super.clear();
if (mc != modCount())
throw new ConcurrentModificationException();
}
@Override
void removeAt(int index) {
incrementModCount();
super.removeAt(index);
postRemoveHook();
}
@Override
public Short remove(Object key) {
short k = (Short) key;
short free, removed;
if (k != (free = freeValue) && k != (removed = removedValue)) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(k) % (capacity = tab.length)])) != k) {
if (cur == free) {
// key is absent, free slot
return null;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == k) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return null;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == k) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return null;
}
step += 2;
}
}
}
// key is present
short val = (short) (entry >>> 16);
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return val;
} else {
// key is absent
return null;
}
}
@Override
public boolean justRemove(short key) {
short free, removed;
if (key != (free = freeValue) && key != (removed = removedValue)) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
if (cur == free) {
// key is absent, free slot
return false;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return false;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return false;
}
step += 2;
}
}
}
// key is present
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return true;
} else {
// key is absent
return false;
}
}
@Override
public short remove(short key) {
short free, removed;
if (key != (free = freeValue) && key != (removed = removedValue)) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
if (cur == free) {
// key is absent, free slot
return defaultValue();
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return defaultValue();
}
step += 2;
}
}
}
// key is present
short val = (short) (entry >>> 16);
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return val;
} else {
// key is absent
return defaultValue();
}
}
@Override
public boolean remove(Object key, Object value) {
return remove(((Short) key).shortValue(),
((Short) value).shortValue()
);
}
@Override
public boolean remove(short key, short value) {
short free, removed;
if (key != (free = freeValue) && key != (removed = removedValue)) {
int[] tab = table;
int capacity, index;
short cur;
int entry;
keyPresent:
if ((cur = (short) (entry = tab[index = ParallelKVShortKeyMixing.mix(key) % (capacity = tab.length)])) != key) {
if (cur == free) {
// key is absent, free slot
return false;
} else {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = (short) (entry = tab[bIndex])) == key) {
index = bIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return false;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = (short) (entry = tab[fIndex])) == key) {
index = fIndex;
break keyPresent;
} else if (cur == free) {
// key is absent, free slot
return false;
}
step += 2;
}
}
}
// key is present
if ((short) (entry >>> 16) == value) {
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
return true;
} else {
return false;
}
} else {
// key is absent
return false;
}
}
@Override
public boolean removeIf(ShortShortPredicate filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (filter.test(key, (short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (filter.test(key, (short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
class EntryView extends AbstractSetView>
implements HashObjSet>,
InternalObjCollectionOps> {
@Nonnull
@Override
public Equivalence> equivalence() {
return Equivalence.entryEquivalence(
Equivalence.defaultEquality()
,
Equivalence.defaultEquality()
);
}
@Nonnull
@Override
public HashConfig hashConfig() {
return MutableQHashParallelKVShortShortMapGO.this.hashConfig();
}
@Override
public int size() {
// Read field instead of calling size() to avoid infinite recursive calls in Koloboke
// Compile-generated map, if it extends AbstractMap
return size;
}
@Override
public double currentLoad() {
return MutableQHashParallelKVShortShortMapGO.this.currentLoad();
}
@Override
@SuppressWarnings("unchecked")
public boolean contains(Object o) {
try {
Map.Entry e = (Map.Entry) o;
return containsEntry(e.getKey(), e.getValue());
} catch (NullPointerException e) {
return false;
} catch (ClassCastException e) {
return false;
}
}
@Override
@Nonnull
public final Object[] toArray() {
int size = size();
Object[] result = new Object[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
result[resultIndex++] = new MutableEntry(mc, i, key, (short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
result[resultIndex++] = new MutableEntry(mc, i, key, (short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Override
@SuppressWarnings("unchecked")
@Nonnull
public final T[] toArray(@Nonnull T[] a) {
int size = size();
if (a.length < size) {
Class elementType = a.getClass().getComponentType();
a = (T[]) java.lang.reflect.Array.newInstance(elementType, size);
}
if (size == 0) {
if (a.length > 0)
a[0] = null;
return a;
}
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
a[resultIndex++] = (T) new MutableEntry(mc, i, key, (short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
a[resultIndex++] = (T) new MutableEntry(mc, i, key, (short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = null;
return a;
}
@Override
public final void forEach(@Nonnull Consumer> action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public boolean forEachWhile(@Nonnull Predicate> predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (!predicate.test(new MutableEntry(mc, i, key, (short) (entry >>> 16)))) {
terminated = true;
break;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!predicate.test(new MutableEntry(mc, i, key, (short) (entry >>> 16)))) {
terminated = true;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
@Override
@Nonnull
public ObjIterator> iterator() {
int mc = modCount();
if (!noRemoved())
return new SomeRemovedEntryIterator(
mc);
return new NoRemovedEntryIterator(
mc);
}
@Nonnull
@Override
public ObjCursor> cursor() {
int mc = modCount();
if (!noRemoved())
return new SomeRemovedEntryCursor(
mc);
return new NoRemovedEntryCursor(
mc);
}
@Override
public final boolean containsAll(@Nonnull Collection c) {
return CommonObjCollectionOps.containsAll(this, c);
}
@Override
public final boolean allContainingIn(ObjCollection c) {
if (this.isEmpty())
return true;
boolean containsAll = true;
ReusableEntry e = new ReusableEntry();
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (!c.contains(e.with(key, (short) (entry >>> 16)))) {
containsAll = false;
break;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!c.contains(e.with(key, (short) (entry >>> 16)))) {
containsAll = false;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
@Override
public boolean reverseRemoveAllFrom(ObjSet s) {
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
ReusableEntry e = new ReusableEntry();
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
changed |= s.remove(e.with(key, (short) (entry >>> 16)));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
changed |= s.remove(e.with(key, (short) (entry >>> 16)));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public final boolean reverseAddAllTo(ObjCollection> c) {
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
changed |= c.add(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
changed |= c.add(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public int hashCode() {
return MutableQHashParallelKVShortShortMapGO.this.hashCode();
}
@Override
public String toString() {
if (this.isEmpty())
return "[]";
StringBuilder sb = new StringBuilder();
int elementCount = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
sb.append(' ');
sb.append(key);
sb.append('=');
sb.append((short) (entry >>> 16));
sb.append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
sb.append(' ');
sb.append(key);
sb.append('=');
sb.append((short) (entry >>> 16));
sb.append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
sb.setCharAt(0, '[');
sb.setCharAt(sb.length() - 1, ']');
return sb.toString();
}
@Override
public boolean shrink() {
return MutableQHashParallelKVShortShortMapGO.this.shrink();
}
@Override
@SuppressWarnings("unchecked")
public boolean remove(Object o) {
try {
Map.Entry e = (Map.Entry) o;
short key = e.getKey();
short value = e.getValue();
return MutableQHashParallelKVShortShortMapGO.this.remove(key, value);
} catch (NullPointerException e) {
return false;
} catch (ClassCastException e) {
return false;
}
}
@Override
public final boolean removeIf(@Nonnull Predicate> filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (filter.test(new MutableEntry(mc, i, key, (short) (entry >>> 16)))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (filter.test(new MutableEntry(mc, i, key, (short) (entry >>> 16)))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@SuppressWarnings("unchecked")
@Override
public final boolean removeAll(@Nonnull Collection c) {
if (c instanceof InternalObjCollectionOps) {
InternalObjCollectionOps c2 = (InternalObjCollectionOps) c;
if (equivalence().equals(c2.equivalence()) && c2.size() < this.size()) {
c2.reverseRemoveAllFrom(this);
}
}
if (this == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
ReusableEntry e = new ReusableEntry();
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (c.contains(e.with(key, (short) (entry >>> 16)))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (c.contains(e.with(key, (short) (entry >>> 16)))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public final boolean retainAll(@Nonnull Collection c) {
if (this == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty())
return false;
if (c.isEmpty()) {
clear();
return true;
}
boolean changed = false;
ReusableEntry e = new ReusableEntry();
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
if (!c.contains(e.with(key, (short) (entry >>> 16)))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!c.contains(e.with(key, (short) (entry >>> 16)))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public void clear() {
// Don't call map.clear() directly to avoid infinite recursive calls in Koloboke
// Compile-generated map, if it extends AbstractMap
MutableQHashParallelKVShortShortMapGO.this.doClear();
}
}
abstract class ShortShortEntry extends AbstractEntry {
abstract short key();
@Override
public final Short getKey() {
return key();
}
abstract short value();
@Override
public final Short getValue() {
return value();
}
@SuppressWarnings("unchecked")
@Override
public boolean equals(Object o) {
Map.Entry e2;
short k2;
short v2;
try {
e2 = (Map.Entry) o;
k2 = (Short) e2.getKey();
v2 = (Short) e2.getValue();
return key() == k2
&&
value() == v2
;
} catch (ClassCastException e) {
return false;
} catch (NullPointerException e) {
return false;
}
}
@Override
public int hashCode() {
return Primitives.hashCode(key())
^
Primitives.hashCode(value())
;
}
}
class MutableEntry extends ShortShortEntry {
final int modCount;
private final int index;
final short key;
private short value;
MutableEntry(int modCount,
int index, short key, short value) {
this.modCount = modCount;
this.index = index;
this.key = key;
this.value = value;
}
@Override
public short key() {
return key;
}
@Override
public short value() {
return value;
}
@Override
public Short setValue(Short newValue) {
if (modCount != modCount())
throw new IllegalStateException();
short oldValue = value;
short unwrappedNewValue = newValue;
value = unwrappedNewValue;
updateValueInTable(unwrappedNewValue);
return oldValue;
}
void updateValueInTable(short newValue) {
U.putShort(
table, INT_BASE + SHORT_VALUE_OFFSET + (((long) index) << INT_SCALE_SHIFT),
newValue);
}
}
class ReusableEntry extends ShortShortEntry {
private short key;
private short value;
ReusableEntry with(short key, short value) {
this.key = key;
this.value = value;
return this;
}
@Override
public short key() {
return key;
}
@Override
public short value() {
return value;
}
}
class ValueView extends AbstractShortValueView {
@Override
public int size() {
return MutableQHashParallelKVShortShortMapGO.this.size();
}
@Override
public boolean shrink() {
return MutableQHashParallelKVShortShortMapGO.this.shrink();
}
@Override
public boolean contains(Object o) {
return MutableQHashParallelKVShortShortMapGO.this.containsValue(o);
}
@Override
public boolean contains(short v) {
return MutableQHashParallelKVShortShortMapGO.this.containsValue(v);
}
@Override
public void forEach(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
action.accept((short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept((short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public void forEach(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
action.accept((short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept((short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
@Override
public boolean forEachWhile(ShortPredicate predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (!predicate.test((short) (entry >>> 16))) {
terminated = true;
break;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!predicate.test((short) (entry >>> 16))) {
terminated = true;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
@Override
public boolean allContainingIn(ShortCollection c) {
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (!c.contains((short) (entry >>> 16))) {
containsAll = false;
break;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!c.contains((short) (entry >>> 16))) {
containsAll = false;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
@Override
public boolean reverseAddAllTo(ShortCollection c) {
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
changed |= c.add((short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
changed |= c.add((short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public boolean reverseRemoveAllFrom(ShortSet s) {
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
changed |= s.removeShort((short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
changed |= s.removeShort((short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
@Nonnull
public ShortIterator iterator() {
int mc = modCount();
if (!noRemoved())
return new SomeRemovedValueIterator(
mc);
return new NoRemovedValueIterator(
mc);
}
@Nonnull
@Override
public ShortCursor cursor() {
int mc = modCount();
if (!noRemoved())
return new SomeRemovedValueCursor(
mc);
return new NoRemovedValueCursor(
mc);
}
@Override
@Nonnull
public Object[] toArray() {
int size = size();
Object[] result = new Object[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
result[resultIndex++] = (short) (entry >>> 16);
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
result[resultIndex++] = (short) (entry >>> 16);
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Override
@SuppressWarnings("unchecked")
@Nonnull
public T[] toArray(@Nonnull T[] a) {
int size = size();
if (a.length < size) {
Class elementType = a.getClass().getComponentType();
a = (T[]) java.lang.reflect.Array.newInstance(elementType, size);
}
if (size == 0) {
if (a.length > 0)
a[0] = null;
return a;
}
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
a[resultIndex++] = (T) Short.valueOf((short) (entry >>> 16));
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
a[resultIndex++] = (T) Short.valueOf((short) (entry >>> 16));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = null;
return a;
}
@Override
public short[] toShortArray() {
int size = size();
short[] result = new short[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
result[resultIndex++] = (short) (entry >>> 16);
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
result[resultIndex++] = (short) (entry >>> 16);
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Override
public short[] toArray(short[] a) {
int size = size();
if (a.length < size)
a = new short[size];
if (size == 0) {
if (a.length > 0)
a[0] = (short) 0;
return a;
}
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
a[resultIndex++] = (short) (entry >>> 16);
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
a[resultIndex++] = (short) (entry >>> 16);
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = (short) 0;
return a;
}
@Override
public String toString() {
if (this.isEmpty())
return "[]";
StringBuilder sb = new StringBuilder();
int elementCount = 0;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
sb.append(' ').append((short) (entry >>> 16)).append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
sb.append(' ').append((short) (entry >>> 16)).append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
sb.setCharAt(0, '[');
sb.setCharAt(sb.length() - 1, ']');
return sb.toString();
}
@Override
public boolean remove(Object o) {
return removeShort(( Short ) o);
}
@Override
public boolean removeShort(short v) {
return removeValue(v);
}
@Override
public void clear() {
MutableQHashParallelKVShortShortMapGO.this.clear();
}
public boolean removeIf(Predicate filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (filter.test((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (filter.test((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public boolean removeIf(ShortPredicate filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (filter.test((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (filter.test((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public boolean removeAll(@Nonnull Collection c) {
if (c instanceof ShortCollection)
return removeAll((ShortCollection) c);
if (this == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
private boolean removeAll(ShortCollection c) {
if (this == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
@Override
public boolean retainAll(@Nonnull Collection c) {
if (c instanceof ShortCollection)
return retainAll((ShortCollection) c);
if (this == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty())
return false;
if (c.isEmpty()) {
clear();
return true;
}
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (!c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
private boolean retainAll(ShortCollection c) {
if (this == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty())
return false;
if (c.isEmpty()) {
clear();
return true;
}
boolean changed = false;
int mc = modCount();
short free = freeValue;
short removed = removedValue;
int[] tab = table;
int entry;
if (noRemoved()) {
for (int i = tab.length - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
if (!c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
} else {
for (int i = tab.length - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
if (!c.contains((short) (entry >>> 16))) {
incrementModCount();
mc++;
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (i)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
changed = true;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
}
class NoRemovedEntryIterator implements ObjIterator> {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index = -1;
int nextIndex;
MutableEntry next;
NoRemovedEntryIterator(int mc) {
expectedModCount = mc;
int[] tab = this.tab = table;
short free = this.free = freeValue;
this.removed = removedValue;
int nextI = tab.length;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free) {
next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16));
break;
}
}
nextIndex = nextI;
}
@Override
public void forEachRemaining(@Nonnull Consumer> action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Map.Entry next() {
int mc;
if ((mc = expectedModCount) == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
index = nextI;
int[] tab = this.tab;
short free = this.free;
MutableEntry prev = next;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free) {
next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16));
break;
}
}
nextIndex = nextI;
return prev;
} else {
throw new java.util.NoSuchElementException();
}
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
int index;
if ((index = this.index) >= 0) {
if (expectedModCount++ == modCount()) {
this.index = -1;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class NoRemovedEntryCursor implements ObjCursor> {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index;
short curKey;
short curValue;
NoRemovedEntryCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
this.removed = removedValue;
curKey = free;
}
@Override
public void forEachForward(Consumer> action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public Map.Entry elem() {
short curKey;
if ((curKey = this.curKey) != free) {
return new MutableEntry(expectedModCount, index, curKey, curValue);
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
index = i;
curKey = key;
curValue = (short) (entry >>> 16);
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
short free;
if (curKey != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class SomeRemovedEntryIterator implements ObjIterator> {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index = -1;
int nextIndex;
MutableEntry next;
SomeRemovedEntryIterator(int mc) {
expectedModCount = mc;
int[] tab = this.tab = table;
short free = this.free = freeValue;
short removed = this.removed = removedValue;
int nextI = tab.length;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free && key != removed) {
next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16));
break;
}
}
nextIndex = nextI;
}
@Override
public void forEachRemaining(@Nonnull Consumer> action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Map.Entry next() {
int mc;
if ((mc = expectedModCount) == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
index = nextI;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
MutableEntry prev = next;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free && key != removed) {
next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16));
break;
}
}
nextIndex = nextI;
return prev;
} else {
throw new java.util.NoSuchElementException();
}
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
int index;
if ((index = this.index) >= 0) {
if (expectedModCount++ == modCount()) {
this.index = -1;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class SomeRemovedEntryCursor implements ObjCursor> {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index;
short curKey;
short curValue;
SomeRemovedEntryCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
this.removed = removedValue;
curKey = free;
}
@Override
public void forEachForward(Consumer> action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16)));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public Map.Entry elem() {
short curKey;
if ((curKey = this.curKey) != free) {
return new MutableEntry(expectedModCount, index, curKey, curValue);
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
index = i;
curKey = key;
curValue = (short) (entry >>> 16);
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
short free;
if (curKey != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class NoRemovedValueIterator implements ShortIterator {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index = -1;
int nextIndex;
short next;
NoRemovedValueIterator(int mc) {
expectedModCount = mc;
int[] tab = this.tab = table;
short free = this.free = freeValue;
this.removed = removedValue;
int nextI = tab.length;
int entry;
while (--nextI >= 0) {
if ((short) (entry = tab[nextI]) != free) {
next = (short) (entry >>> 16);
break;
}
}
nextIndex = nextI;
}
@Override
public short nextShort() {
if (expectedModCount == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
index = nextI;
int[] tab = this.tab;
short free = this.free;
short prev = next;
int entry;
while (--nextI >= 0) {
if ((short) (entry = tab[nextI]) != free) {
next = (short) (entry >>> 16);
break;
}
}
nextIndex = nextI;
return prev;
} else {
throw new java.util.NoSuchElementException();
}
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void forEachRemaining(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
action.accept((short) (entry >>> 16));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public void forEachRemaining(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
action.accept((short) (entry >>> 16));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Short next() {
return nextShort();
}
@Override
public void remove() {
int index;
if ((index = this.index) >= 0) {
if (expectedModCount++ == modCount()) {
this.index = -1;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class NoRemovedValueCursor implements ShortCursor {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index;
short curKey;
short curValue;
NoRemovedValueCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
this.removed = removedValue;
curKey = free;
}
@Override
public void forEachForward(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
if ((short) (entry = tab[i]) != free) {
action.accept((short) (entry >>> 16));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public short elem() {
if (curKey != free) {
return curValue;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
index = i;
curKey = key;
curValue = (short) (entry >>> 16);
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
short free;
if (curKey != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class SomeRemovedValueIterator implements ShortIterator {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index = -1;
int nextIndex;
short next;
SomeRemovedValueIterator(int mc) {
expectedModCount = mc;
int[] tab = this.tab = table;
short free = this.free = freeValue;
short removed = this.removed = removedValue;
int nextI = tab.length;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free && key != removed) {
next = (short) (entry >>> 16);
break;
}
}
nextIndex = nextI;
}
@Override
public short nextShort() {
if (expectedModCount == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
index = nextI;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
short prev = next;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free && key != removed) {
next = (short) (entry >>> 16);
break;
}
}
nextIndex = nextI;
return prev;
} else {
throw new java.util.NoSuchElementException();
}
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void forEachRemaining(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept((short) (entry >>> 16));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public void forEachRemaining(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept((short) (entry >>> 16));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Short next() {
return nextShort();
}
@Override
public void remove() {
int index;
if ((index = this.index) >= 0) {
if (expectedModCount++ == modCount()) {
this.index = -1;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class SomeRemovedValueCursor implements ShortCursor {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index;
short curKey;
short curValue;
SomeRemovedValueCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
this.removed = removedValue;
curKey = free;
}
@Override
public void forEachForward(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept((short) (entry >>> 16));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public short elem() {
if (curKey != free) {
return curValue;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
index = i;
curKey = key;
curValue = (short) (entry >>> 16);
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
short free;
if (curKey != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class NoRemovedMapCursor implements ShortShortCursor {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index;
short curKey;
short curValue;
NoRemovedMapCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
this.removed = removedValue;
curKey = free;
}
@Override
public void forEachForward(ShortShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(key, (short) (entry >>> 16));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public short key() {
short curKey;
if ((curKey = this.curKey) != free) {
return curKey;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public short value() {
if (curKey != free) {
return curValue;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public void setValue(short value) {
if (curKey != free) {
if (expectedModCount == modCount()) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
index = i;
curKey = key;
curValue = (short) (entry >>> 16);
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
short free;
if (curKey != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class SomeRemovedMapCursor implements ShortShortCursor {
final int[] tab;
final short free;
final short removed;
int expectedModCount;
int index;
short curKey;
short curValue;
SomeRemovedMapCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
this.removed = removedValue;
curKey = free;
}
@Override
public void forEachForward(ShortShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
action.accept(key, (short) (entry >>> 16));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public short key() {
short curKey;
if ((curKey = this.curKey) != free) {
return curKey;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public short value() {
if (curKey != free) {
return curValue;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public void setValue(short value) {
if (curKey != free) {
if (expectedModCount == modCount()) {
U.putShort(tab, INT_BASE + SHORT_VALUE_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), value);
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
short removed = this.removed;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free && key != removed) {
index = i;
curKey = key;
curValue = (short) (entry >>> 16);
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
short free;
if (curKey != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
incrementModCount();
U.putShort(tab, INT_BASE + SHORT_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed);
postRemoveHook();
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
}