rejecting and ignoring invalid values that do not belong in a set

[whispywaldo]

I need to return a set of elements in an array via a parameter from this member function int IntegerSet::elements (int arr[]) const. Also, I need a bool member function that determines if the element in the array is true or false with this member function bool IntegerSet::isElem(int m) const. Overall I need the output to display in an array set like s1: {} and s3: {2 4 5 13 20}. The comment in the int main are what the output is suppose to be.

[code]
Put the code you need help with here.
#include <iostream>
#include <string>

using namespace std;


class IntegerSet
{
private:
bool array[255];

public:
IntegerSet();
IntegerSet(int m);
IntegerSet(const int arr[], int n);
int elements (int arr[]) const;
bool isElem(int m) const;
IntegerSet &insert(int k); //allow cascading calls
IntegerSet &remove(int k);
IntegerSet operator+(IntegerSet& s);
IntegerSet operator*(IntegerSet& s);
bool operator<=(IntegerSet s);
bool operator>=(IntegerSet s);

friend ostream &operator<<(ostream &out, const IntegerSet s);
friend istream &operator>>(istream &in, IntegerSet s);
};

IntegerSet::IntegerSet()
{
array[255]= {false};
}

IntegerSet::IntegerSet(int m)
{
array[m] = {false};
if(m>255)
{
cout<<"Beyond 255";
}
else
{
array[m] = true;
}
}

IntegerSet::IntegerSet(const int arr[], int n)
{
for(int i =0; i<256; i++)
{
array[i] = false;
}
for (int i = 0; i<n; i++)
{
int val = array[i];
array[val] = true;
}
}

int IntegerSet::elements (int arr[]) const
{
int count;
for(int i = 0; i<count; i++)

return arr[count];
}

bool IntegerSet::isElem(int m) const
{
if(m>255)
{
return false;
}
else
{
return true;
}
}

IntegerSet& IntegerSet::insert(int k)
{
if(k>255)
{
cout<<"Beyond 255";
}
else
{
this->array[k] = true;
}

return *this;
}

IntegerSet& IntegerSet::remove(int k)
{
if(k>255)
{
cout<<"Beyond 255";
}
else
{
this->array[k] = false;
}

return *this;
}

IntegerSet IntegerSet::operator+(IntegerSet& s)
{
IntegerSet r;
for(int i = 0; i<256; i++)
{
if(this->array[i] == true || s.array[i] == true)
{
r.array[i] = true;
}
}
return r;
}

IntegerSet IntegerSet::operator*(IntegerSet& s)
{
IntegerSet r;
for(int i = 0; i<256; i++)
{
if(this->array[i] == true && s.array[i] == true)
{
r.array[i] = true;
}
}
return r;
}

bool IntegerSet::operator<=(IntegerSet s)
{
for(int i = 0; i<256; i++)
{
if(this->array[i] == true && s.array[i] !=true)
{
return false;
}
else
{
return true;
}
}

}

bool IntegerSet::operator>=(IntegerSet s)
{
for(int i = 0; i<256; i++)
{
if(s.array[i] == true && this->array[i] !=true)
{
return false;
}
else
{
return true;
}
}

}

ostream &operator<<(ostream &out, const IntegerSet s)
{
for(int i = 0; i<256; i++)
{
if(s.array[i] == true)
{
out<<i<<" ";
}
else
{
break;
}
}
return out;
}

istream &operator>>(istream &in, IntegerSet s)
{
int n = 0;
while(n==1)
{
in>>n;
if(n!=-1)
{
s.array[n] = true;
}
else
{
break;
}
}
return in;
}

void print1(IntegerSet s); // pass by value
void print2(IntegerSet &s); // pass by reference
void print3(const IntegerSet &s); // pass by reference with const

int main()
{
int arr1[6] = {5, 2, 20, 4, 13, 256};
int arr2[256]; // can hold up to 256 elements
int count;
IntegerSet s1; // {}
IntegerSet s2(2); // {2}
IntegerSet s3(arr1, 6); // {2 4 5 13 20}, 256 was ignored
IntegerSet s4 = s1; // {}
IntegerSet s5 = s2; // {2}

cout << "TC1: s1 should be empty\n";
cout << "s1: " << s1 << endl; // s1: {}

cout << "TC2: s3 should have 2, 4, 5, 13, and 20\n";
s3.remove(500); // ignore since it is not a valid element
cout << "remove an illegal element (500) so ignore completely\n";
cout << "s3: " << s3 << endl; // s3: {2 4 5 13 20}

cout << "TC3: s5 should have 2\n";
cout << "s5: " << s5 << endl; // s5: {2}

s2.insert(7); // s2 is now {2 7}
cout << "TC4: insert 7 into s2 so s2 should have 2 and 7\n";
cout << "s2: " << s2 << endl; // s2: {2 7}

s4 = s2 * s3; // s4 is now {2}, s2 and s3 are still the same
cout << "TC5: intersection of s2 and s3 should be 2\n";
cout << "s4: " << s4 << endl; // s4: {2}

cout << "TC6: input 5 300 255 so s5 should have 5 and 255\n";
cout << "Enter values for a set (-1 to stop):\n";
cin >> s5; // enter: 5 300 255 -1
// s5 is now {5, 255}, 300 was ignore
cout << "s5: " << s5 << endl; // s5: {5 255}

cout << "TC7: cascading calls\n";
s3.remove(7).remove(2); // s3 is now {4 5 13 20}
// 2 was removed and 7 is not in the set
s3.insert(99).insert(5);// s3 is now {4 5 13 20 99}
// 99 was inserted and 5 is already in the set

cout << "removed 2 and inserted 99 so s3 should have 4, 5, 13, 20, and 99\n";
cout << "s3: " << s3 << endl; // s3: {4 5 13 20 99}

cout << "TC8: getting the count (5) and elements for s3 (4 5 13 20 99)\n";
count = s3.elements(arr2);
cout << "count: " << count << endl;
cout << "Element(s): ";
for (int i = 0; i < count; i++)
cout << arr2[i] << " ";
cout << endl;

cout << "TC9: s4 should not be a subset of s3\n";
if (s4 <= s3) // s4 is not a subset of s3
cout << "s4 is a subset of s3\n";
else
cout << "s4 is not a subset of s3\n";

cout << "TC10: assign s3 to s4\n";
s4 = s3; // s4: {4 5 13 20 99}
cout << "s4 now is a subset of s3\n";
if (s4 <= s3) // s4 is now a subset of s3
cout << "s4 is a subset of s3\n";
else
cout << "s4 is not a subset of s3\n";

cout << "TC11: passing object and 0 should not be in s3\n";
print1(s3);
print2(s3);
print3(s3);

// Create more objects and test cases below

return 0;
}

void print1(IntegerSet s)
{
if (s.isElem(0))
cout << "print1 (pass by value): 0 is in the set." << endl;
else
cout << "print1 (pass by value): 0 is not in the set." << endl;
}

void print2(IntegerSet &s)
{
if (s.isElem(0))
cout << "print2 (pass by reference): 0 is in the set." << endl;
else
cout << "print2 (pass by reference): 0 is not in the set." << endl;
}

void print3(const IntegerSet &s)
{
if (s.isElem(0))
cout << "print3 (pass by reference with const): 0 is in the set." << endl;
else
cout << "print3 (pass by reference with const): 0 is not in the set." << endl;
}

[Kiryu]

http://www.cplusplus.com/forum/beginner/1/

With much thanks