Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Does anyone know of a good library (windows) that will allow me to create a static (not runtime) perfect hash for millions of items (probably about 10m)?
I essentially have millions of sets of strings and I want to know at a minimal O(1) if a string is in my set or not – that’s it. I don’t need it to actually look up the string – there’s no value behind it (other than the existance).
Try:
perfect and gperf produce tables in C code form, which should work fine on Windows. I don’t know what CMPH’s output is.
CMPH has a comment saying:
If that’s correct, then with your million-key case, you should probably prefer CMPH to gperf. I don’t know how they compare to Jenkins’s perfect. It should be simple enough to try all three and benchmark them against each other.