This is a test.
This is only a test.
If this had been a real file, it would have been much longer.
This file has 18 lines in it.
A few of these lines will hash to the same entry.
It is important that you can handle collisions correctly.
You are going two write a few of the has functions.
Do not change the size of the has table.
Do not change the hash function.
When I test your program I will enter these lines.
Then I will delete some lines.
Finially, I will enter some more lines.
If your program should find lines that are in the table.
It will not find the lines that are not in the table.
I will check your hash table after each step.
As soon as an error is found, the checking will stop.
Good luck.
I hope you do not need it.