*/
    public Path getPath() {
        return path;
    }

    @Override
    public String toString() {
        return getLocation();
    }

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

    @Override
    public boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }

        if (obj == null) {
            return false;

    }

    @Override
    public HashCode hash() {
      long value = checksum.getValue();
      if (bits == 32) {
        /*
         * The long returned from a 32-bit Checksum will have all 0s for its second word, so the
         * cast won't lose any information and is necessary to return a HashCode of the correct
         * size.
         */
        return HashCode.fromInt((int) value);
      } else {

    }

    @Override
    public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + ((value1 == null) ? 0 : value1.hashCode());
        result = prime * result + ((value2 == null) ? 0 : value2.hashCode());
        result = prime * result + ((value3 == null) ? 0 : value3.hashCode());
        result = prime * result + ((value4 == null) ? 0 : value4.hashCode());

     * Tests the {@code equals} and {@code hashCode} methods of options.
     */
    @Test
    public void testEqualsHashCode() {
        JavaPathType.Modular foo1 = JavaPathType.patchModule("foo");
        JavaPathType.Modular foo2 = JavaPathType.patchModule("foo");
        JavaPathType.Modular bar = JavaPathType.patchModule("bar");
        assertEquals(foo1, foo2);
        assertEquals(foo1.hashCode(), foo2.hashCode());

        assertEquals("deadbeef", blob.toString(), "toString() should reflect underlying content");
        assertEquals(data.hashCode(), blob.hashCode(), "hashCode should equal the array's hashCode");
    }

    // Validates equals() returns true for same-sized, equal-content blobs
    @Test
    @DisplayName("equals: identical content and size -> true")

            UniAddress uniAddress1 = new UniAddress(inetAddress1);
            assertEquals(inetAddress1.hashCode(), uniAddress1.hashCode());

            UniAddress uniAddress2 = new UniAddress(nbtAddress1);
            assertEquals(nbtAddress1.hashCode(), uniAddress2.hashCode());
        }

        @Test
        void equalsShouldReturnTrueForSameWrappedAddress() {

        this.version = version;
        this.hashCode = Objects.hash(groupId, artifactId, version);
    }

    public String getGroupId() {
        return groupId;
    }

    public String getArtifactId() {
        return artifactId;
    }

    public String getVersion() {
        return version;
    }

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

    @Override

        && isHashCodeFast()
        && ((ImmutableSet<?>) object).isHashCodeFast()
        && hashCode() != object.hashCode()) {
      return false;
    }
    return Sets.equalsImpl(this, object);
  }

  @Override
  public int hashCode() {
    return Sets.hashCodeImpl(this);
  }

  // This declaration is needed to make Set.iterator() and
  // ImmutableCollection.iterator() consistent.

    public StringSource(CharSequence content, String location) {
        this.content = (content != null) ? content.toString() : "";
        this.location = (location != null) ? location : "(memory)";
        this.hashCode = this.content.hashCode();
    }

    @Override
    public InputStream getInputStream() throws IOException {
        return new ByteArrayInputStream(content.getBytes(StandardCharsets.UTF_8));
    }

    @Override

    // Might be nice (eventually) to have:
    //     assertEquals(c1, c2);

    // But for now, settle for this:
    assertEquals(c1.hashCode(), c2.hashCode());

    assertEquals(c1.apply(1.0f), c2.apply(1.0f));
    assertEquals(c1.apply(5.0f), c2.apply(5.0f));
  }

  public void testComposeOfPredicateAndFunctionIsAssociative() {