@Override public String toString() { if (this.isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
@Override public String toString() { if (this.isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; byte[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false;
if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) {
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;
if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false;
if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) {
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;
if (predicate == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return true; boolean terminated = false;
if (predicate == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return true; boolean terminated = false;
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true;
@Override public boolean reverseRemoveAllFrom(ObjSet<?> s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; ReusableEntry e = new ReusableEntry(); int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; byte[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= s.remove(e.with(key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.remove(e.with(key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Short, Byte>> c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; byte[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true;
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; byte[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Short, Byte>> c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; byte[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public boolean reverseRemoveAllFrom(ObjSet<?> s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; ReusableEntry e = new ReusableEntry(); int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; byte[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= s.remove(e.with(key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.remove(e.with(key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }