@Override public void replaceAll( BiFunction<? super Byte, ? super Byte, ? extends Byte> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { U.putByte(tab, CHAR_BASE + BYTE_VALUE_OFFSET + (((long) (i)) << CHAR_SCALE_SHIFT), function.apply(key, (byte) (entry >>> 8))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(BiConsumer<? super Byte, ? super Byte> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { action.accept(key, (byte) (entry >>> 8)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void replaceAll( BiFunction<? super Byte, ? super Byte, ? extends Byte> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { U.putByte(tab, CHAR_BASE + BYTE_VALUE_OFFSET + (((long) (i)) << CHAR_SCALE_SHIFT), function.apply(key, (byte) (entry >>> 8))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public String toString() { if (isEmpty()) return "{}"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { sb.append(' '); sb.append(key); sb.append('='); sb.append((byte) (entry >>> 8)); sb.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(); }
@Override public void replaceAll(ByteByteToByteFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { U.putByte(tab, CHAR_BASE + BYTE_VALUE_OFFSET + (((long) (i)) << CHAR_SCALE_SHIFT), function.applyAsByte(key, (byte) (entry >>> 8))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ByteByteToByteFunction function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { U.putByte(tab, CHAR_BASE + BYTE_VALUE_OFFSET + (((long) (i)) << CHAR_SCALE_SHIFT), function.applyAsByte(key, (byte) (entry >>> 8))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public String toString() { if (isEmpty()) return "{}"; StringBuilder sb = new StringBuilder(); int elementCount = 0; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { sb.append(' '); sb.append(key); sb.append('='); sb.append((byte) (entry >>> 8)); sb.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(); }
public void forEach(BiConsumer<? super Byte, ? super Byte> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { action.accept(key, (byte) (entry >>> 8)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ByteByteConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { action.accept(key, (byte) (entry >>> 8)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ByteByteConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { action.accept(key, (byte) (entry >>> 8)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean forEachWhile(ByteBytePredicate predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { if (!predicate.test(key, (byte) (entry >>> 8))) { terminated = true; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return !terminated; }
@Override public void reversePutAllTo(InternalByteByteMapOps m) { if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { m.justPut(key, (byte) (entry >>> 8)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalByteByteMapOps m) { if (isEmpty()) return; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { m.justPut(key, (byte) (entry >>> 8)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public boolean forEachWhile(ByteBytePredicate predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { if (!predicate.test(key, (byte) (entry >>> 8))) { terminated = true; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return !terminated; }
@Override public boolean allEntriesContainingIn(InternalByteByteMapOps m) { if (isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { if (!m.containsEntry(key, (byte) (entry >>> 8))) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }
@Override public boolean allEntriesContainingIn(InternalByteByteMapOps m) { if (isEmpty()) return true; boolean containsAll = true; int mc = modCount(); byte free = freeValue; char[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { byte key; if ((key = (byte) (entry = tab[i])) != free) { if (!m.containsEntry(key, (byte) (entry >>> 8))) { containsAll = false; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return containsAll; }