Why are the equals and hashCode methods needed in Java?

The equals and hashCode methods in Java are used for correct object comparison and working with hash-based collections (like HashMap, HashSet).

• equals(Object o): Determines if the current object is equivalent to another object. By default, it compares references. It can be overridden to compare internal state.

• hashCode(): Returns an integer hash code for the object. Used by collections for fast lookup. Must be consistent with equals: if two objects are equal according to equals, their hash codes must be the same. The reverse is not required.

Incorrect or missing override of these methods can lead to incorrect behavior in collections, such as not finding an object in a Set after adding it, or not retrieving it from a HashMap by key.

Example override:

public class MyObject {
    private int id;
    private String name;

    public MyObject(int id, String name) {
        this.id = id;
        this.name = name;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true; // Reference check
        if (o == null || getClass() != o.getClass()) return false; // Null and type check

        MyObject that = (MyObject) o; // Type cast

        if (id != that.id) return false; // Compare fields
        return name != null ? name.equals(that.name) : that.name == null;
    }

    @Override
    public int hashCode() {
        int result = id; // Generate hash code based on fields
        result = 31 * result + (name != null ? name.hashCode() : 0);
        return result;
    }
}