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 have no purpose to introduce political and social equality between the white and black races. There is a physical difference between the two, which, in my judgement, will probably for ever forbid their living together upon the footing of perfect equality; and inasmuch as it becomes a necessity that there must be a difference, I ... am in favour of the race to which I belong having the superior position.”
—Abraham Lincoln (1809–1865)
“The function of comedy is to dispel ... unconsciousness by turning the searchlight of the keenest moral and intellectual analysis right on to it.”
—George Bernard Shaw (1856–1950)