}

  private final class AsMapOfRanges extends IteratorBasedAbstractMap<Range<K>, V> {

    final Iterable<Entry<Range<K>, V>> entryIterable;

    @SuppressWarnings("unchecked") // it's safe to upcast iterables
    AsMapOfRanges(Iterable<RangeMapEntry<K, V>> entryIterable) {
      this.entryIterable = (Iterable) entryIterable;
    }

    @Override
    public boolean containsKey(@Nullable Object key) {

    return delegatesCast;
  }

  /** Can't use Iterables.toArray because it's not gwt compatible */
  @SuppressWarnings("unchecked")
  private static <T extends @Nullable Object> ListenableFuture<? extends T>[] gwtCompatibleToArray(
      Iterable<? extends ListenableFuture<? extends T>> futures) {
    Collection<ListenableFuture<? extends T>> collection;

  @SuppressWarnings("unchecked")
  public static <K, V> ImmutableSortedMap<K, V> copyOf(
      Iterable<? extends Entry<? extends K, ? extends V>> entries) {
    return new Builder<K, V>((Comparator<K>) NATURAL_ORDER).putAll(entries).build();
  }

  public static <K, V> ImmutableSortedMap<K, V> copyOf(
      Iterable<? extends Entry<? extends K, ? extends V>> entries,
      Comparator<? super K> comparator) {

    @Override
    @SuppressWarnings("unchecked")
    public Entry<Class<?>, Impl>[] createArray(int length) {
      return (Entry<Class<?>, Impl>[]) new Entry<?, ?>[length];
    }

    @Override
    public Iterable<Entry<Class<?>, Impl>> order(List<Entry<Class<?>, Impl>> insertionOrder) {
      return insertionOrder;
    }
  }

  private interface One {}

  private interface Two {}

  private interface Three {}

      return arithmetic.toString();
    }
  }

  private interface ParameterTypesDifferent {
    void foo(
        String s,
        Runnable r,
        Number n,
        Iterable<?> it,
        boolean b,
        Equivalence<String> eq,
        Exception e,
        InputStream in,
        Comparable<?> c,
        Ordering<Integer> ord,
        Charset charset,

    list.add("a");
    assertThrows(AssertionFailedError.class, () -> assertEmpty(list));
    assertThrows(
        AssertionFailedError.class,
        () ->
            assertEmpty(
                new Iterable<String>() {
                  @Override
                  public Iterator<String> iterator() {
                    return singleton("a").iterator();
                  }
                }));
  }

    list.add("a");
    assertThrows(AssertionFailedError.class, () -> assertEmpty(list));
    assertThrows(
        AssertionFailedError.class,
        () ->
            assertEmpty(
                new Iterable<String>() {
                  @Override
                  public Iterator<String> iterator() {
                    return singleton("a").iterator();
                  }
                }));
  }

   *
   * @param elements the elements that the multiset should contain
   */
  public static <E extends @Nullable Object> LinkedHashMultiset<E> create(
      Iterable<? extends E> elements) {
    LinkedHashMultiset<E> multiset = create(Multisets.inferDistinctElements(elements));
    Iterables.addAll(multiset, elements);
    return multiset;
  }

  private LinkedHashMultiset() {
    super(new LinkedHashMap<E, Count>());
  }

              public SortedMultiset<E> create(Object... entries) {
                return ((SortedMultiset<E>) super.create(entries)).descendingMultiset();
              }

              @Override
              public Iterable<E> order(List<E> insertionOrder) {
                return ImmutableList.copyOf(super.order(insertionOrder)).reverse();
              }
            })
        .named(parentBuilder.getName() + " descending")

  }

  /**
   * Returns the nodes reachable from {@code node} in {@code graph}, according to the given {@code
   * strategy}.
   */
  private static <N> Iterable<N> getReachableNodes(
      Graph<N> graph, N node, TransitiveClosureSelfLoopStrategy strategy) {
    Traverser<N> traverser = Traverser.forGraph(graph);
    switch (strategy) {