com.koloboke.collect.impl.hash.MutableSeparateKVLongLHashGO 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.impl.InternalLongCollectionOps;
import com.koloboke.collect.set.hash.HashLongSet;
import java.util.function.LongConsumer;
import java.util.function.LongPredicate;
import java.util.function.Consumer;
import java.util.function.Predicate;
import com.koloboke.collect.impl.NotGenerated;
import com.koloboke.collect.set.LongSet;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import javax.annotation.Nonnull;
import java.util.*;
public abstract class MutableSeparateKVLongLHashGO
extends MutableSeparateKVLongLHashSO {
@Nonnull
@Override
public long[] keys() {
return set;
}
@Override
public int capacity() {
return set.length;
}
public void forEach(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
action.accept(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public void forEach(LongConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
action.accept(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public boolean forEachWhile(
LongPredicate
predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (!predicate.test(key)) {
terminated = true;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
public boolean allContainingIn(LongCollection c) {
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (!c.contains(key)) {
containsAll = false;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
public boolean reverseAddAllTo(LongCollection c) {
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
changed |= c.add(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public boolean reverseRemoveAllFrom(LongSet s) {
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
changed |= s.removeLong(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public LongIterator iterator() {
int mc = modCount();
return new NoRemovedIterator(mc);
}
public LongCursor setCursor() {
int mc = modCount();
return new NoRemovedCursor(mc);
}
@Nonnull
public Object[] toArray() {
int size = size();
Object[] result = new Object[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
result[resultIndex++] = key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@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();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
a[resultIndex++] = (T) Long.valueOf(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = null;
return a;
}
@Nonnull
public long[] toLongArray() {
int size = size();
long[] result = new long[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
result[resultIndex++] = key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Nonnull
public long[] toArray(long[] a) {
int size = size();
if (a.length < size)
a = new long[size];
if (size == 0) {
if (a.length > 0)
a[0] = 0L;
return a;
}
int resultIndex = 0;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
a[resultIndex++] = key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = 0L;
return a;
}
public int setHashCode() {
int hashCode = 0;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
hashCode += ((int) (key ^ (key >>> 32)));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return hashCode;
}
public String setToString() {
if (this.isEmpty())
return "[]";
StringBuilder sb = new StringBuilder();
int elementCount = 0;
int mc = modCount();
long free = freeValue;
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
sb.append(' ').append(key).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();
}
abstract boolean justRemove(long key);
public boolean removeIf(Predicate filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
long delayedRemoved = 0L;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (filter.test(key)) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
delayedRemoved = key;
keys[indexToRemove] = key;
break closeDeletion;
}
if (indexToRemove == i) {
i++;
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
keys[i] = delayedRemoved;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved, delayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public boolean removeIf(LongPredicate filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
long delayedRemoved = 0L;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (filter.test(key)) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
delayedRemoved = key;
keys[indexToRemove] = key;
break closeDeletion;
}
if (indexToRemove == i) {
i++;
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
keys[i] = delayedRemoved;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved, delayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean removeAll(@Nonnull HashLongSet thisC, @Nonnull Collection c) {
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
long delayedRemoved = 0L;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (c.contains(key)) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
delayedRemoved = key;
keys[indexToRemove] = key;
break closeDeletion;
}
if (indexToRemove == i) {
i++;
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
keys[i] = delayedRemoved;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved, delayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean removeAll(@Nonnull HashLongSet thisC, @Nonnull LongCollection c) {
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
long delayedRemoved = 0L;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (c.contains(key)) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
delayedRemoved = key;
keys[indexToRemove] = key;
break closeDeletion;
}
if (indexToRemove == i) {
i++;
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
keys[i] = delayedRemoved;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved, delayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean retainAll(@Nonnull HashLongSet thisC, @Nonnull Collection c) {
if (c instanceof LongCollection)
return retainAll(thisC, (LongCollection) c);
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty())
return false;
if (c.isEmpty()) {
clear();
return true;
}
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
long delayedRemoved = 0L;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (!c.contains(key)) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
delayedRemoved = key;
keys[indexToRemove] = key;
break closeDeletion;
}
if (indexToRemove == i) {
i++;
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
keys[i] = delayedRemoved;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved, delayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
private boolean retainAll(@Nonnull HashLongSet thisC, @Nonnull LongCollection c) {
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty())
return false;
if (c.isEmpty()) {
clear();
return true;
}
boolean changed = false;
int mc = modCount();
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
long delayedRemoved = 0L;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
if (!c.contains(key)) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
delayedRemoved = key;
keys[indexToRemove] = key;
break closeDeletion;
}
if (indexToRemove == i) {
i++;
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
keys[i] = delayedRemoved;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved, delayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
void closeDelayedRemoved(int firstDelayedRemoved
, long delayedRemoved) {
long free = freeValue;
long[] keys = set;
int capacityMask = keys.length - 1;
for (int i = firstDelayedRemoved; i >= 0; i--) {
if (keys[i] == delayedRemoved) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if ((keyToShift != delayedRemoved) && (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance)) {
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + i) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
}
}
}
class NoRemovedIterator implements LongIterator {
long[] keys;
final long free;
final int capacityMask;
int expectedModCount;
int index = -1;
int nextIndex;
long next;
NoRemovedIterator(int mc) {
expectedModCount = mc;
long[] keys = this.keys = set;
capacityMask = keys.length - 1;
long free = this.free = freeValue;
int nextI = keys.length;
while (--nextI >= 0) {
long key;
if ((key = keys[nextI]) != free) {
next = key;
break;
}
}
nextIndex = nextI;
}
@Override
public long nextLong() {
if (expectedModCount == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
index = nextI;
long[] keys = this.keys;
long free = this.free;
long prev = next;
while (--nextI >= 0) {
long key;
if ((key = keys[nextI]) != free) {
next = key;
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;
long[] keys = this.keys;
long free = this.free;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
action.accept(key);
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public void forEachRemaining(LongConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
long[] keys = this.keys;
long free = this.free;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
action.accept(key);
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Long next() {
return nextLong();
}
@Override
public void remove() {
int index;
if ((index = this.index) >= 0) {
if (expectedModCount++ == modCount()) {
this.index = -1;
long[] keys = this.keys;
if (keys == set) {
int capacityMask = this.capacityMask;
incrementModCount();
int indexToRemove = index;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (this.keys == keys) {
if (indexToShift > indexToRemove) {
int slotsToCopy;
if ((slotsToCopy = nextIndex + 1) > 0) {
this.keys = Arrays.copyOf(keys, slotsToCopy);
if (indexToRemove < slotsToCopy) {
this.keys[indexToRemove] = free;
}
}
} else if (indexToRemove == index) {
this.nextIndex = index;
if (indexToShift < index - 1) {
this.next = keyToShift;
}
}
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + index) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
justRemove(keys[index]);
}
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class NoRemovedCursor implements LongCursor {
long[] keys;
final long free;
final int capacityMask;
int expectedModCount;
int index;
long curKey;
NoRemovedCursor(int mc) {
expectedModCount = mc;
long[] keys = this.keys = set;
capacityMask = keys.length - 1;
index = keys.length;
long free = this.free = freeValue;
curKey = free;
}
@Override
public void forEachForward(LongConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
long[] keys = this.keys;
long free = this.free;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
action.accept(key);
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public long elem() {
long curKey;
if ((curKey = this.curKey) != free) {
return curKey;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
long[] keys = this.keys;
long free = this.free;
for (int i = index - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) != free) {
index = i;
curKey = key;
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
long curKey;
long free;
if ((curKey = this.curKey) != (free = this.free)) {
if (expectedModCount++ == modCount()) {
this.curKey = free;
int index = this.index;
long[] keys = this.keys;
if (keys == set) {
int capacityMask = this.capacityMask;
incrementModCount();
int indexToRemove = index;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
long keyToShift;
if ((keyToShift = keys[indexToShift]) == free) {
break;
}
if (((SeparateKVLongKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (this.keys == keys) {
if (indexToShift > indexToRemove) {
int slotsToCopy;
if ((slotsToCopy = index) > 0) {
this.keys = Arrays.copyOf(keys, slotsToCopy);
if (indexToRemove < slotsToCopy) {
this.keys[indexToRemove] = free;
}
}
} else if (indexToRemove == index) {
this.index = ++index;
}
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + index) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = free;
postRemoveHook();
} else {
justRemove(curKey);
}
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
}