assertThrows(NullPointerException.class, () -> builder.put(immutableEntry((String) null, 1)));
    builder.put("foo", 2);
    assertMapEquals(builder.buildOrThrow(), "foo", 2);
  }

  // for GWT compatibility
  static class SimpleEntry<K, V> extends AbstractMapEntry<K, V> {
    public K key;
    public V value;

    SimpleEntry(K key, V value) {
      this.key = key;
      this.value = value;
    }

 * <p>The successor to Guava's caching API is <a
 * href="https://github.com/ben-manes/caffeine/wiki">Caffeine</a>. Its API is designed to make it a
 * nearly drop-in replacement. It requires Java 8+, and is not available for Android or GWT/J2CL,
 * and may have <a href="https://github.com/ben-manes/caffeine/wiki/Guava">different (usually
 * better) behavior</a> when multiple threads attempt concurrent mutations. Its equivalent to {@code
 * CacheBuilder} is its <a

    // they have been left as independent tests for clarity.

    if (part.length() < 1 || part.length() > MAX_DOMAIN_PART_LENGTH) {
      return false;
    }

    /*
     * GWT claims to support java.lang.Character's char-classification methods, but it actually only
     * works for ASCII. So for now, assume any non-ASCII characters are valid. The only place this
     * seems to be documented is here:

 */
@GwtIncompatible // hasn't been tested yet
@ElementTypesAreNonnullByDefault
public abstract class ImmutableSortedMultiset<E> extends ImmutableMultiset<E>
    implements SortedMultiset<E> {
  // TODO(lowasser): GWT compatibility

  /**
   * Returns a {@code Collector} that accumulates the input elements into a new {@code
   * ImmutableMultiset}. Elements are sorted by the specified comparator.
   *

 *
 * @author Jesse Wilson
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault
public class OrderingTest extends TestCase {
  // TODO(cpovirk): some of these are inexplicably slow (20-30s) under GWT

  private final Ordering<Number> numberOrdering = new NumberOrdering();

  public void testAllEqual() {
    Ordering<@Nullable Object> comparator = Ordering.allEqual();
    assertSame(comparator, comparator.reverse());

 *
 * @author Jesse Wilson
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault
public class OrderingTest extends TestCase {
  // TODO(cpovirk): some of these are inexplicably slow (20-30s) under GWT

  private final Ordering<Number> numberOrdering = new NumberOrdering();

  public void testAllEqual() {
    Ordering<@Nullable Object> comparator = Ordering.allEqual();
    assertSame(comparator, comparator.reverse());

    }

    /** Returns an equivalent {@code Alphabet} except it ignores case. */
    Alphabet ignoreCase() {
      if (ignoreCase) {
        return this;
      }

      // We can't use .clone() because of GWT.
      byte[] newDecodabet = Arrays.copyOf(decodabet, decodabet.length);
      for (int upper = 'A'; upper <= 'Z'; upper++) {
        int lower = upper | 0x20;
        byte decodeUpper = decodabet[upper];

    }

    @SuppressWarnings("unchecked")
    ImmutableList<ListenableFuture<T>> delegatesCast = (ImmutableList) delegates;
    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) {

   *
   * @throws IllegalArgumentException if {@code x <= 0}
   * @since 20.0
   */
  public static long floorPowerOfTwo(long x) {
    checkPositive("x", x);

    // Long.highestOneBit was buggy on GWT.  We've fixed it, but I'm not certain when the fix will
    // be released.
    return 1L << ((Long.SIZE - 1) - Long.numberOfLeadingZeros(x));
  }

  /**
   * Returns {@code true} if {@code x} represents a power of two.

   *
   * @throws IllegalArgumentException if {@code x <= 0}
   * @since 20.0
   */
  public static long floorPowerOfTwo(long x) {
    checkPositive("x", x);

    // Long.highestOneBit was buggy on GWT.  We've fixed it, but I'm not certain when the fix will
    // be released.
    return 1L << ((Long.SIZE - 1) - Long.numberOfLeadingZeros(x));
  }

  /**
   * Returns {@code true} if {@code x} represents a power of two.