Hashing algorithm for uniqueness and speed
When digesting data for uniqueness, but not security, sometimes SHA is overkill. I’m only after speed.
- uses original C code
- it’s not clear from README, but it has ruby standard library Digest integration
Problems with the xxhash rubygem:
- It supports XXH32 and XXH64, but not XXH3_64 and XXH3_128 (faster, newer).
- It doesn’t match Ruby’s Digest behavior because it uses
.to_son all input, whereas Digest requires an object to define implicit conversion to String (i.e. have
.to_strmethod) and raises
TypeErrorotherwise. (Here’s the bad PR: https://github.com/nashby/xxhash/pull/14)
- It doesn’t match Ruby’s Digest behavior because it doesn’t have class methods such as