#include <iostream>

#include <set>

#include <algorithm>

#include <iterator>

#include <functional>

#include "SetTest.h"

using namespace std;

void SetTest::operationDemo()

{

    // type of the collection:

    // - no duplicates

    // - elements are integral values

    // - descending order

    set<int, greater<int>> coll1;

    // insert elements in random order using different member functions

    coll1.insert({ , , , , ,  });

    coll1.insert();

    // print all elements

    for (int elem : coll1)

    {

        cout << elem << ' ';

    }

    cout << endl;

    // insert 4 again and process return value

    auto status = coll1.insert();

    if (status.second)

    {

        cout << "4 inserted as element "

            << distance(coll1.begin(), status.first) +  << endl;

    }

    else

    {

        cout << "4 already exists" << endl;

    }

    // assign elements to another set with ascending order

    set<int> coll2(coll1.cbegin(), coll1.cend());

    // print all elements of the copy using stream iterators

    copy(coll2.cbegin(), coll2.cend(), ostream_iterator<int>(cout, " "));

    cout << endl;

    // remove all elements up to element with value 3

    coll2.erase(coll2.begin(), coll2.find());

    // remove all elements with value 3

    int num;

    num = coll2.erase();

    cout << num << " element(s) removed" << endl;

    // print all elements

    copy(coll2.cbegin(), coll2.cend(), ostream_iterator<int>(cout, " "));

    cout << endl;

}

void SetTest::run()

{

    printStart("operationDemo()");

    operationDemo();

    printEnd("operationDemo()");

}