Pure Python Bloom Filter module
Project description
A pure python bloom filter (low storage requirement, probabilistic set datastructure) is provided.
Includes mmap, in-memory and disk-seek backends.
The user specifies the desired maximum number of elements and the desired maximum false positive probability, and the module calculates the rest.
- Example use:
>>> bf = bloom_filter_mod.Bloom_filter(ideal_num_elements_n=100, error_rate_p=0.01) >>> for i in range(0, 200, 2): ... bf.add(i) ... >>> for i in range(0, 200, 3): ... print(i in bf) ...
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
drs-bloom-filter-2.4.tar.gz
(6.7 kB
view hashes)
Built Distribution
Close
Hashes for drs_bloom_filter-2.4-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 060637b6f1eb840a9a96c4563982fc3e4498de091ac1bad8246848f65755da7a |
|
MD5 | e1f7abf5a683a29975bf373c9266c603 |
|
BLAKE2b-256 | 654d039e12c31af7a54f5083529f2bd6b925942fd6367b5ae0f02109a1bf66a9 |