//Set container //by baptiste prunier #include using namespace std; template class Set; template Set unio(const Set& s1, const Set& s2); template Set inter(const Set& s1, const Set& s2); template ostream& operator<<(ostream& os,const Set& s); template class Set{ T *values; unsigned int size; unsigned int trueSize; const unsigned int inc; unsigned int curr; void incSize(); friend Set unio <>(const Set& s1, const Set& s2); friend Set inter <>(const Set& s1, const Set& s2); friend ostream& operator<< <>(ostream& os,const Set& s); public: Set(unsigned int size=50, unsigned int inc=50); ~Set(); bool contains(T val) const; bool add(T val); bool remove(T val); bool empty(); bool hasNext(); T get(unsigned int id) const; T get_next(); void initialize(); unsigned int length() const; Set operator/(const Set& s); bool operator==(const Set& s); bool operator<=(const Set& s); bool operator>=(const Set& s); bool operator>(const Set& s); bool operator<(const Set& s); void operator=(const Set& s); }; int main() { Set a,b,c; for(int i=0;i<10;i++){ if(i%2==0){ a.add(i); } if(i%3==0){ b.add(i); } if(i%4==0){ c.add(i); } } cout<<"A = "<=c)< void Set::operator=(const Set& s){ size=0; for(int i=0;i