*/
    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;

		}
		m.Aggregated.Mem.Info = madmin.GetMemInfo(GlobalContext, byHostName)
	}
	if types.Contains(madmin.MetricsCPU) {
		m.Aggregated.CPU = &madmin.CPUMetrics{
			CollectedAt: UTCNow(),
		}
		cm, err := c.Times(false)
		if err != nil {
			m.Errors = append(m.Errors, fmt.Sprintf("%s: %v (cpuTimes)", byHostName, err.Error()))
		} else {
			// not collecting per-cpu stats, so there will be only one element
			if len(cm) == 1 {

        logger.info("[END] statsResponseFormatTest");
    }

    @Test
    void multipleStatsCallsTest() {
        logger.info("[BEGIN] multipleStatsCallsTest");

        // Call stats endpoint multiple times to ensure consistency
        final Map<String, Object> searchBody = new HashMap<>();

        String response1 = checkGetMethod(searchBody, "").asString();

   * operation in order to trigger shutdown, consider instead registering a listener and
   * implementing {@code stopping}. Note, however, that {@code stopping} does not run at exactly the
   * same times as {@code triggerShutdown}.
   */
  protected void triggerShutdown() {}

  /**
   * Returns the {@link Executor} that will be used to run this service. Subclasses may override

        // splitIntoBuckets() method expects us to split large element into N elements,
        // but we want to have a single bucket with N batches.
        // As a workaround, we repeat the bucket N times, and deduplicate the result at the end
        val resultIncludingDuplicates =
            splitIntoBuckets(
                LinkedList(subProjectTestClassTimes),
                SubprojectTestClassTime::totalTime,

      } finally {
        currentThread.setName(originalName);
      }
    }
  }

  public void fetch(HttpUrl url) throws IOException {
    // Skip hosts that we've visited many times.
    AtomicInteger hostnameCount = new AtomicInteger();
    AtomicInteger previous = hostnames.putIfAbsent(url.host(), hostnameCount);
    if (previous != null) hostnameCount = previous;

        boolean abort = true;

        DataStoreCrawlingException exception = new DataStoreCrawlingException(url, message, cause, abort);

        // Call aborted() multiple times
        assertTrue(exception.aborted());
        assertTrue(exception.aborted());
        assertTrue(exception.aborted());
    }

    @Test
    public void test_getUrl_multipleCallsReturnSameValue() {

        @Test
        @DisplayName("Should handle multiple operations correctly")
        void testMultipleOperations() throws NdrException {
            // Given: NdrShort that will be used multiple times
            NdrShort ndrShort = new NdrShort(50);
            NdrBuffer buffer1 = mock(NdrBuffer.class);
            NdrBuffer buffer2 = mock(NdrBuffer.class);
            when(buffer2.dec_ndr_short()).thenReturn(75);

   * features to support (from the enclosing {@link AbstractIteratorTester} instance). Instead of
   * throwing exceptions like {@link NoSuchElementException} at the appropriate times, it throws
   * {@link PermittedMetaException} instances, which wrap a set of all exceptions that the iterator
   * could throw during the invocation of that method. This is necessary because, e.g., a call to

   * 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.
   *