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:
“Th’ increasing prospect tires our wand’ring eyes.
Hills peep o’er hills, and Alps on Alps arise!
A perfect Judge will read each work of Wit
With the same spirit that its author writ:
Survey the Whole, nor seek slight faults to find
Where nature moves, and rapture warms the mind;”
—Alexander Pope (1688–1744)
“The more books we read, the clearer it becomes that the true function of a writer is to produce a masterpiece and that no other task is of any consequence.”
—Cyril Connolly (1903–1974)