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.

ejfisc / Linear-Probe-Hash-Table Public

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…

0 stars 0 forks Branches Tags Activity

Star

Notifications

1 Branch 0 Tags

Name	Name	Last commit message	Last commit date
Latest commit ejfisc update readme Nov 18, 2021 229452a · Nov 18, 2021 History 3 Commits
.vscode	.vscode	Project 4	Nov 18, 2021
bin	bin	Project 4	Nov 18, 2021
src	src	Project 4	Nov 18, 2021
.gitattributes	.gitattributes	Initial commit	Nov 18, 2021
README.txt	README.txt	update readme	Nov 18, 2021

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