wdillon
/
mishmash
Obserwuj 1
Gwiazdka 0
Forkuj 0
Kod Problemy 0 Pull Requests 0 Wydania 0 Wiki Aktywność
go implementation of CodeDweller/mishmash.hpp/cpp
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
9 Commity
1 Gałąź
Drzewo: c37b14540e
Gałęzie Tagi
${ item.name }
Utwórz gałąź ${ searchTerm }
z 'c37b14540e'
${ noResults }
William Dillon c37b14540e updating tests + benchmark. found strings to be marginally faster (12500 ns/op vs []byte at ~15000 ns/op) 3 lat temu
LICENSE.TXT first commit 3 lat temu
README.md adding collision stats to README 3 lat temu
go.mod adding go.mod file 3 lat temu
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 lat temu
mishmash_test.go updating tests + benchmark. found strings to be marginally faster (12500 ns/op vs []byte at ~15000 ns/op) 3 lat temu

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.