@Override public void replaceAll( BiFunction<? super K, ? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { tab[i + 1] = function.apply(key, (V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { tab[i + 1] = function.apply(key, (V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false;
@Override public void forEach(BiConsumer<? super K, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { action.accept(key, (V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { action.accept(key, (V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public String toString() { if (isEmpty()) return "{}"; StringBuilder sb = new StringBuilder();
@Override public String toString() { if (isEmpty()) return "{}"; StringBuilder sb = new StringBuilder();
if (thisC == c) throw new IllegalArgumentException(); if (isEmpty() || c.isEmpty()) return false; boolean changed = false;
if (thisC == c) throw new IllegalArgumentException(); if (isEmpty() || c.isEmpty()) return false; boolean changed = false;
if (thisC == c) throw new IllegalArgumentException(); if (isEmpty()) return false; if (c.isEmpty()) {
@Override public void forEach(BiConsumer<? super K, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { action.accept(key, (V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { action.accept(key, (V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll( BiFunction<? super K, ? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { tab[i + 1] = function.apply(key, (V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { tab[i + 1] = function.apply(key, (V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (thisC == c) throw new IllegalArgumentException(); if (isEmpty()) return false; if (c.isEmpty()) {
if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false;
@Override public void reversePutAllTo(InternalObjObjMapOps<? super K, ? super V> m) { if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { m.justPut(key, (V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { m.justPut(key, (V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalObjObjMapOps<? super K, ? super V> m) { if (isEmpty()) return; int mc = modCount(); Object[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE) { m.justPut(key, (V) tab[i + 1]); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { K key; // noinspection unchecked if ((key = (K) (K) tab[i]) != FREE && key != REMOVED) { m.justPut(key, (V) tab[i + 1]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
@Override public boolean allEntriesContainingIn(InternalObjObjMapOps<?, ?> m) { if (isEmpty()) return true; boolean containsAll = true;
@Override public boolean allEntriesContainingIn(InternalObjObjMapOps<?, ?> m) { if (isEmpty()) return true; boolean containsAll = true;
if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;