@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); short[] keys = this.keys; byte[] vals = this.vals; short free = this.free; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new ImmutableEntry(key, vals[i])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachForward(Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); short[] keys = this.keys; byte[] vals = this.vals; short free = this.free; int index = this.index; for (int i = index - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new ImmutableEntry(key, vals[i])); } } if (index != this.index) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); short[] keys = this.keys; byte[] vals = this.vals; short free = this.free; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new ImmutableEntry(key, vals[i])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override @SuppressWarnings("unchecked") @Nonnull public final <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; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { a[resultIndex++] = (T) new ImmutableEntry(key, vals[i]); } } if (a.length > resultIndex) a[resultIndex] = null; return a; }
@Override @SuppressWarnings("unchecked") @Nonnull public final <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; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { a[resultIndex++] = (T) new ImmutableEntry(key, vals[i]); } } if (a.length > resultIndex) a[resultIndex] = null; return a; }
@Override public boolean forEachWhile(@Nonnull Predicate<? super Map.Entry<Short, Byte>> predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!predicate.test(new ImmutableEntry(key, vals[i]))) { terminated = true; break; } } } return !terminated; }
@Override public boolean forEachWhile(@Nonnull Predicate<? super Map.Entry<Short, Byte>> predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { if (!predicate.test(new ImmutableEntry(key, vals[i]))) { terminated = true; break; } } } return !terminated; }
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { result[resultIndex++] = new ImmutableEntry(key, vals[i]); } } return result; }
@Override public void forEachForward(Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); short[] keys = this.keys; byte[] vals = this.vals; short free = this.free; int index = this.index; for (int i = index - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new ImmutableEntry(key, vals[i])); } } if (index != this.index) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public Map.Entry<Short, Byte> next() { int nextI; if ((nextI = nextIndex) >= 0) { short[] keys = this.keys; short free = this.free; ImmutableEntry prev = next; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new ImmutableEntry(key, vals[nextI]); break; } } nextIndex = nextI; return prev; } else { throw new java.util.NoSuchElementException(); } }
@Override public Map.Entry<Short, Byte> next() { int nextI; if ((nextI = nextIndex) >= 0) { short[] keys = this.keys; short free = this.free; ImmutableEntry prev = next; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new ImmutableEntry(key, vals[nextI]); break; } } nextIndex = nextI; return prev; } else { throw new java.util.NoSuchElementException(); } }
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { result[resultIndex++] = new ImmutableEntry(key, vals[i]); } } return result; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Short, Byte>> c) { if (isEmpty()) return false; boolean changed = false; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Short, Byte>> c) { if (isEmpty()) return false; boolean changed = false; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= c.add(new ImmutableEntry(key, vals[i])); } } return changed; }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new ImmutableEntry(key, vals[i])); } } }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Byte>> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; short free = freeValue; short[] keys = set; byte[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new ImmutableEntry(key, vals[i])); } } }
NoRemovedEntryIterator() { short[] keys = this.keys = set; byte[] vals = this.vals = values; short free = this.free = freeValue; int nextI = keys.length; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new ImmutableEntry(key, vals[nextI]); break; } } nextIndex = nextI; }
NoRemovedEntryIterator() { short[] keys = this.keys = set; byte[] vals = this.vals = values; short free = this.free = freeValue; int nextI = keys.length; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new ImmutableEntry(key, vals[nextI]); break; } } nextIndex = nextI; }
@Override public Map.Entry<Short, Byte> elem() { short curKey; if ((curKey = this.curKey) != free) { return new ImmutableEntry(curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }
@Override public Map.Entry<Short, Byte> elem() { short curKey; if ((curKey = this.curKey) != free) { return new ImmutableEntry(curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }