this.inputList = ImmutableList.sortedCopyOf(comparator, input);
      this.comparator = comparator;
      this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is

                    throw new SmbException("Account '" + username + "' is locked out until " + account.getLockoutExpiry());
                } else {
                    // Lockout expired, reset
                    account.reset();
                }
            }
        }

        // Check per-IP limit
        if (sourceIp != null) {

        assertFalse(emptyIterator.hasNext(), "hasNext should consistently return false");
        assertFalse(emptyIterator.hasNext(), "hasNext should always return false on repeated calls");
    }

    @Test
    @DisplayName("next should return null")
    void testNextReturnsNull() {
        // When
        SmbResource result = emptyIterator.next();

        // Then

        // Should validate string length
        String result = unicodeString.check(testString);
        assertEquals(testString, result);

        // Should reject wrong length
        assertThrows(PACDecodingException.class, () -> {
            unicodeString.check("WRONGLENGTH");
        });
    }

    @Test
    @DisplayName("Test empty arrays using mock")

 * more ACEs are evaluated until all desired access bits (combined)
 * are "allowed". If all of the desired access bits are not "allowed"
 * the then same process is repeated for inherited ACEs.
 * <p>
 * For example, if user <code>WNET\alice</code> tries to open a file
 * with desired access bits <code>0x00000003</code> (<code>FILE_READ_DATA |

import org.eclipse.sisu.plexus.TypeArguments;

/**
 * Optimized version of CompositeBeanHelper with caching for improved performance.
 * This implementation caches method and field lookups to avoid repeated reflection operations.
 */
public final class EnhancedCompositeBeanHelper {

    // Cache for method lookups: Class -> PropertyName -> MethodInfo

	p.cycleInfoMu.Lock()
	defer p.cycleInfoMu.Unlock()
	if p.cycleInfo == nil {
		return nil
	}
	c := p.cycleInfo.clone()
	return &c
}

func (p *scannerMetrics) report() madmin.ScannerMetrics {
	var m madmin.ScannerMetrics
	cycle := p.getCycle()
	if cycle != nil {
		m.CurrentCycle = cycle.current
		m.CyclesCompletedAt = cycle.cycleCompleted
		m.CurrentStarted = cycle.started

        }
    }

    @Nested
    @DisplayName("Edge Case Tests")
    class EdgeCaseTest {

        @Test
        @DisplayName("Should handle repeated method calls consistently")
        void shouldHandleRepeatedMethodCallsConsistently() {
            SmbSession mockSession = mock(SmbSession.class);
            Configuration mockConfig = mock(Configuration.class);

```

### Code Quality Commands

```bash
# Format code (Eclipse formatter)
mvn formatter:format

# Check/apply license headers
mvn license:check
mvn license:format

# Generate test coverage report
mvn jacoco:prepare-agent test jacoco:report

# Generate API documentation
mvn javadoc:javadoc
```

### Testing

The project uses JUnit 4 with embedded OpenSearch for integration testing:

    /**
     * Determine optimal polling interval based on directory activity and failure count
     *
     * Current strategy is based on failure count. In the future, this could be enhanced to consider:
     * - Recent event frequency (successful notifications)
     * - Time since last successful notification
     * - Events per unit time for more adaptive behavior
     *
     * @param handle notification handle