// Now we hit the cap
    assertEquals(1 << 30, ImmutableSet.chooseTableSize(1 << 29));
    assertEquals(1 << 30, ImmutableSet.chooseTableSize((1 << 30) - 1));

    // Now we've gone too far
    assertThrows(IllegalArgumentException.class, () -> ImmutableSet.chooseTableSize(1 << 30));
  }

  @GwtIncompatible // RegularImmutableSet.table not in emulation
  public void testResizeTable() {

        assertEquals(32, sid.sub_authority[0]);
        assertEquals(544, sid.sub_authority[1]);
        assertEquals(adminSidString, sid.toString());
    }

    /**
     * Test byte array constructor with too many sub-authorities.
     */
    @Test
    void testByteArrayConstructorTooManySubAuthorities() {
        byte[] badSid = new byte[10];
        badSid[1] = 101; // sub_authority_count > 100

   * connection is fine the ping will receive a pong; otherwise it won't.
   *
   * The deadline to respond to this ping attempts to limit the cost of being wrong. If it is too
   * long, streams created while we await the pong will reuse broken connections and inevitably
   * fail. If it is too short, slow connections will be marked as failed and extra TCP and TLS
   * handshakes will be required.
   *

        SMBUtil.writeInt4(100, buffer, offset + 4);

        // Write notification with next offset beyond buffer
        int notifyOffset = 80;
        SMBUtil.writeInt4(500, buffer, notifyOffset); // Invalid - too large
        SMBUtil.writeInt4(1, buffer, notifyOffset + 4);
        SMBUtil.writeInt4(8, buffer, notifyOffset + 8);
        System.arraycopy("test".getBytes("UnicodeLittleUnmarked"), 0, buffer, notifyOffset + 12, 8);

    assertThrows(IllegalArgumentException.class, () -> BigIntegerMath.factorial(-1));
  }

  public void testBinomialSmall() {
    runBinomialTest(0, 30);
  }

  @GwtIncompatible // too slow
  public void testBinomialLarge() {
    runBinomialTest(31, 100);
  }

  // Depends on the correctness of BigIntegerMath.factorial
  private static void runBinomialTest(int firstN, int lastN) {

      return delegate;
    }

    @Override
    public int size() {
      return delegate.size() + delta;
    }
  }

  @SuppressWarnings("JoinIterableIterator") // explicitly testing iterator overload, too
  public void testNoSpecialNullBehavior() {
    checkNoOutput(J, iterable);
    checkResult(J, iterable1, "1");
    checkResult(J, iterable12, "1-2");
    checkResult(J, iterable123, "1-2-3");

    CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener();
    IdentityLoader<Integer> loader = identityLoader();

    // Even numbers are free, odd are too expensive
    Weigher<Integer, Integer> evensOnly =
        new Weigher<Integer, Integer>() {
          @Override
          public int weigh(Integer k, Integer v) {
            return k % 2;
          }

        ndrBuffer.readOctetArray(destData, 0, sourceData.length);

        assertEquals(sourceData.length, ndrBuffer.getIndex());
        assertEquals(sourceData.length, ndrBuffer.getLength()); // Length is updated on read too
        assertArrayEquals(sourceData, destData);

        // Read with offset and length
        ndrBuffer.setIndex(0);
        Arrays.fill(destData, (byte) 0x00); // Clear destData

	case scanner.Int, '(':
		p.back()
		x := int64(p.expr())
		if p.arch.Family == sys.ARM64 {
			if x >= 64 {
				p.errorf("register shift count too large: %s", str)
			}
			count = int16((x & 63) << 10)
		} else {
			if x >= 32 {
				p.errorf("register shift count too large: %s", str)
			}
			count = int16((x & 31) << 7)
		}
	default:
		p.errorf("unexpected %s in register shift", tok.String())
	}

                if (buffer == null || buffer.length < bufferIndex + 4) {
                    throw new SMBProtocolDecodingException("Buffer too small");
                }
                return 4;
            }

            @Override
            public int encode(byte[] dst, int dstIndex) {
                return 4;
            }