#include <iostream> using namespace std; struct HashEntry { tableSize = 0; strin
ID: 3610029 • Letter: #
Question
#include <iostream>using namespace std;
struct HashEntry
{
tableSize = 0;
string item;
EntryType info;
};
class Dictionary
{
public:
enum EntryType {ACTIVE, EMPTY, DELETED};
Dictionary();
// Creates an empty dictionary;
private:
int tableSize;
};
/************Class file **************************/
// Implementation file for AVL search tree
#include "Dictionary.h"
#include <fstream>
#include <cctype>
using namespace std;
Dictionary::Dictionary()
{
}
HashEntry* Dictionary::rehash()
{
HashEntry *newTable;
newTable = new HashEntry[tableSize];
//Copy contents
for(int i = 0; i < tableSize; i++)
if(HashTable[i].info == HashEntry.ACTIVE)
{//insert
int index = findNextPos(HashTable[i].item);
}
delete [] HashTable;
return newTable;
}
This is just the part of the code giving me the problem.
Any ideas would be greatly appreciated.
Thanks in advance