}
      }
      return false;
    }

    /**
     * If more than this many consecutive positions are filled in a table of the specified size,
     * report probable hash flooding. ({@link #hashFloodingDetected} may also report hash flooding
     * if fewer consecutive positions are filled; see that method for details.)
     */
    static int maxRunBeforeFallback(int tableSize) {

        }

        @Test
        @DisplayName("Should write at different buffer positions")
        void testWriteAtDifferentPositions() {
            request.setReadLength(2048);
            request.setOffset(4096L);

            byte[] buffer = new byte[512];

            // Test at position 0
            int bytesWritten = request.writeBytesWireFormat(buffer, 0);

        assertEquals('E', dst[2]); // (0x54 & 0x0F) + 0x41 = 0x45 = 'E'

        // Check padding (positions 8-30 should be 'CA' pairs for spaces)
        for (int i = 8; i < 31; i += 2) {
            assertEquals('C', dst[i + 1]);
            assertEquals('A', dst[i + 2]);
        }

        // Check type encoding at position 31-32
        assertEquals('C', dst[31]); // (0x20 >> 4) + 0x41 = 'C'

        @DisplayName("Should write at different buffer positions")
        void testWriteAtDifferentPositions() {
            byte[] buffer = new byte[512];

            // Test at position 0
            int bytesWritten = request.writeBytesWireFormat(buffer, 0);
            assertEquals(48, bytesWritten);
            assertEquals(48, SMBUtil.readInt2(buffer, 0));

            // Test at position 100
            Arrays.fill(buffer, (byte) 0);

            // Then
            assertEquals(HEADER_SIZE + CHUNK_SIZE, bytesWritten);

            // Verify source key at correct position
            for (int i = 0; i < SOURCE_KEY_SIZE; i++) {
                assertEquals(sourceKey[i], largeBuffer[position + i]);
            }

            // Verify chunk count at correct position

            assertEquals(6, smallEncodedSize); // actual: 2 bytes count + 2*2 bytes for ciphers
            assertEquals(6, largeEncodedSize);

            // Verify data at different positions
            assertArrayEquals(Arrays.copyOfRange(smallBuffer, 0, smallEncodedSize),
                    Arrays.copyOfRange(largeBuffer, 500, 500 + largeEncodedSize));
        }
    }

    @Nested

    void testStructureSizeImmutability() throws Exception {
        // Given
        byte[] buffer = new byte[2048];

        // When - encode at multiple positions
        for (int i = 0; i < 5; i++) {
            Smb2TreeConnectRequest req = new Smb2TreeConnectRequest(mockConfig, TEST_PATH);
            req.encode(buffer, i * 200);
        }

                + " bytes: %s",
            numBytes, address);
      }
    }

    // Copy the bytes into the least significant positions.
    System.arraycopy(addressBytes, srcPos, targetCopyArray, destPos, copyLength);

    try {
      return InetAddress.getByAddress(targetCopyArray);
    } catch (UnknownHostException impossible) {

   * If {@code k} is the size of the returned {@code ImmutableSortedSet}, then the sorted unique
   * elements are in the first {@code k} positions of {@code contents}, and {@code contents[i] ==
   * null} for {@code k <= i < n}.
   *
   * <p>This method takes ownership of {@code contents}; do not modify {@code contents} after this
   * returns.
   *

   * Ensures that {@code start} and {@code end} specify valid <i>positions</i> in an array, list or
   * string of size {@code size}, and are in order. A position index may range from zero to {@code
   * size}, inclusive.
   *
   * @param start a user-supplied index identifying a starting position in an array, list or string
   * @param end a user-supplied index identifying an ending position in an array, list or string