@Override public boolean test(int value) { return collection.contains(value); } });
@Override public boolean test(int value) { return collection.contains(value); } });
public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { if (!c.contains((int) (entry >>> 32))) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { if (!c.contains((int) (entry >>> 32))) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { if (!c.contains((int) (entry >>> 32))) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; char free = freeValue; char[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; long free = freeValue; long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; 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) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; char free = freeValue; char[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; byte free = freeValue; byte[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; 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) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; short free = freeValue; short[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }
@Override public boolean allContainingIn(IntCollection c) { if (this.isEmpty()) return true; boolean containsAll = true; char free = freeValue; char[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { if (!c.contains(vals[i])) { containsAll = false; break; } } } return containsAll; }