logger.debug("Initializing {}", this.getClass().getSimpleName());
        }
        load();
    }

    /**
     * Returns a list of available KeyMatch instances.
     *
     * @return A list of KeyMatch instances.
     */
    public List<KeyMatch> getAvailableKeyMatchList() {
        return ComponentUtil.getComponent(KeyMatchBhv.class).selectList(cb -> {
            cb.query().matchAll();

import org.w3c.dom.Document;
import org.w3c.dom.NamedNodeMap;
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;

/**
 * Factory class responsible for managing and providing access to data store instances.
 * This factory maintains a registry of data store implementations and provides methods
 * to register, retrieve, and discover available data stores.
 *

 * This class provides functionality to retrieve, store, and manage various
 * dictionary files such as synonyms, kuromoji, protwords, and stopwords.
 * It coordinates with DictionaryCreator instances to handle different
 * dictionary types and manages file synchronization through ConfigSync.
 *
 */
public class DictionaryManager {
    private static final Logger logger = LogManager.getLogger(DictionaryManager.class);

    protected static final String KRYO = "kryo";

    /** ThreadLocal container for Kryo instances to ensure thread safety. */
    protected final ThreadLocal<Kryo> kryoThreadLocal;

    /**
     * Constructs a new DataSerializer.
     * <p>
     * Initializes the ThreadLocal Kryo instances with appropriate configuration.
     * The Kryo instances are configured to not require class registration for

   * TODO(kevinb): evaluate the trade-offs of going bimorphic to save these two fields from most
   * instances. Note that the instances that would get smaller are the right set to care about
   * optimizing, because the rest have the option of calling `trimmed`.
   */

  private final transient int start; // it happens that we only serialize instances where this is 0
  private final int end; // exclusive

  private ImmutableIntArray(int[] array) {

   * TODO(kevinb): evaluate the trade-offs of going bimorphic to save these two fields from most
   * instances. Note that the instances that would get smaller are the right set to care about
   * optimizing, because the rest have the option of calling `trimmed`.
   */

  private final transient int start; // it happens that we only serialize instances where this is 0
  private final int end; // exclusive

  }

  private static void assertFreshInstance(Class<?> type, int instances) {
    assertFreshInstance(TypeToken.of(type), instances);
  }

  private static void assertFreshInstance(TypeToken<?> type, int instances) {
    FreshValueGenerator generator = new FreshValueGenerator();
    EqualsTester tester = new EqualsTester();
    for (int i = 0; i < instances; i++) {
      tester.addEqualityGroup(generator.generateFresh(type));

    protected String targetNodePath = "//HTML/BODY | //@alt | //@title";

    /** Cache for XPathAPI instances to improve performance. */
    protected LoadingCache<String, XPathAPI> xpathAPICache;

    /** Cache duration in minutes for XPathAPI instances. */
    protected long cacheDuration = 10; // min

    /**
     * Creates a new HtmlXpathExtractor instance.
     */

import org.codelibs.fess.dict.DictionaryItem;

import jakarta.annotation.PostConstruct;

/**
 * A dictionary creator for synonym files.
 * This class is responsible for creating {@link SynonymFile} instances
 * from files that match the pattern "synonym.*\\.txt".
 */
public class SynonymCreator extends DictionaryCreator {
    private static final Logger logger = LogManager.getLogger(SynonymCreator.class);

    /**

/**
 * A {@code Multiset} implementation with predictable iteration order. Its iterator orders elements
 * according to when the first occurrence of the element was added. When the multiset contains
 * multiple instances of an element, those instances are consecutive in the iteration order. If all
 * occurrences of an element are removed, after which that element is added to the multiset, the
 * element will appear at the end of the iteration.
 *