}
      return this;
    }

    /**
     * Configures this {@code Builder} to order entries by value according to the specified
     * comparator.
     *
     * <p>The sort order is stable, that is, if two entries have values that compare as equivalent,
     * the entry that was inserted first will be first in the built map's iteration order.
     *

                    + "Select ONLY documents that DIRECTLY address the user's specific question topic. "
                    + "Do NOT select documents about different or merely related topics. "
                    + "Do NOT select table-of-contents or index pages that lack substantive content. "
                    + "Respond with JSON only. Do not include any text outside the JSON object.\n\n"

    * Old behavior:
      * environment variables explicitly whitelisted via --docker-env-metadata-whitelist were exported as `container_env_*=*`. Default is zero so by default non were exported
      * all docker labels were exported as `container_label_*=*`

    if (expectedSize < Ints.MAX_POWER_OF_TWO) {
      // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap
      // ends up being used to compute a "threshold" size, beyond which the internal table
      // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where
      // loadFactor is 0.75 by default. So with the calculation here we ensure that the

    if (expectedSize < Ints.MAX_POWER_OF_TWO) {
      // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap
      // ends up being used to compute a "threshold" size, beyond which the internal table
      // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where
      // loadFactor is 0.75 by default. So with the calculation here we ensure that the

labels.allLanguages=Toutes les langues
labels.dictId=ID du dictionnaire
labels.docId=ID du document
labels.endTime=Heure de fin
labels.hq=hq
labels.inputs=Entrées
labels.jobLogging=Journalisation
labels.jobName=Nom
labels.jobStatus=Statut
labels.labelTypeIds=Étiquettes
labels.lang=Langue
labels.outputs=Sorties
labels.pos=Partie du discours
labels.purgeJobLogDay=Supprimer les anciens journaux de tâches

    HashSet<E> set = new HashSet<>();
    Iterators.addAll(set, elements);
    return set;
  }

  /**
   * Returns a new hash set using the smallest initial table size that can hold {@code expectedSize}
   * elements without resizing. Note that this is not what {@link HashSet#HashSet(int)} does, but it
   * is what most users want and expect it to do.
   *

      <name>Model</name>
      <superClass>ModelBase</superClass>
      <description>
        The {@code &lt;project>} element is the root of the descriptor.
        The following table lists all of the possible child elements.
      </description>
      <version>3.0.0+</version>
      <fields>

        <field xml.transient="true">
          <name>pomFile</name>
          <version>4.1.0+</version>

     *
     * @return true if running in embedded mode, false otherwise
     */
    public boolean isEmbedded() {
        return runner != null;
    }

    /**
     * Enables the use of ingest pipelines for document processing.
     */
    public void usePipeline() {
        usePipeline = true;
    }

    /**
     * Resolves a hostname to an InetAddress.
     *

   * 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
   * iterators. (Retrieving all elements takes approximately O(N*log(M)) time, where N is the total
   * number of elements.)
   */
  private static final class MergingIterator<T extends @Nullable Object>