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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/*
Copyright(c) 2002-2005 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge,
publish, distribute, sublicense, and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
*/
/** \example sample8.cpp
Example demonstrates some STL compatability set operations using
set iterators.
\sa bm::bvector<>::enumerator
\sa bm::bvector<>::insert_iterator
For more information please visit: http://bmagic.sourceforge.net
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <list>
using std::vector;
using std::list;
// This example requires STL compatibility
#ifdef BM_NO_STL
# undef BM_NO_STL
#endif
#include "bm.h"
using namespace std;
void Print(unsigned n)
{
cout << n << endl;;
}
// Utility template function used to print container
template<class T> void PrintContainer(T first, T last)
{
if (first == last)
cout << "<EMPTY SET>";
else
for(;first != last; ++first)
cout << *first << ";";
cout << endl;
}
int main(void)
{
bm::bvector<> bv;
bv[10] = true;
bv[100] = true;
bv[10000] = true;
cout << "Source set:";
PrintContainer(bv.first(), bv.end());
// copy all bitset information into STL vector using copy algorithm
{
vector<unsigned> vect;
vect.resize(bv.count());
std::copy(bv.first(), bv.end(), vect.begin());
cout << "Vector:";
PrintContainer(vect.begin(), vect.end());
}
// doing the same with the help of back_inserter
{
list<unsigned> lst;
std::copy(bv.first(), bv.end(), std::back_inserter(lst));
cout << "List:";
PrintContainer(lst.begin(), lst.end());
}
{
vector<unsigned> vect;
vector<unsigned> res1, res2, res3;
vect.push_back(100);
vect.push_back(15);
vect.push_back(150);
cout << "Argument vector for set operations:";
PrintContainer(vect.begin(), vect.end());
// set should be ordered by < to make set algorithms possible
std::sort(vect.begin(), vect.end());
cout << endl;
std::set_union(bv.first(), bv.end(),
vect.begin(), vect.end(),
std::back_inserter(res1)); //10;15;100;150;10000
cout << "Set union:" << endl;
PrintContainer(res1.begin(), res1.end());
std::set_intersection(bv.first(), bv.end(),
vect.begin(), vect.end(),
std::back_inserter(res2)); // 100
cout << "Set intersection:" << endl;
PrintContainer(res2.begin(), res2.end());
vector<unsigned>::const_iterator it1 = vect.begin();
vector<unsigned>::const_iterator it2 = vect.end();
bm::bvector<>::enumerator en = bv.first();
bm::bvector<>::enumerator en2= bv.end();
std::set_difference(en, en2,
it1, it2,
std::back_inserter(res3)); // 10;10000
cout << "Set diff:" << endl;
PrintContainer(res3.begin(), res3.end());
}
// Using bvector<>::insert_iterator to set bits
{
bm::bvector<> bv1;
std::vector<unsigned> vect;
vect.push_back(300);
vect.push_back(200);
vect.push_back(275);
vect.push_back(200);
cout << endl << "Source vector:";
PrintContainer(vect.begin(), vect.end()); // 300;200;275;200;
// The "side effect" of this operation is that we sorted
// the input sequence and eliminated duplicates
std::copy(vect.begin(), vect.end(), bv1.inserter());
cout << "Bitset:";
PrintContainer(bv1.first(), bv1.end()); // 200;275;300
}
return 0;
}
|
