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 …
-
-
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Maybe check out what Rust's phf_map uses?
-
phf_map uses siphash13, which I haven't benchmarked yet but am confident will be a lot slower than what I'm doing now.
- 3 more replies
New conversation -
-
-
would this be a suitable use case for https://mollyrocket.com/meowhash ?
-
That's exactly the kind of thing I was hoping to hear about, thanks for the pointer. I'll look into it.
End of conversation
New conversation -
-
-
how do u choose a and b
-
I have a as the golden mean (in fractional form) and b as 0x31415926 (yes, I know it doesn't make sense).
End of conversation
New conversation -
-
-
If it's unkeyed you can split your value into two 16-bit words X and Y and do ((X+1)*(Y+1)%(2^16+1))-1 for a 16-bit output. Not sure about the other 16 bits
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
https://github.com/flier/rust-t1ha includes most of the fast rust hashing functions in its bench if you need a comparison
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Fxhash sounds interesting https://github.com/Amanieu/hashbrown/blob/master/src/fx.rs …
-
*looks, there is also this one https://docs.rs/seahash/3.0.6/seahash/ …
End of conversation
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.