@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(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(); }
@Override public String toString() { if (this.isEmpty()) return "{}"; StringBuilder sb = new StringBuilder();
@Override public String toString() { if (this.isEmpty()) return "{}"; StringBuilder sb = new StringBuilder();
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(); }
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 replaceAll(LongShortToShortFunction 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.applyAsShort(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.applyAsShort(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(LongShortConsumer 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(); }
@Override public void forEach(LongShortConsumer 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(); }
@Override public void replaceAll(LongShortToShortFunction 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.applyAsShort(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.applyAsShort(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(); }
if (predicate == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return true; boolean terminated = false;
if (predicate == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return true; boolean terminated = false;
@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 allEntriesContainingIn(InternalLongShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true;
@Override public boolean allEntriesContainingIn(InternalLongShortMapOps m) { if (this.isEmpty()) return true; boolean containsAll = true;
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;