}
    }

    // Integration test with actual MD5 to verify HMAC calculation logic
    @Test
    void testHMACT64WithActualMD5() throws NoSuchAlgorithmException {
        // This test uses a real MD5 instance to verify the HMAC calculation logic
        // HMACT64 is a modified HMAC-MD5 where the key is truncated at 64 bytes

			Optional:    true,
			Type:        "string",
		},
		config.HelpKV{
			Key:         Optimize,
			Description: `optimize parity calculation for standard storage class, set 'capacity' for capacity optimized (no additional parity)` + defaultHelpPostfix(Optimize),
			Optional:    true,
			Type:        "string",
		},
		config.HelpKV{
			Key:         config.Comment,

        SmbComTransaction result = transaction.nextElement();

        assertSame(transaction, result);
    }

    @Test
    @DisplayName("Test pad calculation with various offsets")
    void testPadCalculation() {
        // Test pad calculation with different alignment values
        assertEquals(0, transaction.pad(0)); // Already aligned
        assertEquals(0, transaction.pad(4)); // Already aligned

        Encodable mockInfo = mock(Encodable.class);
        when(mockInfo.size()).thenReturn(100);
        request.setInfo(mockInfo);

        int size = request.size();

        // Expected size calculation: size8(SMB2_HEADER_LENGTH + 32 + info.size())
        // size8 rounds up to nearest multiple of 8
        int expectedRawSize = Smb2Constants.SMB2_HEADER_LENGTH + 32 + 100;

        // When
        boolean isCancel = request.isCancel();

        // Then
        assertTrue(isCancel, "Should identify itself as a cancel request");
    }

    @Test
    @DisplayName("Test size calculation")
    void testSize() {
        // Given
        Smb2CancelRequest request = new Smb2CancelRequest(mockConfig, 1L, 0L);

        // When
        int size = request.size();

        // Then

     * of the child. The general idea is to adjust inherited URLs to match the project layout (in SCM).
     *
     * <p>This calculation is only a heuristic based on our conventions.
     * In detail, the algo relies on the following assumptions: <ul>
     * <li>The parent uses aggregation and refers to the child via the modules section</li>

		return
	}

	duration := endTime.Sub(m.startTime)

	bytesSinceLastWindow := atomic.SwapUint64(&m.bytesSinceLastWindow, 0)

	if m.expMovingAvg == 0 {
		// Should address initial calculation and should be fine for resuming from 0
		m.expMovingAvg = float64(bytesSinceLastWindow) / duration.Seconds()
		return
	}

	increment := float64(bytesSinceLastWindow) / duration.Seconds()

scanner               manage namespace scanning for usage calculation, lifecycle, healing and more
```

> NOTE: if you set any of the following sub-system configuration using ENVs, dynamic behavior is not supported.

### Usage scanner

import java.time.LocalDateTime;
import java.time.ZonedDateTime;
import java.util.Collection;
import java.util.Date;
import java.util.Map;
import java.util.Objects;

/**
 * Utility class for memory operations and size calculations.
 */
public final class MemoryUtil {
    private MemoryUtil() {
    }

    /**
     * Gets a formatted memory usage log string.
     *
     * @return formatted memory usage information
     */

        assertEquals(8, emptyContext.size()); // Minimum size
        assertFalse(emptyContext.supportsAlgorithm(CompressionNegotiateContext.COMPRESSION_LZ77));
    }

    @Test
    @DisplayName("Test context size calculation")
    public void testContextSize() {
        int expectedSize = 8 + (3 * 2); // Header + 3 algorithms * 2 bytes each
        assertEquals(expectedSize, context.size());
    }

    @Test