A perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. A perfect hash function has many of the same applications as other hash functions, but with the advantage that no collision resolution has to be implemented. In mathematical terms, it is a total injective function.
Read more about Perfect Hash Function: Properties and Uses, Minimal Perfect Hash Function
Famous quotes containing the words perfect and/or function:
“O cloud-pale eyelids, dream-dimmed eyes,
The poets labouring all their days
To build a perfect beauty in rhyme
Are overthrown by a woman’s gaze....”
—William Butler Yeats (1865–1939)
“Nobody seriously questions the principle that it is the function of mass culture to maintain public morale, and certainly nobody in the mass audience objects to having his morale maintained.”
—Robert Warshow (1917–1955)