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.
-
-
https://searchfox.org/mozilla-central/source/xpcom/ds/PerfectHash.h#17-32 … is what the Perfect Hash Function in mozilla-central is using.
-
Yeah, FNV processes one byte at a time so what I did will also be faster than that. I see it used a bunch by perfect hashers.
- 1 more reply
New conversation -
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.