private static final BigInteger[] nonzero2 = new BigInteger[ARRAY_SIZE];
  private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE];

  @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"})
  RoundingMode mode;

  @BeforeExperiment
  void setUp() {
    for (int i = 0; i < ARRAY_SIZE; i++) {
      positive[i] = randomPositiveBigInteger(1024);
      nonzero1[i] = randomNonZeroBigInteger(1024);

 */
@NullUnmarked
public class IntMathRoundingBenchmark {
  private static final int[] positive = new int[ARRAY_SIZE];
  private static final int[] nonzero = new int[ARRAY_SIZE];
  private static final int[] ints = new int[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {
    for (int i = 0; i < ARRAY_SIZE; i++) {
      positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue();

  /**
   * @param c the number of compression rounds (must be positive)
   * @param d the number of finalization rounds (must be positive)
   * @param k0 the first half of the key
   * @param k1 the second half of the key
   */
  SipHashFunction(int c, int d, long k0, long k1) {
    checkArgument(
        c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
    checkArgument(

  RoundingMode mode;

  private static final long[] positive = new long[ARRAY_SIZE];
  private static final long[] nonzero = new long[ARRAY_SIZE];
  private static final long[] longs = new long[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {
    for (int i = 0; i < ARRAY_SIZE; i++) {
      positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();

        verifyNoMoreInteractions(smbFile);
    }

    @Test
    @DisplayName("accept: length-based filter evaluates negative/zero/positive sizes")
    void accept_lengthBasedFilter_handlesNumericEdges() throws Exception {
        // Arrange: filter that accepts only strictly positive length
        SmbFileFilter filter = f -> f.length() > 0;

        // negative size -> reject
        when(smbFile.length()).thenReturn(-1L);

  /**
   * @param c the number of compression rounds (must be positive)
   * @param d the number of finalization rounds (must be positive)
   * @param k0 the first half of the key
   * @param k1 the second half of the key
   */
  SipHashFunction(int c, int d, long k0, long k1) {
    checkArgument(
        c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
    checkArgument(

    }

    @Test
    void constructor_shouldInitializeValueCorrectly() {
        // Test case 1: Positive value
        int positiveValue = 12345;
        NdrLong ndrLongPositive = new NdrLong(positiveValue);
        assertEquals(positiveValue, ndrLongPositive.value, "Constructor should correctly initialize with a positive value.");

        // Test case 2: Negative value
        int negativeValue = -54321;

        assertEquals(AvPair.MsvAvTimestamp, avTimestamp.getType());
        assertEquals(timestamp, avTimestamp.getTimestamp()); // Verify encoding and decoding
    }

    /**
     * Test getTimestamp method with a positive timestamp.
     */
    @Test
    public void testGetTimestampPositive() {
        long expectedTimestamp = 123456789012345L;
        byte[] rawBytes = new byte[8];

            auth1.equals(auth2);
        }
    }

    /**
     * Test that password comparison is constant-time by comparing execution times
     * for passwords that differ at different positions.
     */
    @Test
    public void testConstantTimePasswordComparison() throws Exception {
        char[] basePassword = "supersecretpassword123456789".toCharArray();

)

var (
	errLifecycleInvalidDate         = Errorf("Date must be provided in ISO 8601 format")
	errLifecycleInvalidDays         = Errorf("Days must be positive integer when used with Expiration")
	errLifecycleInvalidExpiration   = Errorf("Exactly one of Days (positive integer) or Date (positive ISO 8601 format) should be present inside Expiration.")