@Override public String toString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { sb.append(' '); sb.append(key); sb.append('='); sb.append(vals[i]); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); sb.setCharAt(0, '['); sb.setCharAt(sb.length() - 1, ']'); return sb.toString(); }
@Override public String toString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { sb.append(' '); sb.append(key); sb.append('='); sb.append(vals[i]); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); sb.setCharAt(0, '['); sb.setCharAt(sb.length() - 1, ']'); return sb.toString(); }
@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();
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override public final boolean removeAll(@Nonnull Collection<?> c) { if (c instanceof InternalObjCollectionOps) { InternalObjCollectionOps c2 = (InternalObjCollectionOps) c; if (equivalence().equals(c2.equivalence()) && c2.size() < this.size()) { // noinspection unchecked c2.reverseRemoveAllFrom(this); } } throw new java.lang.UnsupportedOperationException(); }
@Override public final boolean removeAll(@Nonnull Collection<?> c) { if (c instanceof InternalObjCollectionOps) { InternalObjCollectionOps c2 = (InternalObjCollectionOps) c; if (equivalence().equals(c2.equivalence()) && c2.size() < this.size()) { // noinspection unchecked c2.reverseRemoveAllFrom(this); } } throw new java.lang.UnsupportedOperationException(); }