Bloom filter is a probabilistic data structure based on hashing. It’s very similar to hash table, but differs in several important aspects.

• only add() and contains() operations are supported (I’ll skip union)
• contains() may return false…