solved1 thx

[alware]

hashing

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cmath>

#include "lhash.h"

using namespace std;

lhash::lhash()
{
	for(int i = 0; i< tablesize; i++)
	{
		hashtable[i] = new item;
		hashtable[i]->name = "empty";
		hashtable[i]->drink = "empty";
		hashtable[i]->next = NULL;
	}

}

void lhash::additem(string name, string drink)
{
	int index= ash(name);

	if(hashtable[index]->name == "empty")
	{
		hashtable[index]->name = name;
		hashtable[index]->drink = drink;
	}
	else
	{
		item* ptr = hashtable[index];
		item* n = new item;
		n->name = name;
		n->drink = drink;
		n->next = NULL;
		while(ptr->next != NULL)
		{
			ptr= ptr->next;
		}
		ptr->next = n;
	}
}

int lhash::numitemsinindex(int index)
{
	int count= 0;

	if(hashtable[index]->name == "empty")
	{
		return count;
	}
	else
	{
		count++;
		item* ptr = hashtable[index];
		while(ptr->next != NULL)
		{
			count++;
			ptr= ptr->next;
		}
	}
	return count;
}
void lhash::printtable()
{
	int number;
	for(int i = 0; i< tablesize ; i++)
	{
		number = numitemsinindex(i);
		cout<<"------------------\n";
		cout<<"index = " << i << endl;
		cout<<hashtable[i]->name<<endl;
		cout<<hashtable[i]->drink<< endl;
		cout<< "# of items = "<< number<< endl;
		cout<<"------------------\n";

	}
}

void lhash::printitemsinindex(int index)
{
	item* ptr = hashtable[index];

	if(ptr-> name == "empty")
	{
		cout<< "index = "<< index<< " is empty"<< endl;
	}
	else
	{
		cout<< "index "<<index<< " contains the following item\n";

		while(ptr != NULL)
		{
			cout<<"=================\n";
			cout<< ptr->name <<endl;
			cout<< ptr->drink << endl;
			cout<<"=================\n";
			ptr = ptr->next;
		}
	}
}
int lhash::ash(string key)
{
	int hash =0;
	int index;

	// adding askii value of each letter of ur umput

	for(int i=0; i< key.length(); i++)
	{
		hash= hash + (int)key[i];
		//cout<< "hash = "<< hash << endl;
	}

	index = hash % tablesize;


	return index;
}
  //
//  CuckooHashTable.h
//  CuckooHashTable
//
#include "CuckooHashTable.h"
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cmath>

using namespace std;

CuckooHashTable::CuckooHashTable()
{
//  Initialize hastable
	for (int i=0; i<2; i++)
	{
		vector<string> new_table;
		for (int j=0; j<LOGICAL_SIZE; j++)
			new_table.push_back("-");
		contents.push_back(new_table);
	}
	currentSize = 0;
}

int CuckooHashTable::hashCode(string value, int which)
{
//  Compute hash function for input 'value', table 'which'
	if (which == 1)
		return atoi(value.c_str()) % 13;
	else if (which == 2)
		return 11 - (atoi(value.c_str()) % 11);
	else 
		return LOGICAL_SIZE;
}

void CuckooHashTable::add(string value)
{
//  Insert 'value' to hash table
	int hash_type = 1;
	int index = hashCode(value, hash_type);

	string start_value = value;
	int    start_index = index;
	int    start_hasht = hash_type;
	do {
		value.swap(contents[hash_type-1][index]);
		hash_type = 3 - hash_type;
		index = hashCode(value, hash_type);
		
		if (value == start_value &&
			index == start_index && 
			hash_type == start_hasht){
			cout << "ERROR: Inserting " + value + " causes an infinite loop.\n";
			return;
		}
	}
	while (value != "-");
	this->currentSize++;
}

void CuckooHashTable::print()
{
//  Print the contents of the table.
	for (int i=0; i<2; i++)
	{
		cout << "Table " << i+1 << endl;
		for (int j=0; j<LOGICAL_SIZE; j++)
			cout << contents[i][j] << endl;
		cout << endl;
	}
}