Hi Will, Could you please explain the memory characteristics of your implementation? i.e. given boom.New(m, k), how much memory will the filter consume? Is the memory consumption related to number of items in the filter? If appropriate, function such as
func EstimateParameterByMemory(mem int) (m, k int) func (f *BloomFilter) MemoryConsumption() int will be very useful in my case. Thank you very much! xrfang 在 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.
