// Then
        // Verify that the super constructor is called with correct arguments
        // Note: Directly verifying super constructor calls is not straightforward in JUnit/Mockito.
        // We verify the effects of the super constructor by checking the fields of the created object.

        // Assert object_attributes fields
        assertNotNull(msrpcLsarOpenPolicy2.object_attributes);

    interface EnumConsumer {
        void accept(RequestParam rp);
    }

    @Mock
    EnumConsumer consumer;

    @Test
    @DisplayName("Enum value can be passed to collaborators without side effects")
    void enumUsedWithCollaboratorHasNoSideEffects() {
        // Arrange: pick a value and a mocked consumer
        RequestParam rp = RequestParam.NO_RETRY;

        // Act: pass to the collaborator

    private static final double TIMING_TOLERANCE = 2.0; // 200% tolerance - JVM timing is inherently variable for timing variations

    @BeforeEach
    public void setUp() {
        // Warm up JVM to reduce JIT compilation effects
        for (int i = 0; i < 100; i++) {
            NtlmPasswordAuthenticator auth1 = new NtlmPasswordAuthenticator("testdomain", "testuser", "password123");

	if objectAPI == nil {
		return
	}

	// NB rebalance-start admin API is always coordinated from first pool's
	// first node. The following is required to serialize (the effects of)
	// concurrent rebalance-start commands.
	if ep := globalEndpoints[0].Endpoints[0]; !ep.IsLocal {
		for nodeIdx, proxyEp := range globalProxyEndpoints {
			if proxyEp.Host == ep.Host {

        cache.resolveSids(ctx, null, arr, 2, 1); // resolve only s3

        // Verify cache behavior - after reset, spying on the same cache won't work
        // Since we're working with internal state, we'll verify the side effects
        assertEquals("DOM", s1.getDomainName());
        assertEquals("user1", s1.getAccountName());
        assertEquals("DOM", s2.getDomainName());
        assertEquals("user2", s2.getAccountName());

	// Find the field start and end indices.
	// Doing this in a separate pass (rather than slicing the string s
	// and collecting the result substrings right away) is significantly
	// more efficient, possibly due to cache effects.
	start := -1 // valid span start if >= 0
	for i := 0; i < len(s); {
		r, size := utf8.DecodeRune(s[i:])
		if f(r) {
			if start >= 0 {
				spans = append(spans, span{start, i})
				start = -1
			}