mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 21:41:08 +00:00
27 lines
714 B
Python
27 lines
714 B
Python
|
#!/usr/bin/env python3
|
||
|
|
|
||
|
|
from .hash_table import HashTable
|
||
|
|
|
||
|
|
|
||
|
|
class QuadraticProbing(HashTable):
|
||
|
|
"""
|
||
|
|
Basic Hash Table example with open addressing using Quadratic Probing
|
||
|
|
"""
|
||
|
|
def __init__(self, *args, **kwargs):
|
||
|
|
super().__init__(*args, **kwargs)
|
||
|
|
|
||
|
|
def _colision_resolution(self, key, data=None):
|
||
|
|
i = 1
|
||
|
|
new_key = self.hash_function(key + i*i)
|
||
|
|
|
||
|
|
while self.values[new_key] is not None \
|
||
|
|
and self.values[new_key] != key:
|
||
|
|
i += 1
|
||
|
|
new_key = self.hash_function(key + i*i) if not \
|
||
|
|
self.balanced_factor() >= self.lim_charge else None
|
||
|
|
|
||
|
|
if new_key is None:
|
||
|
|
break
|
||
|
|
|
||
|
|
return new_key
|