set_stl.cpp

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

int main()
{
   set<int> mySet; // default increasing order
   set<int, greater<int>> mySet2; // decreasing order

    for (int i = 1 ; i <= 10 ; i++)
    {
        // 1-10 masing-masing hanya disimpan 1x
        for (int j = 1 ; j <= 10 ; j++) {
            mySet.insert(i); 
        }
    }

    cout << "ukuran set sekarang : " << mySet.size() << endl;
    cout << "elemen - elemen di dalam set : ";
    for (set<int>::iterator it = mySet.begin() ; it != mySet.end() ; ++it)
    {
        cout << *it << " "; //coba tebak kenapa harus pakai asterisk?
    }
    cout << endl;

    for (int i = 7 ; i <= 12 ; i++)
    {
        if (mySet.count(i))
            cout << i << " ada di dalam set" << endl;
        else
            cout << i << " tidak ada di dalam set" << endl;
    }

    if(mySet.find(100) == mySet.end()) { // find akan return pointer setelah elemen terakhir jika elemen tidak ditemukan
        cout << "100 tidak ada di dalam set" << endl;
    } else {
        cout << "100 ada di dalam set" << endl;
    }

    set<int>::iterator lo,hi;
    mySet.erase(5);                 //1 2 3 4 6 7 8 9 10
    lo = mySet.lower_bound(4);      //      ^
    hi = mySet.upper_bound(4);      //        ^

    cout << "lower bound ada di index " << *lo << endl;
    cout << "upper bound ada di index " << *hi << endl;

    return 0;
}