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
For the curious, I didn't find anything better than what I first posted, and the results are inhttps://github.com/unicode-rs/unicode-normalization/pull/37 …
0 replies
0 retweets
10 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.