algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update data_structures/hashing/bloom_filter.py

Browse Source 
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
isidroas
2023-04-08 16:06:50 +02:00
committed by GitHub
parent 9b014721e4
commit c132d501b6
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
data_structures/hashing/bloom_filter.py
View File

@@ -2,7 +2,7 @@
See https://en.wikipedia.org/wiki/Bloom_filter
The use of this data structure is to test membership in a set.
Compared to python built-in set() it is more space-efficent.
Compared to Python's built-in set() it is more space-efficient.
In the following example, only 8 bits of memory will be used:
>>> b = Bloom(size=8)
>>> "Titanic" in b