@Override public String toString() { if (this.isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
@Override public void forEach(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { action.accept(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { action.accept(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (filter == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return false; boolean changed = false;
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;
if (c instanceof InternalDoubleCollectionOps) return allContainingIn((InternalDoubleCollectionOps) c); if (this.isEmpty()) return true; boolean containsAll = true;
if (c instanceof InternalDoubleCollectionOps) return allContainingIn((InternalDoubleCollectionOps) c); if (this.isEmpty()) return true; boolean containsAll = true;
private boolean allContainingIn(InternalDoubleCollectionOps c) { if (this.isEmpty()) return true; boolean containsAll = true;
private boolean allContainingIn(InternalDoubleCollectionOps c) { if (this.isEmpty()) return true; boolean containsAll = true;
@Override public boolean reverseAddAllTo(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return reverseAddAllTo((InternalDoubleCollectionOps) c); if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public boolean reverseAddAllTo(DoubleCollection c) { if (c instanceof InternalDoubleCollectionOps) return reverseAddAllTo((InternalDoubleCollectionOps) c); if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public boolean reverseRemoveAllFrom(DoubleSet s) { if (s instanceof InternalDoubleCollectionOps) return reverseRemoveAllFrom((InternalDoubleCollectionOps) s); if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= s.removeDouble(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeDouble(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean reverseAddAllTo(InternalDoubleCollectionOps c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean reverseRemoveAllFrom(InternalDoubleCollectionOps s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= s.removeDouble(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeDouble(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public boolean reverseRemoveAllFrom(DoubleSet s) { if (s instanceof InternalDoubleCollectionOps) return reverseRemoveAllFrom((InternalDoubleCollectionOps) s); if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= s.removeDouble(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeDouble(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public void forEach(DoubleConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { action.accept(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(DoubleConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { action.accept(Double.longBitsToDouble(vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(Double.longBitsToDouble(vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
private boolean reverseRemoveAllFrom(InternalDoubleCollectionOps s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= s.removeDouble(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeDouble(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
private boolean reverseAddAllTo(InternalDoubleCollectionOps c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] != free) { changed |= c.add(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }