Implement a new type_hash policy, minimal_perfect_hash, that is modeled after the existing fast_perfect_hash policy, except that it finds a perfect minimal hash function using the PtHash algorithm. The primary hash function is in the form H(x) = (M * x) >> N, where x is the value to hash (a type_id), and M and N are the integer parameters of the hash function. Like with fast_perfect_hash, if the runtime_checks policy is present in the registry, create a control table during initialization, and use it during hashing to check that the input value x is in the universe passed to initialize. Also create a test suite.
Implement a new
type_hashpolicy,minimal_perfect_hash, that is modeled after the existingfast_perfect_hashpolicy, except that it finds a perfect minimal hash function using the PtHash algorithm. The primary hash function is in the formH(x) = (M * x) >> N, wherexis the value to hash (atype_id), and M and N are the integer parameters of the hash function. Like withfast_perfect_hash, if theruntime_checkspolicy is present in the registry, create a control table during initialization, and use it during hashing to check that the input valuexis in the universe passed toinitialize. Also create a test suite.