public int setHashCode() { int hashCode = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { hashCode += ((int) (key ^ (key >>> 32))); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { 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 free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { hashCode += ((int) (key ^ (key >>> 32))); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { hashCode += ((int) (key ^ (key >>> 32))); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public void forEach(Consumer<? super Long> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { action.accept(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public LongIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public LongIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public LongCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public LongCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
@Nonnull public long[] toLongArray() { int size = size(); long[] result = new long[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { result[resultIndex++] = key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Nonnull public Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { result[resultIndex++] = key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Nonnull public long[] toLongArray() { int size = size(); long[] result = new long[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { result[resultIndex++] = key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Nonnull public Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { result[resultIndex++] = key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
public void forEach(LongConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { action.accept(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(Consumer<? super Long> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { action.accept(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(LongConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { action.accept(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key;
public boolean reverseAddAllTo(LongCollection c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { changed |= c.add(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseAddAllTo(LongCollection c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { changed |= c.add(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key;
public boolean reverseRemoveAllFrom(LongSet s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { changed |= s.removeLong(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { changed |= s.removeLong(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseRemoveAllFrom(LongSet s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] tab = table; if (noRemoved()) { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free) { changed |= s.removeLong(key); } } } else { for (int i = tab.length - 2; i >= 0; i -= 2) { long key; if ((key = tab[i]) != free && key != removed) { changed |= s.removeLong(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }