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
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
|
<!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++: xsample02.cpp</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><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">xsample02.cpp</div> </div>
</div><!--header-->
<div class="contents">
<p>Counting sort using bit-vector and sparse vector to build histogram of unsigned ints.Benchmark compares different histogram buiding techniques using BitMagic and std::sort()</p>
<p>Histogram construction, based on integer events is a common problem, this demo studies different approaches, potential for parallelization and other aspects.</p>
<div class="fragment"><div class="line"><span class="comment">/*</span></div>
<div class="line"><span class="comment">Copyright(c) 2018 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">Licensed under the Apache License, Version 2.0 (the "License");</span></div>
<div class="line"><span class="comment">you may not use this file except in compliance with the License.</span></div>
<div class="line"><span class="comment">You may obtain a copy of the License at</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment"> http://www.apache.org/licenses/LICENSE-2.0</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">Unless required by applicable law or agreed to in writing, software</span></div>
<div class="line"><span class="comment">distributed under the License is distributed on an "AS IS" BASIS,</span></div>
<div class="line"><span class="comment">WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
<div class="line"><span class="comment">See the License for the specific language governing permissions and</span></div>
<div class="line"><span class="comment">limitations under the License.</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">For more information please visit: http://bitmagic.io</span></div>
<div class="line"><span class="comment">*/</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">/** \example xsample02.cpp</span></div>
<div class="line"><span class="comment"> Counting sort using bit-vector and sparse vector to build histogram of unsigned ints.</span></div>
<div class="line"><span class="comment"> Benchmark compares different histogram buiding techniques using BitMagic and std::sort()</span></div>
<div class="line"><span class="comment"> </span></div>
<div class="line"><span class="comment"> Histogram construction, based on integer events is a common problem,</span></div>
<div class="line"><span class="comment"> this demo studies different approaches, potential for parallelization and other</span></div>
<div class="line"><span class="comment"> aspects.</span></div>
<div class="line"><span class="comment">*/</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">/*! \file xsample02.cpp</span></div>
<div class="line"><span class="comment"> \brief Example: sparse_vector<> used for counting sort / historgam construction</span></div>
<div class="line"><span class="comment">*/</span></div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="preprocessor">#include <iostream></span></div>
<div class="line"><span class="preprocessor">#include <memory></span></div>
<div class="line"><span class="preprocessor">#include <map></span></div>
<div class="line"><span class="preprocessor">#include <vector></span></div>
<div class="line"><span class="preprocessor">#include <chrono></span></div>
<div class="line"><span class="preprocessor">#include <algorithm></span></div>
<div class="line"><span class="preprocessor">#include <random></span></div>
<div class="line"><span class="preprocessor">#include <stdexcept></span></div>
<div class="line"> </div>
<div class="line"><span class="preprocessor">#include <future></span></div>
<div class="line"><span class="preprocessor">#include <thread></span></div>
<div class="line"> </div>
<div class="line"><span class="preprocessor">#include "<a class="code" href="bm_8h.html">bm.h</a>"</span></div>
<div class="line"><span class="preprocessor">#include "<a class="code" href="bmtimer_8h.html">bmtimer.h</a>"</span></div>
<div class="line"><span class="preprocessor">#include "<a class="code" href="bmsparsevec_8h.html">bmsparsevec.h</a>"</span></div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="comment">// ----------------------------------------------------</span></div>
<div class="line"><span class="comment">// Global parameters and types</span></div>
<div class="line"><span class="comment">// ----------------------------------------------------</span></div>
<div class="line"> </div>
<div class="line"><span class="keyword">const</span> <span class="keywordtype">unsigned</span> <a name="a0"></a><a class="code" href="xsample02_8cpp.html#ace201b00999e65c2609354bcc2834f10">value_max</a> = 1250000; <span class="comment">// range of variants of events [0..max]</span></div>
<div class="line"><span class="keyword">const</span> <span class="keywordtype">unsigned</span> <a name="a1"></a><a class="code" href="xsample02_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a> = 250000000; <span class="comment">// number of events (ints) to generate</span></div>
<div class="line"> </div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"><span class="comment">// Random generator</span></div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"> </div>
<div class="line">std::random_device <a name="a2"></a><a class="code" href="xsample02_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b">rand_dev</a>;</div>
<div class="line">std::mt19937 <a name="a3"></a><a class="code" href="xsample02_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a>(<a class="code" href="xsample02_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b">rand_dev</a>());</div>
<div class="line">std::uniform_int_distribution<> <a name="a4"></a><a class="code" href="xsample02_8cpp.html#ae2805bdcfb8ec09e8f1b9d436927f498">rand_dis</a>(1, <a class="code" href="xsample02_8cpp.html#ace201b00999e65c2609354bcc2834f10">value_max</a>); <span class="comment">// generate uniform numebrs for [1, vector_max]</span></div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="keyword">typedef</span> <a name="_a5"></a><a class="code" href="classbm_1_1sparse__vector.html">bm::sparse_vector<unsigned, bm::bvector<></a> > <a name="a6"></a><a class="code" href="xsample02_8cpp.html#a71d75c77694afe022fe5ed0f0b98ec66">sparse_vector_u32</a>;</div>
<div class="line"><span class="keyword">typedef</span> std::map<unsigned, unsigned> <a name="a7"></a><a class="code" href="xsample02_8cpp.html#a2cd60b6d36f9cc7dfc54ba3c5fa1931b">map_u32</a>;</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="comment">// timing storage for benchmarking</span></div>
<div class="line"><a class="code" href="classbm_1_1chrono__taker.html#add1676592117ed0eaa2fa6279a71b46a">bm::chrono_taker::duration_map_type</a> <a name="a8"></a><a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>;</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"><span class="comment">// Counting sort / histogram construction (std::map)</span></div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"> </div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a name="a9"></a><a class="code" href="xsample02_8cpp.html#a8eab7b1181927f8aa1bc7aa9dba562a2">sort_map</a>(<a class="code" href="xsample02_8cpp.html#a2cd60b6d36f9cc7dfc54ba3c5fa1931b">map_u32</a>& hmap, <span class="keyword">const</span> std::vector<unsigned>& vin)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : vin)</div>
<div class="line"> {</div>
<div class="line"> hmap[v]++;</div>
<div class="line"> }</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"><span class="comment">// Counting sort / histogram construction (naive)</span></div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"> </div>
<div class="line"><span class="comment">// This sorting method uses sparse_vector<> as a storage but implements increment</span></div>
<div class="line"><span class="comment">// as an get-inc-put operations (decoding-encoding every value in the sum)</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a name="a10"></a><a class="code" href="xsample02_8cpp.html#a84e6269613fa67b8f4609be9c24d229e">counting_sort_naive</a>(<a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv_out, <span class="keyword">const</span> std::vector<unsigned>& vin)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : vin)</div>
<div class="line"> {</div>
<div class="line"> <span class="keyword">auto</span> count = sv_out.<a name="a11"></a><a class="code" href="classbm_1_1sparse__vector.html#a20fe4ed7805474ea16c7ff4a24fb3f0e">get</a>(v);</div>
<div class="line"> sv_out.<a name="a12"></a><a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(v, count + 1);</div>
<div class="line"> }</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"><span class="comment">// Counting sort / histogram construction</span></div>
<div class="line"><span class="comment">// -------------------------------------------</span></div>
<div class="line"> </div>
<div class="line"><span class="comment">// This sorting method uses sparse_vector<> as a storage but implements increment</span></div>
<div class="line"><span class="comment">// but increment was implemented as a bm::sparse_vector::inc() method</span></div>
<div class="line"><span class="comment">// which in turn is based on uses bvector<>::inc()</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="comment">// This approach is faster than decoding-encoding used in naive counting sort</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a name="a13"></a><a class="code" href="xsample02_8cpp.html#a3c0e036da876ec6e082f3d270092373a">counting_sort</a>(<a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv_out, <span class="keyword">const</span> std::vector<unsigned>& vin)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">for</span>(<span class="keyword">auto</span> v : vin)</div>
<div class="line"> sv_out.<a name="a14"></a><a class="code" href="classbm_1_1sparse__vector.html#a03a5edc8c785d50afeed20f0105495a9">inc</a>(v);</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"><span class="comment">// --------------------------------------------------</span></div>
<div class="line"><span class="comment">// Counting sort / histogram construction (parallel)</span></div>
<div class="line"><span class="comment">// --------------------------------------------------</span></div>
<div class="line"> </div>
<div class="line"><span class="comment">// parallel subproblem for all even numbers: (v & 1) == 0</span></div>
<div class="line"><span class="keyword">inline</span> </div>
<div class="line"><span class="keywordtype">unsigned</span> <a name="a15"></a><a class="code" href="xsample02_8cpp.html#a99c8ab21cdf40904529107a31313d560">counting_sort_subbatch</a>(<a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>* sv_out, <span class="keyword">const</span> std::vector<unsigned>* vin)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < vin->size(); i++)</div>
<div class="line"> {</div>
<div class="line"> <span class="keyword">auto</span> v = (*vin)[i];</div>
<div class="line"> <span class="keywordflow">if</span> ((v & 1) == 0)</div>
<div class="line"> sv_out-><a class="code" href="classbm_1_1sparse__vector.html#a03a5edc8c785d50afeed20f0105495a9">inc</a>(v);</div>
<div class="line"> }</div>
<div class="line"> <span class="keywordflow">return</span> 0;</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"><span class="comment">// Parallel histogram construction uses a very simple divide and conquer technique</span></div>
<div class="line"><span class="comment">// splitting by even/odd numbers, uses std::async() for parallelization</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="comment">// (should be possible to do a lot better than that)</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a name="a16"></a><a class="code" href="xsample02_8cpp.html#a062c0c17b97add2390a458e73459d71e">counting_sort_parallel</a>(<a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv_out, <span class="keyword">const</span> std::vector<unsigned>& vin)</div>
<div class="line">{</div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> sv_out2(<a name="a17"></a><a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"> <span class="comment">// process evens in parallel</span></div>
<div class="line"> std::future<unsigned> f1 = std::async(std::launch::async, <a class="code" href="xsample02_8cpp.html#a99c8ab21cdf40904529107a31313d560">counting_sort_subbatch</a>, &sv_out2, &vin);</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// process all odd elements</span></div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < vin.size(); i++)</div>
<div class="line"> {</div>
<div class="line"> <span class="keyword">auto</span> v = vin[i];</div>
<div class="line"> <span class="keywordflow">if</span> (v & 1)</div>
<div class="line"> sv_out.<a class="code" href="classbm_1_1sparse__vector.html#a03a5edc8c785d50afeed20f0105495a9">inc</a>(v);</div>
<div class="line"> }</div>
<div class="line"> f1.wait();</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// merge effectively performs logical OR on all plains, only it</span></div>
<div class="line"> <span class="comment">// borrows memory blocks from the argument vector, so it gets changed</span></div>
<div class="line"> <span class="comment">// (which is ok here, since sv_out2 is a temporary)</span></div>
<div class="line"> <span class="comment">//</span></div>
<div class="line"> sv_out.<a name="a18"></a><a class="code" href="classbm_1_1sparse__vector.html#a7f9df1ccf969f9ea0df4f00d0e7faf27">merge</a>(sv_out2);</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"><span class="comment">// Test utility. It also illustrates histogram access method</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a name="a19"></a><a class="code" href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a>(<span class="keyword">const</span> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv)</div>
<div class="line">{</div>
<div class="line"> <span class="keyword">const</span> <a name="_a20"></a><a class="code" href="classbm_1_1bvector.html">sparse_vector_u32::bvector_type</a>* bv_null = sv.<a name="a21"></a><a class="code" href="classbm_1_1base__sparse__vector.html#aacbde903b5a180ec493d34dd209fe542">get_null_bvector</a>();</div>
<div class="line"> <a name="a22"></a><a class="code" href="classbm_1_1bvector.html#a71cabca9670588878381f72d16e059b8">sparse_vector_u32::bvector_type::enumerator</a> en = bv_null-><a name="a23"></a><a class="code" href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">first</a>();</div>
<div class="line"> </div>
<div class="line"> <span class="keywordflow">for</span> (; en.valid(); ++en)</div>
<div class="line"> {</div>
<div class="line"> <span class="keywordtype">unsigned</span> v = *en;</div>
<div class="line"> <span class="keywordtype">unsigned</span> cnt = sv.<a class="code" href="classbm_1_1sparse__vector.html#a20fe4ed7805474ea16c7ff4a24fb3f0e">get</a>(v);</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j < cnt; ++j)</div>
<div class="line"> {</div>
<div class="line"> std::cout << v << <span class="stringliteral">", "</span>;</div>
<div class="line"> } <span class="comment">// for</span></div>
<div class="line"> } <span class="comment">// for en</span></div>
<div class="line"> std::cout << std::endl;</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"><span class="comment">// Test utility for std::map</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a class="code" href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a>(<span class="keyword">const</span> <a class="code" href="xsample02_8cpp.html#a2cd60b6d36f9cc7dfc54ba3c5fa1931b">map_u32</a>& hmap)</div>
<div class="line">{</div>
<div class="line"> map_u32::const_iterator it = hmap.begin();</div>
<div class="line"> map_u32::const_iterator it_end = hmap.end();</div>
<div class="line"> </div>
<div class="line"> <span class="keywordflow">for</span> (; it != it_end; ++it)</div>
<div class="line"> {</div>
<div class="line"> <span class="keywordtype">unsigned</span> v = it->first;</div>
<div class="line"> <span class="keywordtype">unsigned</span> cnt = it->second;</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j < cnt; ++j)</div>
<div class="line"> {</div>
<div class="line"> std::cout << v << <span class="stringliteral">", "</span>;</div>
<div class="line"> } <span class="comment">// for</span></div>
<div class="line"> } <span class="comment">// for en</span></div>
<div class="line"> std::cout << std::endl;</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="comment">// build histogram using sorted vector</span></div>
<div class="line"><span class="comment">//</span></div>
<div class="line"><span class="keyword">static</span></div>
<div class="line"><span class="keywordtype">void</span> <a name="a24"></a><a class="code" href="xsample02_8cpp.html#a7116c616ac00e3fedf31e11842331931">build_histogram</a>(<a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv_out, <span class="keyword">const</span> std::vector<unsigned>& vin)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">if</span> (vin.empty())</div>
<div class="line"> <span class="keywordflow">return</span>;</div>
<div class="line"> <span class="keywordtype">unsigned</span> start = vin[0];</div>
<div class="line"> <span class="keywordtype">unsigned</span> count = 0; <span class="comment">// histogram counter</span></div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : vin)</div>
<div class="line"> {</div>
<div class="line"> <span class="keywordflow">if</span> (v == start)</div>
<div class="line"> {</div>
<div class="line"> ++count;</div>
<div class="line"> }</div>
<div class="line"> <span class="keywordflow">else</span></div>
<div class="line"> {</div>
<div class="line"> sv_out.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(start, count);</div>
<div class="line"> start = v; count = 1; </div>
<div class="line"> }</div>
<div class="line"> }</div>
<div class="line"> <span class="keywordflow">if</span> (count)</div>
<div class="line"> {</div>
<div class="line"> sv_out.<a class="code" href="classbm_1_1sparse__vector.html#a56101ce9a559b30f8e14153133063ca7">set</a>(start, count);</div>
<div class="line"> }</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="keywordtype">int</span> <a name="a25"></a><a class="code" href="xsample02_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">try</span></div>
<div class="line"> {</div>
<div class="line"> <span class="comment">// try simple input vector as a model</span></div>
<div class="line"> <span class="comment">//</span></div>
<div class="line"> {</div>
<div class="line"> std::vector<unsigned> v {10, 1, 5, 4, 8, 8, 8} ;</div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> r_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>); <span class="comment">// result vector</span></div>
<div class="line"> </div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a3c0e036da876ec6e082f3d270092373a">counting_sort</a>(r_sv, v);</div>
<div class="line"> </div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a>(r_sv); <span class="comment">// 1, 4, 5, 8, 8, 8, 10,</span></div>
<div class="line"> </div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> p_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a062c0c17b97add2390a458e73459d71e">counting_sort_parallel</a>(p_sv, v);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a>(r_sv);</div>
<div class="line"> </div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a2cd60b6d36f9cc7dfc54ba3c5fa1931b">map_u32</a> h_map;</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a8eab7b1181927f8aa1bc7aa9dba562a2">sort_map</a>(h_map, v);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a>(h_map);</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> std::sort(v.begin(), v.end());</div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> h_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>); <span class="comment">// histogram vector</span></div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a7116c616ac00e3fedf31e11842331931">build_histogram</a>(h_sv, v);</div>
<div class="line"> <span class="keywordflow">if</span> (!r_sv.equal(h_sv))</div>
<div class="line"> {</div>
<div class="line"> std::cerr << <span class="stringliteral">"Error: Histogram comparison failed!"</span> << std::endl;</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a>(h_sv);</div>
<div class="line"> <span class="keywordflow">return</span> 1;</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// run benchmarks</span></div>
<div class="line"> <span class="comment">//</span></div>
<div class="line"> std::vector<unsigned> v;</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// generate vector of random numbers</span></div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="xsample02_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a>; ++i)</div>
<div class="line"> {</div>
<div class="line"> v.push_back(<span class="keywordtype">unsigned</span>(<a class="code" href="xsample02_8cpp.html#ae2805bdcfb8ec09e8f1b9d436927f498">rand_dis</a>(<a class="code" href="xsample02_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a>)));</div>
<div class="line"> }</div>
<div class="line"> std::cout << <span class="stringliteral">"test vector generation ok"</span> << std::endl;</div>
<div class="line"> </div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> r_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> h_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> n_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"> <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> p_sv(<a class="code" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a2cd60b6d36f9cc7dfc54ba3c5fa1931b">map_u32</a> h_map;</div>
<div class="line"> </div>
<div class="line"> {</div>
<div class="line"> <a name="_a26"></a><a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"1. counting sort "</span>, 1, &<a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a3c0e036da876ec6e082f3d270092373a">counting_sort</a>(r_sv, v);</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> {</div>
<div class="line"> <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"3. counting sort (naive) "</span>, 1, &<a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a84e6269613fa67b8f4609be9c24d229e">counting_sort_naive</a>(n_sv, v);</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> {</div>
<div class="line"> <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"4. counting sort (parallel) "</span>, 1, &<a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a062c0c17b97add2390a458e73459d71e">counting_sort_parallel</a>(p_sv, v);</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> {</div>
<div class="line"> <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"5. counting sort (map) "</span>, 1, &<a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a8eab7b1181927f8aa1bc7aa9dba562a2">sort_map</a>(h_map, v);</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> {</div>
<div class="line"> <a class="code" href="classbm_1_1chrono__taker.html">bm::chrono_taker</a> tt1(<span class="stringliteral">"2. std::sort() + histogram"</span>, 1, &<a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>);</div>
<div class="line"> std::sort(v.begin(), v.end());</div>
<div class="line"> <a class="code" href="xsample02_8cpp.html#a7116c616ac00e3fedf31e11842331931">build_histogram</a>(h_sv, v);</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> <span class="comment">// quality assurance checks</span></div>
<div class="line"> <span class="comment">//</span></div>
<div class="line"> <span class="keywordflow">if</span> (!r_sv.equal(h_sv) || !n_sv.equal(h_sv)) </div>
<div class="line"> {</div>
<div class="line"> std::cerr << <span class="stringliteral">"Error: Histogram comparison failed!"</span> << std::endl;</div>
<div class="line"> <span class="keywordflow">return</span> 1;</div>
<div class="line"> }</div>
<div class="line"> <span class="keywordflow">if</span> (!r_sv.equal(p_sv))</div>
<div class="line"> {</div>
<div class="line"> std::cerr << <span class="stringliteral">"Error: Histogram comparison failed for parallel sort!"</span> << std::endl;</div>
<div class="line"> <span class="keywordflow">return</span> 1;</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// compute memory consumption of sparse vector</span></div>
<div class="line"> {</div>
<div class="line"> std::cout << std::endl;</div>
<div class="line"> </div>
<div class="line"> <a name="a27"></a><a class="code" href="bm_8h.html#ad9736d9521d713fa5d48859aa720bfdd">BM_DECLARE_TEMP_BLOCK</a>(tb);</div>
<div class="line"> sparse_vector_u32::statistics st;</div>
<div class="line"> r_sv.optimize(tb, <a name="a28"></a><a class="code" href="classbm_1_1bvector.html#a05f1e977cb5e6208838afc7e7b69e5f0a99b64b2444e1a8b22a5e89b02dca6001">sparse_vector_u32::bvector_type::opt_compress</a>, &st);</div>
<div class="line"> </div>
<div class="line"> std::cout << <span class="stringliteral">"Sparse vector memory usage:"</span> << st.memory_used / (1024*1024)<< <span class="stringliteral">"MB"</span> << std::endl;</div>
<div class="line"> std::cout << <span class="stringliteral">"vector<unsigned> usage:"</span> << v.size() * <span class="keyword">sizeof</span>(v[0]) / (1024 * 1024) << <span class="stringliteral">"MB"</span> << std::endl << std::endl;</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> <a name="a29"></a><a class="code" href="classbm_1_1chrono__taker.html#a30b45453d952d14afe56c29087970899">bm::chrono_taker::print_duration_map</a>(<a class="code" href="xsample02_8cpp.html#a6cb51d150528a5d2d87acb3e88f450bc">timing_map</a>, <a name="a30"></a><a class="code" href="classbm_1_1chrono__taker.html#a9a41e5f2fe48ba472fd77a1dbd86457dad530ca7863ce7e60f4fa221e1dfa64a2">bm::chrono_taker::ct_ops_per_sec</a>);</div>
<div class="line"> </div>
<div class="line"> }</div>
<div class="line"> <span class="keywordflow">catch</span>(std::exception& ex)</div>
<div class="line"> {</div>
<div class="line"> std::cerr << ex.what() << std::endl;</div>
<div class="line"> <span class="keywordflow">return</span> 1;</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> <span class="keywordflow">return</span> 0;</div>
<div class="line">}</div>
<div class="line"> </div>
</div><!-- fragment --> </div><!-- contents -->
<div class="ttc" id="axsample02_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="xsample02_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00238">xsample02.cpp:238</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_aa2b978bd986f60d9fc01964da5653c78"><div class="ttname"><a href="xsample02_8cpp.html#aa2b978bd986f60d9fc01964da5653c78">print_sorted</a></div><div class="ttdeci">static void print_sorted(const sparse_vector_u32 &sv)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00170">xsample02.cpp:170</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="axsample02_8cpp_html_a6cb51d150528a5d2d87acb3e88f450bc"><div class="ttname"><a href="xsample02_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="xsample02_8cpp_source.html#l00071">xsample02.cpp:71</a></div></div>
<div class="ttc" id="abm_8h_html_ad9736d9521d713fa5d48859aa720bfdd"><div class="ttname"><a href="bm_8h.html#ad9736d9521d713fa5d48859aa720bfdd">BM_DECLARE_TEMP_BLOCK</a></div><div class="ttdeci">#define BM_DECLARE_TEMP_BLOCK(x)</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l00047">bm.h:47</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_ace201b00999e65c2609354bcc2834f10"><div class="ttname"><a href="xsample02_8cpp.html#ace201b00999e65c2609354bcc2834f10">value_max</a></div><div class="ttdeci">const unsigned value_max</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00054">xsample02.cpp:54</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_a71cabca9670588878381f72d16e059b8"><div class="ttname"><a href="classbm_1_1bvector.html#a71cabca9670588878381f72d16e059b8">bm::bvector<>::enumerator</a></div><div class="ttdeci">friend class enumerator</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l00809">bm.h:809</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="axsample02_8cpp_html_a7116c616ac00e3fedf31e11842331931"><div class="ttname"><a href="xsample02_8cpp.html#a7116c616ac00e3fedf31e11842331931">build_histogram</a></div><div class="ttdeci">static void build_histogram(sparse_vector_u32 &sv_out, const std::vector< unsigned > &vin)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00211">xsample02.cpp:211</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_a71d75c77694afe022fe5ed0f0b98ec66"><div class="ttname"><a href="xsample02_8cpp.html#a71d75c77694afe022fe5ed0f0b98ec66">sparse_vector_u32</a></div><div class="ttdeci">bm::sparse_vector< unsigned, bm::bvector<> > sparse_vector_u32</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00066">xsample02.cpp:66</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_a3c0e036da876ec6e082f3d270092373a"><div class="ttname"><a href="xsample02_8cpp.html#a3c0e036da876ec6e082f3d270092373a">counting_sort</a></div><div class="ttdeci">static void counting_sort(sparse_vector_u32 &sv_out, const std::vector< unsigned > &vin)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00116">xsample02.cpp:116</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_a4d7cf7e96896f9aebdd79fed7c8bab7b"><div class="ttname"><a href="xsample02_8cpp.html#a4d7cf7e96896f9aebdd79fed7c8bab7b">rand_dev</a></div><div class="ttdeci">std::random_device rand_dev</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00061">xsample02.cpp:61</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_a8eab7b1181927f8aa1bc7aa9dba562a2"><div class="ttname"><a href="xsample02_8cpp.html#a8eab7b1181927f8aa1bc7aa9dba562a2">sort_map</a></div><div class="ttdeci">static void sort_map(map_u32 &hmap, const std::vector< unsigned > &vin)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00079">xsample02.cpp:79</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_a062c0c17b97add2390a458e73459d71e"><div class="ttname"><a href="xsample02_8cpp.html#a062c0c17b97add2390a458e73459d71e">counting_sort_parallel</a></div><div class="ttdeci">static void counting_sort_parallel(sparse_vector_u32 &sv_out, const std::vector< unsigned > &vin)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00145">xsample02.cpp:145</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="axsample02_8cpp_html_ae2805bdcfb8ec09e8f1b9d436927f498"><div class="ttname"><a href="xsample02_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="axsample02_8cpp_html_a006d7ce7dc31baa25671d1d264dd0c64"><div class="ttname"><a href="xsample02_8cpp.html#a006d7ce7dc31baa25671d1d264dd0c64">test_size</a></div><div class="ttdeci">const unsigned test_size</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00055">xsample02.cpp:55</a></div></div>
<div class="ttc" id="aclassbm_1_1bvector_html_a05f1e977cb5e6208838afc7e7b69e5f0a99b64b2444e1a8b22a5e89b02dca6001"><div class="ttname"><a href="classbm_1_1bvector.html#a05f1e977cb5e6208838afc7e7b69e5f0a99b64b2444e1a8b22a5e89b02dca6001">bm::bvector<>::opt_compress</a></div><div class="ttdeci">@ opt_compress</div><div class="ttdoc">compress blocks when possible (GAP/prefix sum)</div><div class="ttdef"><b>Definition:</b> <a href="bm_8h_source.html#l00134">bm.h:134</a></div></div>
<div class="ttc" id="axsample02_8cpp_html_a84e6269613fa67b8f4609be9c24d229e"><div class="ttname"><a href="xsample02_8cpp.html#a84e6269613fa67b8f4609be9c24d229e">counting_sort_naive</a></div><div class="ttdeci">static void counting_sort_naive(sparse_vector_u32 &sv_out, const std::vector< unsigned > &vin)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00096">xsample02.cpp:96</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="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="aclassbm_1_1sparse__vector_html_a20fe4ed7805474ea16c7ff4a24fb3f0e"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a20fe4ed7805474ea16c7ff4a24fb3f0e">bm::sparse_vector::get</a></div><div class="ttdeci">value_type get(size_type idx) const BMNOEXCEPT</div><div class="ttdoc">get specified element without bounds checking</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01445">bmsparsevec.h:1445</a></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_a7f9df1ccf969f9ea0df4f00d0e7faf27"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a7f9df1ccf969f9ea0df4f00d0e7faf27">bm::sparse_vector::merge</a></div><div class="ttdeci">sparse_vector< Val, BV > & merge(sparse_vector< Val, BV > &sv)</div><div class="ttdoc">merge with another sparse vector using OR operation Merge is different from join(),...</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01803">bmsparsevec.h:1803</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="axsample02_8cpp_html_a9b287f91e2adf83c3131895cd6e07195"><div class="ttname"><a href="xsample02_8cpp.html#a9b287f91e2adf83c3131895cd6e07195">gen</a></div><div class="ttdeci">std::mt19937 gen(rand_dev())</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="axsample02_8cpp_html_a99c8ab21cdf40904529107a31313d560"><div class="ttname"><a href="xsample02_8cpp.html#a99c8ab21cdf40904529107a31313d560">counting_sort_subbatch</a></div><div class="ttdeci">unsigned counting_sort_subbatch(sparse_vector_u32 *sv_out, const std::vector< unsigned > *vin)</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00128">xsample02.cpp:128</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="axsample02_8cpp_html_a2cd60b6d36f9cc7dfc54ba3c5fa1931b"><div class="ttname"><a href="xsample02_8cpp.html#a2cd60b6d36f9cc7dfc54ba3c5fa1931b">map_u32</a></div><div class="ttdeci">std::map< unsigned, unsigned > map_u32</div><div class="ttdef"><b>Definition:</b> <a href="xsample02_8cpp_source.html#l00067">xsample02.cpp:67</a></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_html_a03a5edc8c785d50afeed20f0105495a9"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a03a5edc8c785d50afeed20f0105495a9">bm::sparse_vector::inc</a></div><div class="ttdeci">void inc(size_type idx)</div><div class="ttdoc">increment specified element by one</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01661">bmsparsevec.h:1661</a></div></div>
<div class="ttc" id="aclassbm_1_1base__sparse__vector_html_aacbde903b5a180ec493d34dd209fe542"><div class="ttname"><a href="classbm_1_1base__sparse__vector.html#aacbde903b5a180ec493d34dd209fe542">bm::base_sparse_vector::get_null_bvector</a></div><div class="ttdeci">const bvector_type * get_null_bvector() const BMNOEXCEPT</div><div class="ttdoc">Get bit-vector of assigned values or NULL (if not constructed that way)</div><div class="ttdef"><b>Definition:</b> <a href="bmbmatrix_8h_source.html#l00329">bmbmatrix.h:329</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>
|
