this class implement a basic hash table that support add some key-value based data to its entry. we use a simple modulo operation to compute hash (table index) for each key, if collision occur, we apply the double hashing strategy to find another available "slot" to store key. if elements within table reach some critical value, we expended it as needed.

I also plan to add some security feature future, to its add() method to prevent memory exhausting attack (e.g., the caller continuously add key in an infinite loop to force the table expand exceed the heap memory limitation of a Python program. )

Name		Name	Last commit message	Last commit date
Latest commit History 103 Commits
README.md		README.md
_config.yml		_config.yml
count_each_letter_in_file.py		count_each_letter_in_file.py
generate-histogram.py		generate-histogram.py
hashmap.py		hashmap.py
helper_func_set.py		helper_func_set.py
histogram.py		histogram.py
my_arrays.py		my_arrays.py
sine_approximation.py		sine_approximation.py