public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
@Override public boolean test(Object value) { return collection.contains(value); } });
public static <E> boolean addAll(final ObjCollection<E> collection, Collection<? extends E> another) { if (collection == another) throw new IllegalArgumentException(); long maxPossibleSize = collection.sizeAsLong() + Containers.sizeAsLong(another); collection.ensureCapacity(maxPossibleSize); if (another instanceof ObjCollection) { if (another instanceof InternalObjCollectionOps) { return ((InternalObjCollectionOps) another).reverseAddAllTo(collection); } else { class AddAll implements Consumer<E> { boolean collectionChanged = false; @Override public void accept(E value) { collectionChanged |= collection.add(value); } } AddAll addAll = new AddAll(); ((ObjCollection) another).forEach(addAll); return addAll.collectionChanged; } } else { boolean collectionChanged = false; for (E v : another) { collectionChanged |= collection.add(v); } return collectionChanged; } }
if (another instanceof ObjCollection) { ObjCollection c2 = (ObjCollection) another; if (collection.equivalence().equals(c2.equivalence())) { if (collection instanceof ObjSet && c2 instanceof ObjSet && collection.size() < another.size()) { return false; return c2.forEachWhile(new Predicate() { @Override } else { for (Object o : another) { if (!collection.contains(o)) return false;
if (another instanceof ObjCollection) { ObjCollection c2 = (ObjCollection) another; if (collection.equivalence().equals(c2.equivalence())) { if (collection instanceof ObjSet && c2 instanceof ObjSet && collection.size() < another.size()) { return false; return c2.forEachWhile(new Predicate() { @Override } else { for (Object o : another) { if (!collection.contains(o)) return false;
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
@Override public boolean test(Object value) { return collection.contains(value); } });
public static <E> boolean addAll(final ObjCollection<E> collection, Collection<? extends E> another) { if (collection == another) throw new IllegalArgumentException(); long maxPossibleSize = collection.sizeAsLong() + Containers.sizeAsLong(another); collection.ensureCapacity(maxPossibleSize); if (another instanceof ObjCollection) { if (another instanceof InternalObjCollectionOps) { return ((InternalObjCollectionOps) another).reverseAddAllTo(collection); } else { class AddAll implements Consumer<E> { boolean collectionChanged = false; @Override public void accept(E value) { collectionChanged |= collection.add(value); } } AddAll addAll = new AddAll(); ((ObjCollection) another).forEach(addAll); return addAll.collectionChanged; } } else { boolean collectionChanged = false; for (E v : another) { collectionChanged |= collection.add(v); } return collectionChanged; } }
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
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 reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
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 reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
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 reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
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 reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { E key; // noinspection unchecked if ((key = (E) keys[i]) != FREE) { changed |= c.add(key); } } return changed; }
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 reverseAddAllTo(ObjCollection<? super E> c) { if (this.isEmpty()) return false; boolean changed = false; Object[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) tab[i]) != FREE) { changed |= c.add(key); } } return changed; }
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; }