// *****************************************************************
// Author:			Zhixiang Chen
// Class:			CSCI/CMPE 3333, Fall 2014
// Lab 3:			Hashing, separate chaining 
// Date:			08/2014
// Comment:			The code here is meant to be revised.
//-----------------------------------------------------------------
// Description: This program is to implement a generic hash table using 
//				separate chaining to resolve collisions.
// *****************************************************************
#include <iostream>
#include <cassert>
#include <string> 
#include <cstdlib>
#include <ctime>

#include "lab3333_3_.h"	

using namespace std; 

int main()
{
	/**********************************************************
	 Part A: Some practice
	 **********************************************************/

	//pratice integer hash table
	int S = 10; 
	hashTableType<int, intHashFunctor> ht(S); 
	int num, i, j, N=20; 
	bool tag; 

	//load the table
	srand(time(0)); 
	for (i=0; i<40; i++)
	{
		num = rand()%100; 
		j = hashInt(num, ht.getTableSize());
		ht.insert(num); 
	}
	//print hash table
	cout<<" table size = " << ht.getTableSize()<<endl
		<<" table count = " <<ht.getTableCount()<<endl; 
	for (i=0; i<S; i++)
	{
		cout<<" i = " << i <<endl; 
		ht.print(i); 
		cout<<endl<<"*************************"<<endl;
	}

	/*
	cout<<" testing rehash " <<endl; 
	ht.reHash(); 
	//print new hash table
	cout<<" new size = " << ht.getTableSize()<<endl
		<<" new count = " <<ht.getTableCount()<<endl; 
	for (i=0; i<ht.getTableSize(); i++)
	{
		cout<<" i = " << i <<endl; 
		ht.print(i); 
		cout<<endl<<"*************************"<<endl;
	}
	*/
	
	//search hash table
	for (i=0; i<S; i++)
	{
		tag = false; 
		num = rand()%100;
		j = hashInt(num, ht.getTableSize());
		tag = ht.search(num);
		if (tag)
		{
			cout<<" found " <<num << " at j = " << j <<"............" <<endl; 
			ht.print(j); 
			cout<<endl<<"after removal --------------------------------"<<endl; 
			ht.remove(num); 
			ht.print(j); 
			cout<<endl<<"--------------------------------"<<endl; 
		}
		else
			cout<< " failed to find " << num  <<endl; 
		system("pause"); 
	}
	

	/**********************************************************************
	 Part B: Redo part A. Here, you shall practice a string type hashTable. 
	 You can use the hash function hashStr to map a string to an int. You 
	 shall also define a function to generate a random string.  
	 **********************************************************************/
	
	//Write your code here

	/**********************************************************************
	 Part C:  Redo part A. Here, you shall practice a personType hashTable. 
	 You use the hash function hashStr to map a person's name to an int. You 
	 shall also define a function to generate a random person.  
	 ***********************************************************************/
	
	//Write your code here


	//complete the program
	return 0; 
}