com.koloboke.collect.impl.hash.MutableSeparateKVFloatLHashGO 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.InternalFloatCollectionOps;
import com.koloboke.collect.set.hash.HashFloatSet;
import com.koloboke.function.FloatConsumer;
import com.koloboke.function.FloatPredicate;
import java.util.function.Consumer;
import java.util.function.Predicate;
import com.koloboke.collect.impl.NotGenerated;
import com.koloboke.collect.set.FloatSet;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import javax.annotation.Nonnull;
import java.util.*;
public abstract class MutableSeparateKVFloatLHashGO
extends MutableSeparateKVFloatLHashSO {
@Nonnull
@Override
public int[] 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();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Float.intBitsToFloat(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public void forEach(FloatConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Float.intBitsToFloat(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public boolean forEachWhile(
FloatPredicate
predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (!predicate.test(Float.intBitsToFloat(key))) {
terminated = true;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
public boolean allContainingIn(FloatCollection c) {
if (c instanceof InternalFloatCollectionOps)
return allContainingIn((InternalFloatCollectionOps) c);
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (!c.contains(Float.intBitsToFloat(key))) {
containsAll = false;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
boolean allContainingIn(InternalFloatCollectionOps c) {
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (!c.contains(key)) {
containsAll = false;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
public boolean reverseAddAllTo(FloatCollection c) {
if (c instanceof InternalFloatCollectionOps)
return reverseAddAllTo((InternalFloatCollectionOps) c);
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
changed |= c.add(Float.intBitsToFloat(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean reverseAddAllTo(InternalFloatCollectionOps c) {
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
changed |= c.add(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public boolean reverseRemoveAllFrom(FloatSet s) {
if (s instanceof InternalFloatCollectionOps)
return reverseRemoveAllFrom((InternalFloatCollectionOps) s);
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
changed |= s.removeFloat(Float.intBitsToFloat(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean reverseRemoveAllFrom(InternalFloatCollectionOps s) {
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
changed |= s.removeFloat(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public FloatIterator iterator() {
int mc = modCount();
return new NoRemovedIterator(mc);
}
public FloatCursor 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();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
result[resultIndex++] = Float.intBitsToFloat(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();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
a[resultIndex++] = (T) Float.valueOf(Float.intBitsToFloat(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = null;
return a;
}
@Nonnull
public float[] toFloatArray() {
int size = size();
float[] result = new float[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
result[resultIndex++] = Float.intBitsToFloat(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Nonnull
public float[] toArray(float[] a) {
int size = size();
if (a.length < size)
a = new float[size];
if (size == 0) {
if (a.length > 0)
a[0] = 0.0f;
return a;
}
int resultIndex = 0;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
a[resultIndex++] = Float.intBitsToFloat(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = 0.0f;
return a;
}
public int setHashCode() {
int hashCode = 0;
int mc = modCount();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
hashCode += key;
}
}
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();
int[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
sb.append(' ').append(Float.intBitsToFloat(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(int 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();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (filter.test(Float.intBitsToFloat(key))) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public boolean removeIf(FloatPredicate filter) {
if (filter == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (filter.test(Float.intBitsToFloat(key))) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean removeAll(@Nonnull HashFloatSet thisC, @Nonnull Collection c) {
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (c.contains(Float.intBitsToFloat(key))) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean removeAll(@Nonnull HashFloatSet thisC, @Nonnull FloatCollection c) {
if (c instanceof InternalFloatCollectionOps)
return removeAll(thisC, (InternalFloatCollectionOps) c);
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (c.contains(Float.intBitsToFloat(key))) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean removeAll(@Nonnull HashFloatSet thisC, @Nonnull InternalFloatCollectionOps c) {
if (thisC == (Object) c)
throw new IllegalArgumentException();
if (this.isEmpty() || c.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
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;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean retainAll(@Nonnull HashFloatSet thisC, @Nonnull Collection c) {
if (c instanceof FloatCollection)
return retainAll(thisC, (FloatCollection) 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();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (!c.contains(Float.intBitsToFloat(key))) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
private boolean retainAll(@Nonnull HashFloatSet thisC, @Nonnull FloatCollection c) {
if (c instanceof InternalFloatCollectionOps)
return retainAll(thisC, (InternalFloatCollectionOps) 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();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
if (!c.contains(Float.intBitsToFloat(key))) {
incrementModCount();
mc++;
closeDeletion:
if (firstDelayedRemoved < 0) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
private boolean retainAll(@Nonnull HashFloatSet thisC,
@Nonnull InternalFloatCollectionOps 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();
int[] keys = set;
int capacityMask = keys.length - 1;
int firstDelayedRemoved = -1;
for (int i = keys.length - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
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;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.mix(keyToShift) - indexToShift) & capacityMask) >= shiftDistance) {
if (indexToShift > indexToRemove) {
firstDelayedRemoved = i;
keys[indexToRemove] = REMOVED_BITS;
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_BITS;
postRemoveHook();
} else {
keys[i] = REMOVED_BITS;
}
changed = true;
}
}
}
if (firstDelayedRemoved >= 0) {
closeDelayedRemoved(firstDelayedRemoved);
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
void closeDelayedRemoved(int firstDelayedRemoved
) {
int[] keys = set;
int capacityMask = keys.length - 1;
for (int i = firstDelayedRemoved; i >= 0; i--) {
if (keys[i] == REMOVED_BITS) {
int indexToRemove = i;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if ((keyToShift != REMOVED_BITS) && (((SeparateKVFloatKeyMixing.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_BITS;
postRemoveHook();
}
}
}
class NoRemovedIterator implements FloatIterator {
int[] keys;
final int capacityMask;
int expectedModCount;
int index = -1;
int nextIndex;
float next;
NoRemovedIterator(int mc) {
expectedModCount = mc;
int[] keys = this.keys = set;
capacityMask = keys.length - 1;
int nextI = keys.length;
while (--nextI >= 0) {
int key;
if ((key = keys[nextI]) < FREE_BITS) {
next = Float.intBitsToFloat(key);
break;
}
}
nextIndex = nextI;
}
@Override
public float nextFloat() {
if (expectedModCount == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
index = nextI;
int[] keys = this.keys;
float prev = next;
while (--nextI >= 0) {
int key;
if ((key = keys[nextI]) < FREE_BITS) {
next = Float.intBitsToFloat(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;
int[] keys = this.keys;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Float.intBitsToFloat(key));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public void forEachRemaining(FloatConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] keys = this.keys;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Float.intBitsToFloat(key));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
index = nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Float next() {
return nextFloat();
}
@Override
public void remove() {
int index;
if ((index = this.index) >= 0) {
if (expectedModCount++ == modCount()) {
this.index = -1;
int[] 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;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.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_BITS;
}
}
} else if (indexToRemove == index) {
this.nextIndex = index;
if (indexToShift < index - 1) {
this.next = Float.intBitsToFloat(keyToShift);
}
}
}
keys[indexToRemove] = keyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
if (indexToShift == 1 + index) {
throw new java.util.ConcurrentModificationException();
}
}
}
keys[indexToRemove] = FREE_BITS;
postRemoveHook();
} else {
justRemove(keys[index]);
}
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
class NoRemovedCursor implements FloatCursor {
int[] keys;
final int capacityMask;
int expectedModCount;
int index;
int curKey;
NoRemovedCursor(int mc) {
expectedModCount = mc;
int[] keys = this.keys = set;
capacityMask = keys.length - 1;
index = keys.length;
curKey = FREE_BITS;
}
@Override
public void forEachForward(FloatConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] keys = this.keys;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Float.intBitsToFloat(key));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = FREE_BITS;
}
@Override
public float elem() {
int curKey;
if ((curKey = this.curKey) != FREE_BITS) {
return Float.intBitsToFloat(curKey);
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] keys = this.keys;
for (int i = index - 1; i >= 0; i--) {
int key;
if ((key = keys[i]) < FREE_BITS) {
index = i;
curKey = key;
return true;
}
}
curKey = FREE_BITS;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
int curKey;
if ((curKey = this.curKey) != FREE_BITS) {
if (expectedModCount++ == modCount()) {
this.curKey = FREE_BITS;
int index = this.index;
int[] 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;
int keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE_BITS) {
break;
}
if (((SeparateKVFloatKeyMixing.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_BITS;
}
}
} 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_BITS;
postRemoveHook();
} else {
justRemove(curKey);
}
} else {
throw new java.util.ConcurrentModificationException();
}
} else {
throw new java.lang.IllegalStateException();
}
}
}
}