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:
“I sit in the top of the wood, my eyes closed.
Inaction, no falsifying dream
Between my hooked head and hooked feet:
Or in sleep rehearse perfect kills and eat.”
—Ted Hughes (b. 1930)
“It is the function of vice to keep virtue within reasonable bounds.”
—Samuel Butler (1835–1902)
Related Phrases
Related Words