assertEquals("open-fail", ex.getMessage());
        verify(handle, times(1)).ensureOpen();
    }

    @Test
    @DisplayName("getHandle returns the exact handle instance")
    void getHandle_returnsHandle() throws Exception {
        // Arrange
        SmbPipeOutputStream out = newStream();

        // Act
        SmbPipeHandleImpl got = out.getHandle();

        // Then
        assertEquals(6, bytesWritten);
        assertEquals(fid, SMBUtil.readInt2(dst, 0));
        // With a digest, the lastWriteTime should be written.
        // We can't verify the exact bytes without a real implementation of writeUTime,
        // but we can check that it's not zero.
        long writtenTime = SMBUtil.readInt4(dst, 2) & 0xFFFFFFFFL;
        // This is a weak check, but better than nothing.

        }

        @Test
        @DisplayName("Should decode minimum buffer size")
        void testDecodeMinimumBufferSize() throws SMBProtocolDecodingException {
            byte[] buffer = new byte[12]; // Exact size needed
            SMBUtil.writeInt4(3, buffer, 0);
            SMBUtil.writeInt4(4096, buffer, 4);
            SMBUtil.writeInt4(12288, buffer, 8);

            e.decode(buffer, bufferIndex, len);

            /*
             * lastNameOffset ends up pointing to either to
             * the exact location of the filename(e.g. Win98)
             * or to the start of the entry containing the
             * filename(e.g. NT). Ahhrg! In either case the
             * lastNameOffset falls between the start of the

	historyFile := pathJoin(minioConfigHistoryPrefix, uuidKV+kvPrefix)
	_, err := objAPI.DeleteObject(ctx, minioMetaBucket, historyFile, ObjectOptions{
		DeletePrefix:       true,
		DeletePrefixObject: true, // use prefix delete on exact object (this is an optimization to avoid fan-out calls)
	})
	return err
}

func readServerConfigHistory(ctx context.Context, objAPI ObjectLayer, uuidKV string) ([]byte, error) {

    @DisplayName("send handles each RequestParam enum constant")
    void send_eachRequestParam_isAccepted(RequestParam param) throws Exception {
        // Arrange: stub per-call return to ensure interaction with the exact enum
        when(tree.send(eq(request), eq(param))).thenReturn(response);

        // Act
        CommonServerMessageBlockResponse out = tree.send(request, param);

        // Assert

   * href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3
   * algorithm, x86 variant</a> (little-endian variant), using the given seed value.
   *
   * <p>The exact C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A).
   *
   * <p>This method is called {@code murmur3_32_fixed} because it fixes a bug in the {@code
   * HashFunction} returned by the original {@code murmur3_32} method.

     * Returns the duration elapsed since this clock was initialized.
     * <p>
     * The returned duration is calculated using {@link System#nanoTime()}
     * to ensure monotonic behavior. This duration represents the exact time
     * span between clock initialization and the current instant.
     *
     * @return the duration since clock initialization
     * @see #startInstant()
     * @see #instant()
     */

    if (dividend >= 0) {
      return dividend / divisor;
    }

    /*
     * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
     * guaranteed to be either exact or one less than the correct value. This follows from fact that
     * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite
     * trivial.
     */

   * containing one element (the given set itself).
   *
   * <p>Despite the method name, this method attempts to avoid actually copying the data when it is
   * safe to do so. The exact circumstances under which a copy will or will not be performed are
   * undocumented and subject to change.
   *
   * <p>This method is not type-safe, as it may be called on elements that are not mutually
   * comparable.