#include <iostream>
#include <fstream>
#include <vector>

using namespace std;


// http://www.cs.yorku.ca/~oz/hash.html
int hash2( char *str )
{
    unsigned int hash = 0;
    int c;
    while ( c = *str++ )
        hash += c;
    return hash;
}

// http://www.softlab.od.ua/algo/other/alg/node29.html
int hash3 ( char *str )
{
    int total = 0;
    while ( *str )
    {
        total += *str++;
    }
    return ( total % 256 );
}

/* Peter Weinberger's */
//http://www.sparknotes.com/cs/searching/hashtables/section2.rhtml
int hash4(char *s)
{
	char *p;
	unsigned int h, g;
	h = 0;
	for(p=s; *p!='\0'; p++){
		h = (h<<4) + *p;
		if (g = h&0xF0000000) {
			h ^= g>>24;
			h ^= g;
		}
	}
	return h % 211;
}

int main()
{
	ifstream inputText;
	vector<char> inputString;
	//vector<char> hashTbl;
	char * temp;
	typedef int (*hashValType)(char*);
	hashValType hashArray[5];

	hashArray[1] = &hash2;
	hashArray[2] = &hash3;
	hashArray[3] = &hash4;
	
	inputText.open("wordlist.txt");

	//take in words from file
	while(!inputText.eof())
	{
		inputText >> temp;
		inputString.push_back(*temp);
		cout << temp;
	}
	
       //is that correct syntax for the hash table?
	vector<int> hashTbl[113];
	
	int x, y;
       //loop for amount of hash tables
	for(x = 0; x < 5; x++)
	{
             //loop for words in list to put in each hash table individually
		for(y = 0; y < 50; y++)
		{
			
			//I should do the key value and pass to the functions in here
                     //something like hashArray[x] (key);
		}
	}
	
}

#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

vector<int>::size_type hash1(char *key){
    vector<int>::size_type hash = 0;
    register unsigned long temp;
    while ( *key ){
        hash = ( hash << 4 ) + *key++;
        if ( (temp = ( hash & 0xf0000000 )) ){
            hash ^= ( temp >> 24 );
            hash ^= temp;
        }
    }
    return hash;
}

// http://www.softlab.od.ua/algo/other/alg/node29.html
vector< int>::size_type hash2 ( char *str )
{
    vector<int>::size_type total = 0;

    while ( *str )
    {
        total += *str++;
    }

    return ( total % 256 );
}

/* Peter Weinberger's */
//http://www.sparknotes.com/cs/searching/hashtables/section2.rhtml
vector< int>::size_type hash3(char *s)
{
	char *p;
	vector<int>::size_type h, g;
	h = 0;
	for(p=s; *p!='\0'; p++){
		h = (h<<4) + *p;
		if (g = h&0xF0000000) {
			h ^= g>>24;
			h ^= g;
		}
	}
	return h % 211;
}

int main()
{
	ifstream inputText;
	int tableSize = 113, collisions = 0, x;
	vector<char *> inputString;
	vector<int> hashTbl;
	vector<int> indexList;
	char * temp;
	vector<int>::size_type (*hashArray[5])(char *) = {hash1, hash2, hash3};

	inputText.open("mispro.txt");

	//take in words from file
	while(!inputText.eof())
	{
		temp = new char[64];
		inputText.getline(temp, 64);
		inputString.push_back(temp);
	}

	
	hashTbl.resize(tableSize);
	hashTbl.clear();
	for(x = 0; x < 112; x++)
		hashTbl[x] = 0;
	

	int y, hashIndex;
	for(x = 0; x < 3; x++)
	{
		for(y = 0; y < tableSize; y++)
		{
			hashIndex = hashArray[x](inputString[y]) % tableSize;
			//check to see if index is open, if not, go somewhere else
			//record collisions, decide to increase table size
			if(hashTbl[hashIndex] != 0)
			{
				collisions++;
				//deal with collisions
				
				hashIndex++;
				if(hashIndex == hashTbl.size())
				{
					hashIndex = 0;
				}
				
				while(hashTbl[hashIndex] != 0)
					hashIndex++;
					
				hashTbl[hashIndex] = 1;
					
			}
			else
				hashTbl[hashIndex] = 1;
				
		}
		cout << "Hash Function " << x + 1 << " had " << collisions << " many collisions." << endl;
		collisions = 0;
		hashTbl.clear();
		hashTbl.resize(tableSize);
	}
}