BloomFilterStrategies.MURMUR128_MITZ_32);

    // Insert "numInsertions" even numbers into the BF.
    for (int i = 0; i < numInsertions * 2; i += 2) {
      bf.put(Integer.toString(i));
    }
    assertApproximateElementCountGuess(bf, numInsertions);

    // Assert that the BF "might" have all of the even numbers.
    for (int i = 0; i < numInsertions * 2; i += 2) {

            BloomFilterStrategies.MURMUR128_MITZ_32);

    // Insert "numInsertions" even numbers into the BF.
    for (int i = 0; i < numInsertions * 2; i += 2) {
      bf.put(Integer.toString(i));
    }
    assertApproximateElementCountGuess(bf, numInsertions);

    // Assert that the BF "might" have all of the even numbers.
    for (int i = 0; i < numInsertions * 2; i += 2) {

	ItemsHealed uint64
	ItemsFailed uint64

	BytesDone   uint64
	BytesFailed uint64

	// Last object scanned.
	Bucket string `json:"-"`
	Object string `json:"-"`

	// Numbers when current bucket started healing,
	// for resuming with correct numbers.
	ResumeItemsHealed  uint64 `json:"-"`
	ResumeItemsFailed  uint64 `json:"-"`
	ResumeItemsSkipped uint64 `json:"-"`
	ResumeBytesDone    uint64 `json:"-"`

    BigInteger result = randomPositiveBigInteger(numBits);
    return RANDOM_SOURCE.nextBoolean() ? result : result.negate();
  }

  /**
   * Chooses a number in (-2^numBits, 2^numBits) at random, with density concentrated in numbers of
   * lower magnitude.
   */
  static BigInteger randomBigInteger(int numBits) {
    while (true) {
      if (RANDOM_SOURCE.nextBoolean()) {

import org.junit.jupiter.api.Test;

/**
 * Tests for SpnegoConstants interface.
 * Verifies constant values, modifiers, types, and structural properties.
 */
class SpnegoConstantsTest {

    // Simple OID format: numbers separated by dots (at least one dot)
    private static final Pattern OID_PATTERN = Pattern.compile("\\d+(?:\\.\\d+)+");

    @Test
    @DisplayName("Constant values match expected OIDs")
    void constantValues() {

        private final List<E> parent;

        /** The total number of pages available. */
        protected int allPageCount;

        /** The total number of records across all pages. */
        protected int allRecordCount;

        /** The number of records per page. */
        protected int pageSize;

        /** The current page number (1-based). */
        protected int currentPageNumber;

        return "REG-" + System.currentTimeMillis() + "-" + Integer.toHexString(System.identityHashCode(this));
    }

    /**
     * Gets the next sequence number for this registration.
     *
     * @return the next sequence number
     */
    public long getNextSequenceNumber() {
        return sequenceNumber.incrementAndGet();
    }

    /**

    }

    @ParameterizedTest
    @CsvSource({ "0, 0", // all zeros
            "-1, 2147483647", // negative fid, max positive security
            "12345, 999" // arbitrary numbers
    })
    void toString_includesCorrectHexValues(int fid, int securityInformation) {
        NtTransQuerySecurityDesc cmd = new NtTransQuerySecurityDesc(fid, securityInformation);
        String result = cmd.toString();

    BigInteger result = randomPositiveBigInteger(numBits);
    return RANDOM_SOURCE.nextBoolean() ? result : result.negate();
  }

  /**
   * Chooses a number in (-2^numBits, 2^numBits) at random, with density concentrated in numbers of
   * lower magnitude.
   */
  static BigInteger randomBigInteger(int numBits) {
    while (true) {
      if (RANDOM_SOURCE.nextBoolean()) {

func Test_localLocker_expireOldLocksExpire(t *testing.T) {
	rng := rand.New(rand.NewSource(0))
	quorum := 0
	// Numbers of unique locks
	for _, locks := range []int{100, 1000, 1e6} {
		if testing.Short() && locks > 100 {
			continue
		}
		t.Run(fmt.Sprintf("%d-locks", locks), func(t *testing.T) {
			// Number of readers per lock...
			for _, readers := range []int{1, 10, 100} {
				if locks > 1000 && readers > 1 {