@Nonnull @Override public ShortByteCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Override @Nonnull public ByteIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueIterator( mc); return new NoRemovedValueIterator( mc); }
@Nonnull @Override public ByteCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueCursor( mc); return new NoRemovedValueCursor( mc); }
@Override @Nonnull public ObjIterator<Map.Entry<Short, Byte>> iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryIterator( mc); return new NoRemovedEntryIterator( mc); }
@Override @Nonnull public ByteIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueIterator( mc); return new NoRemovedValueIterator( mc); }
@Override @Nonnull public ObjIterator<Map.Entry<Short, Byte>> iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryIterator( mc); return new NoRemovedEntryIterator( mc); }
@Nonnull @Override public ShortByteCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public ByteCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueCursor( mc); return new NoRemovedValueCursor( mc); }
@Nonnull @Override public ObjCursor<Map.Entry<Short, Byte>> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryCursor( mc); return new NoRemovedEntryCursor( mc); }
@Nonnull @Override public ObjCursor<Map.Entry<Short, Byte>> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryCursor( mc); return new NoRemovedEntryCursor( mc); }
@Override public int hashCode() { int hashCode = 0; 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) { hashCode += key ^ vals[i]; } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { hashCode += key ^ vals[i]; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public void forEach(BiConsumer<? super Short, ? super 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(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(Consumer<? super 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--) { if (keys[i] != free) { action.accept(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(BiConsumer<? super Short, ? super 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(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ShortByteConsumer 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(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void replaceAll( BiFunction<? super Short, ? super Byte, ? extends Byte> function) { if (function == 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) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ShortByteConsumer 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(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalShortByteMapOps m) { 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) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean reverseAddAllTo(ByteCollection 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--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public void reversePutAllTo(InternalShortByteMapOps m) { 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) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }