public void forEach(Consumer<? super E> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE) { action.accept(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE && key != REMOVED) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false;
public String setToString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
public String setToString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
boolean removeAll(@Nonnull HashObjSet<E> thisC, @Nonnull Collection<?> c) { if (thisC == c) throw new IllegalArgumentException(); if (isEmpty() || c.isEmpty()) return false; boolean changed = false;
boolean removeAll(@Nonnull HashObjSet<E> thisC, @Nonnull Collection<?> c) { if (thisC == c) throw new IllegalArgumentException(); if (isEmpty() || c.isEmpty()) return false; boolean changed = false;
boolean retainAll(@Nonnull HashObjSet<E> thisC, @Nonnull Collection<?> c) { if (thisC == c) throw new IllegalArgumentException(); if (isEmpty()) return false; if (c.isEmpty()) {
public void forEach(Consumer<? super E> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE) { action.accept(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE && key != REMOVED) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
boolean retainAll(@Nonnull HashObjSet<E> thisC, @Nonnull Collection<?> c) { if (thisC == c) throw new IllegalArgumentException(); if (isEmpty()) return false; if (c.isEmpty()) {
if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false;
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE) { changed |= c.add(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE && key != REMOVED) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean allContainingIn(ObjCollection<?> c) { if (isEmpty()) return true; boolean containsAll = true;
public boolean removeIf(Predicate<? super E> filter) { if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
public boolean reverseAddAllTo(ObjCollection<? super E> c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE) { changed |= c.add(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE && key != REMOVED) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean allContainingIn(ObjCollection<?> c) { if (isEmpty()) return true; boolean containsAll = true;
public boolean reverseRemoveAllFrom(ObjSet<?> s) { if (isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE) { changed |= s.remove(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE && key != REMOVED) { changed |= s.remove(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseRemoveAllFrom(ObjSet<?> s) { if (isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE) { changed |= s.remove(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { E key; // noinspection unchecked if ((key = (E) (E) tab[i]) != FREE && key != REMOVED) { changed |= s.remove(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean removeIf(Predicate<? super E> filter) { if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;