this.usePipeline = true;
    }

    protected InetAddress getInetAddressByName(final String host) {
        try {
            return InetAddress.getByName(host);
        } catch (final UnknownHostException e) {
            throw new FessSystemException("Failed to resolve the hostname: " + host, e);
        }
    }

    @PostConstruct
    public void open() {
        if (logger.isDebugEnabled()) {

        assertEquals("subscribe@", pom.getValue("mailingLists[1]/subscribe"));
        assertEquals("unsubscribe@", pom.getValue("mailingLists[1]/unsubscribe"));
        assertEquals("post@", pom.getValue("mailingLists[1]/post"));
        assertEquals("mail-archive", pom.getValue("mailingLists[1]/archive"));
        assertEquals(1, ((List<?>) pom.getValue("mailingLists[1]/otherArchives")).size());

    protected static final String RESULT_FIELD = "result";

    private static final String DOC_ID_FIELD = "doc_id";

    protected static final String GET = "GET";

    protected static final String POST = "POST";

    protected String mimeType = "application/json";

    public SearchApiManager() {
        setPathPrefix("/api/v1");
    }

    @PostConstruct
    public void register() {

    return new MergingIterator<>(iterators, comparator);
  }

  /**
   * An iterator that performs a lazy N-way merge, calculating the next value each time the iterator
   * is polled. This amortizes the sorting cost over the iteration and requires less memory than
   * sorting all elements at once.
   *
   * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of

   * Character#isLetter(char) Java's definition}. If you only care to match letters of the Latin
   * alphabet, you can use {@code inRange('a', 'z').or(inRange('A', 'Z'))}.
   *
   * @deprecated Most letters are supplementary characters; see the class documentation.
   * @since 19.0 (since 1.0 as constant {@code JAVA_LETTER})
   */
  @Deprecated
  public static CharMatcher javaLetter() {

   * E} is an {@link Enum} type, use {@link EnumSet#noneOf} instead. Otherwise, strongly consider
   * using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get
   * deterministic iteration behavior.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,

   * are guarded by a lock and operations are applied in batches to avoid lock contention. The
   * penalty of applying the batches is spread across threads so that the amortized cost is slightly
   * higher than performing just the operation without enforcing the capacity constraint.
   *
   * This implementation uses a per-segment queue to record a memento of the additions, removals,

    //                                                                       =============
    @Override
    public String asTableDbName() {
        return "duplicate_host";
    }

    @Override
    public String xgetAliasName() {
        return "duplicate_host";
    }

    // ===================================================================================

    }

    default void setVirtualHostValue(final String value) {
        setSystemProperty(Constants.VIRTUAL_HOST_VALUE_PROPERTY, value);
        propMap.remove(VIRTUAL_HOST_HEADERS);
    }

    default String getVirtualHostValue() {
        return getSystemProperty(Constants.VIRTUAL_HOST_VALUE_PROPERTY, getVirtualHostHeaders());
    }

    default void setLoginRequired(final boolean value) {

 * creation. However, the methods of this class have a large number of overloads that prevent such
 * allocations in many common cases.
 *
 * <p>The message string is not formatted unless the exception will be thrown, so the cost of the
 * string formatting itself should not be a concern.
 *
 * <p>As with any performance concerns, you should consider profiling your code (in a production