### Question:
Node implements Bounded, Comparable<Node> { public final @Override int hashCode() { return RevObjects.hashCode(this); }  abstract TYPE getType(); abstract String getName(); abstract Optional<ObjectId> getMetadataId(); abstract Map<String, Object> getExtraData(); @Nullable Object getExtraData(String key); final @Override int compareTo(Node o); final @Override int hashCode(); final @Override boolean equals(Object o); @Override String toString(); Node update(final ObjectId newId); Node update(final ObjectId newId, final @Nullable Envelope newBounds);  }### Answer:
@Test public void testHashCode() { Node node = RevObjectFactory.defaultInstance().createNode("Points.1", ObjectId.valueOf("abc123000000000000001234567890abcdef0000"), ObjectId.NULL, TYPE.FEATURE, null, null); Node node2 = RevObjectFactory.defaultInstance().createNode("Lines.1", ObjectId.valueOf("abc123000000000000001234567890abcdef0001"), ObjectId.NULL, TYPE.FEATURE, null, null); assertNotSame(node.hashCode(), node2.hashCode()); }