⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 multiset.cpp

📁 C++ sample code, for the book: C++ black book, including templates, exceptional handling.
💻 CPP
字号:
#include <iostream>
#include <set>
using namespace std;

int main ()
{
    multiset<int,less<int> >  set1, set2, union_set, intersection_set;
    ostream_iterator<multiset<int,less<int> >::value_type,char> ostream_itr(cout, " ");

    set1.insert(set1.begin(), 1);
    set1.insert(set1.begin(), 1);
    set1.insert(set1.begin(), 3);
    set1.insert(set1.begin(), 3);
    set1.insert(set1.begin(), 3);
    set1.insert(set1.begin(), 4);
    set1.insert(set1.begin(), 5);
    set1.insert(set1.begin(), 6);

    cout << "First set:" << endl;

    copy(set1.begin(),set1.end(), ostream_itr);
    cout << endl;

    set2.insert(set1.begin(), 4);
    set2.insert(set1.begin(), 4);
    set2.insert(set1.begin(), 5);
    set2.insert(set1.begin(), 5);
    set2.insert(set1.begin(), 5);
    set2.insert(set1.begin(), 6);
    set2.insert(set1.begin(), 7);
    set2.insert(set1.begin(), 8);

    cout << "Second set:" << endl;

    copy(set2.begin(),set2.end(), ostream_itr);
    cout << endl;

    set_union(set1.begin(), set1.end(), set2.begin(), set2.end(),
    insert_iterator<multiset<int,less<int> > >
        (union_set, union_set.begin()));

    cout << "Union of the two sets:" << endl;
    copy(union_set.begin(), union_set.end(), ostream_itr);
    cout << endl;

    set_intersection(set1.begin(), set1.end(), set2.begin(), set2.end(),
    insert_iterator<multiset<int,less<int> > >
        (intersection_set, intersection_set.begin()));

    cout << "Intersection of the two sets:" << endl;
    copy(intersection_set.begin(), intersection_set.end(), ostream_itr);
    cout << endl;
  
    return 0;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -