boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = 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 (c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = 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 (c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; vals[i] = null; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; vals[i] = null; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = 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 (!c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true;
private boolean removeAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { if (c.contains(Double.longBitsToDouble(tab[i + 1]))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean removeAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { if (c.contains(Double.longBitsToDouble(tab[i + 1]))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = false; int mc = modCount(); long[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = 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 (!c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll(thisC, (InternalDoubleCollectionOps) c); if (thisC == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = false; int mc = modCount(); long[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) < FREE_BITS) { if (!c.contains(Double.longBitsToDouble(key))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true;
private boolean removeAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { if (c.contains(Double.longBitsToDouble(vals[i]))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean removeAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return removeAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty() || c.isEmpty()) return false; boolean changed = false; int mc = modCount(); int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { if (c.contains(Double.longBitsToDouble(vals[i]))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = false; int mc = modCount(); int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { if (!c.contains(Double.longBitsToDouble(vals[i]))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = false; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { if (!c.contains(Double.longBitsToDouble(tab[i + 1]))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = false; int mc = modCount(); int[] keys = set; long[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { if (!c.contains(Double.longBitsToDouble(vals[i]))) { incrementModCount(); mc++; keys[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean retainAll(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return retainAll((InternalDoubleCollectionOps) c); if (this == (Object) c) throw new IllegalArgumentException(); if (this.isEmpty()) return false; if (c.isEmpty()) { clear(); return true; } boolean changed = false; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { if (!c.contains(Double.longBitsToDouble(tab[i + 1]))) { incrementModCount(); mc++; tab[i] = REMOVED_BITS; postRemoveHook(); changed = true; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }