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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.17"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>BitMagic-C++: svsample06.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">BitMagic-C++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_6f9635d4fbfa321d4c00f29df5cd540c.html">samples</a></li><li class="navelem"><a class="el" href="dir_d51bb69ff0dfe06b389399b05ef484f6.html">svsample06</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">svsample06.cpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="svsample06_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">Copyright(c) 2002-2017 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"></span> </div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">Licensed under the Apache License, Version 2.0 (the "License");</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">you may not use this file except in compliance with the License.</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">You may obtain a copy of the License at</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"></span> </div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> http://www.apache.org/licenses/LICENSE-2.0</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"></span> </div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">Unless required by applicable law or agreed to in writing, software</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">distributed under the License is distributed on an "AS IS" BASIS,</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">See the License for the specific language governing permissions and</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">limitations under the License.</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"></span> </div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">For more information please visit: http://bitmagic.io</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">*/</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"></span> </div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">/** \example svsample06.cpp</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> Search/scan for elements in unordered, non-unique sparse vector</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> </span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> \sa bm::sparse_vector<>::const_iterator</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> \sa bm::sparse_vector<>::back_insert_iterator</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> \sa bm::sparse_vector_scanner</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">*/</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"></span> </div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">/*! \file svsample06.cpp</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> \brief Example: sparse_vector<> scan search (non-ordered set functionality)</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">*/</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  </div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <iostream></span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <vector></span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <chrono></span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <algorithm></span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <random></span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <stdexcept></span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "<a class="code" href="bm_8h.html">bm.h</a>"</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="bmsparsevec_8h.html">bmsparsevec.h</a>"</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "<a class="code" href="bmsparsevec__algo_8h.html">bmsparsevec_algo.h</a>"</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="bmtimer_8h.html">bmtimer.h</a>"</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  </div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  </div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">using namespace </span>std;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a6285ce7ea16491e7b6e34d7007385b38"> 46</a></span> <span class="keyword">typedef</span> <a class="code" href="classbm_1_1sparse__vector.html">bm::sparse_vector<bm::id_t, bm::bvector<></a> > <a class="code" href="svsample06_8cpp.html#a6285ce7ea16491e7b6e34d7007385b38">sparse_vector_u32</a>;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// ----------------------------------------------------</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// Global parameters and types</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// ----------------------------------------------------</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#ace201b00999e65c2609354bcc2834f10"> 53</a></span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <a class="code" href="svsample06_8cpp.html#ace201b00999e65c2609354bcc2834f10">value_max</a> = 1250000; <span class="comment">// range of variants of events [0..max]</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64"> 54</a></span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <a class="code" href="svsample06_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a> = 250000000; <span class="comment">// vector size to generate</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// -------------------------------------------</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// Random generator</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// -------------------------------------------</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b"> 60</a></span> std::random_device <a class="code" href="svsample06_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b">rand_dev</a>;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> std::mt19937 <a class="code" href="svsample06_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a>(<a class="code" href="svsample06_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b">rand_dev</a>());</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> std::uniform_int_distribution<> <a class="code" href="svsample06_8cpp.html#ae2805bdcfb8ec09e8f1b9d436927f498">rand_dis</a>(1, <a class="code" href="svsample06_8cpp.html#ace201b00999e65c2609354bcc2834f10">value_max</a>); <span class="comment">// generate uniform numebrs for [1, vector_max]</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// timing storage for benchmarking</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc"> 65</a></span> <a class="code" href="classbm_1_1chrono__taker.html#add1676592117ed0eaa2fa6279a71b46a">bm::chrono_taker::duration_map_type</a> <a class="code" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>;</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  </div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Function to generate test vector set with some NULL values stored as a</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// separate bit-bector</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">//</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">static</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#ae70384c7090bbcf1bbf7c7ec3541f962"> 73</a></span> <span class="keywordtype">void</span> <a class="code" href="svsample06_8cpp.html#ae70384c7090bbcf1bbf7c7ec3541f962">generate_test_set</a>(std::vector<unsigned>& vect,</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a>& bv_null,</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv)</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> {</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// back insert iterator is faster than random element access for sparse vector</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="classbm_1_1sparse__vector.html#a7362aaf921cee882e08cb349677d51de">sparse_vector_u32::back_insert_iterator</a> bi(sv.<a class="code" href="classbm_1_1sparse__vector.html#a664bc1422f5a71c93c09d809b3d1ec3f">get_back_inserter</a>());</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  vect.resize(<a class="code" href="svsample06_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a>);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  bv_null.<a class="code" href="classbm_1_1bvector.html#ac1280ff08a2b1f4377ca15df081781f8">reset</a>();</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="svsample06_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a>; ++i)</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  {</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">unsigned</span> v = unsigned(<a class="code" href="svsample06_8cpp.html#ae2805bdcfb8ec09e8f1b9d436927f498">rand_dis</a>(<a class="code" href="svsample06_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a>));</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  vect[i] = v;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  bv_null[i] = <span class="keyword">true</span>; <span class="comment">// not NULL(assigned) element</span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  *bi = v; <span class="comment">// push back an element to sparse vector</span></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (i % 64 == 0)</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  bi.add_null(5); <span class="comment">// add 5 unassigned elements using back inserter</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  i += 5; <span class="comment">// insert a small NULL plate (unassigned values)</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  } <span class="comment">// for</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> }</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// plain scan in std::vector<>, matching values are indexed </span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// in result bit-vector (subset projection)</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// values are added, so multiple calls result in subset addition</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="keyword">static</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a6375dd981ff2723f73dc255db6e6ba55"> 106</a></span> <span class="keywordtype">void</span> <a class="code" href="svsample06_8cpp.html#a6375dd981ff2723f73dc255db6e6ba55">vector_search</a>(<span class="keyword">const</span> std::vector<unsigned>& vect,</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">const</span> <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a>& bv_null,</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">unsigned</span> value,</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a>& bv_res)</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> {</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  bv_res.<a class="code" href="classbm_1_1bvector.html#aaceb8d31d9da05f977de5c6a6cd62e24">init</a>(); <span class="comment">// always use init() if set_bit_no_check()</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < vect.size(); ++i)</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  {</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (vect[i] == value)</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  bv_res.<a class="code" href="classbm_1_1bvector.html#aff4c0900eed72eaccff6f5804e33ce97">set_bit_no_check</a>((<a class="code" href="namespacebm.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a>)i);</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  } <span class="comment">// for</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  bv_res &= bv_null; <span class="comment">// correct results to only include non-NULL values</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  </div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">inline</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a9682c30f1b194905b7c04449fdcda1e2"> 122</a></span> <span class="keywordtype">void</span> <a class="code" href="svsample06_8cpp.html#a9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(<span class="keyword">const</span> <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a>& bv)</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> {</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  cout << <span class="stringliteral">"( count = "</span> << bv.<a class="code" href="classbm_1_1bvector.html#a3009ba9b116f13f4933a48641f3a695d">count</a>() << <span class="stringliteral">")"</span> << <span class="stringliteral">": ["</span>;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="classbm_1_1bvector_1_1enumerator.html">bm::bvector<>::enumerator</a> en = bv.<a class="code" href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">first</a>();</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">for</span> (; en.<a class="code" href="classbm_1_1bvector_1_1iterator__base.html#a3f6af7f5b46c0219b28916187d302c43">valid</a>(); ++en)</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  cout << *en << <span class="stringliteral">", "</span>;</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  cout << <span class="stringliteral">"]"</span> << endl;</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> }</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  </div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  </div>
<div class="line"><a name="l00133"></a><span class="lineno"><a class="line" href="svsample06_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe"> 133</a></span> <span class="keywordtype">int</span> <a class="code" href="svsample06_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> {</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">try</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  {</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// First, lets run, simple (printable) search case</span></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(2, 25);</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(3, 35);</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(7, 75);</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(1000, 2000);</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(256, 2001);</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(77, 25);</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_found; <span class="comment">// search results vector</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="classbm_1_1sparse__vector__scanner.html">bm::sparse_vector_scanner<sparse_vector_u32></a> scanner; <span class="comment">// scanner class</span></div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  scanner.<a class="code" href="classbm_1_1sparse__vector__scanner.html#aa2439360def2f3fe3c788872c0e70997">find_eq</a>(sv, 25, bv_found); <span class="comment">// seach for all values == 25</span></div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="svsample06_8cpp.html#a9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv_found); <span class="comment">// print results </span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  scanner.<a class="code" href="classbm_1_1sparse__vector__scanner.html#a803ff666c047dae732836e959339d89c">invert</a>(sv, bv_found); <span class="comment">// invert search results to NOT EQ</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <a class="code" href="svsample06_8cpp.html#a9682c30f1b194905b7c04449fdcda1e2">print_bvector</a>(bv_found); <span class="comment">// print all != 25</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  std::vector<unsigned> vect;</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_null;</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"0. test set generate "</span>, 1, &<a class="code" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="svsample06_8cpp.html#ae70384c7090bbcf1bbf7c7ec3541f962">generate_test_set</a>(vect, bv_null, sv);</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordtype">unsigned</span> search_repeats = 500;</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// generate a search vector for benchmarking</span></div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  std::vector<unsigned> search_vect;</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  {</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_tmp;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  search_vect.reserve(search_repeats);</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < search_repeats;)</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  {</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="namespacebm.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> idx = <a class="code" href="namespacebm.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a>(<a class="code" href="svsample06_8cpp.html#ae2805bdcfb8ec09e8f1b9d436927f498">rand_dis</a>(<a class="code" href="svsample06_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a>));</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (!bv_tmp.<a class="code" href="classbm_1_1bvector.html#a16d902c3df4aa6aa88d8e137af4a4b9b">test</a>(idx)) <span class="comment">// check if number is unique</span></div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  {</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  search_vect.push_back(idx);</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  bv_tmp[idx] = 1;</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ++i;</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// run benchmarks</span></div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_res1;</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_res2;</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_res3;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"1. std::vector<> scan "</span>, search_repeats, &<a class="code" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < search_repeats; ++i)</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  {</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">unsigned</span> vs = search_vect[i];</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <a class="code" href="svsample06_8cpp.html#a6375dd981ff2723f73dc255db6e6ba55">vector_search</a>(vect, bv_null, vs, bv_res1);</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  } <span class="comment">// for</span></div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  </div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  {</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"2. sparse_vector<> scan "</span>, search_repeats, &<a class="code" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  </div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <a class="code" href="classbm_1_1sparse__vector__scanner.html">bm::sparse_vector_scanner<sparse_vector_u32></a> scanner;</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  scanner.<a class="code" href="classbm_1_1sparse__vector__scanner.html#aa2439360def2f3fe3c788872c0e70997">find_eq</a>(sv, search_vect.<a class="code" href="classbm_1_1sparse__vector.html#ae60eed242dd6ca5ac13a046f3f75b2f7">begin</a>(), search_vect.end(), bv_res2);</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  </div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// check jus in case if results look correct</span></div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">if</span> (bv_res1.<a class="code" href="classbm_1_1bvector.html#acfb4e0f923e55057db5ed518853fbecf">compare</a>(bv_res2) != 0)</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  std::cerr << <span class="stringliteral">"2. Search result mismatch!"</span> << std::endl;</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  {</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  bv_res3.<a class="code" href="classbm_1_1bvector.html#aaceb8d31d9da05f977de5c6a6cd62e24">init</a>(); <span class="comment">// always init before calling "set_bit_no_check()"</span></div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"3. sparse_vector<>::const_iterator search "</span>, search_repeats, &<a class="code" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  </div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// prepare a unique search set</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_search(<a class="code" href="group__bvector.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c">bm::BM_GAP</a>);</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="group__setalgo.html#gab15f2180dfd9a8bcb0d261689336d786">bm::combine_or</a>(bv_search, search_vect.begin(), search_vect.<a class="code" href="classbm_1_1bvector.html#a937cd13482984f234a5d94cc638c22b5">end</a>());</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="classbm_1_1sparse__vector.html#a73134a0c2f6d595d3cf165236622f5da">sparse_vector_u32::const_iterator</a> it = sv.<a class="code" href="classbm_1_1sparse__vector.html#ae60eed242dd6ca5ac13a046f3f75b2f7">begin</a>();</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="classbm_1_1sparse__vector.html#a73134a0c2f6d595d3cf165236622f5da">sparse_vector_u32::const_iterator</a> it_end = sv.<a class="code" href="classbm_1_1sparse__vector.html#a60bdc29e0f6731410372e3518ab0940b">end</a>();</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">for</span> (; it != it_end; ++it)</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">unsigned</span> v = *it;</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">if</span> (bv_search.<a class="code" href="classbm_1_1bvector.html#a16d902c3df4aa6aa88d8e137af4a4b9b">test</a>(v))</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  bv_res3.<a class="code" href="classbm_1_1bvector.html#aff4c0900eed72eaccff6f5804e33ce97">set_bit_no_check</a>(it.pos());</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  } <span class="comment">// for</span></div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// paranoiya check</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (bv_res1.<a class="code" href="classbm_1_1bvector.html#acfb4e0f923e55057db5ed518853fbecf">compare</a>(bv_res3) != 0)</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  {</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  std::cerr << <span class="stringliteral">"3. Search result mismatch!"</span> << std::endl;</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="classbm_1_1chrono__taker.html#a30b45453d952d14afe56c29087970899">bm::chrono_taker::print_duration_map</a>(<a class="code" href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>, <a class="code" href="classbm_1_1chrono__taker.html#a9a41e5f2fe48ba472fd77a1dbd86457dad530ca7863ce7e60f4fa221e1dfa64a2">bm::chrono_taker::ct_ops_per_sec</a>);</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">catch</span>(std::exception& ex)</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  {</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  std::cerr << ex.what() << std::endl;</div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  </div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> }</div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  </div>
</div><!-- fragment --></div><!-- contents -->
<div class="ttc" id="asvsample06_8cpp_html_ae70384c7090bbcf1bbf7c7ec3541f962"><div class="ttname"><a href="svsample06_8cpp.html#ae70384c7090bbcf1bbf7c7ec3541f962">generate_test_set</a></div><div class="ttdeci">static void generate_test_set(std::vector< unsigned > &vect, bm::bvector<> &bv_null, sparse_vector_u32 &sv)</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00073">svsample06.cpp:73</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector__scanner_html_a803ff666c047dae732836e959339d89c"><div class="ttname"><a href="classbm_1_1sparse__vector__scanner.html#a803ff666c047dae732836e959339d89c">bm::sparse_vector_scanner::invert</a></div><div class="ttdeci">void invert(const SV &sv, typename SV::bvector_type &bv_out)</div><div class="ttdoc">invert search result ("EQ" to "not EQ")</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec__algo_8h_source.html#l01195">bmsparsevec_algo.h:1195</a></div></div>
<div class="ttc" id="abmsparsevec__algo_8h_html"><div class="ttname"><a href="bmsparsevec__algo_8h.html">bmsparsevec_algo.h</a></div><div class="ttdoc">Algorithms for bm::sparse_vector.</div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_a7362aaf921cee882e08cb349677d51de"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a7362aaf921cee882e08cb349677d51de">bm::sparse_vector::back_insert_iterator</a></div><div class="ttdeci">friend back_insert_iterator</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l00349">bmsparsevec.h:349</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_a73134a0c2f6d595d3cf165236622f5da"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a73134a0c2f6d595d3cf165236622f5da">bm::sparse_vector::const_iterator</a></div><div class="ttdeci">friend const_iterator</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l00348">bmsparsevec.h:348</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html"><div class="ttname"><a href="classbm_1_1sparse__vector.html">bm::sparse_vector</a></div><div class="ttdoc">sparse vector with runtime compression using bit transposition method</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l00081">bmsparsevec.h:81</a></div></div>
<div class="ttc" id="aclassbm_1_1chrono__taker_html"><div class="ttname"><a href="classbm_1_1chrono__taker.html">bm::chrono_taker</a></div><div class="ttdoc">Utility class to collect performance measurements and statistics.</div><div class="ttdef"><b>Definition:</b> <a href="bmtimer_8h_source.html#l00039">bmtimer.h:39</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_ac1280ff08a2b1f4377ca15df081781f8"><div class="ttname"><a href="classbm_1_1bvector.html#ac1280ff08a2b1f4377ca15df081781f8">bm::bvector::reset</a></div><div class="ttdeci">bvector< Alloc > & reset()</div><div class="ttdoc">Clears every bit in the bitvector.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l01225">bm.h:1225</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a6cb51d150528a5d2d87acb3e88f450bc"><div class="ttname"><a href="svsample06_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a></div><div class="ttdeci">bm::chrono_taker::duration_map_type timing_map</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00065">svsample06.cpp:65</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_aff4c0900eed72eaccff6f5804e33ce97"><div class="ttname"><a href="classbm_1_1bvector.html#aff4c0900eed72eaccff6f5804e33ce97">bm::bvector::set_bit_no_check</a></div><div class="ttdeci">void set_bit_no_check(size_type n)</div><div class="ttdoc">Set bit without checking preconditions (size, etc)</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l03468">bm.h:3468</a></div></div>
<div class="ttc" id="abmsparsevec_8h_html"><div class="ttname"><a href="bmsparsevec_8h.html">bmsparsevec.h</a></div><div class="ttdoc">Sparse constainer sparse_vector<> for integer types using bit-transposition transform.</div></div>
<div class="ttc" id="aclassbm_1_1bvector_1_1enumerator_html"><div class="ttname"><a href="classbm_1_1bvector_1_1enumerator.html">bm::bvector::enumerator</a></div><div class="ttdoc">Constant iterator designed to enumerate "ON" bits.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l00599">bm.h:599</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector__scanner_html"><div class="ttname"><a href="classbm_1_1sparse__vector__scanner.html">bm::sparse_vector_scanner</a></div><div class="ttdoc">algorithms for sparse_vector scan/search</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec__algo_8h_source.html#l00481">bmsparsevec_algo.h:481</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_acfb4e0f923e55057db5ed518853fbecf"><div class="ttname"><a href="classbm_1_1bvector.html#acfb4e0f923e55057db5ed518853fbecf">bm::bvector::compare</a></div><div class="ttdeci">int compare(const bvector< Alloc > &bvect) const BMNOEXCEPT</div><div class="ttdoc">Lexicographical comparison with a bitvector.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l03159">bm.h:3159</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a006d7ce7dc31baa25671d1d264dd0c64"><div class="ttname"><a href="svsample06_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a></div><div class="ttdeci">const unsigned test_size</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00054">svsample06.cpp:54</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a9682c30f1b194905b7c04449fdcda1e2"><div class="ttname"><a href="svsample06_8cpp.html#a9682c30f1b194905b7c04449fdcda1e2">print_bvector</a></div><div class="ttdeci">void print_bvector(const bm::bvector<> &bv)</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00122">svsample06.cpp:122</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html"><div class="ttname"><a href="classbm_1_1bvector.html">bm::bvector<></a></div></div>
<div class="ttc" id="agroup__bvector_html_ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79"><div class="ttname"><a href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a></div><div class="ttdeci">@ use_null</div><div class="ttdoc">support "non-assigned" or "NULL" logic</div><div class="ttdef"><b>Definition:</b> <a href="bmconst_8h_source.html#l00215">bmconst.h:215</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a6375dd981ff2723f73dc255db6e6ba55"><div class="ttname"><a href="svsample06_8cpp.html#a6375dd981ff2723f73dc255db6e6ba55">vector_search</a></div><div class="ttdeci">static void vector_search(const std::vector< unsigned > &vect, const bm::bvector<> &bv_null, unsigned value, bm::bvector<> &bv_res)</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00106">svsample06.cpp:106</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_a3009ba9b116f13f4933a48641f3a695d"><div class="ttname"><a href="classbm_1_1bvector.html#a3009ba9b116f13f4933a48641f3a695d">bm::bvector::count</a></div><div class="ttdeci">size_type count() const BMNOEXCEPT</div><div class="ttdoc">population cout (count of ON bits)</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l02194">bm.h:2194</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_a60bdc29e0f6731410372e3518ab0940b"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a60bdc29e0f6731410372e3518ab0940b">bm::sparse_vector::end</a></div><div class="ttdeci">const_iterator end() const BMNOEXCEPT</div><div class="ttdoc">Provide const iterator access to the end</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l00493">bmsparsevec.h:493</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_1_1iterator__base_html_a3f6af7f5b46c0219b28916187d302c43"><div class="ttname"><a href="classbm_1_1bvector_1_1iterator__base.html#a3f6af7f5b46c0219b28916187d302c43">bm::bvector::iterator_base::valid</a></div><div class="ttdeci">bool valid() const BMNOEXCEPT</div><div class="ttdoc">Checks if iterator is still valid. Analog of != 0 comparison for pointers.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l00280">bm.h:280</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_aaceb8d31d9da05f977de5c6a6cd62e24"><div class="ttname"><a href="classbm_1_1bvector.html#aaceb8d31d9da05f977de5c6a6cd62e24">bm::bvector::init</a></div><div class="ttdeci">void init()</div><div class="ttdoc">Explicit post-construction initialization.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l02123">bm.h:2123</a></div></div>
<div class="ttc" id="abmtimer_8h_html"><div class="ttname"><a href="bmtimer_8h.html">bmtimer.h</a></div><div class="ttdoc">Timing utilities for benchmarking (internal)</div></div>
<div class="ttc" id="asvsample06_8cpp_html_a6285ce7ea16491e7b6e34d7007385b38"><div class="ttname"><a href="svsample06_8cpp.html#a6285ce7ea16491e7b6e34d7007385b38">sparse_vector_u32</a></div><div class="ttdeci">bm::sparse_vector< bm::id_t, bm::bvector<> > sparse_vector_u32</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00046">svsample06.cpp:46</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_ae60eed242dd6ca5ac13a046f3f75b2f7"><div class="ttname"><a href="classbm_1_1sparse__vector.html#ae60eed242dd6ca5ac13a046f3f75b2f7">bm::sparse_vector::begin</a></div><div class="ttdeci">const_iterator begin() const BMNOEXCEPT</div><div class="ttdoc">Provide const iterator access to container content</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01900">bmsparsevec.h:1900</a></div></div>
<div class="ttc" id="aclassbm_1_1chrono__taker_html_a9a41e5f2fe48ba472fd77a1dbd86457dad530ca7863ce7e60f4fa221e1dfa64a2"><div class="ttname"><a href="classbm_1_1chrono__taker.html#a9a41e5f2fe48ba472fd77a1dbd86457dad530ca7863ce7e60f4fa221e1dfa64a2">bm::chrono_taker::ct_ops_per_sec</a></div><div class="ttdeci">@ ct_ops_per_sec</div><div class="ttdef"><b>Definition:</b> <a href="bmtimer_8h_source.html#l00059">bmtimer.h:59</a></div></div>
<div class="ttc" id="anamespacebm_html_aa3824d882a037396370b16f2f0a8bf37"><div class="ttname"><a href="namespacebm.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a></div><div class="ttdeci">unsigned int id_t</div><div class="ttdef"><b>Definition:</b> <a href="bmconst_8h_source.html#l00037">bmconst.h:37</a></div></div>
<div class="ttc" id="agroup__bvector_html_ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c"><div class="ttname"><a href="group__bvector.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c">bm::BM_GAP</a></div><div class="ttdeci">@ BM_GAP</div><div class="ttdoc">GAP compression is ON.</div><div class="ttdef"><b>Definition:</b> <a href="bmconst_8h_source.html#l00144">bmconst.h:144</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_ace201b00999e65c2609354bcc2834f10"><div class="ttname"><a href="svsample06_8cpp.html#ace201b00999e65c2609354bcc2834f10">value_max</a></div><div class="ttdeci">const unsigned value_max</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00053">svsample06.cpp:53</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a9b287f91e2adf83c3131895cd6e07195"><div class="ttname"><a href="svsample06_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a></div><div class="ttdeci">std::mt19937 gen(rand_dev())</div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_a16d902c3df4aa6aa88d8e137af4a4b9b"><div class="ttname"><a href="classbm_1_1bvector.html#a16d902c3df4aa6aa88d8e137af4a4b9b">bm::bvector::test</a></div><div class="ttdeci">bool test(size_type n) const BMNOEXCEPT</div><div class="ttdoc">returns true if bit n is set and false is bit n is 0.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l01440">bm.h:1440</a></div></div>
<div class="ttc" id="agroup__setalgo_html_gab15f2180dfd9a8bcb0d261689336d786"><div class="ttname"><a href="group__setalgo.html#gab15f2180dfd9a8bcb0d261689336d786">bm::combine_or</a></div><div class="ttdeci">void combine_or(BV &bv, It first, It last)</div><div class="ttdoc">OR Combine bitvector and the iterable sequence.</div><div class="ttdef"><b>Definition:</b> <a href="bmalgo__impl_8h_source.html#l01016">bmalgo_impl.h:1016</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_ae2805bdcfb8ec09e8f1b9d436927f498"><div class="ttname"><a href="svsample06_8cpp.html#ae2805bdcfb8ec09e8f1b9d436927f498">rand_dis</a></div><div class="ttdeci">std::uniform_int_distribution rand_dis(1, value_max)</div></div>
<div class="ttc" id="aclassbm_1_1chrono__taker_html_add1676592117ed0eaa2fa6279a71b46a"><div class="ttname"><a href="classbm_1_1chrono__taker.html#add1676592117ed0eaa2fa6279a71b46a">bm::chrono_taker::duration_map_type</a></div><div class="ttdeci">std::map< std::string, statistics > duration_map_type</div><div class="ttdoc">test name to duration map</div><div class="ttdef"><b>Definition:</b> <a href="bmtimer_8h_source.html#l00065">bmtimer.h:65</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_a664bc1422f5a71c93c09d809b3d1ec3f"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a664bc1422f5a71c93c09d809b3d1ec3f">bm::sparse_vector::get_back_inserter</a></div><div class="ttdeci">back_insert_iterator get_back_inserter()</div><div class="ttdoc">Provide back insert iterator Back insert iterator implements buffered insertion, which is faster,...</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l00506">bmsparsevec.h:506</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="svsample06_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00133">svsample06.cpp:133</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_a937cd13482984f234a5d94cc638c22b5"><div class="ttname"><a href="classbm_1_1bvector.html#a937cd13482984f234a5d94cc638c22b5">bm::bvector::end</a></div><div class="ttdeci">enumerator end() const</div><div class="ttdoc">Returns enumerator pointing on the next bit after the last.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l01776">bm.h:1776</a></div></div>
<div class="ttc" id="aclassbm_1_1chrono__taker_html_a30b45453d952d14afe56c29087970899"><div class="ttname"><a href="classbm_1_1chrono__taker.html#a30b45453d952d14afe56c29087970899">bm::chrono_taker::print_duration_map</a></div><div class="ttdeci">static void print_duration_map(const duration_map_type &dmap, format fmt=ct_time)</div><div class="ttdef"><b>Definition:</b> <a href="bmtimer_8h_source.html#l00127">bmtimer.h:127</a></div></div>
<div class="ttc" id="asvsample06_8cpp_html_a4d7cf7e96896f9aebdd79fed7c8bab7b"><div class="ttname"><a href="svsample06_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b">rand_dev</a></div><div class="ttdeci">std::random_device rand_dev</div><div class="ttdef"><b>Definition:</b> <a href="svsample06_8cpp_source.html#l00060">svsample06.cpp:60</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_a86b939f3aed555dc073e8c26e9efea71"><div class="ttname"><a href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">bm::bvector::first</a></div><div class="ttdeci">enumerator first() const</div><div class="ttdoc">Returns enumerator pointing on the first non-zero bit.</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l01770">bm.h:1770</a></div></div>
<div class="ttc" id="abm_8h_html"><div class="ttname"><a href="bm_8h.html">bm.h</a></div><div class="ttdoc">Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.</div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_a56101ce9a559b30f8e14153133063ca7"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">bm::sparse_vector::set</a></div><div class="ttdeci">void set(size_type idx, value_type v)</div><div class="ttdoc">set specified element with bounds checking and automatic resize</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01469">bmsparsevec.h:1469</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector__scanner_html_aa2439360def2f3fe3c788872c0e70997"><div class="ttname"><a href="classbm_1_1sparse__vector__scanner.html#aa2439360def2f3fe3c788872c0e70997">bm::sparse_vector_scanner::find_eq</a></div><div class="ttdeci">void find_eq(const SV &sv, typename SV::value_type value, typename SV::bvector_type &bv_out)</div><div class="ttdoc">find all sparse vector elements EQ to search value</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec__algo_8h_source.html#l02033">bmsparsevec_algo.h:2033</a></div></div>
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.17
</small></address>
</body>
</html>
|
