import org.codelibs.core.lang.StringUtil;
import org.codelibs.fess.dict.DictionaryItem;

/**
 * Represents a single character mapping rule that defines how input characters are mapped to output characters
 * for text analysis and search processing. This class is used in character mapping dictionaries to transform
 * text during indexing and search operations.
 *

    @Min(0)
    @Max(100)
    @ValidateTypeFailure
    public Integer crawlingThreadCount;

    /**
     * Enable or disable search query logging.
     * When enabled, user search queries are logged for analysis.
     */
    @Size(max = 10)
    public String searchLog;

    /**
     * Enable or disable user information tracking.
     * When enabled, user information is stored and tracked.
     */
    @Size(max = 10)

            ComponentUtil.getCrawlerStatsHelper().record(urlQueue, StatsAction.ACCESS_EXCEPTION);
        }
    }

    /**
     * Stores a failure URL with error information for later analysis.
     *
     * @param crawlerContext the crawler context
     * @param urlQueue the URL queue containing the failed URL
     * @param errorName the name/type of the error

 * This class provides functionality to load, parse, and manage character mapping
 * rules that define how input characters should be transformed to output characters
 * during text analysis and search processing.
 *
 * Character mapping files contain mapping rules in the format:
 * input1,input2,... => output
 */
public class CharMappingFile extends DictionaryFile<CharMappingItem> {

      "refresh_interval": "1s",
      "number_of_shards": "${fess.index.number_of_shards}",
      "number_of_replicas": 0,
      "auto_expand_replicas": "${fess.index.auto_expand_replicas}"
    },
    "analysis": {
      "char_filter": {
        "mapping_fa_filter": {
          "type": "mapping",
          "mappings_path": "${fess.dictionary.path}fa/mapping.txt"
        },
        "mapping_ja_filter": {

import java.util.List;
import org.jspecify.annotations.Nullable;

/**
 * An immutable well-formed internet domain name, such as {@code com} or {@code foo.co.uk}. Only
 * syntactic analysis is performed; no DNS lookups or other network interactions take place. Thus
 * there is no guarantee that the domain actually exists on the internet.
 *

{
  "index": {
    "refresh_interval": "1s",
    "number_of_shards": 1,
    "number_of_replicas": 0,
    "auto_expand_replicas": "0-1"
  },
  "analysis" : {
    "tokenizer" : {
      "fess_japanese_normal" : {
        "type" : "kuromoji_tokenizer",
        "mode" : "normal",
        "discard_punctuation" : "false"
      },
      "fess_korean_normal": {
        "type": "nori_tokenizer",
        "decompound_mode": "mixed",

     * operations take expected O(1) time but with high probability take O(log n) for at least some
     * element. (https://en.wikipedia.org/wiki/Linear_probing#Analysis)
     *
     * <p>This method may return {@code true} even on truly random input, but {@code
     * ImmutableSetTest} tests that the probability of that is low.
     */

{
  "index": {
    "refresh_interval": "1s",
    "number_of_shards": 1,
    "number_of_replicas": 0,
    "auto_expand_replicas": "0-1"
  },
  "analysis" : {
    "tokenizer" : {
      "fess_japanese_normal" : {
        "type" : "kuromoji_tokenizer",
        "mode" : "normal",
        "discard_punctuation" : "false"
      },
      "fess_korean_normal": {
        "type": "seunjeon_tokenizer",
        "index_eojeol": false,

{
  "index": {
    "refresh_interval": "1s",
    "number_of_shards": 1,
    "number_of_replicas": 0,
    "auto_expand_replicas": "0-1"
  },
  "analysis" : {
    "tokenizer" : {
      "fess_japanese_normal" : {
        "type" : "fess_japanese_tokenizer",
        "mode" : "normal",
        "discard_punctuation" : "false"
      },
      "fess_korean_normal": {
        "type": "fess_korean_tokenizer",
        "decompound_mode": "mixed",