C / C++ / MFC

#include <iostream>
#include <string>
#include <cstdlib>

#include "table1.h"

using namespace std;



void main()
{
   table<tractor> t;
   t.hash(100);
}

#ifndef TABLE1_H
#define TABLE1_1
#include <cstdlib>  
#include <cassert>


const size_t CAPACITY = 811;
int NEVER_USED = -1;
int PREVIOUSLY_USED = -2;


struct tractor
{
   int key;
   

};




template<class recordType>
class table
{
	//MEMBER CONSTANTS
private:	
	
	
	
	//MEMBER VARIABLES
    recordType  data[CAPACITY];
	size_t used;

	//HELPER FUNCTIONS
	template<class recordType>
	size_t hash(int key) const
	{
		return (key % CAPACITY);
	}
	size_t next_index(size_t index) const
	{
		if((index+1)==CAPACITY)
			return ((index + 1) % CAPACITY);

	}
	void find_index(int key, bool &found, size_t &index) const
	{
		size_t count; //number of entries that have been examined
		count = 0;

		i=hash(key);
		while((count<CAPACITY) && (!never_used(i)) && (data[i].key != key))
		{
			++count;
			i = next_index(i);
		}
		found = (data[i].key == key);


	}
	bool never_used(size_t index) const;
	bool is_vacant(size_t index) const;

public:

	
	//CONSTRUCTOR 
	
    
	table()
	{
		size_t i;
		used = 0;
		for(i=0; i<CAPACITY; ++i)
		 data[i].key = NEVER_USED;
		
	}
	

	//MODIFICATION MEMBER FUNCTIONS
	template<class recordType>
	 void insert(const recordType &entry)
	{
		bool already_present;
		size_t index;

		assert(entry.key >= 0);

		//SET INDEX SO THAT DATA[INDEX] IS THE SPOT TO PLACE THE NEW ENTRY
		find_index(entry.key, already_present, index);

		//IF THE KEY WASN'T ALREADY THERE, THEN FIND THE LOCATION FOR THE NEW ENTRY.
		if(!already_present)
		{
			assert(size() < CAPACITY);
			index = hash(entry.key);
			while(!is_vacant(index))
				index = next_index(index);
			++used;
		}
		data[index] = entry;
	}

    template<class recordType>
	void remove(int key)
	{
		bool found;
		std::size_t index; //SPOT WHERE DATA[INDEX].KEY==KEY

		assert(key >= 0);

		find_index(key,found,index);
		if(found)
		{
			//THE KEY WAS FOUND SO REMOVE THIS RECORD AND REDUCE USED BY 1
			data[index].key = PREVIOUSLY_USED;  //INDICATES A SPOT THATS NO LONGER IN USE
			--used;
		}
	
	}

	
	//CONSTANT MEMBER FUNCTIONS
	bool is_present(int key) const;
	void find(int key, bool &found, recordType &result) const;
	size_t size() const
	{
		return used;
	}
};


#endif