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 @raphlinus
would this be a suitable use case for https://mollyrocket.com/meowhash ?
1 reply 0 retweets 5 likes
Replying to @SerialDev
That's exactly the kind of thing I was hoping to hear about, thanks for the pointer. I'll look into it.
8:03 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.