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 had no other treasure in this world than to see you once perfect and complete, as much in virtue, honesty and wisdom, as in all free and honest learning, and so leave you after my death like a mirror representing my person—your father—if not as excellent in fact as I would wish, certainly so in desire.”
—François Rabelais (1494–1553)
“Our father has an even more important function than modeling manhood for us. He is also the authority to let us relax the requirements of the masculine model: if our father accepts us, then that declares us masculine enough to join the company of men. We, in effect, have our diploma in masculinity and can go on to develop other skills.”
—Frank Pittman (20th century)