mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
f7c58e4c4b
* renames prime functions and occurances in comments
* changes implementation of primality testing to be uniform
* adds static typing as per conventions
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
42 lines
1.2 KiB
Python
42 lines
1.2 KiB
Python
#!/usr/bin/env python3
|
|
from .hash_table import HashTable
|
|
from .number_theory.prime_numbers import is_prime, next_prime
|
|
|
|
|
|
class DoubleHash(HashTable):
|
|
"""
|
|
Hash Table example with open addressing and Double Hash
|
|
"""
|
|
|
|
def __init__(self, *args, **kwargs):
|
|
super().__init__(*args, **kwargs)
|
|
|
|
def __hash_function_2(self, value, data):
|
|
|
|
next_prime_gt = (
|
|
next_prime(value % self.size_table)
|
|
if not is_prime(value % self.size_table)
|
|
else value % self.size_table
|
|
) # gt = bigger than
|
|
return next_prime_gt - (data % next_prime_gt)
|
|
|
|
def __hash_double_function(self, key, data, increment):
|
|
return (increment * self.__hash_function_2(key, data)) % self.size_table
|
|
|
|
def _collision_resolution(self, key, data=None):
|
|
i = 1
|
|
new_key = self.hash_function(data)
|
|
|
|
while self.values[new_key] is not None and self.values[new_key] != key:
|
|
new_key = (
|
|
self.__hash_double_function(key, data, i)
|
|
if self.balanced_factor() >= self.lim_charge
|
|
else None
|
|
)
|
|
if new_key is None:
|
|
break
|
|
else:
|
|
i += 1
|
|
|
|
return new_key
|