@Override public boolean test(Object value) { return collection.contains(value); } });
@Override public boolean test(Object value) { return collection.contains(value); } });
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
public boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { if (!c.contains(key)) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!c.contains(e.with(key, tab[i + 1]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!c.contains(e.with(key, tab[i + 1]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!c.contains(e.with(key, tab[i + 1]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!c.contains(e.with(key, tab[i + 1]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); int[] keys = set; char[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true; ReusableEntry e = new ReusableEntry(); long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(e.with(key, vals[i]))) { containsAll = false; break; } } } return containsAll; }