@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--) { if (keys[i] != free) { sb.append(' ').append(vals[i]).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--) { if (keys[i] != free) { sb.append(' ').append(vals[i]).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 @SuppressWarnings("unchecked") @Nonnull public <T> T[] toArray(@Nonnull T[] a) { int size = size(); if (a.length < size) { Class<?> elementType = a.getClass().getComponentType(); a = (T[]) java.lang.reflect.Array.newInstance(elementType, size); } if (size == 0) { if (a.length > 0) a[0] = null; return a; } int resultIndex = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { a[resultIndex++] = (T) Long.valueOf(vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); if (a.length > resultIndex) a[resultIndex] = null; return a; }
@Override @SuppressWarnings("unchecked") @Nonnull public <T> T[] toArray(@Nonnull T[] a) { int size = size(); if (a.length < size) { Class<?> elementType = a.getClass().getComponentType(); a = (T[]) java.lang.reflect.Array.newInstance(elementType, size); } if (size == 0) { if (a.length > 0) a[0] = null; return a; } int resultIndex = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { a[resultIndex++] = (T) Long.valueOf(vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); if (a.length > resultIndex) a[resultIndex] = null; return a; }
@Override public long[] toArray(long[] a) { int size = size(); if (a.length < size) a = new long[size]; if (size == 0) { if (a.length > 0) a[0] = 0L; return a; } int resultIndex = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { a[resultIndex++] = vals[i]; } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); if (a.length > resultIndex) a[resultIndex] = 0L; return a; }
@Override public long[] toArray(long[] a) { int size = size(); if (a.length < size) a = new long[size]; if (size == 0) { if (a.length > 0) a[0] = 0L; return a; } int resultIndex = 0; int mc = modCount(); short free = freeValue; short[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { a[resultIndex++] = vals[i]; } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); if (a.length > resultIndex) a[resultIndex] = 0L; return a; }
@Override @Nonnull public 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--) { if (keys[i] != free) { result[resultIndex++] = vals[i]; } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override @Nonnull public 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--) { if (keys[i] != free) { result[resultIndex++] = vals[i]; } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override public long[] toLongArray() { int size = size(); long[] result = new long[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--) { if (keys[i] != free) { result[resultIndex++] = vals[i]; } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override public long[] toLongArray() { int size = size(); long[] result = new long[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--) { if (keys[i] != free) { result[resultIndex++] = vals[i]; } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }