@Override public void accept(long key, double value) { map.justPut(key, value); } });
@Override public void accept(long key, double value) { map.justPut(key, value); } });
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { m.justPut(key, tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalLongDoubleMapOps m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { m.justPut(key, tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { m.justPut(key, tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public static void putAll(final InternalLongDoubleMapOps map, Map<? extends Long, ? extends Double> another) { if (map == another) throw new IllegalArgumentException(); long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another); map.ensureCapacity(maxPossibleSize); if (another instanceof LongDoubleMap) { if (another instanceof InternalLongDoubleMapOps) { ((InternalLongDoubleMapOps) another).reversePutAllTo(map); } else { ((LongDoubleMap) another).forEach(new LongDoubleConsumer() { @Override public void accept(long key, double value) { map.justPut(key, value); } }); } } else { for (Map.Entry<? extends Long, ? extends Double> e : another.entrySet()) { map.justPut(e.getKey(), e.getValue()); } } }
public static void putAll(final InternalLongDoubleMapOps map, Map<? extends Long, ? extends Double> another) { if (map == another) throw new IllegalArgumentException(); long maxPossibleSize = map.sizeAsLong() + Containers.sizeAsLong(another); map.ensureCapacity(maxPossibleSize); if (another instanceof LongDoubleMap) { if (another instanceof InternalLongDoubleMapOps) { ((InternalLongDoubleMapOps) another).reversePutAllTo(map); } else { ((LongDoubleMap) another).forEach(new LongDoubleConsumer() { @Override public void accept(long key, double value) { map.justPut(key, value); } }); } } else { for (Map.Entry<? extends Long, ? extends Double> e : another.entrySet()) { map.justPut(e.getKey(), e.getValue()); } } }