-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsetops.cpp
56 lines (46 loc) · 1.32 KB
/
setops.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// setops.cpp -- some set operations
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <iterator>
int main()
{
using namespace std;
const int N = 6;
string s1[N] = {"buffoon", "thinkers", "for", "heavy", "can", "for"};
string s2[N] = {"metal", "any", "food", "elegant", "deliver", "for"};
set<string> A (s1, s1 + N);
set<string> B (s2, s2 + N);
ostream_iterator<string, char> out (cout, " ");
cout << "Set A: ";
copy (A.begin(), A.end(), out);
cout << endl;
cout << "Set B: ";
copy (B.begin(), B.end(), out);
cout << endl;
cout << "Union of A and B: \n";
set_union(A.begin(), A.end(), B.begin(), B.end(), out);
cout << endl;
cout << "Intersection of A and B: \n";
set_intersection (A.begin(), A.end(), B.begin(), B.end(), out);
cout << endl;
cout << "Difference of A and B: \n";
set_difference (A.begin(), A.end(), B.begin(), B.end(), out);
cout << endl;
set<string> C;
cout << "Set C: \n";
set_union (A.begin(), A.end(), B.begin(), B.end(),
insert_iterator<set<string> > (C, C.begin()));
copy (C.begin(), C.end(), out);
cout << endl;
string s3("grungy");
C.insert (s3);
cout << "Set C after insertion: \n";
copy (C.begin(), C.end(), out);
cout << endl;
cout << "Showing a range: \n";
copy (C.lower_bound("ghost"), C.upper_bound("spook"), out);
cout << endl;
return 0;
}