CompactLinkedHashSet<E> set = createWithExpectedSize(elements.length);
    Collections.addAll(set, elements);
    return set;
  }

  /**
   * Creates a {@code CompactLinkedHashSet} instance, with a high enough "initial capacity" that it
   * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures.
   *
   * @param expectedSize the number of elements you expect to add to the returned set

/**
 * {@code Escaper} instances suitable for strings to be included in XML attribute values and
 * elements' text contents. When possible, avoid manual escaping by using templating systems and
 * high-level APIs that provide autoescaping. For example, consider <a
 * href="http://www.xom.nu/">XOM</a>.
 *
 * <p><b>Note:</b> Currently the escapers provided by this class do not escape any characters

        buffer[8] = 0x00;

        // Flags
        buffer[9] = 0x00;

        // Flags2 (2 bytes)
        buffer[10] = 0x00;
        buffer[11] = 0x00;

        // Process ID High (2 bytes)
        buffer[12] = 0x00;
        buffer[13] = 0x00;

        // Signature (8 bytes)
        for (int i = 14; i < 22; i++) {
            buffer[i] = 0x00;
        }

   * Returns a hash function implementing FarmHash's Fingerprint64, an open-source algorithm.
   *
   * <p>This is designed for generating persistent fingerprints of strings. It isn't
   * cryptographically secure, but it produces a high-quality hash with fewer collisions than some
   * alternatives we've used in the past.
   *
   * <p>FarmHash fingerprints are encoded by {@link HashCode#asBytes} in little-endian order. This

        QueryBuilder result = booleanQueryCommand.execute(context, booleanQuery, 1.0f);

        assertNotNull(result);
        assertTrue(result instanceof BoolQueryBuilder);
    }

    // Test to ensure high coverage of edge cases
    public void test_convertBooleanQuery_multipleShouldClauses() {
        BooleanQuery.Builder boolQueryBuilder = new BooleanQuery.Builder();

        // Add multiple SHOULD clauses

import jcifs.internal.smb2.rdma.RdmaNegotiateRequest;
import jcifs.internal.smb2.rdma.RdmaNegotiateResponse;

/**
 * DiSNI RDMA connection implementation.
 *
 * This class would integrate with the DiSNI library to provide
 * high-performance RDMA operations over InfiniBand/RoCE networks.
 *
 * Note: This is a skeleton implementation. A real implementation would
 * require proper DiSNI integration with actual RDMA hardware.
 */

        .withFeatures(features)
        .suppressing(parentBuilder.getSuppressedTests())
        .createTestSuite();
  }

  /**
   * Returns an array of four bogus elements that will always be too high or too low for the
   * display. This includes two values for each extreme.
   *
   * <p>This method (dangerously) assume that the strings {@code "!! a"} and {@code "~~ z"} will

        assertNotNull(builder);
        assertTrue(builder instanceof MatchPhrasePrefixQueryBuilder);

        // Query was processed with high boost
        MatchPhrasePrefixQueryBuilder mpqb = (MatchPhrasePrefixQueryBuilder) builder;
        assertEquals(10.0f, mpqb.boost());
    }

        long[] testValues = { 0L, // Zero
                1L, // One
                -1L, // Negative one
                0x00000000FFFFFFFFL, // 32-bit max as long
                0xFFFFFFFF00000000L, // High 32 bits set
                0x7FFFFFFFFFFFFFFFL, // Long.MAX_VALUE
                0x8000000000000000L, // Long.MIN_VALUE
                0x0101010101010101L, // Repeating pattern

        System.arraycopy(new byte[] { (byte) 0xFF, 'S', 'M', 'B' }, 0, buffer, 0, 4);
        buffer[4] = 1; // wordCount
        buffer[7] = 0; // byteCount low
        buffer[8] = 0; // byteCount high

        assertDoesNotThrow(() -> response.decode(buffer, 0));
    }

    @Test
    @DisplayName("Test writeParameterWordsWireFormat")
    void testWriteParameterWordsWireFormat() {