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

type hints requested by boot

Browse Source
This commit is contained in:
Isidro Arias 2023-04-06 14:17:32 +02:00
parent 392616713d
commit 280ffa0564
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

@ -10,7 +10,7 @@ class Bloom:
# number of hash functions is fixed # number of hash functions is fixed
HASH_FUNCTIONS = (sha256, md5) HASH_FUNCTIONS = (sha256, md5)
def __init__(self, size=8): def __init__(self, size: int = 8) -> None:
self.bitstring = 0b0 self.bitstring = 0b0
self.size = size self.size = size
@ -52,7 +52,7 @@ class Bloom:
return res return res
def test_movies(): def test_movies() -> None:
b = Bloom() b = Bloom()
b.add("Titanic") b.add("Titanic")
b.add("Avatar") b.add("Avatar")
@ -66,11 +66,11 @@ def test_movies():
assert b.exists("Pulp Fiction") in (True, False) assert b.exists("Pulp Fiction") in (True, False)
def random_string(size): def random_string(size: int) -> str:
return "".join(choices(ascii_lowercase + " ", k=size)) return "".join(choices(ascii_lowercase + " ", k=size))
def test_probability(m=64, n=20): def test_probability(m: int = 64, n: int = 20) -> None:
b = Bloom(size=m) b = Bloom(size=m)
k = len(b.HASH_FUNCTIONS) k = len(b.HASH_FUNCTIONS)