public int setHashCode() { int hashCode = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { hashCode += key; } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { hashCode += key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public int setHashCode() { int hashCode = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { hashCode += key; } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { hashCode += key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public void forEach(Consumer<? super Integer> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key;
long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key;
public IntIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key;
long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key;
public IntCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public IntIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public IntCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(Consumer<? super Integer> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { changed |= c.add(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { changed |= c.add(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key;
long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key;
public boolean reverseRemoveAllFrom(IntSet s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { changed |= s.removeInt(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { changed |= s.removeInt(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseRemoveAllFrom(IntSet s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { changed |= s.removeInt(key); } } } else { for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free && key != removed) { changed |= s.removeInt(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }