c++ stl 哈希表（未完成）

#include "stdafx.h"
#include <iostream>
#include <string>
#include <vector>
#include <list>

using namespace std;

int hash(const string& str , int hashTableSize)
{
 int hasVal = 0;
 for ( int i =0 ;i < str.size() ;i++)
 {
  hasVal += str[i];
 }
 return hasVal%hashTableSize;
}

int hash (int keys)
{
 return keys;
}

class Employee
{
public:
 const string & getName() {return name;}
 bool operator == (const Employee& rhs)const
 {
  return getName() == rhs.getName();
 }
 bool operator != (const Employee& rhs)const
 {
  return !(*this == rhs);
 }
private:
 string name;
 double salary;
 int seniority;
};

int hash(const Employee& item)
{
 return hash(item.getName());
}

template <typename HashedObj>
class HashTable
{
public:
 explicit HashTable(int size = 101);
 bool contains(const HashedObj & x)const;
 void makeEmpty();
 void insert(const HashedObj & x);
 void remove(const HashedObj & x);
private:
 vector<list<HashedObj> > theLists;
 int currentSize;

 void rehash();

 int myhash(const HashedObj & x)const;
};

void HashTable::makeEmpty()
{
 for ( int i =0 ;i < theLists.size(); i++)
 {
  theLists[i].clear();
 }
}

bool HashTable::contains(const HashedObj & x)const
{
 const list<HashedObj> & whichlist = theLists[ myhash(x) ];
 return find(whichlist.begin(), whichlist.end(),x)!=whichlist.end();
}

bool HashTable::remove(const HashedObj& x)
{
 list< HashedObj>& whichlist = theLists[ myhash(x)];
 list<HashedObj>::iterator iter = find ( whichlist.begin(),whichlist.end(),x);
 if ( iter == whichlist.end())
 {
  return false;
 }
 else
 {
  whichlist.erase(iter);
 }
 --currentSize;
 return true;
}

bool HashTable::insert(const HashedObj &x)
{
 list<HashedObj>& whichlist = theLists[hash(HashedObj& x)];
 if ( find(whichlist.begin(),whichlist.end(),x) == whichlist.end())
 {
  whichlist.push_back(x);
 }
 else
 {
  return false;
 }
 if ( ++currentSize > theLists.size())
 {
  rehash();
 }
 return true;
}

 

void main(void)
{

}