//HashTable.cpp
List const & HTable::Find (char const * str) const
{
int i = hash (str);
return _aList [i];
}

void HTable::Add (char const * str, int id)
{
int i = hash (str);
_aList[i].Add (id);
}

cl main.obj *.obj -libpath:..\LinkedListFolder"
 

//link.h
class Link
{
public:
Link (int id): _id (id) {}
virtual ~Link();
int Id () const { return _id; }
private:
int _id;
};

//sLink.h
#include "Link.h"
class sLink : public Link
{
public:
  sLink (sLink* pNext, int id): Link(id), _pNext (pNext)   {}
  sLink * Next () const { return _pNext; }
private:
  sLink * _pNext;
};

List.h
#include "sLink.h"
class List
{
public:
List (): _pHead (NULL){}
~List ();
void Add ( int id );
sLink const * GetHead () const { return _pHead; }
private:
sLink * _pHead;
};

//List.cpp
#include "sList.h"

List::~List ()
{
// free the list
while ( _pHead != NULL )
{
sLink* pLink = _pHead;
_pHead = _pHead->Next(); // unlink pLink
delete pLink;
}
}

void List::Add ( int id )
{
// add in front of the list
sLink * pLink = new sLink (_pHead, id);
_pHead = pLink;
}

//HashTable.h
#include "sList.h"

const int sizeHTable = 127;

// Hash table of strings
class HTable
{
public:
List const & Find (char const * str) const;// return a short list of candidates
void Add (char const * str, int id);// add another string->id mapping
private:
int hash (char const * str) const;  // the hashing function
List _aList [sizeHTable]; // an array of (short) lists
};