Create a bloom filter with multiple items from an iterator
Create a bloom filter with multiple items.
Create a bloom filter with one item.
Attempts to create a new BloomFilter instance from a BitSet.
Hash the value numHashes times and return an array of indices of true bits in the BitSet.
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 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