mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-03 13:28:40 +00:00
Code Issues Packages Projects Releases Wiki Activity

passing ruff

Browse Source
This commit is contained in:
Isidro Arias 2023-04-06 13:46:21 +02:00
parent 486dcbc04c
commit 4111807c47
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
data_structures/hashing/bloom_filter.py
View File

@ -1,9 +1,9 @@
""" """
See https://en.wikipedia.org/wiki/Bloom_filter See https://en.wikipedia.org/wiki/Bloom_filter
""" """
import string
from hashlib import md5, sha256 from hashlib import md5, sha256
from random import choices from random import choices
from string import ascii_lowercase
class Bloom: class Bloom:
@ -15,7 +15,7 @@ class Bloom:
self.size = size self.size = size
def add(self, value): def add(self, value):
h = self.hash(value) h = self.hash_(value)
self.bitstring |= h self.bitstring |= h
print( print(
f"""\ f"""\
@ -26,7 +26,7 @@ class Bloom:
) )
def exists(self, value): def exists(self, value):
h = self.hash(value) h = self.hash_(value)
res = (h & self.bitstring) == h res = (h & self.bitstring) == h
print( print(
@ -43,7 +43,7 @@ class Bloom:
res = bin(value)[2:] res = bin(value)[2:]
return res.zfill(self.size) return res.zfill(self.size)
def hash(self, value): def hash_(self, value):
res = 0b0 res = 0b0
for func in self.HASH_FUNCTIONS: for func in self.HASH_FUNCTIONS:
b = func(value.encode()).digest() b = func(value.encode()).digest()
@ -67,7 +67,7 @@ def test_movies():
def random_string(size): def random_string(size):
return "".join(choices(string.ascii_lowercase + " ", k=size)) return "".join(choices(ascii_lowercase + " ", k=size))
def test_probability(m=64, n=20): def test_probability(m=64, n=20):