// File: HashTable.h
// Simple hash table example, using linear probing for collision resolution.

#include "HashEntry.h"

const int TABLE_SIZE = 127, NULL=0;
 
class HashMap {
private:
      HashEntry **table;
public:
      HashMap();
      // Access elements	
      int  get(int key);
      void put(int key, int value);
 
      // Need destructor, as entries are instantiated using new.
      ~HashMap();
};