public int setHashCode() { int hashCode = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { hashCode += key; } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { hashCode += key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public int setHashCode() { int hashCode = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { hashCode += key; } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { hashCode += key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public void forEach(Consumer<? super Integer> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public IntIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public IntIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public IntCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public IntCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
@Nonnull public int[] toIntArray() { int size = size(); int[] result = new int[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[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(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[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(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { result[resultIndex++] = key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Nonnull public int[] toIntArray() { int size = size(); int[] result = new int[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { result[resultIndex++] = key; } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { result[resultIndex++] = key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
public void forEach(Consumer<? super Integer> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= c.add(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseAddAllTo(IntCollection c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= c.add(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key;
int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key;
public boolean reverseRemoveAllFrom(IntSet s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= s.removeInt(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeInt(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseRemoveAllFrom(IntSet s) { if (this.isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { changed |= s.removeInt(key); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { changed |= s.removeInt(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }