}

    @Override
    public Iterable<Entry<AnEnum, String>> order(List<Entry<AnEnum, String>> insertionOrder) {
      return new Ordering<Entry<AnEnum, String>>() {

        @Override
        public int compare(Entry<AnEnum, String> left, Entry<AnEnum, String> right) {
          return left.getKey().compareTo(right.getKey());
        }
      }.sortedCopy(insertionOrder);
    }
  }

      }

      @Override
      public long getDelay(TimeUnit unit) {
        return Long.MAX_VALUE;
      }

      @Override
      public int compareTo(Delayed other) {
        return Long.compare(getDelay(NANOSECONDS), other.getDelay(NANOSECONDS));
      }
    }
  }

  @Test
  public void customComparator() {
    Comparator<NonComparableSuperClass> comparator =
        new Comparator<NonComparableSuperClass>() {
          @Override
          public int compare(NonComparableSuperClass left, NonComparableSuperClass right) {
            return left.value.compareTo(right.value);
          }
        };

    MutableGraph<NonComparableSuperClass> graph =

    }

    @Override
    public int hashCode() {
      return hash;
    }

    @Override
    public int compareTo(Element that) {
      return Integer.compare(hash, that.hash);
    }

    @Override
    public String toString() {
      return String.valueOf(hash);
    }
  }

  static class SlowElement extends Element {
    SlowElement(int hash) {

    /**
     * Returns true if the string ends with the specified substring, ignoring case.
     *
     * @param target1
     *            the text to check
     * @param target2
     *            the substring to compare
     * @return {@literal true} if the string ends with the specified substring, ignoring case
     */
    public static boolean endsWithIgnoreCase(final String target1, final String target2) {

 * operations at random. Each thread keeps track of the per-key deltas that it's directly
 * responsible for; after all threads have completed, we sum the per-key deltas and compare to the
 * existing multiset values.
 *
 * @author mike nonemacher
 */

@NullUnmarked
public class ConcurrentHashMultisetBasherTest extends TestCase {

              </excludes>
              <compilerArgs>
                <!--
                    Make includes/excludes fully work:
                    https://issues.apache.org/jira/browse/MCOMPILER-174
                    (Compare what guava-gwt has to do for maven-javadoc-plugin.)
                -->
                <arg>-sourcepath</arg>
                <arg>doesnotexist</arg>
              </compilerArgs>
            </configuration>

  // trivial because the divisor is bigger than the dividend.
  // Using remainder here does not give us a uniform distribution but it should
  // not have a big impact on the measurement.
  private static long randomDivisor(long dividend) {
    long r = randomSource.nextLong();
    if (dividend == -1) {
      return r;
    } else {

    ImmutableValueGraph.Builder<String, Integer> immutableValueGraphBuilder =
        graphBuilder.<String, Integer>immutable();

    // Update ValueGraphBuilder, but this shouldn't impact immutableValueGraphBuilder
    graphBuilder.allowsSelfLoops(false).nodeOrder(ElementOrder.<String>unordered());

    ImmutableValueGraph<String, Integer> emptyGraph = immutableValueGraphBuilder.build();

                          <Description>Full Text Search for Your Documents.</Description>
                          <Tags>Full Text Search</Tags>
                          <Contact>******@****.***</Contact>
                          <SearchForm>http://localhost:8080/fess/</SearchForm>
                          <Url type="text/html" template="http://localhost:8080/fess/search?q={searchTerms}"/>