@Nonnull @Override public ObjCursor<Map.Entry<Long, Short>> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryCursor( mc); return new NoRemovedEntryCursor( mc); }
@Nonnull @Override public LongShortCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public ObjCursor<Map.Entry<Long, Short>> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryCursor( mc); return new NoRemovedEntryCursor( mc); }
@Override @Nonnull public ObjIterator<Map.Entry<Long, Short>> iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryIterator( mc); return new NoRemovedEntryIterator( mc); }
@Override @Nonnull public ShortIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueIterator( mc); return new NoRemovedValueIterator( mc); }
@Nonnull @Override public ShortCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueCursor( mc); return new NoRemovedValueCursor( mc); }
@Nonnull @Override public LongShortCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public ShortCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueCursor( mc); return new NoRemovedValueCursor( mc); }
@Override @Nonnull public ObjIterator<Map.Entry<Long, Short>> iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryIterator( mc); return new NoRemovedEntryIterator( mc); }
@Override @Nonnull public ShortIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueIterator( mc); return new NoRemovedValueIterator( mc); }
@Override public int hashCode() { int hashCode = 0; 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) { hashCode += ((int) (key ^ (key >>> 32))) ^ vals[i]; } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { hashCode += ((int) (key ^ (key >>> 32))) ^ vals[i]; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public void forEach(Consumer<? super 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--) { if (keys[i] != free) { action.accept(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { action.accept(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll( BiFunction<? super Long, ? super Short, ? extends Short> function) { if (function == 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) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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(ShortConsumer 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--) { if (keys[i] != free) { action.accept(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { action.accept(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void replaceAll( BiFunction<? super Long, ? super Short, ? extends Short> function) { if (function == 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) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(BiConsumer<? super Long, ? super 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(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
long[] keys = set; short[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key;
@Override public void reversePutAllTo(InternalLongShortMapOps m) { 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) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongShortMapOps m) { 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) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@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; }