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
On Sat, Jan 25, 2014, at 07:17 AM, greg.z...@gmail.com wrote:
> Hello, I seem to be unable to Unmarshal a bitset over size 32..
What have you tried and what errors did you encounter?
If you share some code then your question will be easier to answer.
--
You received this message because
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
