*
   * <ul>
   *   <li>The visible constructor or visible static factory method with the most parameters is used
   *       to construct the sample instances. In case of tie, the candidate constructors or
   *       factories are tried one after another until one can be used to construct sample
   *       instances.

 * priority. If you need to enforce an ordering, you can define custom classes or comparators that
 * use a secondary key to break ties in primary priority values. For example, here is a class that
 * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a
 * {@code new FIFOEntry(anEntry)} instead of a plain entry object.
 *
 * <pre>{@code

   *
   * <ul>
   *   <li>The visible constructor or visible static factory method with the most parameters is used
   *       to construct the sample instances. In case of tie, the candidate constructors or
   *       factories are tried one after another until one can be used to construct sample
   *       instances.

   *
   * <ul>
   *   <li>The non-private constructor or non-private static factory method with the most parameters
   *       is used to construct the sample instances. In case of tie, the candidate constructors or
   *       factories are tried one after another until one can be used to construct sample
   *       instances.

  }

  <T2 extends T> Ordering<Entry<T2, ?>> onKeys() {
    return onResultOf(Entry::getKey);
  }

  /**
   * Returns an ordering which first uses the ordering {@code this}, but which in the event of a
   * "tie", then delegates to {@code secondaryComparator}. For example, to sort a bug list first by
   * status and second by priority, you might use {@code byStatus.compound(byPriority)}. For a

query.boost.fuzzy.content.prefix_length=0
# Whether to allow transpositions in fuzzy content queries.
query.boost.fuzzy.content.transpositions=true

# Default query type.
query.default.query_type=bool
# Tie breaker value for dismax queries.
query.dismax.tie_breaker=0.1
# Minimum should match value for boolean queries.
query.bool.minimum_should_match=

# Number of expansions for prefix queries.
query.prefix.expansions=50

        },

  EXPECT_TRUE(absl::StrContains(s, expected))
      << "'" << s << "' does not contain '" << expected << "'";
}

// Returns the GPU device name if there is one (with arbitrary tie breaking if
// there are more than one), or "" otherwise.
string GPUDeviceName(TF_Session* session) {
  std::unique_ptr<TF_Status, decltype(&TF_DeleteStatus)> status(
      TF_NewStatus(), TF_DeleteStatus);

     * comment: Tie breaker value for dismax queries.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getQueryDismaxTieBreaker();

    /**
     * Get the value for the key 'query.dismax.tie_breaker' as {@link java.math.BigDecimal}. <br>
     * The value is, e.g. 0.1 <br>
     * comment: Tie breaker value for dismax queries.