};
        ComponentUtil.register(client, "searchEngineClient");

        final List<Map<String, Object>> documents =
                indexingHelper.getDocumentListByQuery(client, QueryBuilders.idsQuery().addIds("001"), new String[] { "title", "content" });
        assertEquals("fess.update", resultMap.get("index"));
        assertEquals(

        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        return searchEngineClient.getDocument(fessConfig.getIndexDocumentUpdateIndex(), builder -> {
            builder.setQuery(QueryBuilders.idsQuery().addIds(id));
            builder.setFetchSource(fields, null);
            return true;
        }).orElse(null);
    }

    /**
     * Retrieves a list of documents whose IDs start with the specified prefix.

    protected boolean usePipeline = false;

    /**
     * Adds an index configuration file path to be loaded.
     *
     * @param path path to the index configuration file
     */
    public void addIndexConfig(final String path) {
        indexConfigList.add(path);
    }

    /**
     * Adds a configuration file for a specific index.
     *
     * @param index the index name

 * </pre>
 *
 * <p>Methods:</p>
 * <ul>
 *   <li>{@link #normalize(String, String, String...)} - Applies all added normalizers to the input text.</li>
 *   <li>{@link #add(Normalizer)} - Adds a new normalizer to the chain.</li>
 * </ul>
 *
 * <p>Fields:</p>
 * <ul>
 *   <li>{@code normalizers} - A list of normalizers to be applied in sequence.</li>
 * </ul>
 */

   */
  @CanIgnoreReturnValue
  boolean putEdge(N nodeU, N nodeV);

  /**
   * Adds an edge connecting {@code endpoints} (in the order, if any, specified by {@code
   * endpoints}) if one is not already present.
   *
   * <p>If this graph is directed, {@code endpoints} must be ordered and the added edge will be
   * directed; if it is undirected, the added edge will be undirected.
   *

        }
        int current = 0;
        boolean added = false;
        final Map<Pattern, CrawlerClient> newClientMap = new LinkedHashMap<>();
        for (final Map.Entry<Pattern, CrawlerClient> entry : clientMap.entrySet()) {
            if (pos == current) {
                newClientMap.put(Pattern.compile(regex), client);
                added = true;
            }

 * equivalent elements are added to it, it is undefined which will come first in the output.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
final class TopKSelector<
    T extends @Nullable Object> {

  /**
   * Returns a {@code TopKSelector} that collects the lowest {@code k} elements added to it,

     *
     * @param map the <code>Map</code> to which keys and values are added
     */
    protected Maps(final Map<K, V> map) {
        this.map = map;
    }

    /**
     * Adds a key and value to the {@link Map}.
     *
     * @param key the key to be added to the <code>Map</code>
     * @param value the value to be added to the <code>Map</code>
     * @return this instance
     */

 * that every {@code Runnable} that is {@linkplain #add added} will be executed after {@link
 * #execute()} is called. Any {@code Runnable} added after the call to {@code execute} is still
 * guaranteed to execute. There is no guarantee, however, that listeners will be executed in the
 * order that they are added.
 *
 * <p>Exceptions thrown by a listener will be propagated up to the executor. Any exception thrown

 * equivalent elements are added to it, it is undefined which will come first in the output.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
final class TopKSelector<
    T extends @Nullable Object> {

  /**
   * Returns a {@code TopKSelector} that collects the lowest {@code k} elements added to it,