You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This example implements a Bloom filter in Python, a probabilistic data structure for fast membership testing. Items are added using multiple hash functions that set bits in a fixed-size array. Membership checks return definitely not present or possibly present, with false positives possible. The source code is part of the 127 algorithms collection.
DEPRECATED REPO!! New place at https://github.com/tunnckocore/opensource! Next release soon will be published! Return positive value if any of passed values exists in array, or optionally an index.