mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
27 lines
713 B
Python
27 lines
713 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
|