The goal of this assignment is to reinforce implementation of container class concepts in C++. Specifically, the assignment is to create a dynamic array implementation of a set. Add the efficiency of each function to the documentation in the header file Use test_set.cpp as your test program.

Set.h & Test_Set.cpp is code that is already given & my code is the Set.cpp thats not working.

FILE: SET.H #ifndef _SET_H #define _SET_H #include  #include  class set { public: typedef int value_type; typedef std::size_t size_type; static const size_type INITIAL_CAPACITY = 30; set(size_type initial_capacity = INITIAL_CAPACITY); // postcondition: empty set has been created ~set(); // postcondition: set has been deallocated set (const set& source); // postcondition: a copy of source has been created set& operator = (const set& source); // postcondition: void insert (const value_type& entry); // postcondition: entry is in the set void remove (const value_type& entry); // postcondition: entry is not in the set size_type size() const; // postcondition: number of elements in the set has been returned bool contains (const value_type& entry) const; // postcondition: whether entry is in the set has been returned friend set set_union (const set& s1, const set& s2); //postcondition: union of s1 & s2 has been returned friend set set_intersection (const set& s1, const set& s2); // postcondition: intersection of s1 & s2 has been returned friend set set_difference (const set& s1, const set& s2); // postcondition: difference of s1 - s2 has been returned friend bool is_subset (const set& s1, const set& s2); // postcondition: returned whether s1 is a subset of s2 friend bool operator == (const set& s1, const set& s2); // postcondition: returned whether s1 & s2 are equal friend std::ostream& operator << (std::ostream& output, const set& s); // postcondition: s has been displayed on output private: size_type find (const value_type& entry) const; // returned location of entry in the set if entry is in the set - used otherwise void resize (unsigned int new_size); value_type* data; size_type used; size_type capacity; }; #endif 

File: Test_Set.cpp

#include "set.h" #include  #include  int main () { set s; assert (!s.contains (7)); s.insert (7); assert (s.contains (7)); s.remove (7); assert (!s.contains (7)); set s1; s1.insert (4); s1.insert (5); s1.insert (-24); s1.insert (89); s1.insert (34); s1.insert (11); s1.insert (0); s1.insert (3); s1.insert (14); s1.insert (28); std::cout << s1 << std::endl; set s2; s2.insert (6); s2.insert (-5); s2.insert (-24); s2.insert (-89); s2.insert (34); s2.insert (-11); s2.insert (0); s2.insert (3); std::cout << s2 << std::endl; set s3 = set_union (s1, s2); assert (s3.contains (4)); assert (s3.contains (0)); assert (s3.contains (-5)); std::cout << s3 << std::endl; set s4 = set_intersection (s1, s2); assert (s4.contains (34)); assert (!s4.contains (4)); assert (!s4.contains (-5)); std::cout << s4 << std::endl; set s5 = set_difference (s1, s2); assert (s5.contains (4)); assert (!s5.contains (0)); assert (!s5.contains (-5)); std::cout << s5 << std::endl; assert (is_subset (s5, s1)); set s6(s2); assert (s6 == s2); std::cout << "all tests passed" << std::endl; return 0; } 

FILE: SET.CPP (NOT WORKING)

#include "set.h" #include #include

using namespace std;

//default constructor set::set() { CAPACITY = 30; used = 0; data = new value_type[CAPACITY]; }

//method to insert the element in the set void set::insert(const value_type& entry) { if (!contains(entry)) { if (size() == CAPACITY) { double_capacity(); } data[used] = entry; used++; } }

//method to resize the capacity of the set for union void set::double_capacity() { value_type *newData = new value_type[2 * CAPACITY]; for (int i = 0; i < used; ++i) { newData[i] = data[i]; } data = newData; CAPACITY *= 2; }

//method to delete the element in the set void set::deletion(const value_type& entry) { size_type location = find(entry); if (location >= 0) { data[location] = data[used - 1]; used--; } }

//method to compute the sie of the set set::size_type set::size() const { return used; }

//destructor set::~set()

{ //delete the memory //delete data }

//method to find the location of the element in the set set::size_type set::find(const value_type& entry) const { size_type location = 0; while (location < used && data[location] != entry) location++; return location; }

//method to check the element in the set bool set::contains(const value_type& entry) const { return find(entry) < used; }

//method to find union set set_union(const set& s1, const set& s2) { set result; for (set::size_type i = 0; i < s1.size(); i++) result.insert(s1.data[i]); for (set::size_type i = 0; i < s2.size(); i++) result.insert(s2.data[i]); return result; }

//method to compute intersection set set_intersection(const set& s1, const set& s2) { set result; for (set::size_type i = 0; i < s1.size(); i++) { if (s2.contains(s1.data[i])) result.insert(s1.data[i]); } return result; }

//relative_complement method set relative_complement(const set& s1, const set& s2) { set result; for (set::size_type i = 0; i < s2.size(); i++) { if (!(s1.contains(s2.data[i]))) result.insert(s2.data[i]); } return result; }

//overloading assinment operator std::ostream& operator<< (std::ostream& output, const set& s) { for (set::size_type i = 0; i < s.size(); i++) { output << s.data[i] << " "; } return output;

}