@Override public void accept(double key, short value) { map.justPut(key, value); } });
@Override public void accept(double key, short value) { map.justPut(key, value); } });
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalDoubleShortMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; short[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public static void putAll(final InternalDoubleShortMapOps map, Map<? extends Double, ? extends Short> another) { if (map == another) throw new IllegalArgumentException(); long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another); map.ensureCapacity(maxPossibleSize); if (another instanceof DoubleShortMap) { if (another instanceof InternalDoubleShortMapOps) { ((InternalDoubleShortMapOps) another).reversePutAllTo(map); } else { ((DoubleShortMap) another).forEach(new DoubleShortConsumer() { @Override public void accept(double key, short value) { map.justPut(key, value); } }); } } else { for (Map.Entry<? extends Double, ? extends Short> e : another.entrySet()) { map.justPut(e.getKey(), e.getValue()); } } }
public static void putAll(final InternalDoubleShortMapOps map, Map<? extends Double, ? extends Short> another) { if (map == another) throw new IllegalArgumentException(); long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another); map.ensureCapacity(maxPossibleSize); if (another instanceof DoubleShortMap) { if (another instanceof InternalDoubleShortMapOps) { ((InternalDoubleShortMapOps) another).reversePutAllTo(map); } else { ((DoubleShortMap) another).forEach(new DoubleShortConsumer() { @Override public void accept(double key, short value) { map.justPut(key, value); } }); } } else { for (Map.Entry<? extends Double, ? extends Short> e : another.entrySet()) { map.justPut(e.getKey(), e.getValue()); } } }