Create a bloom filter with multiple items.
Create a bloom filter with one item.
Assume the bloom filters are compatible (same width and same hashing functions).
Assume the bloom filters are compatible (same width and same hashing functions). This is the union of the 2 bloom filters.
override this if there is a faster way to do this sum than reduceLeftOption on plus
override this if there is a faster way to do this sum than reduceLeftOption on plus
Bloom Filter - a probabilistic data structure to test presence of an element.
Operations 1) insert: hash the value k times, updating the bitfield at the index equal to the each hashed value 2) query: hash the value k times. If there are k collisions, then return true; otherwise false.
http://en.wikipedia.org/wiki/Bloom_filter