"Thomas Hartman" <[EMAIL PROTECTED]> writes:
> What kind of speed do you get on your laptop for Data.Set? How much
> faster is the bloom filter?
I tried to modify examples/Words.hs to use Data.Set insted. The
results look like this (first Bloom, second Data.Set, both compiled
with -O2):
nmd
What kind of speed do you get on your laptop for Data.Set? How much
faster is the bloom filter?
thomas.
2008/5/30 Bryan O'Sullivan <[EMAIL PROTECTED]>:
> I'm pleased to announce the availability of a fast Bloom filter library
> for Haskell. A Bloom filter is a probabilistic data structure that
>
On Sat, May 31, 2008 at 4:09 PM, Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
> David MacIver wrote:
>
>> The Hashable stuff in there looks like it might be independently
>> useful.
>
> Probably, yes.
>
>> Any interest in splitting it out into an independent package
>> or is it really intended to be
David MacIver wrote:
> The Hashable stuff in there looks like it might be independently
> useful.
Probably, yes.
> Any interest in splitting it out into an independent package
> or is it really intended to be something fairly specific to the Bloom
> filter implementation?
I'll split them if the
On Fri, May 30, 2008 at 11:30 PM, Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
> I'm pleased to announce the availability of a fast Bloom filter library
> for Haskell. A Bloom filter is a probabilistic data structure that
> provides a fast set membership querying capability. It does not give
> fal
I'm pleased to announce the availability of a fast Bloom filter library
for Haskell. A Bloom filter is a probabilistic data structure that
provides a fast set membership querying capability. It does not give
false negatives, but has a tunable false positive rate. (A false
positive arises when th
