// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

    }

    @Test
    @DisplayName("Test wire format structure matches SMB2 specification")
    void testWireFormatStructure() {
        byte[] buffer = new byte[256];
        Arrays.fill(buffer, (byte) 0xCC); // Fill with pattern to detect unwritten areas

        int written = request.writeBytesWireFormat(buffer, 0);

        // Verify structure according to SMB2 CLOSE specification

    void testWriteParametersWireFormatPreservesBuffer() {
        querySecurityDesc = new NtTransQuerySecurityDesc(mockConfig, 0x1234, OWNER_SECURITY_INFORMATION);
        byte[] dst = new byte[20];

        // Fill buffer with test pattern
        for (int i = 0; i < dst.length; i++) {
            dst[i] = (byte) (i & 0xFF);
        }

        int startIndex = 5;

        // Given
        Configuration mockConfig = mock(Configuration.class);
        Smb2TreeDisconnectRequest request = new Smb2TreeDisconnectRequest(mockConfig);
        byte[] buffer = new byte[256];
        // Fill with non-zero values first
        for (int i = 0; i < buffer.length; i++) {
            buffer[i] = (byte) 0xFF;
        }

        // When
        request.writeBytesWireFormat(buffer, 10);

        int[] invalidSizes = { -1, 0, 1, 2, 3, 5, 6, 8, 16, 32, 64, 128, 256, 512, 1024 };

        for (int invalidSize : invalidSizes) {
            byte[] buffer = new byte[256];

            // Handle negative values (will wrap around in writeInt2)
            if (invalidSize >= 0) {
                SMBUtil.writeInt2(invalidSize, buffer, 0);

                // When & Then

	if result.RowsAffected != int64(len(users)) {
		t.Errorf("affected rows should be %v, but got %v", len(users), result.RowsAffected)
	}

	for _, user := range users {
		if user.ID == 0 {
			t.Fatalf("failed to fill user's ID, got %v", user.ID)
		} else {
			var newUser User
			if err := DB.Where("id = ?", user.ID).Preload(clause.Associations).First(&newUser).Error; err != nil {
				t.Fatalf("errors happened when query: %v", err)

    void testDecodeDataIntegrity() throws SMBProtocolDecodingException {
        // Prepare buffer with specific pattern
        byte[] buffer = new byte[32];
        byte[] expectedData = new byte[16];

        // Fill data section with pattern
        for (int i = 0; i < 16; i++) {
            expectedData[i] = (byte) (0xA0 + i);
            buffer[16 + i] = expectedData[i];
        }

        // Set header values

  }

  @Override
  public void clear() {
    if (needsAllocArrays()) {
      return;
    }
    this.firstEntry = ENDPOINT;
    this.lastEntry = ENDPOINT;
    if (links != null) {
      Arrays.fill(links, 0, size(), 0);
    }
    super.clear();
  }

  /*
   * For discussion of the safety of the following methods, see the comments near the end of
   * CompactHashMap.
   */

            return (int) (this.fp - start);
        }
    }

    /**
     * This stream class is unbuffered. Therefore this method will always
     * return 0 for streams connected to regular files. However, a
     * stream created from a Named Pipe this method will query the server using a
     * "peek named pipe" operation and return the number of available bytes
     * on the server.
     */
    @Override

    // We consider elementData(index) a "hole", and we want to fill it
    // with the last element of the heap, toTrickle.
    // Since the last element of the heap is from the bottom level, we
    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of
    // comparisons with toTrickle, but in some cases we will need to bubble it
    // all the way up again.