3 ms·

You're saying you can use a perfect hash also implies you know you will only find those values? If so, then yes, the name is accurate and is probably a very goo

by jerf 1y ago

You're saying you can use a perfect hash also implies you know you will only find those values? If so, then yes, the name is accurate and is probably a very good choice. But if you put things into the perfect hash function it is not expecting, some fraction of them will collide. If you're searching for a fixed set, look at the Ragel library. Compile-time generation of the search in a way that is very hard to beat.

anon-3988 1y ago
> You're saying you can use a perfect hash also implies you know you will only find those values? No, 99.999999% of the time the values is NOT what I am looking for. So the error rate is EXTREMELY high, so its very important that the failure path is quick.