@Override public void replaceAll( BiFunction<? super Double, ? super Long, ? extends Long> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { tab[i + 1] = function.apply(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(BiConsumer<? super Double, ? super Long> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public String toString() { if (isEmpty()) return "{}"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { sb.append(' '); sb.append(Double.longBitsToDouble(key)); sb.append('='); sb.append(tab[i + 1]); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); sb.setCharAt(0, '{'); sb.setCharAt(sb.length() - 1, '}'); return sb.toString(); }
public void forEach(BiConsumer<? super Double, ? super Long> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(DoubleLongToLongFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { tab[i + 1] = function.applyAsLong(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(DoubleLongConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(DoubleLongConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void replaceAll( BiFunction<? super Double, ? super Long, ? extends Long> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { tab[i + 1] = function.apply(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(DoubleLongToLongFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { tab[i + 1] = function.applyAsLong(Double.longBitsToDouble(key), tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public String toString() { if (isEmpty()) return "{}"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { sb.append(' '); sb.append(Double.longBitsToDouble(key)); sb.append('='); sb.append(tab[i + 1]); sb.append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); sb.setCharAt(0, '{'); sb.setCharAt(sb.length() - 1, '}'); return sb.toString(); }
@Override public boolean forEachWhile(DoubleLongPredicate predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!predicate.test(Double.longBitsToDouble(key), tab[i + 1])) { terminated = true; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return !terminated; }
@Override public void reversePutAllTo(InternalDoubleLongMapOps m) { if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean forEachWhile(DoubleLongPredicate predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!predicate.test(Double.longBitsToDouble(key), tab[i + 1])) { terminated = true; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return !terminated; }
@Override public void reversePutAllTo(InternalDoubleLongMapOps m) { if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { m.justPut(key, tab[i + 1]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean allEntriesContainingIn(InternalDoubleLongMapOps m) { if (isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalDoubleLongMapOps m) { if (isEmpty()) return true; boolean containsAll = true; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { if (!m.containsEntry(key, tab[i + 1])) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }