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.2.tar.gz
(6.4 kB
view hashes)
Built Distribution
Close
Hashes for drs_bloom_filter-2.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7d8d8624e84ba13cd25792e13d5e9b750c28aea3ee1473e514be57659ec6e379 |
|
MD5 | 1969f672277afd1d95fc0bf8ea94be5e |
|
BLAKE2b-256 | 853f8438e4d638f55a50b4f3da38e2b3f8dafaf0f32326857cc6d1dca026d665 |