I have read the code, one thing I'm not clearly is that the choosing of the k hash function. Is there any reason you use such location function to implement the k function, What's the advantage?
在 2011年5月21日星期六 UTC+8下午10:24:05，Will Fitzgerald写道： > > I've written an implementation of Bloom filters, using the BitSet package. > You can find it at > > https://github.com/willf/bloom > > As usual, comments welcome. > > Will > -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
