The goal of Lab 8 is to implement a hash table for retrieving a planet’s probability of life. You must use linear open addressing for collision resolution.
(Parts A must be completed in lab)
## Part A: Hash Table
For Part A you are going to implement a Hash and Node class that will store a key string and value double. You must use use linear open addressing for collision resolution. Open addressing sacrifices insertion and lookup performance to save memory by placing the data in the next open space when there is a collision. Your hash should correctly store and retrieve probabilities along with the key. Some rules your hash must follow are:
1. You must use linear open addressing for collision resolution
2. You must use a standard array (boring, I know).
3. Your hash table must not change size. Empty ‘slots’ are represented with empty strings.
:warning: Node class must not be an internal class and everything must be public. This is only for testing purposes. You must have the following interface:
* string key;
* double value;
* sets `key` to an empty string and `value` to -1.0
* Hash(unsigned int size)
* Should initialize an array to the size passed in. You must use an array of `Node` objects to store the key/value pairs.
* unsigned int hasher(string key)
* hash function that determines an index based on the key parameter
* Your hash function should be implemented as follows: `<sum of string ascii values> % size`
* bool insert(string key, double value)
* returns true is the key was correctly inserted into the hash
* false if the hash is full
* Adding duplicate keys is undefined behavior.
* bool empty()
* returns true of the hash is empty
* int size()
* returns the max size of the hash table (not the current number of items)
* Node * getTable()
* return a pointer to your Node array
__Show your TA your code.__
__–END OF IN LAB REQUIRED WORK–__
_You may continue to work on the remainder of the lab on your own time or in lab_
## Part B: Retrieval and Deletion
Add the following methods to your Hash Class:
* bool remove(string key)
* removes the entry from the hash be setting the key to an empty string and value to -1.0
* returns false if the key was not found
* double find(string key)
* returns the correct value based on the key parameter
* If the key is not found, returns -1.0
## Part C: Code Organization and Submission
* Required code organization:
* lab8.cpp (driver code – You must include this file in your submission)
* testa.dat, testb.dat, testc.dat – (sample test files)
* executable should be called: lab8
* You must have the following targets in your makefile:
* `lab8` – only compiles your source code using separate compilation for each .cpp file
* `clean` – removes all object files and binary executables
* `run` – compiles if necessary and runs your executable
* `memcheck` – compiles your source if necessary, then runs your executable with valgrind
* `lab8.cpp` is set up to allow you to skip specified tests. To select tests to skip, you should set a preprocessor define directive in your makefile, using the -D flag. This sets the preprocessing variable in your makefile when you compile `lab8.cpp` to an object file. Below is an example of skipping tests 3-5:
* `g++ -g -std=c++14 -c lab8.cpp -o lab8.o -DTEST3 -DTEST4 -DTEST5`
Below is just a reminder of the commands you should use to submit your code. If you cannot remember the exact process, please review lab 1.
_These commands all presume that your current working directory is within the directory tracked by `git`._
You will need to do the following when your submission is ready for grading. :warning: Make sure you have added all files to your repo.
git commit -am “final commit”
To complete your submission, you must copy and paste the commit hash into MyCourses. Go to MyCourses, select CS240, and then assignments. Select Lab 8, and where it says text submission, paste your commit hash. You can get your latest commit hash with the following command:
git rev-parse HEAD
:warning: Remember, you __MUST__ make a submission on mycourses before the deadline to be considered on time.