what is the error with bool function getElement

[marcia1010]

This program works until I get to the member function getElement, which I have commented out so the first functions work. getElement is called from the unionOfSets function. The compiler error message is:'IntegerSet::getElement': function call missing argument list; use '&IntegerSet::getElement' to create a pointer to member. Also:subscript requires array or pointer type. I have not worked with type Bool before and I know it is not correct, but what do I need here? ...I am a beginner programmer. Here's the code...

//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()
{
//	cout << "---"  << endl;
	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;
			}
		}
	}
	 cout << endl << endl << endl;

}

//bool IntegerSet::getElement(int a)
//{
//	if (numberSet[a])
//	{
//		return true;
//	}
//	else
//	{
//		return false;
//	}
		
//}


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

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

//bool IntegerSet::isEqualTo(IntegerSet)
//{
//		return false;
//}


//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;
//}


//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))
    {
        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))
    {
        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;
}

[Athar]

You're creating an array of 101 vectors. You're supposed to create one vector with 100 elements.

[marcia1010]

I changed it to an array and it works fine with the first 4 driver program tests. When I come to the unionOfSets it doesn't work with the getElement function properly. Can you look at the getElement in conjuction with the UnionOfSets? What is that supposed to look like?

[Athar]

getElement is correct, but unnecessarily complicated. It should be:

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

In, unionOfSets, you confused () with [] and == with =.

There is no need for an int array. Use an array of bool or a vector of bool.

[marcia1010]

Thanks Athar...back after some tweaking of this thing! Thank you soooo much! Now let me see how far I can get on my own.

[marcia1010]

The unionOfSets works!!!! OMG...I am thrilled!!! Thanks again. Now to go on to the intersectionOfSets. This project is making progress. Thanks for being a smartie!!