@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(); } }
public void forEach(Consumer<? super Float> 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(); }
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 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 void forEach(Consumer<? super Float> 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(); }
@Override public void remove() { if (curKey != FREE_BITS) { if (expectedModCount++ == modCount()) { this.curKey = FREE_BITS; incrementModCount(); keys[index] = REMOVED_BITS; postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
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; }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); keys[index] = 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(); keys[index] = 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(); keys[index] = REMOVED_BITS; postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
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; }
@Override public void remove() { if (curKey != FREE_BITS) { if (expectedModCount++ == modCount()) { this.curKey = FREE_BITS; incrementModCount(); keys[index] = 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(); keys[index] = REMOVED_BITS; postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
public FloatCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public FloatIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public FloatIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public FloatCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }