HashTable.cpp

// Implementation file for the Hash class
// Written By: A. Student
// Changed by: Tauhid Malik

#include <string>

#include "HashTable.h"

using namespace std;

/*~*~*~*
  A simple hash function 
 *~**/
int HashTable::_hash(string key) const
{
    int sum = 0;
    for (int i = 0; key[i]; i++)
        sum += key[i];
    return sum % hashSize;
};

/*~*~*~*
  hash insert - linear probe
*~**/

bool HashTable::insert(const Student &itemIn)
{
    if (count == hashSize)
        return false;

    
    int hashIndex = _hash(itemIn.getName());
        
    for (int i = 0; i < hashSize; i++) {
        int index = (hashIndex + i) % hashSize;

        if (!(hashAry[index].getOccupied())) {
            hashAry[index].setItem(itemIn);
            hashAry[index].setOccupied(1);
            break;
        }

        hashAry[index].setNoCollisions(hashAry[index].getNoCollisions() + 1);
    }
   
    return true;
}

/*~*~*~*
   hash delete - linear probe
*~**/

bool HashTable::remove(Student &itemOut)
{
    return false;
}

/*~*~*~*
   hash search - linear probe
   search for key
   if found: 
      - copy data to itemOut
      - copy number of collisions for this key to noCol
      - returns true
   if not found, returns false
*~**/
bool HashTable::search(Student &itemOut, int &noCol, string key)
{
   /* write your code here */
     
    return false;
}