- `crawler/mimetype.xml`, `crawler/encoding.xml`, `crawler/robotstxt.xml`, `crawler/sitemaps.xml`
- `crawler/filter.xml`, `crawler/interval.xml`, `crawler/contentlength.xml`, `crawler/urlconverter.xml`, `crawler/container.xml`, `crawler/log.xml`

### Exception Hierarchy

    fun resetForTests(platform: Platform = findPlatform()) {
      this.platform = platform
      PublicSuffixDatabase.resetForTests()
    }

    fun alpnProtocolNames(protocols: List<Protocol>) = protocols.filter { it != Protocol.HTTP_1_0 }.map { it.toString() }

    val isAndroid: Boolean
      get() = PlatformRegistry.isAndroid

    /** Attempt to match the host runtime to a capable Platform implementation. */

    /**
     * Creates a new web socket and immediately returns it. Creating a web socket initiates an
     * asynchronous process to connect the socket. Once that succeeds or fails, `listener` will be
     * notified. The caller must either close or cancel the returned web socket when it is no longer
     * in use.
     */
    fun newWebSocket(
      request: Request,
      listener: WebSocketListener,
    ): WebSocket
  }

abstract class AbstractStreamingHasher extends AbstractHasher {
  /** Buffer via which we pass data to the hash algorithm (the implementor) */
  private final ByteBuffer buffer;

  /** Number of bytes to be filled before process() invocation(s). */
  private final int bufferSize;

  /** Number of bytes processed per process() invocation. */
  private final int chunkSize;

  /**

    }

    throw new IllegalArgumentException(
        Platform.format("key %s not found in entries %s", newEntry.getKey(), expected));
  }

  /**
   * Wrapper for {@link Map#get(Object)} that forces the caller to pass in a key of the same type as
   * the map. Besides being slightly shorter than code that uses {@link #getMap()}, it also ensures
   * that callers don't pass an {@link Entry} by mistake.
   */

	accessKeys, err := globalIAMSys.ListAllAccessKeys(ctx)
	if err != nil {
		writeErrorResponseJSON(ctx, w, toAdminAPIErr(ctx, err), r.URL)
		return
	}

	for _, accessKey := range accessKeys {
		// Filter out any disqualifying access keys
		_, ok := accessKey.Claims[subClaim]
		if !ok {
			continue // OpenID access keys must have a sub claim
		}

import org.codelibs.fess.opensearch.config.cbean.cq.CrawlingInfoCQ;
import org.codelibs.fess.opensearch.config.cbean.cq.bs.BsCrawlingInfoCQ;
import org.opensearch.search.aggregations.bucket.filter.FilterAggregationBuilder;
import org.opensearch.search.aggregations.bucket.global.GlobalAggregationBuilder;
import org.opensearch.search.aggregations.bucket.histogram.HistogramAggregationBuilder;

  static PairedStats createPairedStatsOf(List<Double> xValues, List<Double> yValues) {
    return createFilledPairedStatsAccumulator(xValues, yValues).snapshot();
  }

  /**
   * Creates a {@link PairedStatsAccumulator} filled with the given lists of {@code x} and {@code y}
   * values, which must be of the same size.
   */
  static PairedStatsAccumulator createFilledPairedStatsAccumulator(
      List<Double> xValues, List<Double> yValues) {

        /** The handle to the domain */
        public rpc.policy_handle domain_handle;
        /** The enumeration context handle */
        public int resume_handle;
        /** Account control flags filter */
        public int acct_flags;
        /** The returned array of SAM entries */
        public SamrSamArray sam;
        /** The number of entries returned */
        public int num_entries;

        /**

        /** The handle to the domain */
        public rpc.policy_handle domain_handle;
        /** The enumeration context handle */
        public int resume_handle;
        /** Account control flags filter */
        public int acct_flags;
        /** The returned array of SAM entries */
        public SamrSamArray sam;
        /** The number of entries returned */
        public int num_entries;

        /**