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:
“The most perfect caricature is that which, on a small surface, with the simplest means, most accurately exaggerates, to the highest point, the peculiarities of a human being, at his most characteristic moment in the most beautiful manner.”
—Max Beerbohm (1872–1956)
“Any translation which intends to perform a transmitting function cannot transmit anything but information—hence, something inessential. This is the hallmark of bad translations.”
—Walter Benjamin (1892–1940)