public int setHashCode() { int hashCode = 0; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { hashCode += key; } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { hashCode += key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public int setHashCode() { int hashCode = 0; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { hashCode += key; } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { hashCode += key; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public ByteIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator(mc); return new NoRemovedIterator(mc); }
public void forEach(Consumer<? super Byte> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public ByteCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key;
char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key;
char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key;
public ByteIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator(mc); return new NoRemovedIterator(mc); }
public ByteCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public void forEach(ByteConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key;
public void forEach(Consumer<? super Byte> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(ByteConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public boolean reverseAddAllTo(ByteCollection c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { changed |= c.add(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key;
public boolean reverseAddAllTo(ByteCollection c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { changed |= c.add(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key;
public boolean reverseRemoveAllFrom(ByteSet s) { if (isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { changed |= s.removeByte(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { changed |= s.removeByte(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseRemoveAllFrom(ByteSet s) { if (isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); byte free = freeValue; byte removed = removedValue; char[] tab = table; long base = CHAR_BASE + BYTE_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free) { changed |= s.removeByte(key); } } } else { for (long off = ((long) tab.length) << CHAR_SCALE_SHIFT; (off -= CHAR_SCALE) >= 0L;) { byte key; if ((key = U.getByte(tab, base + off)) != free && key != removed) { changed |= s.removeByte(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }