@Nonnull @Override public DoubleCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueCursor( mc); return new NoRemovedValueCursor( mc); }
@Nonnull @Override public ShortDoubleCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Override @Nonnull public ObjIterator<Map.Entry<Short, Double>> iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryIterator( mc); return new NoRemovedEntryIterator( mc); }
@Override @Nonnull public DoubleIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueIterator( mc); return new NoRemovedValueIterator( mc); }
@Nonnull @Override public ShortDoubleCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Override @Nonnull public ObjIterator<Map.Entry<Short, Double>> iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryIterator( mc); return new NoRemovedEntryIterator( mc); }
@Nonnull @Override public ObjCursor<Map.Entry<Short, Double>> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryCursor( mc); return new NoRemovedEntryCursor( mc); }
@Override @Nonnull public DoubleIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueIterator( mc); return new NoRemovedValueIterator( mc); }
@Nonnull @Override public DoubleCursor cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedValueCursor( mc); return new NoRemovedValueCursor( mc); }
@Override public void replaceAll( BiFunction<? super Short, ? super Double, ? extends Double> 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; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { vals[i] = Double.doubleToLongBits(function.apply(key, Double.longBitsToDouble(vals[i]))); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { vals[i] = Double.doubleToLongBits(function.apply(key, Double.longBitsToDouble(vals[i]))); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Nonnull @Override public ObjCursor<Map.Entry<Short, Double>> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedEntryCursor( mc); return new NoRemovedEntryCursor( mc); }
@Override public void forEach(Consumer<? super Double> 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; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { action.accept(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { long val; hashCode += key ^ ((int) ((val = vals[i]) ^ (val >>> 32))); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { long val; hashCode += key ^ ((int) ((val = vals[i]) ^ (val >>> 32))); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Double>> 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; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(BiConsumer<? super Short, ? super Double> 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; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(key, Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(key, Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(DoubleConsumer 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; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { action.accept(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ShortDoubleConsumer 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; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(key, Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(key, Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
private boolean reverseAddAllTo(InternalDoubleCollectionOps c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] 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; }
private boolean reverseAddAllTo(InternalDoubleCollectionOps c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] 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; }
private boolean reverseRemoveAllFrom(InternalDoubleCollectionOps s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= s.removeDouble(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeDouble(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }