A perfect hash function is one that generates no collisions; that is, it obeys the predicate
Whenever one class instance equals()
another, the hashCode()
contract
requires that they produce equal hash codes. Because the hash function is
perfect, the two objects must be identical and the hash code is isomorphic to
an instance reference.
This page last modified on 7 July 2003.