* implicit target of the methods {@link #peek()}, {@link #poll()} and {@link #remove()} -- is
 * defined as the <i>least</i> element in the queue according to the queue's comparator. But unlike
 * a regular priority queue, the methods {@link #peekLast}, {@link #pollLast} and {@link
 * #removeLast} are also provided, to act on the <i>greatest</i> element in the queue instead.
 *

 * the License.
 */

package com.google.common.base;

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for extra methods of {@code Objects} only in web. Intended to be empty for regular
 * version.
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault

   * Creates a suite whose map has some elements filtered out of view.
   *
   * <p>Because the map may be ascending or descending, this test must derive the relative order of
   * these extreme values rather than relying on their regular sort ordering.
   */
  final TestSuite createSubmapSuite(
      FeatureSpecificTestSuiteBuilder<
              ?, ? extends OneSizeTestContainerGenerator<Map<K, V>, Entry<K, V>>>
          parentBuilder,

/** Benchmarks for the hashing of UTF-8 strings. */
public class HashStringBenchmark {
  static class MaxCodePoint {
    final int value;

    /**
     * Convert the input string to a code point. Accepts regular decimal numerals, hex strings, and
     * some symbolic names meaningful to humans.
     */
    private static int decode(String userFriendly) {
      try {
        return Integer.decode(userFriendly);

 * they are thin wrapper around {@link java.util.Collections#emptySet()}, {@link
 * Collections#singleton(Object)} and {@link java.util.LinkedHashSet} for empty, singleton and
 * regular sets respectively. For the sorted sets, it's a thin wrapper around {@link
 * java.util.TreeSet}.
 *
 * @see ImmutableSortedSet
 * @author Hayward Chan
 */
@ElementTypesAreNonnullByDefault

    long nanos = elapsedNanos();

    TimeUnit unit = chooseUnit(nanos);
    double value = (double) nanos / NANOSECONDS.convert(1, unit);

    // Too bad this functionality is not exposed as a regular method call
    return Platform.formatCompact4Digits(value) + " " + abbreviate(unit);
  }

  private static TimeUnit chooseUnit(long nanos) {
    if (DAYS.convert(nanos, NANOSECONDS) > 0) {
      return DAYS;

    return new CompositionPredicate<>(predicate, function);
  }

  /**
   * Returns a predicate that evaluates to {@code true} if the {@code CharSequence} being tested
   * contains any match for the given regular expression pattern. The test used is equivalent to
   * {@code Pattern.compile(pattern).matcher(arg).find()}
   *
   * @throws IllegalArgumentException if the pattern is invalid
   * @since 3.0
   */

 * the License.
 */

package com.google.common.base;

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for extra methods of {@code Objects} only in web. Intended to be empty for regular
 * version.
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault

 * the License.
 */

package com.google.common.primitives;

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for web specializations of methods of {@code Doubles}. Intended to be empty for regular
 * version.
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault

 * the License.
 */

package com.google.common.primitives;

import com.google.common.annotations.GwtCompatible;

/**
 * Holder for web specializations of methods of {@code Floats}. Intended to be empty for regular
 * version.
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault