go implementation of CodeDweller/mishmash.hpp/cpp
Du kan inte välja fler än 25 ämnen Ämnen måste starta med en bokstav eller siffra, kan innehålla bindestreck ('-') och vara max 35 tecken långa.
William Dillon c37b14540e updating tests + benchmark. found strings to be marginally faster (12500 ns/op vs []byte at ~15000 ns/op) 3 år sedan
LICENSE.TXT first commit 3 år sedan
README.md adding collision stats to README 3 år sedan
go.mod adding go.mod file 3 år sedan
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 3 år sedan
mishmash_test.go updating tests + benchmark. found strings to be marginally faster (12500 ns/op vs []byte at ~15000 ns/op) 3 år sedan

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.