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: sample4.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>sample4.cpp</h1><a href="a00082.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 sample4.cpp</span>
49
<a name="l00025"></a>00025 <span class="comment"> Exmaple demonstrates bitvector serialization/deserialization.</span>
50
<a name="l00026"></a>00026 <span class="comment"> </span>
51
<a name="l00027"></a>00027 <span class="comment">For more information please visit: http://bmagic.sourceforge.net</span>
52
<a name="l00028"></a>00028 <span class="comment"></span>
53
<a name="l00029"></a>00029 <span class="comment"> \sa bm::serialize </span>
54
<a name="l00030"></a>00030 <span class="comment"> \sa bm::deserialize </span>
55
<a name="l00031"></a>00031 <span class="comment"></span>
56
<a name="l00032"></a>00032 <span class="comment">*/</span>
57
<a name="l00033"></a>00033
58
<a name="l00034"></a>00034 <span class="preprocessor">#include <stdlib.h></span>
59
<a name="l00035"></a>00035 <span class="preprocessor">#include <iostream></span>
60
<a name="l00036"></a>00036 <span class="preprocessor">#include "<a class="code" href="a00068.html">bm.h</a>"</span>
61
<a name="l00037"></a>00037 <span class="preprocessor">#include "<a class="code" href="a00074.html">bmserial.h</a>"</span>
62
<a name="l00038"></a>00038
63
<a name="l00039"></a>00039 <span class="keyword">using namespace </span>std;
64
<a name="l00040"></a>00040
65
<a name="l00041"></a>00041
66
<a name="l00042"></a>00042 <span class="comment">// This exmaple demonstrates bitvector serialization/deserialization.</span>
67
<a name="l00043"></a>00043
68
<a name="l00044"></a>00044
69
<a name="l00045"></a>00045
70
<a name="l00046"></a><a class="code" href="a00082.html#8652d848be89c1f9b0a77327ee32fc0f">00046</a> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <a class="code" href="a00081.html#8652d848be89c1f9b0a77327ee32fc0f">MAX_VALUE</a> = 1000000;
71
<a name="l00047"></a>00047
72
<a name="l00048"></a>00048 <span class="comment">// This procedure creates very dense bitvector.</span>
73
<a name="l00049"></a>00049 <span class="comment">// The resulting set will consists mostly from ON (1) bits</span>
74
<a name="l00050"></a>00050 <span class="comment">// interrupted with small gaps of 0 bits.</span>
75
<a name="l00051"></a>00051
76
<a name="l00052"></a><a class="code" href="a00082.html#663e1bc930c9ade56c0bc436b8860a1e">00052</a> <span class="keywordtype">void</span> <a class="code" href="a00081.html#6c4e3c21afef90ce9111f8f5e60d4c13">fill_bvector</a>(<a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>* bv)
77
<a name="l00053"></a>00053 {
78
<a name="l00054"></a>00054 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="a00081.html#8652d848be89c1f9b0a77327ee32fc0f">MAX_VALUE</a>; ++i)
79
<a name="l00055"></a>00055 {
80
<a name="l00056"></a>00056 <span class="keywordflow">if</span> (rand() % 2500)
81
<a name="l00057"></a>00057 {
82
<a name="l00058"></a>00058 bv-><a class="code" href="a00036.html#1769d9ed3a4ee41b03fc3ca4a0e5a58e" title="Sets bit n.">set_bit</a>(i);
83
<a name="l00059"></a>00059 }
84
<a name="l00060"></a>00060 }
85
<a name="l00061"></a>00061 }
86
<a name="l00062"></a>00062
87
<a name="l00063"></a>00063
88
<a name="l00064"></a><a class="code" href="a00082.html#eb4ca6f0a986ad6ae67d1f7124fdc400">00064</a> <span class="keywordtype">void</span> <a class="code" href="a00081.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(<span class="keyword">const</span> <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>& bv)
89
<a name="l00065"></a>00065 {
90
<a name="l00066"></a>00066 <a class="code" href="a00067.html" title="Statistical information about bitset&#39;s memory allocation details.">bm::bvector<>::statistics</a> st;
91
<a name="l00067"></a>00067 bv.<a class="code" href="a00036.html#1eaaac76a97b9eb1d3c11f21cf9385ac" title="Calculates bitvector statistics.">calc_stat</a>(&st);
92
<a name="l00068"></a>00068
93
<a name="l00069"></a>00069 cout << <span class="stringliteral">"Bits count:"</span> << bv.<a class="code" href="a00036.html#71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;
94
<a name="l00070"></a>00070 cout << <span class="stringliteral">"Bit blocks:"</span> << st.<a class="code" href="a00035.html#4ec8ba190b4ba31c431c008402881c62" title="Number of bit blocks.">bit_blocks</a> << endl;
95
<a name="l00071"></a>00071 cout << <span class="stringliteral">"GAP blocks:"</span> << st.<a class="code" href="a00035.html#4dcfd64e9ab0be5472e3c2b04e551f81" title="Number of GAP blocks.">gap_blocks</a> << endl;
96
<a name="l00072"></a>00072 cout << <span class="stringliteral">"Memory used:"</span><< st.<a class="code" href="a00035.html#d3b2190eb4afe24ecd56323cbc0a7666" title="Memory used by bitvector including temp and service blocks.">memory_used</a> << endl;
97
<a name="l00073"></a>00073 cout << <span class="stringliteral">"Max.serialize mem.:"</span> << st.<a class="code" href="a00035.html#92f800e8649a1455c17019c8ec882b4b" title="Estimated maximum of memory required for serialization.">max_serialize_mem</a> << endl << endl;;
98
<a name="l00074"></a>00074 }
99
<a name="l00075"></a>00075
100
<a name="l00076"></a>00076
101
<a name="l00077"></a><a class="code" href="a00082.html#8309e061bbaebc2dcc6d54f684e8d27d">00077</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* <a class="code" href="a00082.html#8309e061bbaebc2dcc6d54f684e8d27d">serialize_bvector</a>(<a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>& bv)
102
<a name="l00078"></a>00078 {
103
<a name="l00079"></a>00079 <span class="comment">// It is reccomended to optimize vector before serialization.</span>
104
<a name="l00080"></a>00080 bv.<a class="code" href="a00036.html#bd522c13e26c2b8f84636fe8b6648dcb" title="Optimize memory bitvector&#39;s memory allocation.">optimize</a>();
105
<a name="l00081"></a>00081
106
<a name="l00082"></a>00082 <a class="code" href="a00067.html" title="Statistical information about bitset&#39;s memory allocation details.">bm::bvector<>::statistics</a> st;
107
<a name="l00083"></a>00083 bv.<a class="code" href="a00036.html#1eaaac76a97b9eb1d3c11f21cf9385ac" title="Calculates bitvector statistics.">calc_stat</a>(&st);
108
<a name="l00084"></a>00084
109
<a name="l00085"></a>00085 cout << <span class="stringliteral">"Bits count:"</span> << bv.<a class="code" href="a00036.html#71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;
110
<a name="l00086"></a>00086 cout << <span class="stringliteral">"Bit blocks:"</span> << st.<a class="code" href="a00035.html#4ec8ba190b4ba31c431c008402881c62" title="Number of bit blocks.">bit_blocks</a> << endl;
111
<a name="l00087"></a>00087 cout << <span class="stringliteral">"GAP blocks:"</span> << st.<a class="code" href="a00035.html#4dcfd64e9ab0be5472e3c2b04e551f81" title="Number of GAP blocks.">gap_blocks</a> << endl;
112
<a name="l00088"></a>00088 cout << <span class="stringliteral">"Memory used:"</span><< st.<a class="code" href="a00035.html#d3b2190eb4afe24ecd56323cbc0a7666" title="Memory used by bitvector including temp and service blocks.">memory_used</a> << endl;
113
<a name="l00089"></a>00089 cout << <span class="stringliteral">"Max.serialize mem.:"</span> << st.<a class="code" href="a00035.html#92f800e8649a1455c17019c8ec882b4b" title="Estimated maximum of memory required for serialization.">max_serialize_mem</a> << endl;
114
<a name="l00090"></a>00090
115
<a name="l00091"></a>00091 <span class="comment">// Allocate serialization buffer.</span>
116
<a name="l00092"></a>00092
117
<a name="l00093"></a>00093 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* buf = <span class="keyword">new</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>[st.<a class="code" href="a00035.html#92f800e8649a1455c17019c8ec882b4b" title="Estimated maximum of memory required for serialization.">max_serialize_mem</a>];
118
<a name="l00094"></a>00094
119
<a name="l00095"></a>00095 <span class="comment">// Serialization to memory.</span>
120
<a name="l00096"></a>00096
121
<a name="l00097"></a>00097 <span class="keywordtype">unsigned</span> len = <a class="code" href="a00096.html#g5210c3bda57254ef2e8c71e23306cc88" title="Saves bitvector into memory.">bm::serialize</a>(bv, buf);
122
<a name="l00098"></a>00098
123
<a name="l00099"></a>00099 cout << <span class="stringliteral">"Serialized size:"</span> << len << endl << endl;
124
<a name="l00100"></a>00100
125
<a name="l00101"></a>00101 <span class="keywordflow">return</span> buf;
126
<a name="l00102"></a>00102 }
127
<a name="l00103"></a>00103
128
<a name="l00104"></a>00104
129
<a name="l00105"></a><a class="code" href="a00082.html#840291bc02cba5474a4cb46a9b9566fe">00105</a> <span class="keywordtype">int</span> <a class="code" href="a00079.html#840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)
130
<a name="l00106"></a>00106 {
131
<a name="l00107"></a>00107 <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv1;
132
<a name="l00108"></a>00108 <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv2;
133
<a name="l00109"></a>00109
134
<a name="l00110"></a>00110 bv2.<a class="code" href="a00036.html#b1094180d03cbc961d62f0f453097452" title="Sets new blocks allocation strategy.">set_new_blocks_strat</a>(<a class="code" href="a00091.html#ggd0b87b3b7292383a864d27feaf1c9eff7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">bm::BM_GAP</a>); <span class="comment">// set DGAP compression mode ON</span>
135
<a name="l00111"></a>00111
136
<a name="l00112"></a>00112 <a class="code" href="a00081.html#6c4e3c21afef90ce9111f8f5e60d4c13">fill_bvector</a>(&bv1);
137
<a name="l00113"></a>00113 <a class="code" href="a00081.html#6c4e3c21afef90ce9111f8f5e60d4c13">fill_bvector</a>(&bv2);
138
<a name="l00114"></a>00114
139
<a name="l00115"></a>00115 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* buf1 = <a class="code" href="a00082.html#8309e061bbaebc2dcc6d54f684e8d27d">serialize_bvector</a>(bv1);
140
<a name="l00116"></a>00116 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* buf2 = <a class="code" href="a00082.html#8309e061bbaebc2dcc6d54f684e8d27d">serialize_bvector</a>(bv2);
141
<a name="l00117"></a>00117
142
<a name="l00118"></a>00118 <span class="comment">// Serialized bvectors (buf1 and buf2) now ready to be</span>
143
<a name="l00119"></a>00119 <span class="comment">// saved to a database, file or send over a network.</span>
144
<a name="l00120"></a>00120
145
<a name="l00121"></a>00121 <span class="comment">// ...</span>
146
<a name="l00122"></a>00122
147
<a name="l00123"></a>00123 <span class="comment">// Deserialization.</span>
148
<a name="l00124"></a>00124
149
<a name="l00125"></a>00125 <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv3;
150
<a name="l00126"></a>00126
151
<a name="l00127"></a>00127 <span class="comment">// As a result of desrialization bv3 will contain all bits from</span>
152
<a name="l00128"></a>00128 <span class="comment">// bv1 and bv3:</span>
153
<a name="l00129"></a>00129 <span class="comment">// bv3 = bv1 OR bv2</span>
154
<a name="l00130"></a>00130
155
<a name="l00131"></a>00131 <a class="code" href="a00096.html#gfbe633db8da3d867f098468269fd8d3d" title="Bitvector deserialization from memory.">bm::deserialize</a>(bv3, buf1);
156
<a name="l00132"></a>00132 <a class="code" href="a00096.html#gfbe633db8da3d867f098468269fd8d3d" title="Bitvector deserialization from memory.">bm::deserialize</a>(bv3, buf2);
157
<a name="l00133"></a>00133
158
<a name="l00134"></a>00134 <a class="code" href="a00081.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(bv3);
159
<a name="l00135"></a>00135
160
<a name="l00136"></a>00136 <span class="comment">// After a complex operation we can try to optimize bv3.</span>
161
<a name="l00137"></a>00137
162
<a name="l00138"></a>00138 bv3.<a class="code" href="a00036.html#bd522c13e26c2b8f84636fe8b6648dcb" title="Optimize memory bitvector&#39;s memory allocation.">optimize</a>();
163
<a name="l00139"></a>00139
164
<a name="l00140"></a>00140 <a class="code" href="a00081.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(bv3);
165
<a name="l00141"></a>00141
166
<a name="l00142"></a>00142 <span class="keyword">delete</span> [] buf1;
167
<a name="l00143"></a>00143 <span class="keyword">delete</span> [] buf2;
168
<a name="l00144"></a>00144
169
<a name="l00145"></a>00145 <span class="keywordflow">return</span> 0;
170
<a name="l00146"></a>00146 }
171
<a name="l00147"></a>00147
173
<hr size="1"><address style="text-align: right;"><small>Generated on Sat Aug 8 12:21:27 2009 for BitMagic by
174
<a href="http://www.doxygen.org/index.html">
175
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
added
removed
doc/html/a00082_source.html
