@Override public void remove() { if (curKey != FREE_BITS) { if (expectedModCount++ == modCount()) { this.curKey = FREE_BITS; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { if (curKey != FREE_BITS) { if (expectedModCount++ == modCount()) { this.curKey = FREE_BITS; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { if (curKey != FREE_BITS) { if (expectedModCount++ == modCount()) { this.curKey = FREE_BITS; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { if (curKey != FREE_BITS) { if (expectedModCount++ == modCount()) { this.curKey = FREE_BITS; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putInt(tab, LONG_BASE + FLOAT_KEY_OFFSET + (((long) (index)) << LONG_SCALE_SHIFT), REMOVED_BITS); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (c.contains(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (c.contains(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean removeIf(Predicate<? super Float> filter) { if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (filter.test(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (filter.test(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean removeIf(Predicate<? super Float> filter) { if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (filter.test(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (filter.test(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (c.contains(key)) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (c.contains(key)) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (c.contains(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (c.contains(Float.intBitsToFloat(key))) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } 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(); long[] tab = table; long base = LONG_BASE + FLOAT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) < FREE_BITS) { if (!c.contains(key)) { incrementModCount(); mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
mc++; U.putInt(tab, base + off, REMOVED_BITS); postRemoveHook(); changed = true;