@Override @Nonnull public HashObjSet<Map.Entry<Long, Short>> entrySet() { return new EntryView(); }
@Override public String toString() { if (this.isEmpty()) return "[]"; StringBuilder sb = new StringBuilder(); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2));
if (c instanceof InternalObjCollectionOps) { InternalObjCollectionOps c2 = (InternalObjCollectionOps) c; if (equivalence().equals(c2.equivalence()) && c2.size() < this.size()) { c2.reverseRemoveAllFrom(this); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false;
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;
if (c instanceof InternalObjCollectionOps) { InternalObjCollectionOps c2 = (InternalObjCollectionOps) c; if (equivalence().equals(c2.equivalence()) && c2.size() < this.size()) { c2.reverseRemoveAllFrom(this); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false;
@Nonnull public final <T> T[] toArray(@Nonnull T[] a) { int size = size(); if (a.length < size) { Class<?> elementType = a.getClass().getComponentType();
@Nonnull public final <T> T[] toArray(@Nonnull T[] a) { int size = size(); if (a.length < size) { Class<?> elementType = a.getClass().getComponentType();
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;
@Override public String toString() { if (this.isEmpty()) return "[]"; StringBuilder sb = new StringBuilder(); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2));
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 final boolean allContainingIn(ObjCollection<?> c) { if (this.isEmpty()) return true; boolean containsAll = true;
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0)
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0)
@Override public boolean reverseRemoveAllFrom(ObjSet<?> s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; ReusableEntry e = new ReusableEntry(); int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; short[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { changed |= s.remove(e.with(key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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 void forEach(@Nonnull Consumer<? super Map.Entry<Long, Short>> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; short[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long 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--) { long 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 void forEach(@Nonnull Consumer<? super Map.Entry<Long, Short>> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; short[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long 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--) { long 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(); }