*/
    protected int queueShards = Runtime.getRuntime().availableProcessors() * 2;

    /**
     * Number of shards for the data index.
     */
    protected int dataShards = Runtime.getRuntime().availableProcessors() * 2;

    /**
     * Number of shards for the filter index.
     */
    protected int filterShards = Runtime.getRuntime().availableProcessors() * 2;

    /**
     * Number of replicas for the queue index.

  javaLauncher.set(javaToolchains.launcherFor {
    languageVersion.set(JavaLanguageVersion.of(testJavaVersion))
  })

  maxParallelForks = Runtime.getRuntime().availableProcessors() * 2
  testLogging {
    exceptionFormat = TestExceptionFormat.FULL
  }

  systemProperty("okhttp.platform", platform)
  systemProperty("junit.jupiter.extensions.autodetection.enabled", "true")
}

                });

                _defaultParallel = Integer.parseInt(stdout.toString().trim());
            }

            _defaultParallel = Runtime.getRuntime().availableProcessors() / 2;
        }

        return _defaultParallel;
    }

    private static boolean isMac(ProviderFactory providers) {

    protected SuggestAnalyzer analyzer;
    /** The thread pool. */
    protected ExecutorService threadPool;

    /** The thread pool size. */
    protected int threadPoolSize = Runtime.getRuntime().availableProcessors();

    /**
     * Sets the suggest settings.
     * @param settings The suggest settings.
     * @return This builder instance.
     */
    public SuggesterBuilder settings(final SuggestSettings settings) {

     */
    public synchronized int getTimeoutTaskCount() {
        return timeoutTaskList.size();
    }

    @Override
    public void run() {
        int nThreads = Runtime.getRuntime().availableProcessors() / 2;
        final String value = System.getProperty("corelib.timeout_task.num_of_threads");
        if (StringUtil.isNotBlank(value)) {
            try {
                nThreads = Integer.parseInt(value);

                });

                _defaultParallel = Integer.parseInt(stdout.toString().trim());
            }

            _defaultParallel = Runtime.getRuntime().availableProcessors() / 2;
        }

        return _defaultParallel;
    }


    public static String getResourceContents(String resourcePath) {
        try (

  /** Generator of new random hash codes */
  static final Random rng = new Random();

  /** Number of CPUS, to place bound on table size */
  static final int NCPU = Runtime.getRuntime().availableProcessors();

  /** Table of cells. When non-null, size is a power of 2. */
  transient volatile Cell @Nullable [] cells;

  /**

 * and memory footprint. For example, if a set of tasks are CPU-bound, one could easily create a
 * very compact {@code Striped<Lock>} of {@code availableProcessors() * 4} stripes, instead of
 * possibly thousands of locks which could be created in a {@code Map<K, Lock>} structure.
 *
 * @author Dimitris Andreou
 * @since 13.0
 */
@J2ktIncompatible
@GwtIncompatible

                int numThreads = ComponentUtil.getFessConfig().getRankFusionThreadsAsInteger();
                if (numThreads <= 0) {
                    numThreads = Runtime.getRuntime().availableProcessors() * 3 / 2 + 1;
                }
                if (logger.isDebugEnabled()) {
                    logger.debug("Initializing executor service with {} threads", numThreads);
                }

                            + "'. Value must be positive.");
                }

                int procs = Runtime.getRuntime().availableProcessors();
                int threads = (int) (coreMultiplier * procs);
                return threads == 0 ? 1 : threads;
            } else {
                int threads = Integer.parseInt(threadConfiguration);