dustin/go-probably — pull request #2 by dgryski (2012-11-03 11:57:58+00:00)
Title: Improve the hash functions used in count.go:hashn()

This patch improves hashn to use fnv1a and Jenkins' one-at-a-time to
simulate 'd' independent hash functions. This contruction is validated
by the paper at: http://www.eecs.harvard.edu/~kirsch/pubs/bbbf/esa06.pdf
[ "Less Hashing, Same Performance: Building a Better Bloom Filter" ,
Kirsch & Mitzenmacher (2006) ]

This also fixes a problem with the current implementation where counts
would be off for any strings which collided on the first hash function.