mIntegerSet.cpp

#include <mIntegerSet.h>
//IntegerSet::
IntegerSet::IntegerSet()
{
    SET [100] = {0};
}
IntegerSet::IntegerSet(bool * _isC)
{
    for (int i = 0; i<99; ++i)
        this->SET[i] = _isC[i];
}

IntegerSet IntegerSet::unionOfSets(IntegerSet _is2)
{
    bool tmpS [100] = {0};
    for (int i = 0; i<99; ++i)
        tmpS[i] = (_is2.SET[i] || this->SET);
    return IntegerSet(tmpS);
}

IntegerSet IntegerSet::interseptionOfSets(IntegerSet _is2)
{
    bool tmpS [100] = {0};
    for (int i = 0; i<99; ++i)
        tmpS[i] = (_is2.SET[i] && this->SET);
    return IntegerSet(tmpS);
}
void IntegerSet::insertElement(unsigned int _p)
{
    SET[_p-1] = true;
}
void IntegerSet::deleteElement(unsigned int _p)
{
    SET[_p-1] = false;
}

void IntegerSet::printSet()
{
    for (int i = 0; i<99; ++i)
    {
        if (SET[i])
           std::cout << i+1 << " ";
    }
    std::cout << std::endl;
}

bool IntegerSet::isEqualTo(IntegerSet _is2)
{
    unsigned int i = 0;
    bool k = false;
    do
    {
        if( k = (SET[i] != _is2.SET[i]))
        {
            return false;
            break;
        }
       ++i;
    }
    while(!k && i<100);
    return true;
}