1
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
3
<title>BitMagic: sample2.cpp Source File</title>
4
<link href="tabs.css" rel="stylesheet" type="text/css">
5
<link href="doxygen.css" rel="stylesheet" type="text/css">
7
<!-- Generated by Doxygen 1.5.9 -->
8
<div class="navigation" id="top">
11
<li><a href="index.html"><span>Main Page</span></a></li>
12
<li><a href="modules.html"><span>Modules</span></a></li>
13
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
14
<li><a href="annotated.html"><span>Data Structures</span></a></li>
15
<li class="current"><a href="files.html"><span>Files</span></a></li>
16
<li><a href="examples.html"><span>Examples</span></a></li>
21
<li><a href="files.html"><span>File List</span></a></li>
22
<li><a href="globals.html"><span>Globals</span></a></li>
25
<h1>sample2.cpp</h1><a href="a00080.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
26
<a name="l00002"></a>00002 <span class="comment">Copyright(c) 2002-2005 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)</span>
27
<a name="l00003"></a>00003 <span class="comment"></span>
28
<a name="l00004"></a>00004 <span class="comment">Permission is hereby granted, free of charge, to any person </span>
29
<a name="l00005"></a>00005 <span class="comment">obtaining a copy of this software and associated documentation </span>
30
<a name="l00006"></a>00006 <span class="comment">files (the "Software"), to deal in the Software without restriction, </span>
31
<a name="l00007"></a>00007 <span class="comment">including without limitation the rights to use, copy, modify, merge, </span>
32
<a name="l00008"></a>00008 <span class="comment">publish, distribute, sublicense, and/or sell copies of the Software, </span>
33
<a name="l00009"></a>00009 <span class="comment">and to permit persons to whom the Software is furnished to do so, </span>
34
<a name="l00010"></a>00010 <span class="comment">subject to the following conditions:</span>
35
<a name="l00011"></a>00011 <span class="comment"></span>
36
<a name="l00012"></a>00012 <span class="comment">The above copyright notice and this permission notice shall be included </span>
37
<a name="l00013"></a>00013 <span class="comment">in all copies or substantial portions of the Software.</span>
38
<a name="l00014"></a>00014 <span class="comment"></span>
39
<a name="l00015"></a>00015 <span class="comment">THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, </span>
40
<a name="l00016"></a>00016 <span class="comment">EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES </span>
41
<a name="l00017"></a>00017 <span class="comment">OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. </span>
42
<a name="l00018"></a>00018 <span class="comment">IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, </span>
43
<a name="l00019"></a>00019 <span class="comment">DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, </span>
44
<a name="l00020"></a>00020 <span class="comment">ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR </span>
45
<a name="l00021"></a>00021 <span class="comment">OTHER DEALINGS IN THE SOFTWARE.</span>
46
<a name="l00022"></a>00022 <span class="comment">*/</span>
47
<a name="l00023"></a>00023 <span class="comment"></span>
48
<a name="l00024"></a>00024 <span class="comment">/** \example sample2.cpp</span>
49
<a name="l00025"></a>00025 <span class="comment"> Example demonstrates using set operations AND, OR, XOR, etc.</span>
50
<a name="l00026"></a>00026 <span class="comment"> For more information please visit: http://bmagic.sourceforge.net</span>
51
<a name="l00027"></a>00027 <span class="comment"> </span>
52
<a name="l00028"></a>00028 <span class="comment">*/</span>
53
<a name="l00029"></a>00029
54
<a name="l00030"></a>00030
55
<a name="l00031"></a>00031 <span class="preprocessor">#include <iostream></span>
56
<a name="l00032"></a>00032 <span class="preprocessor">#include "<a class="code" href="a00068.html">bm.h</a>"</span>
57
<a name="l00033"></a>00033
58
<a name="l00034"></a>00034 <span class="keyword">using namespace </span>std;
59
<a name="l00035"></a>00035
60
<a name="l00036"></a><a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">00036</a> <span class="keywordtype">void</span> <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(<span class="keyword">const</span> <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>& bv)
61
<a name="l00037"></a>00037 {
62
<a name="l00038"></a>00038 <span class="keywordtype">unsigned</span> value = bv.<a class="code" href="a00036.html#f3129b35cabf0554d85711c085a8616d" title="Gets number of first bit which is ON.">get_first</a>();
63
<a name="l00039"></a>00039 <span class="keywordflow">do</span>
64
<a name="l00040"></a>00040 {
65
<a name="l00041"></a>00041 cout << value;
66
<a name="l00042"></a>00042 value = bv.<a class="code" href="a00036.html#def9c095a682a9857068c280e37c8240" title="Finds the number of the next bit ON.">get_next</a>(value);
67
<a name="l00043"></a>00043 <span class="keywordflow">if</span> (value)
68
<a name="l00044"></a>00044 {
69
<a name="l00045"></a>00045 cout << <span class="stringliteral">","</span>;
70
<a name="l00046"></a>00046 }
71
<a name="l00047"></a>00047 <span class="keywordflow">else</span>
72
<a name="l00048"></a>00048 {
73
<a name="l00049"></a>00049 <span class="keywordflow">break</span>;
74
<a name="l00050"></a>00050 }
75
<a name="l00051"></a>00051 } <span class="keywordflow">while</span>(1);
76
<a name="l00052"></a>00052 cout << endl;
77
<a name="l00053"></a>00053 }
78
<a name="l00054"></a>00054
79
<a name="l00055"></a><a class="code" href="a00080.html#840291bc02cba5474a4cb46a9b9566fe">00055</a> <span class="keywordtype">int</span> <a class="code" href="a00079.html#840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)
80
<a name="l00056"></a>00056 {
81
<a name="l00057"></a>00057 <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv1;
82
<a name="l00058"></a>00058 <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv2;
83
<a name="l00059"></a>00059 <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv3;
84
<a name="l00060"></a>00060
85
<a name="l00061"></a>00061 bv1.<a class="code" href="a00036.html#bc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(10);
86
<a name="l00062"></a>00062 bv1.<a class="code" href="a00036.html#bc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(100);
87
<a name="l00063"></a>00063 bv1.<a class="code" href="a00036.html#bc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(1000000);
88
<a name="l00064"></a>00064
89
<a name="l00065"></a>00065
90
<a name="l00066"></a>00066 bv2.<a class="code" href="a00036.html#bc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(10);
91
<a name="l00067"></a>00067 bv2.<a class="code" href="a00036.html#bc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(100);
92
<a name="l00068"></a>00068
93
<a name="l00069"></a>00069 <span class="comment">// Logical AND operation on bv2 (bv1 is the argument)</span>
94
<a name="l00070"></a>00070 <span class="comment">// bv2 = bv2 AND bv1</span>
95
<a name="l00071"></a>00071
96
<a name="l00072"></a>00072 bv3 = bv1 & bv2;
97
<a name="l00073"></a>00073 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv3);
98
<a name="l00074"></a>00074
99
<a name="l00075"></a>00075 bv2 &= bv1; <span class="comment">// You also can use: bv2.bit_and(bv1);</span>
100
<a name="l00076"></a>00076 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv2);
101
<a name="l00077"></a>00077
102
<a name="l00078"></a>00078 <span class="comment">// bv2 = bv2 OR bv1</span>
103
<a name="l00079"></a>00079
104
<a name="l00080"></a>00080 bv3 = bv1 | bv2;
105
<a name="l00081"></a>00081 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv3);
106
<a name="l00082"></a>00082
107
<a name="l00083"></a>00083 bv2 |= bv1; <span class="comment">// You can also use: bv2.bit_or(bv1);</span>
108
<a name="l00084"></a>00084 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv2);
109
<a name="l00085"></a>00085
110
<a name="l00086"></a>00086
111
<a name="l00087"></a>00087 bv1.<a class="code" href="a00036.html#bc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(1000000, <span class="keyword">false</span>);
112
<a name="l00088"></a>00088
113
<a name="l00089"></a>00089 <span class="comment">// bv2 = bv2 SUB bv1</span>
114
<a name="l00090"></a>00090
115
<a name="l00091"></a>00091 bv3 = bv2 - bv1;
116
<a name="l00092"></a>00092 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv3);
117
<a name="l00093"></a>00093
118
<a name="l00094"></a>00094 bv2 -= bv1; <span class="comment">// You can also use: bv2.bit_sub(bv1);</span>
119
<a name="l00095"></a>00095 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv2);
120
<a name="l00096"></a>00096
121
<a name="l00097"></a>00097 <span class="comment">// bv2 XOR bv1</span>
122
<a name="l00098"></a>00098
123
<a name="l00099"></a>00099 bv3 = bv2 ^ bv1;
124
<a name="l00100"></a>00100 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv3);
125
<a name="l00101"></a>00101
126
<a name="l00102"></a>00102 bv2 ^= bv1; <span class="comment">// You can also use: bv2.bit_xor(bv1);</span>
127
<a name="l00103"></a>00103 <a class="code" href="a00080.html#9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv2);
128
<a name="l00104"></a>00104
129
<a name="l00105"></a>00105 <span class="comment">// For lexicographical comparison there is set of overloaded</span>
130
<a name="l00106"></a>00106 <span class="comment">// operators and function compare.</span>
131
<a name="l00107"></a>00107
132
<a name="l00108"></a>00108 <span class="keywordflow">if</span> (bv2 == bv3)
133
<a name="l00109"></a>00109 {
134
<a name="l00110"></a>00110 cerr << <span class="stringliteral">"Equivalent. Comparison result = "</span>
135
<a name="l00111"></a>00111 << bv2.compare(bv3) << endl;
136
<a name="l00112"></a>00112 }
137
<a name="l00113"></a>00113 <span class="keywordflow">else</span>
138
<a name="l00114"></a>00114 {
139
<a name="l00115"></a>00115 cout << <span class="stringliteral">"Error."</span> << endl;
140
<a name="l00116"></a>00116 <span class="keywordflow">return</span> 1;
141
<a name="l00117"></a>00117 }
142
<a name="l00118"></a>00118
143
<a name="l00119"></a>00119
144
<a name="l00120"></a>00120 <span class="keywordflow">return</span> 0;
145
<a name="l00121"></a>00121 }
147
<hr size="1"><address style="text-align: right;"><small>Generated on Sat Aug 8 12:21:27 2009 for BitMagic by
148
<a href="http://www.doxygen.org/index.html">
149
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>