public String setToString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
public String setToString() { if (isEmpty()) return "[]"; StringBuilder sb = new StringBuilder();
public void forEach(Consumer<? super Character> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(CharConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(Consumer<? super Character> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(CharConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { action.accept(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { action.accept(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false;
if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false;
public boolean reverseAddAllTo(CharCollection c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { changed |= c.add(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean removeIf(Predicate<? super Character> filter) { if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
public boolean reverseAddAllTo(CharCollection c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { changed |= c.add(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { changed |= c.add(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean allContainingIn(CharCollection c) { if (isEmpty()) return true; boolean containsAll = true;
public boolean allContainingIn(CharCollection c) { if (isEmpty()) return true; boolean containsAll = true;
public boolean reverseRemoveAllFrom(CharSet s) { if (isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { changed |= s.removeChar(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { changed |= s.removeChar(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
public boolean reverseRemoveAllFrom(CharSet s) { if (isEmpty() || s.isEmpty()) return false; boolean changed = false; int mc = modCount(); char free = freeValue; char removed = removedValue; int[] tab = table; long base = INT_BASE + CHAR_KEY_OFFSET; if (noRemoved()) { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free) { changed |= s.removeChar(key); } } } else { for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) { char key; if ((key = U.getChar(tab, base + off)) != free && key != removed) { changed |= s.removeChar(key); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
boolean removeAll(@Nonnull HashCharSet thisC, @Nonnull CharCollection c) { if (thisC == c) throw new IllegalArgumentException(); if (isEmpty() || c.isEmpty()) return false; boolean changed = false;
private boolean retainAll(@Nonnull HashCharSet thisC, @Nonnull CharCollection c) { if (thisC == c) throw new IllegalArgumentException(); if (isEmpty()) return false; if (c.isEmpty()) {
public boolean removeIf(CharPredicate filter) { if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
public boolean removeIf(CharPredicate filter) { if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;
public boolean removeIf(Predicate<? super Character> filter) { if (filter == null) throw new java.lang.NullPointerException(); if (isEmpty()) return false; boolean changed = false;