I'm doing perfect hashing for Unicode lookups. Perfect hashing only requires "Good Enough" hash functions. Does anybody know really fast u32->u32 hash-like functions? So far I've got (x * a) ^ (x * b), which seems pretty good.
-
Show this thread
-
Replying to @marcusklaas
I have a as the golden mean (in fractional form) and b as 0x31415926 (yes, I know it doesn't make sense).
8:20 AM - 9 Apr 2019
0 replies
0 retweets
3 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.