#ifndef HASHTABLE_H_
#define HASHTABLE_H_

#include "BinarySearchTree.h"

#define PRIME  217

template <class T>
class HashTable
{
public:
	void Insert(const T& elem);
	T Exsits(const T& elem);
private:
	BinarySearchTree<T> _tree[PRIME];
};

int Key(const std::string& elem);


template <class T>
void HashTable<T>::Insert(const T& elem)
{
	_tree[Key(elem)].Insert(elem);
}

template <class T>
T HashTable<T>::Exsits(const T& elem)
{
	return _tree[Key(elem)].Exists(elem);
}

#endif