What is the recommended way to combine multiple field values into a single hashCode() implementation, following the common formula used by IDE-generated code?

A widely-used, well-distributed hashCode() combining formula starts with a nonzero seed (traditionally 17), then for each significant field repeatedly applies result = 31 * result + fieldHashCode -- this specific approach (using a prime multiplier like 31, chosen partly because it can be efficiently computed via a bit-shift-and-subtract on older JVMs) helps spread hash values well across the available bucket range, minimizing collisions; Objects.hash() implements essentially this same formula internally, making it the simpler, preferred choice for most code rather than hand-rolling this pattern manually.

public class Point {
    private final int x, y;

    @Override
    public int hashCode() {
        int result = 17;
        result = 31 * result + x;
        result = 31 * result + y;
        return result;
    }
    // Equivalent to: return Objects.hash(x, y);
}