mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-07 18:10:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

type hints

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

8
data_structures/hashing/bloom_filter.py
View File

@ -14,7 +14,7 @@ class Bloom:
self.bitstring = 0b0 self.bitstring = 0b0
self.size = size self.size = size
def add(self, value): def add(self, value: str):
h = self.hash_(value) h = self.hash_(value)
self.bitstring |= h self.bitstring |= h
print( print(
@ -25,7 +25,7 @@ class Bloom:
""" """
) )
def exists(self, value): def exists(self, value: str)-> bool:
h = self.hash_(value) h = self.hash_(value)
res = (h & self.bitstring) == h res = (h & self.bitstring) == h
@ -39,11 +39,11 @@ class Bloom:
) )
return res return res
def format_bin(self, value): def format_bin(self, value: int) -> str:
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: str) -> int:
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()