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
|
/*
Copyright(c) 2002-2017 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
For more information please visit: http://bitmagic.io
*/
/** \example sample2.cpp
Example demonstrates using set operations AND, OR, XOR, etc.
\sa bvsetalgebra.cpp
*/
/*! \file sample2.cpp
\brief Example: bvector<> set algebra operations AND, OR, XOR, etc.
*/
#include <iostream>
#include "bm.h"
using namespace std;
static
void print_bvector(const bm::bvector<>& bv)
{
bm::bvector<>::size_type value = bv.get_first();
do
{
cout << value;
value = bv.get_next(value);
if (value)
{
cout << ",";
}
else
{
break;
}
} while(1);
cout << endl;
}
int main(void)
{
try
{
bm::bvector<> bv1;
bm::bvector<> bv2;
bm::bvector<> bv3;
bv1.set(10);
bv1.set(100);
bv1.set(1000000);
bv2.set(10);
bv2.set(100);
// Logical AND operation on bv2 (bv1 is the argument)
// bv2 = bv2 AND bv1
bv3 = bv1 & bv2;
print_bvector(bv3);
bv2 &= bv1; // You also can use: bv2.bit_and(bv1);
print_bvector(bv2);
// bv2 = bv2 OR bv1
bv3 = bv1 | bv2;
print_bvector(bv3);
bv2 |= bv1; // You can also use: bv2.bit_or(bv1);
print_bvector(bv2);
bv1.set(1000000, false);
// bv2 = bv2 SUB bv1
bv3 = bv2 - bv1;
print_bvector(bv3);
bv2 -= bv1; // You can also use: bv2.bit_sub(bv1);
print_bvector(bv2);
// bv2 XOR bv1
bv3 = bv2 ^ bv1;
print_bvector(bv3);
// product of XOR is a mismatch vector (definition of XOR)
//
{
bm::bvector<>::size_type pos;
bool f = bv3.find(pos);
if (f)
{
cout << "XOR mismatch position = " << pos << endl;
}
// if we need to find only first mismatch we don't need a full
// XOR product, we can use bvector<>::find_first_mismatch()
//
f = bv2.find_first_mismatch(bv1, pos);
if (f)
{
cout << "search mismatch position = " << pos << endl;
}
}
bv2 ^= bv1; // You can also use: bv2.bit_xor(bv1);
print_bvector(bv2);
// For lexicographical comparison there is set of overloaded
// operators and function compare (see also bvector<>::equal() )
if (bv2 == bv3)
{
cerr << "Equivalent. Comparison result = "
<< bv2.compare(bv3) << endl;
}
else
{
cout << "Error." << endl;
return 1;
}
}
catch(std::exception& ex)
{
std::cerr << ex.what() << std::endl;
}
return 0;
}
|
