ContiguousSet.closedOpen(Integer.MIN_VALUE, Integer.MIN_VALUE),
            ImmutableSortedSet.of(),
            ImmutableSet.of())
        .testEquals();
    // not testing hashCode for these because it takes forever to compute
    assertEquals(
        ContiguousSet.closed(Integer.MIN_VALUE, Integer.MAX_VALUE),
        ContiguousSet.create(Range.<Integer>all(), integers()));
    assertEquals(

                    && Objects.equals(phase(), phaseId.phase())
                    && Objects.equals(priority(), phaseId.priority());
        }
    }

    @Override
    public int hashCode() {
        return Objects.hash(executionPoint(), phase(), priority());
    }

    @Override
    public String toString() {

      return that.isEmpty();
    }
    return false;
  }

  @GwtIncompatible // not used in GWT
  @Override
  boolean isHashCodeFast() {
    return true;
  }

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

  @GwtIncompatible
  @J2ktIncompatible
  private static final class SerializedForm<C extends Comparable> implements Serializable {
    private final DiscreteDomain<C> domain;

    }

    @Override
    public boolean equals(@Nullable Object obj) {
      return obj instanceof Collider && ((Collider) obj).value == value;
    }

    @Override
    public int hashCode() {
      return 1; // evil!
    }
  }

     * <p>The hash code of a multiset entry for element {@code element} and count {@code count} is
     * defined as:
     *
     * {@snippet :
     * ((element == null) ? 0 : element.hashCode()) ^ count
     * }
     */
    @Override
    int hashCode();

    /**
     * Returns the canonical string representation of this entry, defined as follows. If the count

    for (int i = 0; i < reps; i++) {
      MoreObjects.ToStringHelper helper = newHelper();
      for (int j = 0; j < dataSize; ++j) {
        dataset.addEntries(helper);
      }
      dummy ^= helper.toString().hashCode();
    }
    return dummy;
  }

  // When omitEmptyValues() is released, remove this method and add a new @Param "omitEmptyValues".

    assertSame(not, pool.intern(not));
  }

  private static final class MyInt {
    private final int i;

    MyInt(int i) {
      this.i = i;
    }

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

    @Override
    public boolean equals(Object o) {
      return o instanceof MyInt && ((MyInt) o).i == i;
    }
  }

  public void testAsFunction_simplistic() {

                        && Objects.equals(extension, that.extension)
                        && Objects.equals(type, that.type);
            }

            @Override
            public int hashCode() {
                return Objects.hash(groupId, artifactId, version, classifier, extension, type);
            }

            @Override
            public String toString() {

  // We need to test that our method behaves like the JDK method.
  @SuppressWarnings("InlineMeInliner")
  public void testHashCode() {
    for (byte value : VALUES) {
      assertThat(Bytes.hashCode(value)).isEqualTo(Byte.hashCode(value));
    }
  }

  public void testContains() {
    assertThat(Bytes.contains(EMPTY, (byte) 1)).isFalse();
    assertThat(Bytes.contains(ARRAY1, (byte) 2)).isFalse();

      return map.entrySet().iterator();
    }

    @Override
    Map<K, Collection<V>> createAsMap() {
      return new AsMap<>(this);
    }

    @Override
    public int hashCode() {
      return map.hashCode();
    }

    @GwtIncompatible @J2ktIncompatible     private static final long serialVersionUID = 7845222491160860175L;
  }

  /**