*/
  public abstract ComparisonChain compare(double left, double right);

  /**
   * Discouraged synonym for {@link #compareFalseFirst}.
   *
   * @deprecated Use {@link #compareFalseFirst}; or, if the parameters passed are being either
   *     negated or reversed, undo the negation or reversal and use {@link #compareTrueFirst}.
   * @since 19.0
   */
  @InlineMe(replacement = "this.compareFalseFirst(left, right)")
  @Deprecated

   * times, due to numerical errors.
   *
   * <h3>Non-finite values</h3>
   *
   * <p>If the dataset contains any non-finite values ({@link Double#POSITIVE_INFINITY}, {@link
   * Double#NEGATIVE_INFINITY}, or {@link Double#NaN}) then the result is {@link Double#NaN}.
   *
   * @throws IllegalStateException if the dataset is empty
   */
  public double populationCovariance() {
    checkState(count() != 0);

 *       contents of the current one (for example {@link #transform})
 *   <li>element extraction methods which facilitate the retrieval of certain elements (for example
 *       {@link #last})
 *   <li>query methods which answer questions about the {@code FluentIterable}'s contents (for
 *       example {@link #anyMatch})

                                            <c:if test="${pager.existPrePage}">
                                                <li class="page-item"><la:link
                                                        styleClass="page-link"
                                                        href="list/${pager.currentPageNumber - 1}?dictId=${f:u(dictId)}">
                                                    <la:message key="labels.prev_page"/>

    }
    assertEquals(
        "A List's hashCode() should be computed from those of its elements.",
        expectedHashCode,
        getList().hashCode());
  }

  /**
   * Returns the {@link Method} instance for {@link #testHashCode()} so that list tests on
   * unhashable objects can suppress it with {@code FeatureSpecificTestSuiteBuilder.suppressing()}.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection

   * ordering of all views in the returned table, with {@link #putAll} following the {@link
   * Table#cellSet()} iteration order. However, if {@link #orderRowsBy} or {@link #orderColumnsBy}
   * is called, the views are sorted by the supplied comparators.
   *
   * <p>For empty or single-cell immutable tables, {@link #of()} and {@link #of(Object, Object,
   * Object)} are even more convenient.
   *

    }

    /**
     * Creates and returns a {@link ParameterizedClassDesc} representing the {@link Type}.
     *
     * @param type
     *            the type
     * @param map
     *            a {@link Map} with type variables as keys and type arguments as values for the parameterized type
     * @return a {@link ParameterizedClassDesc} representing the type
     */

/**
 * A descriptor for a <i>discrete</i> {@code Comparable} domain such as all {@link Integer}
 * instances. A discrete domain is one that supports the three basic operations: {@link #next},
 * {@link #previous} and {@link #distance}, according to their specifications. The methods {@link
 * #minValue} and {@link #maxValue} should also be overridden for bounded types.
 *

        /**
         * Constructs a new {@link StreamOf} instance with the given supplier.
         *
         * @param supplier the supplier of the stream
         */
        public StreamOf(final Supplier<Stream<T>> supplier) {
            this.supplier = supplier;
        }

        /**
         * Executes the provided {@link Consumer} with a {@link Stream} obtained from the supplier.

            throw new SQLRuntimeException(ex);
        }
    }

    /**
     * Closes the {@link Statement}.
     * <p>
     * If {@link Statement#close()} throws an exception, an error message is logged. The exception is not rethrown.
     * </p>
     *
     * @param statement
     *            {@link Statement}
     * @see Statement#close()
     */
    public static void close(final Statement statement) {