import org.codelibs.fess.util.ComponentUtil;
import org.opensearch.action.bulk.BulkRequestBuilder;
import org.opensearch.action.bulk.BulkResponse;

/**
 * A timer target that periodically flushes buffered log notification events
 * to an OpenSearch index for downstream processing.
 */
public class LogNotificationTarget implements TimeoutTarget {

    /**
     * Default constructor.
     */

        <include>mvnenc</include>
        <include>mvnsh</include>
        <include>mvnup</include>
        <include>mvnDebug</include>
        <include>mvnencDebug</include>
        <!-- This is so that CI systems can periodically run the profiler -->
        <include>mvnyjp</include>
      </includes>
      <lineEnding>unix</lineEnding>
      <fileMode>0755</fileMode>
    </fileSet>
    <fileSet>

import org.opensearch.action.admin.cluster.node.stats.NodeStats;
import org.opensearch.action.admin.cluster.node.stats.NodesStatsResponse;
import org.opensearch.monitor.os.OsStats;

/**
 * Timeout target that periodically monitors search engine CPU usage.
 */
public class LoadControlMonitorTarget implements TimeoutTarget {

    private static final Logger logger = LogManager.getLogger(LoadControlMonitorTarget.class);

                    for (int i = 0; i < eventsPerThread; i++) {
                        helper.offer(new LogNotificationEvent(i, "ERROR", "org.test", "t" + threadId + "-" + i, null));
                        // Periodically drain
                        if (i % 50 == 49) {
                            List<LogNotificationEvent> drained = helper.drainAll();
                            totalDrained.addAndGet(drained.size());

     */
    protected Map<String, DataStore> dataStoreMap = new LinkedHashMap<>();

    /**
     * Cached array of available data store names discovered from plugin JAR files.
     * This cache is refreshed periodically based on the lastLoadedTime.
     */
    protected volatile String[] dataStoreNames = StringUtil.EMPTY_STRINGS;

    /**
     * Timestamp of the last time data store names were loaded from plugin files.

      int steps,
      Iterable<E> elementsToInsertIterable,
      Iterable<? extends IteratorFeature> features,
      Iterable<E> expectedElements,
      KnownOrder knownOrder,
      int startIndex) {
    // periodically we should manually try (steps * 3 / 2) here; all tests but
    // one should still pass (testVerifyGetsCalled()).
    stimuli = (Stimulus<E, ? super I>[]) new Stimulus<?, ?>[steps];

      int steps,
      Iterable<E> elementsToInsertIterable,
      Iterable<? extends IteratorFeature> features,
      Iterable<E> expectedElements,
      KnownOrder knownOrder,
      int startIndex) {
    // periodically we should manually try (steps * 3 / 2) here; all tests but
    // one should still pass (testVerifyGetsCalled()).
    stimuli = (Stimulus<E, ? super I>[]) new Stimulus<?, ?>[steps];

disable consideration of cgroup limits. This setting only affects Linux.

Go 1.25 added a new `updatemaxprocs` setting that controls whether the Go
runtime will periodically update GOMAXPROCS for new CPU affinity or cgroup
limits. The default value `updatemaxprocs=1` will enable periodic updates.
`updatemaxprocs=0` will disable periodic updates.

  /*
   * Now we have monster tests that create hundreds of Orderings using different
   * combinations of methods, then checks compare(), binarySearch() and so
   * forth on each one.
   */

  // should periodically try increasing this, but it makes the test run long
  private static final int RECURSE_DEPTH = 2;

  public void testCombinationsExhaustively_startingFromNatural() {

  /*
   * Now we have monster tests that create hundreds of Orderings using different
   * combinations of methods, then checks compare(), binarySearch() and so
   * forth on each one.
   */

  // should periodically try increasing this, but it makes the test run long
  private static final int RECURSE_DEPTH = 2;

  public void testCombinationsExhaustively_startingFromNatural() {