assertEquals(1.0, stats.successRate);
    }

    @Test
    @DisplayName("Test circuit opens after failure threshold")
    void testCircuitOpensAfterThreshold() {
        // Fail 3 times to open the circuit
        for (int i = 0; i < 3; i++) {
            try {
                circuitBreaker.call(() -> {
                    throw new RuntimeException("Test failure");
                });

   * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a
   * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
   * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)].
   */
  public void testTimeToWarmUpIsHonouredEvenWithWeights() {
    Random random = new Random();
    int warmupPermits = 10;

   * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a
   * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling
   * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)].
   */
  public void testTimeToWarmUpIsHonouredEvenWithWeights() {
    Random random = new Random();
    int warmupPermits = 10;

   * scheduled. If the task is already in the queue, the earliest execution time is used.
   *
   * The target execution time is implemented on a best-effort basis. If another task in this queue
   * is running when that time is reached, that task is allowed to complete before this task is
   * started. Similarly the task will be delayed if the host lacks compute resources.
   *

    val elapsedUntilPong3 = System.nanoTime() - startNanos
    assertThat(TimeUnit.NANOSECONDS.toMillis(elapsedUntilPong3).toDouble())
      .isCloseTo(1500.0, 250.0)

    // The client pinged the server 3 times, and it has ponged back 3 times.
    assertThat(webSocket.sentPingCount()).isEqualTo(3)
    assertThat(server.receivedPingCount()).isEqualTo(3)
    assertThat(webSocket.receivedPongCount()).isEqualTo(3)

     */
    protected ThreadLocal<String[]> sitemapsLocal = new ThreadLocal<>();

    /** The number of threads used by the crawler */
    protected int numOfThread = 10;

    /** The maximum number of times to check for active threads. */
    protected int maxThreadCheckCount = 20;

    /** The maximum depth for crawling. A value of -1 indicates no depth check. */
    protected int maxDepth = -1;

        CountDownLatch endLatch = new CountDownLatch(threadCount);
        AtomicInteger releaseCount = new AtomicInteger(0);
        AtomicInteger acquireCount = new AtomicInteger(0);

        // Acquire session multiple times
        for (int i = 0; i < threadCount - 1; i++) {
            session.acquire();
        }

        // When - Multiple threads try to release/acquire concurrently
        for (int t = 0; t < threadCount; t++) {

        UnsignedLong bUnsigned = UnsignedLong.fromLongBits(b);
        long expected =
            aUnsigned.bigIntegerValue().multiply(bUnsigned.bigIntegerValue()).longValue();
        UnsignedLong unsignedMul = aUnsigned.times(bUnsigned);
        assertThat(unsignedMul.longValue()).isEqualTo(expected);
      }
    }
  }

  public void testDividedBy() {
    for (long a : TEST_LONGS) {
      for (long b : TEST_LONGS) {

            assertEquals(currentTime, lastModified, "Should return correct last modified time");
            assertEquals(currentTime - 1000, lastAccess, "Should return correct last access time");
            assertEquals(currentTime - 2000, createTime, "Should return correct create time");
            assertTrue(createTime <= lastAccess, "Create time should be before or equal to last access");

import java.util.concurrent.atomic.AtomicInteger;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;

/**
 * Tests relating to cache expiration: make sure entries expire at the right times, make sure
 * expired entries don't show up, etc.
 *
 * @author mike nonemacher
 */
@SuppressWarnings("deprecation") // tests of deprecated method
@NullUnmarked
public class CacheExpirationTest extends TestCase {