出典:Wikipedia
出典:『Wikipedia』 (2010/12/17 17:45 UTC 版)
A perfect hash function for a set S is a hash function that maps distinct elements in S to distinct integers, with no collisions. A perfect hash function with values in a limited range can be used for efficient lookup operations, by placing keys from S (or other associated values) in a table indexed by the output of the function.