go implementation of CodeDweller/mishmash.hpp/cpp
Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.
William Dillon c37b14540e updating tests + benchmark. found strings to be marginally faster (12500 ns/op vs []byte at ~15000 ns/op) před 3 roky
LICENSE.TXT first commit před 3 roky
README.md adding collision stats to README před 3 roky
go.mod adding go.mod file před 3 roky
mishmash.go changed []byte to string after finding out string indexing is faster than []byte in Go, since we're never modifying our string and only working with the accumulator we should see an improvement in speed in general před 3 roky
mishmash_test.go updating tests + benchmark. found strings to be marginally faster (12500 ns/op vs []byte at ~15000 ns/op) před 3 roky

README.md

Mishmash

this is a non-cryptographic hash optimized for short strings.

.003% collision rate on 326K entries during testing

adapted from CodeDweller/mishmash

to use: use the Mishmash function. If you’re in need of a second hash use Engine instead, which will return the accumulator. You can use the MishmashAccumulator function to mishmash your accumulator, and could also feed that accumulator back into Mishmash to double hash.