> On 3 Mar 2020, at 22:31, Claude Warren wrote:
>
> take a look at
> https://github.com/apache/commons-collections/pull/131/files#diff-8b2bf046dc35c88908eef196937173e1
>
> This is a different Hasher with a smaller data footprint than
> DynamicHasher. Like the DynamicHasher it builds the values
take a look at
https://github.com/apache/commons-collections/pull/131/files#diff-8b2bf046dc35c88908eef196937173e1
This is a different Hasher with a smaller data footprint than
DynamicHasher. Like the DynamicHasher it builds the values on the fly.
Can SplitIterators be implemented on them easily?
On 02/03/2020 22:34, Claude Warren wrote:
So what we have then is:
*public* *interface* BloomFilter {
*int* andCardinality(BloomFilter other);
*int* cardinality();
*boolean* contains(BloomFilter other);
*boolean* contains(Hasher hasher);
*long*[] getBits();
