Sets By Varick Erickson Introduction For this project you will implement a Set using a hash based chain implementation (each bucket can contain multiple elements). template class SetT { public:...

Ans 1) THIS IS THE CODE FOR THE REQUIRED QUESTION
#include
#include
#include
#include
using namespace std;
template
class SetT
{
public:
SetT();
SetT(int numBucks);
~SetT();
void Add(T elem);
void Remove(T elem);
bool Contains(T elem);
void Union(SetT otherSet);
void Difference(SetT otherSet);
void Intersection(SetT otherSet);
void Filter(bool fnc(T elem)); // Extra Credit
void Traverse(void visit(T& elem));
int Size() { return numElems ;}
void show(){
for(int i=0; icout<";
for(auto it= buckets[i]->begin(); it!= buckets[i]->end(); it++){
cout<<*it<<"\t";
}
cout<}
}
SetT operator+(T elem); // Add
SetT operator+(SetT& other); // Union
SetT operator*(SetT& other); // Intersection
SetT operator-(T elem); // Remove
SetT operator-(SetT& other); // Difference
private:
forward_list** buckets; // An array of forward_list's (ie, each index is a forward_list pointer)
int numBuckets;
int getHashIndex(const T& elem);
int numElems;
// Any other private functions and variables you need
};
template
int SetT::getHashIndex(const T& key)
{
// This is done... No touching!
unordered_map mapper;
typename unordered_map::hasher hashFunction = mapper.hash_function();
return static_cast(hashFunction(key) % numBuckets);
}
template
SetT::SetT():numElems(0)
{
// Create an array of forward_lists and initially set each bucket to null
buckets = new forward_list*[100];
for (int i = 0; i < 100; i++) {
buckets[i] = new forward_list;
}
numBuckets = 100;
}
template
SetT::~SetT()
{
}
template
void SetT::Add(T elem)
{
// Add elem to the set if it doesn't already contain it
// Get the bucket index and check to see if the bucket
// contains elements. If the bucket has never had elements,
// then initialize the forward_list of that bucket. Add the
// element to the bucket.
int...