@Override void removeAt(int index) { incrementModCount(); super.removeAt(index); values[index] = null; postRemoveHook(); }
@Override void removeAt(int index) { incrementModCount(); super.removeAt(index); values[index] = null; postRemoveHook(); }
return newValue; } else { incrementModCount(); set[index] = removedValue; vals[index] = null;
if ((key = keys[i]) != free) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed;
public V computeIfPresent(Long key, BiFunction<? super Long, ? super V, ? extends V> remappingFunction) { long k = key; if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(k); if (index >= 0) { // key is present V[] vals = values; V val; if ((val = vals[index]) != null) { V newValue = remappingFunction.apply(k, val); if (newValue != null) { vals[index] = newValue; return newValue; } else { incrementModCount(); set[index] = removedValue; vals[index] = null; postRemoveHook(); return null; } } else { return null; } } else { // key is absent return null; } }
if ((key = keys[i]) != free) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed;
@Override public V computeIfPresent(long key, LongObjFunction<? super V, ? extends V> remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present V[] vals = values; V val; if ((val = vals[index]) != null) { V newValue = remappingFunction.apply(key, val); if (newValue != null) { vals[index] = newValue; return newValue; } else { incrementModCount(); set[index] = removedValue; vals[index] = null; postRemoveHook(); return null; } } else { return null; } } else { // key is absent return null; } }
@Override public V computeIfPresent(long key, LongObjFunction<? super V, ? extends V> remappingFunction) { if (remappingFunction == null) throw new java.lang.NullPointerException(); int index = index(key); if (index >= 0) { // key is present V[] vals = values; V val; if ((val = vals[index]) != null) { V newValue = remappingFunction.apply(key, val); if (newValue != null) { vals[index] = newValue; return newValue; } else { incrementModCount(); set[index] = removedValue; vals[index] = null; postRemoveHook(); return null; } } else { return null; } } else { // key is absent return null; } }
incrementModCount(); keys[index] = removed; vals[index] = null;
incrementModCount(); keys[index] = removed; values[index] = null;
if ((key = keys[i]) != free) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (c.contains(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (filter.test(key, vals[i])) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (filter.test(key, vals[i])) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (filter.test(key, vals[i])) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (filter.test(key, vals[i])) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (filter.test(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (!c.contains(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (!c.contains(key)) { incrementModCount(); mc++; keys[i] = removed;
if ((key = keys[i]) != free) { if (!c.contains(key)) { incrementModCount(); mc++; keys[i] = removed; if ((key = keys[i]) != free && key != removed) { if (!c.contains(key)) { incrementModCount(); mc++; keys[i] = removed;