#include <cstdio>
#include <vector>
#include <cctype>
#include "timer.h"
#include <cmath>
using namespace std;

template <class T>
class myHash {
 private:
   //hashsize is number you are going to decided on.
   const static int HASHSIZE = ?;
   T * hash; 
   int size;
public:

  myHash() {
    size =0;
    hash = new T[HASHSIZE];
    for(int i=0; i<HASHSIZE; i++) {
      hash[i]="";
    }
  }
  ~myHash() {
     delete [] hash;
  }

  int findhash(string toHash) {
    int i; long int val = 0;

    for (i = 0; i <= toHash.size(); i++) {
        val += (int)toHash[i] * (i * i);
    }
    //divide by the size of the array to make sure you always get something within bounds
    return val % HASHSIZE;
}


  int getSize() { return size;}
  bool isEmpty() { return size==0;}

  void insert (T item) {
    int key = findhash(item);
    if (hash[key].empty() ) {
      hash[key] = item;
      size++;
    } else  {
       //problem here
    }
  }

  bool find (T item) {
    int key = findhash(item);
    if (hash[key].compare(item) ==0) {     //found it
      return true;
    } else if (hash[key].empty() ) {
      return false;
    } else {
      //problem here
    } 
    return false;
  }
};