writeBytes.setAccessible(true);
            writeBytes.invoke(cancel, dst, 0);

            // Then - array should remain unchanged
            assertArrayEquals(originalDst, dst);
        }

        @Test
        @DisplayName("Read operations should not modify buffer array")

    void lookup_returns_empty_for_unknown_codes(int unknownCode) {
        // Invalid inputs: codes not present should yield no message
        // Guard to ensure test remains valid if constants change in future
        for (int c : WinError.WINERR_CODES) {
            assertNotEquals(unknownCode, c, "Chosen unknown code unexpectedly clashes with a known code");
        }

            final int idx = i;
            assertEquals(expected[i], dst[offset + i], () -> "byte index " + idx);
        }
        // The region before offset and after the payload must remain untouched.
        for (int i = 0; i < offset; i++) {
            final int idx = i;
            assertEquals(0, dst[i], () -> "pre-offset byte " + idx + " modified");
        }

    // explicitly remove the existing value
    cache.asMap().computeIfPresent(1, (key, value) -> null);
    assertThat(notifications).hasSize(1);
    CacheTesting.checkEmpty(cache);

    // ensure no zombie entry remains
    cache.asMap().computeIfPresent(1, (key, value) -> null);
    assertThat(notifications).hasSize(1);
    CacheTesting.checkEmpty(cache);
  }

  public void testComputeIfPresent_error() {

        Smb2LeaseKey key = new Smb2LeaseKey(originalBytes);
        byte[] retrievedKey = key.getKey();

        // Modify the retrieved key
        retrievedKey[0] = (byte) 0xFF;

        // Original key should remain unchanged
        assertEquals(0x01, key.getKey()[0]);
    }

    @Test
    @DisplayName("Should create readable string representation")
    void testToString() {

    )

    @Throws(IOException::class)
    fun nextPart(): Part? {
      check(!closed) { "closed" }

      if (noMoreParts) return null

      // Read a boundary, skipping the remainder of the preceding part as necessary.
      if (partCount == 0 && source.rangeEquals(0L, dashDashBoundary)) {
        // This is the first part. Consume "--" followed by the boundary.

            // Modify the copy
            copyFileId[0] = 0x00;

            // Verify original is unchanged
            assertEquals((byte) 0xFF, originalFileId[0], "Original FileId should remain unchanged");
            assertArrayEquals(
                    new byte[] { (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF, (byte) 0xFF,

        assertEquals(8, result);
        assertEquals(3, response.getNumEntries());
        assertFalse(response.isEndOfSearch());
        assertEquals(0, response.getSid()); // sid should remain 0
    }

   * cartesian product is constructed, the input lists are merely copied. Only as the resulting list
   * is iterated are the individual lists created, and these are not retained after iteration.
   *
   * @param lists the lists to choose elements from, in the order that the elements chosen from
   *     those lists should appear in the resulting lists

    assertEquals("string with spaces", spaceEscaper.escape("string with spaces"));
  }

  /** Tests that if we add extra 'safe' characters they remain unescaped */
  public void testCustomEscaper() {
    UnicodeEscaper e = new PercentEscaper("+*/-", false);
    for (char c = 0; c < 128; c++) {
      if ((c >= '0' && c <= '9')
          || (c >= 'a' && c <= 'z')