GitHub - ejfisc/Linear-Probe-Hash-Table: Generic implementation of a hash table with linear probing and lazy deletion using an array of private generic HashEntry<K,V> objects in HashTableLinearProbe.java, methods are tested in Main.java. Note that only String and Integer are valid K (key) objects but V (value) can be anything, there is a section at the bottom of main that tests the error handling of invalid and null keys.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
.vscode		.vscode
bin		bin
src		src
.gitattributes		.gitattributes
README.txt		README.txt

Repository files navigation

CS 3345.005
ejf180001
Project4
Description: Generic implementation of a hash table with linear probing and lazy deletion using an array of private generic HashEntry<K,V> objects in HashTableLinearProbe.java, methods are tested in Main.java. Note that only String and Integer are valid K (key) objects but V (value) can be anything, there is a section at the bottom of main that tests the error handling of invalid and null keys. 
IDE: VS Code
Java Version: Java SE 11.0.12

About

Generic implementation of a hash table with linear probing and lazy deletion using an array of private generic HashEntry<K,V> objects in HashTableLinearProbe.java, methods are tested in Main.java. Note that only String and Integer are valid K (key) objects but V (value) can be anything, there is a section at the bottom of main that tests the err…

Readme