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 @raphlinus
is there even a clear upside over a single multiplication with a largish prime?
1 reply 0 retweets 0 likes
Replying to @marcusklaas
Yeah, the latter has too many collisions even for phf, or at least I couldn't get it to work. Maybe there is a way to do it though.
8:22 AM - 9 Apr 2019
0 replies
0 retweets
1 like
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.