function call isEqualTo - how to do this?

[marcia1010]

The driver program is calling this function which I need to write. It is called in two instances, one is: if (s.isEqualTo(emptySet)) the other is: if (evenset.isEqualTo(oddSet)). I have declared it in the .h file as type bool, which I hope is right. I need to know how to compare two arrays for equality. I am a beginner and this assignment is blowing my mind. So far it works for the print, insert, delete, union and intersection of the sets. I have worked on it for 3 days. Remaining resolution are the last several tests in the driver: isEqualTo and primeSet.
Here's my code so far:

//driver program for testing the IntegerSet class.
//Instantiates several IntegerSet objects and executes 
//all member functions of the IntegerSet class.
//
#include <iostream>
using namespace std;

#include "Second_Try_Lab05.h"  //include IntegerSet class definition

int main()
{
    // IntegerSet holds integers in the range 0..100
    const int maxInteger = 100;

    // Test default constructor --
    // Create an empty set s
    IntegerSet s;
    cout << "Initial empty set: " << endl;
    s.printSet();
    cout << endl;
     
    // Test insertElement function --
    // Insert powers of 5 into Integer set s
    for (int i = 0; i <= maxInteger; i += 5)
    {
       s.insertElement(i);
    }
    cout << "Inserted powers of 5: " << endl;
	s.printSet();
    cout << endl;

    // Test deleteElement Function -- 
    // Delete powers of 10 from IntegerSet s	
    for (int i = 0; i <= maxInteger; i+= 10)
    {
        s.deleteElement(i);
    }
    cout << "Deleted powers of 10: " << endl;
    s.printSet();
    cout << endl;

    // Create a set of even integers
    IntegerSet evenSet;
    for (int i = 0; i <= maxInteger; i+=2)
    {
        evenSet.insertElement(i);
    }
    cout << "Even Integers: " << endl;
    evenSet.printSet();
    cout << endl;

    // Create a set of odd integers
    IntegerSet oddSet;
    for (int i = 1; i <= maxInteger; i+=2)
    {
        oddSet.insertElement(i);
    }
    cout << "Odd Integers: " << endl;
    oddSet.printSet();
    cout << endl;

    // Test unionOfSets Function --
    // Print union of even and odd integers which
    // results in a set of all integers between 0..100
    s = evenSet.unionOfSets(oddSet);
    cout << "Union of Even and Odd Integers: " << endl;
    s.printSet();
    cout << endl;

    // Test intersectionOfSets Function --
    // Print intersection of even and odd integers which
    // results in an empty set
    s = evenSet.intersectionOfSets(oddSet);
    cout << "Intersection of Even and Odd Integers: " << endl;
    s.printSet();
    cout << endl;

    // Test isEqualTo Function --
    // Even integers should not be equal to odd integers.
//    if (evenSet.isEqualTo(oddSet))  //HERE IS ONE OF TWO FUNCTION CALLS FOR THE ISeQUALtO MEMBER FUNCTION
    {
        cout << "Even Integer Set is equal "
             << "to Odd Integer Set." << endl;
    }
    else
    {
        cout << "Even Integer Set is NOT equal "
             << "to Odd Integer Set." << endl;
    }

    // Test isEqualTo Function --
    // Set s, the intersection of even and odd integers,
    // should equal the empty set.
    IntegerSet emptySet;
//    if (s.isEqualTo(emptySet))   //HERE IS THE SECOND OF TWO FUNCTION CALLS FOR THE ISeQUALtO MEMBER FUNCTION
    {
        cout << "Intersection of even and odd integers "
             << "is equal to the Empty Set." << endl;
    }
    else
    {
        cout << "Intersection of even and odd integers "
             << "is NOT equal to the Empty Set." << endl;
    }
    cout << endl;

    // Test constructor from array of integers --
    // Create a set of prime numbers between 0 to 100
    const int numPrimes = 25;
    int primes[numPrimes] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 
                             31, 37, 41, 43, 47, 53, 59, 61, 67, 
                             71, 73, 79, 83, 89, 97};
    IntegerSet primeSet(primes, numPrimes);
    cout << "Prime Integers: " << endl;
    
	primeSet.printSet();
    cout << endl;

    return 0;
}

//IntegerSet.h   Class declaration
//
//IntegerSet class declaration

#include <iostream>
#include <vector>
using namespace std;

//prevents multiple inclusion of header
#ifndef INTEGERSET_H
#define INTEGERSET_H


const int maxInteger =100;

class IntegerSet
{
public:
	IntegerSet();
	IntegerSet(int [], int);
	void printSet();
	void insertElement(int);
	void deleteElement(int);
	bool getElement(int);
	IntegerSet unionOfSets(IntegerSet);
	IntegerSet intersectionOfSets(IntegerSet);
//	bool isEqualTo(IntegerSet);
private:
	int numberSet [101];


}; //end class IntegerSet
#endif

//IntegerSet.cpp
//IntegerSet class member function definitions
#include <iostream>
#include "Second_Try_Lab05.h"
using namespace std;

//constructor
IntegerSet::IntegerSet()
{
	for ( int a = 0; a <= maxInteger; a++)
	{
		numberSet[a] = false;
	}

}			

IntegerSet::IntegerSet( int b[], int SIZE)
{
	
}


void IntegerSet::printSet()
{
	int count = 1;
	
	for (int j = 0; j <=maxInteger; j++)
	{
		if (count%20 == 0)
		{
			if (numberSet[j])
			{
				cout << j << "  " << endl;
				count += 1;
			}
		}
		else
		{
			if (numberSet[j])
			{
				cout << j << "  ";
				count += 1;
			}
		}
	  
	}
	
	if (count == 1)
		{
		 cout << "---"  << endl;
		}

	cout << endl << endl;

}

bool IntegerSet::getElement(int a)
{
	return numberSet[a];
}



void IntegerSet::insertElement(int a)
{
	numberSet[a] = 	true;
	return;
}

void IntegerSet::deleteElement(int a)
{
	numberSet[a] = false;
	return;
}

//bool IntegerSet::isEqualTo(IntegerSet)
//{
//		what goes here???
//}


IntegerSet IntegerSet::unionOfSets(IntegerSet setA)
{
	
	IntegerSet s;
	
	for (int k = 0; k <= maxInteger; k++)
	{
		if (setA.getElement(k) == true || numberSet[k] == true)
		{
			s.insertElement(k);
		}
	}

	return s;
}


IntegerSet IntegerSet::intersectionOfSets(IntegerSet setA)
{
	
	IntegerSet s;
	
	for (int k = 0; k <= maxInteger; k++)
	{
		if (setA.getElement(k) == true && numberSet[k] == true)
		{
			s.insertElement(k);
		}
	}

	return s;
}

[Duthomhas]

You are very close. Remember, two sets are equal if they contain the exact same elements. So, you need to loop through all the integers and check to see if both sets return the same values for getElement(k).

For your second constructor (the one that takes an array of integers), all you need to do is loop through the integers and add each one to your set.

Hope this helps.

[marcia1010]

WOW...It all works now! I thought this was my worst nightmare three days ago. Finally it came together, with a little help! A sincere thanks for picking your wonderful brain. Mission accomplished.

[Duthomhas]

You're welcome!

Though, you should know that my brain is tired and barely working this week...


All computer science stuff (and math, and anything else you wish to learn) just takes some time working with it, and being frustrated with it, until you can wrap your own mind around it. After that things start to make more and more sense. All it takes is some perseverance.

Glad to have been of help. :O)