*/
    protected IntervalController intervalController;

    /**
     * Set of robots.txt URLs that have been processed.
     */
    protected Set<String> robotsTxtUrlSet = new LruHashSet<>(10000);

    /**
     * Thread-local storage for sitemaps.
     */
    protected ThreadLocal<String[]> sitemapsLocal = new ThreadLocal<>();

    /** The number of threads used by the crawler */

 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class ComparatorDelegationOverheadBenchmark {
  private final Integer[][] inputArrays = new Integer[0x100][];

  @Param({"10000"})
  int n;

  @BeforeExperiment
  void setUp() throws Exception {
    Random rng = new Random();
    for (int i = 0; i < 0x100; i++) {
      Integer[] array = new Integer[n];
      for (int j = 0; j < n; j++) {

        long endTime = System.currentTimeMillis();
        long duration = endTime - startTime;

        // Then - should complete quickly (this is more of a performance indicator)
        assertTrue(duration < 1000, "Creating and using 10000 EmptyIterators should be fast (took " + duration + "ms)");
    }

    @Test
    @DisplayName("EmptyIterator should work correctly in nested iteration")
    void testNestedIteration() {

        // Verify O(1) performance - should be reasonably fast (allowing for JVM overhead)
        assertTrue(avgAllocTimeNs < 10000, "Average allocation should be under 10000ns (O(1) performance)");
        assertTrue(avgReleaseTimeNs < 10000, "Average release should be under 10000ns (O(1) performance)");
        assertEquals(threadCount * operationsPerThread, allocations.get());

        StringBuilder longName = new StringBuilder();
        for (int i = 0; i < 10000; i++) {
            longName.append("verylongname");
        }
        String longNameStr = longName.toString();

        testTransformer.setName(longNameStr);
        assertEquals(longNameStr, testTransformer.getName());
        assertEquals(120000, testTransformer.getName().length());
    }

    /**

        @Test
        @DisplayName("Should handle very long messages")
        void testVeryLongMessage() {
            StringBuilder longMessage = new StringBuilder();
            for (int i = 0; i < 10000; i++) {
                longMessage.append("x");
            }
            String message = longMessage.toString();

            TransportException exception = new TransportException(message);

    Cache<Integer, Integer> cache =
        CacheBuilder.newBuilder().expireAfterWrite(20000, MILLISECONDS).ticker(fakeTicker).build();

    cache.put(654, 2675);
    fakeTicker.advance(10000, MILLISECONDS);
    cache.put(2456, 56);
    cache.put(2, 15);

    fakeTicker.advance(10001, MILLISECONDS);

    assertTrue(cache.asMap().containsValue(15));
    assertTrue(cache.asMap().containsValue(56));

        IntervalControlHelper helper = new IntervalControlHelper();
        helper.addIntervalRule("10:00", "18:00", "1,2,3,4,5", 1000);

        assertEquals(1, helper.ruleList.size());
        IntervalRule rule = helper.ruleList.get(0);
        assertEquals(1000, rule.getDelay());
    }

    public void test_addIntervalRule_emptyDays() {
        IntervalControlHelper helper = new IntervalControlHelper();

 */
class TaskRunner(
  val backend: Backend,
  internal val logger: Logger = TaskRunner.logger,
) : Lockable {
  private var nextQueueName = 10000
  private var coordinatorWaiting = false
  private var coordinatorWakeUpAt = 0L

  /**
   * When we need a new thread to run tasks, we call [Backend.execute]. A few microseconds later we

import org.jspecify.annotations.NullUnmarked;

/** Test Java8 map.compute in concurrent cache context. */
@NullUnmarked
public class LocalCacheMapComputeTest extends TestCase {
  final int count = 10000;
  final String delimiter = "-";
  final String key = "key";
  Cache<String, String> cache;

  // helper
  private static void doParallelCacheOp(int count, IntConsumer consumer) {