public int setHashCode() { int hashCode = 0; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { hashCode += ((int) (key ^ (key >>> 32))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public int setHashCode() { int hashCode = 0; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { hashCode += ((int) (key ^ (key >>> 32))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public boolean moveNext() { if (expectedModCount == modCount()) { long[] tab = this.tab; for (int i = index - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { index = i; curKey = key; return true; } } curKey = FREE_BITS; index = -1; return false; } else { throw new java.util.ConcurrentModificationException(); } }
@Override public void forEachRemaining(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key)); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
public DoubleIterator iterator() { int mc = modCount(); return new NoRemovedIterator(mc); }
public DoubleCursor setCursor() { int mc = modCount(); return new NoRemovedCursor(mc); }
public DoubleCursor setCursor() { int mc = modCount(); return new NoRemovedCursor(mc); }
public void forEach(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Nonnull public Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { result[resultIndex++] = Double.longBitsToDouble(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
public DoubleIterator iterator() { int mc = modCount(); return new NoRemovedIterator(mc); }
public void forEach(DoubleConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEachRemaining(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key)); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
boolean reverseAddAllTo(InternalDoubleCollectionOps c) { if (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) { changed |= c.add(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public void forEach(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(DoubleConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(Double.longBitsToDouble(key)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
boolean reverseAddAllTo(InternalDoubleCollectionOps c) { if (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) { changed |= c.add(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
boolean allContainingIn(InternalDoubleCollectionOps c) { if (isEmpty()) return true; boolean containsAll = true; 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(key)) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
public String setToString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); long[] tab = table; for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { sb.append(' ').append(Double.longBitsToDouble(key)).append(','); if (++elementCount == 8) { int expectedLength = sb.length() * (size() / 8); sb.ensureCapacity(expectedLength + (expectedLength / 2)); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); sb.setCharAt(0, '['); sb.setCharAt(sb.length() - 1, ']'); return sb.toString(); }
boolean reverseRemoveAllFrom(InternalDoubleCollectionOps s) { if (isEmpty() || s.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) { changed |= s.removeDouble(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
boolean reverseRemoveAllFrom(InternalDoubleCollectionOps s) { if (isEmpty() || s.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) { changed |= s.removeDouble(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }