Subject: Re: [boost] [GSoC] Request for Feedback on Boost.Bloom Filter Project
From: Arash Partow (arash_at_[hidden])
Date: 2011-06-25 03:19:05
Phil Endecott wrote:
> For some reason I have a mental block about how intersection works. Union is OK; I can see that
>
> set a;
> set b;
> bloom_filter(a) union bloom_filter(b) == bloom_filter( a union b );
>
> but it's not clear to me if
>
> bloom_filter(a) intersect bloom_filter(b) == bloom_filter( a intersect b );
>
> Can you convince me?
That is correct, afaik only union (or) and difference (xor) can be applied to non-counting BFs.