|| (stimuli.length >= 5 && removes > 2)) {
      // removes are the most expensive thing to test, since they often throw exceptions with stack
      // traces, so we test them a bit less aggressively
      return;
    }

    MultiExceptionListIterator reference = new MultiExceptionListIterator(expectedElements);
    I target = newTargetIterator();
    for (int i = 0; i < stimuli.length; i++) {

   *
   * <p>The serialization format consists of a 6-byte header (1 byte strategy, 1 byte hash
   * functions, 4 bytes array length) followed by the bit array data (bitSize / 8 bytes).
   */
  public void testBitSizeMatchesSerializationSize() throws Exception {
    int[] expectedInsertionValues = {1, 10, 100, 1000, 10000};
    double[] fppValues = {0.01, 0.03, 0.1};

        subjectPublicKey = BitString(publicKeyBytes, 0),
      )
    return CertificateAdapters.subjectPublicKeyInfo.toDer(subjectPublicKeyInfo)
  }

  /** Returns a byte string that differs from this one by one bit. */
  private fun ByteString.offByOneBit(): ByteString =
    Buffer()
      .write(this, 0, size - 1)
      .writeByte(this[size - 1].toInt() xor 1)
      .readByteString()

        capabilities &= server.capabilities;
        if ((server.capabilities & CAP_EXTENDED_SECURITY) == CAP_EXTENDED_SECURITY) {
            capabilities |= CAP_EXTENDED_SECURITY; // & doesn't copy high bit
        }

        if ((capabilities & SmbConstants.CAP_UNICODE) == 0) {
            // server doesn't want unicode
            if (FORCE_UNICODE) {
                capabilities |= SmbConstants.CAP_UNICODE;

    }

    NbtAddress doNameQuery(final Name name, InetAddress svr) throws UnknownHostException {
        NbtAddress addr;

        if (name.hexCode == 0x1d && svr == null) {
            svr = this.baddr; // bit of a hack but saves a lookup
        }
        name.srcHashCode = svr != null ? svr.hashCode() : 0;
        addr = getCachedAddress(name);

        /*
         * This is almost exactly like InetAddress.java. See the

  // Timed Get
  // There are a few design constraints to consider
  // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I
  //   have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the
  //   timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of

        assertTrue(SmbConstants.DEFAULT_SO_TIMEOUT >= SmbConstants.DEFAULT_RESPONSE_TIMEOUT);
    }

    @Test
    @DisplayName("Should have distinct bit patterns for flags")
    void testDistinctBitPatterns() {
        // Verify file attributes have distinct bit patterns
        int[] attributes = { SmbConstants.ATTR_READONLY, SmbConstants.ATTR_HIDDEN, SmbConstants.ATTR_SYSTEM, SmbConstants.ATTR_VOLUME,

	SLLIUW		$31, X17, X18			// 1b99f809
	SLLIUW		$63, X17			// 9b98f80b
	SLLIUW		$63, X17, X18			// 1b99f80b
	SLLIUW		$1, X18, X19			// 9b191908

	//
	// "B" Extension for Bit Manipulation, Version 1.0.0
	//

	// 28.4.2: Basic Bit Manipulation (Zbb)
	ANDN	X19, X20, X21				// b37a3a41 or 93caf9ffb37a5a01
	ANDN	X19, X20				// 337a3a41 or 93cff9ff337afa01
	CLZ	X20, X21				// 931a0a60
	CLZW	X21, X22				// 1b9b0a60

   * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables
   * for matchers that only match a few characters, and so on. In the worst-case scenario, it
   * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
   * matcher which is faster to query than the original.
   */
  @GwtIncompatible // SmallCharMatcher
  CharMatcher precomputedInternal() {

   * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables
   * for matchers that only match a few characters, and so on. In the worst-case scenario, it
   * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
   * matcher which is faster to query than the original.
   */
  @GwtIncompatible // SmallCharMatcher
  CharMatcher precomputedInternal() {