* @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */
  public static <K extends @Nullable Object, V extends @Nullable Object> HashMultimap<K, V> create(
      int expectedKeys, int expectedValuesPerKey) {
    return new HashMultimap<>(expectedKeys, expectedValuesPerKey);

    static String getMessageByCode(final int errcode) {
        /* Note there's a signedness error here because 0xC0000000 based values are
         * negative so it with NT_STATUS_SUCCESS (0) the binary search will not be
         * performed properly. The effect is that the code at index 1 is never found
         * (NT_STATUS_UNSUCCESSFUL). So here we factor out NT_STATUS_SUCCESS

            "48, 16, true", // DIRECTORY | ARCHIVE vs DIRECTORY
            "48, 32, true", // DIRECTORY | ARCHIVE vs ARCHIVE
            "21, 5, true", // READONLY | SYSTEM | DIRECTORY vs READONLY | SYSTEM

            // Negative cases (should be rejected)
            "1, 2, false", // READONLY vs HIDDEN
            "2, 1, false", // HIDDEN vs READONLY
            "16, 32, false", // DIRECTORY vs ARCHIVE

    /**
     * Bind packet type - establishes context
     */
    int RPC_PT_BIND = 0x0B;
    /**
     * Bind acknowledgment packet type
     */
    int RPC_PT_BIND_ACK = 0x0C;
    /**
     * Bind negative acknowledgment packet type
     */
    int RPC_PT_BIND_NAK = 0x0D;
    /**
     * Alter context packet type
     */
    int RPC_PT_ALTER_CONTEXT = 0x0E;
    /**
     * Alter context response packet type

                SmbConstants.DEFAULT_SHARING);

        byte[] data = new byte[10];

        // When & Then - test boundary conditions
        // Negative length or offset should not cause issues (len <= 0 returns early)
        assertDoesNotThrow(() -> outputStream.write(data, 0, -1)); // negative length, returns early
        assertDoesNotThrow(() -> outputStream.write(data, 0, 0)); // zero length, returns early

* **Professional appearance**: Consistent APIs and documentation appear more polished
* **Clearer contribution guidelines**: [CONTRIBUTING.md](../../CONTRIBUTING.md) now includes this requirement

### Negative Consequences

* **Historical inconsistencies**: Existing code may contain British English spellings that cannot be changed due to backward compatibility

### Migration and Enforcement

   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */
  public static <K extends @Nullable Object, V extends @Nullable Object> HashMultimap<K, V> create(
      int expectedKeys, int expectedValuesPerKey) {
    return new HashMultimap<>(expectedKeys, expectedValuesPerKey);

        setupCountField.setAccessible(true);
        assertEquals(255, setupCountField.get(response));
    }

    @Test
    @DisplayName("Test negative values handling (as unsigned)")
    void testNegativeValuesAsUnsigned() throws Exception {
        byte[] buffer = new byte[100];
        int bufferIndex = 0;

        // Reserved bytes

            // Act & Assert
            assertDoesNotThrow(() -> new MsrpcSamrConnect2(null, 0, ph));
        }

        @Test
        @DisplayName("should accept negative access mask values")
        void testNegativeAccessMaskAccepted() {
            // Arrange
            SamrPolicyHandle ph = createMockPolicyHandle();

            // Act & Assert

        assertEquals(0, cmd.readDataWireFormat(buf, 0, buf.length));
    }

    @ParameterizedTest
    @CsvSource({ "0, 0", // all zeros
            "-1, 2147483647", // negative fid, max positive security
            "12345, 999" // arbitrary numbers
    })
    void toString_includesCorrectHexValues(int fid, int securityInformation) {