public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= c.add(key); } } return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= c.add(key); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { changed |= c.add((int) (entry >>> 32)); } } return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= c.add(key); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { changed |= c.add(vals[i]); } } return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; long[] tab = table; long base = LONG_BASE + INT_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) { changed |= c.add(key); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; byte free = freeValue; byte[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long free = freeValue; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long free = freeValue; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; long[] tab = table; long base = LONG_BASE + INT_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) { changed |= c.add(key); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { changed |= c.add((int) (entry >>> 32)); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { changed |= c.add((int) (entry >>> 32)); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; char free = freeValue; char[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; long free = freeValue; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; long[] tab = table; long base = LONG_BASE + INT_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) { changed |= c.add(key); } } return changed; }
@Override public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int free = freeValue; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) != free) { changed |= c.add((int) (entry >>> 32)); } } return changed; }