// 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());

 * you would expect.
 *
 * <p>If required to do a weighted average between an infinity and a finite value, or between an
 * infinite value and itself, the infinite value is returned. If required to do a weighted average
 * between {@link Double#NEGATIVE_INFINITY NEGATIVE_INFINITY} and {@link Double#POSITIVE_INFINITY

 * [okhttp-stats](https://github.com/flipkart-incubator/okhttp-stats): Get stats like average network speed.
 * [okhttp-system-keystore](https://github.com/charleskorn/okhttp-system-keystore): Use trusted certificates from the operating system keystore (Keychain on macOS, Certificate Store on Windows).

        suggestHelper.suggester().createNextIndex();

        logger.info("Storing all bad words.");
        suggestHelper.storeAllBadWords(true);

        logger.info("Storing all elevate words.");
        suggestHelper.storeAllElevateWords(true);

        final AtomicInteger exitCode = new AtomicInteger(0);

        if (ComponentUtil.getFessConfig().isSuggestDocuments()) {

labels.stopwordsFile=File stopwords
labels.stemmerOverrideFile=File override stemmer
labels.mappingFile=File di mappatura
labels.protwordsFile=File protwords
labels.kuromojiFile=File kuromoji
labels.elevateWordFile=File parole elevate
labels.badWordFile=File parole proibite
labels.urlExpr=Condizione
labels.boostExpr=Espressione di boost
labels.confirmPassword=Conferma
labels.crawler=Crawler
labels.crudMode=Modalità

  // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
  // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
  final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed

  /** Constructs a graph with the properties specified in {@code builder}. */

      assertEquivalent(stats.mean(), stream(array).average().getAsDouble());
      assertEquivalent(stats.sum(), stream(array).sum());
      assertEquivalent(stats.max(), stream(array).max().getAsDouble());
      assertEquivalent(stats.min(), stream(array).min().getAsDouble());
      // static method on Stats vs on instance method on DoubleStream
      assertEquivalent(Stats.meanOf(array), stream(array).average().getAsDouble());

                } catch (InterruptedException e) {}
                return "slow";
            });

            // Check metrics
            assertTrue(cbWithMetrics.getAverageResponseTime() > 0, "Average response time should be tracked");
            assertTrue(cbWithMetrics.getMinResponseTime() > 0, "Min response time should be tracked");

            // This could happen if the last chunk is smaller
            byte[] buffer = createValidCopyChunkResponse(10, // 10 chunks
                    65536, // Last chunk size (not average)
                    589824 // Total less than 10 * 65536
            );

            int bytesDecoded = response.decode(buffer, 0, buffer.length);

            assertEquals(12, bytesDecoded);

   */
  @SuppressWarnings("GoodTime") // should return a java.time.Duration
  public long totalLoadTime() {
    return totalLoadTime;
  }

  /**
   * Returns the average time spent loading new values. This is defined as {@code totalLoadTime /
   * (loadSuccessCount + loadExceptionCount)}.
   *
   * <p><b>Note:</b> the values of the metrics are undefined in case of overflow (though it is