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
|
<!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++: sample16.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">sample16.cpp</div> </div>
</div><!--header-->
<div class="contents">
<p>Example for finding first and last bits in bit-vector (dynamic range).Ranges of bit-vectors can be used to find probability of intersection. For instance, in some corner cases AND product can be predicted empty if vectors belong to different ranges. </p><pre class="fragment">@sa bm::aggregator
</pre><div class="fragment"><div class="line"><span class="comment">/*</span></div>
<div class="line"><span class="comment">Copyright(c) 2002-2017 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 sample16.cpp</span></div>
<div class="line"><span class="comment">Example for finding first and last bits in bit-vector (dynamic range).</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">Ranges of bit-vectors can be used to find probability of intersection.</span></div>
<div class="line"><span class="comment">For instance, in some corner cases AND product can be predicted empty if vectors</span></div>
<div class="line"><span class="comment">belong to different ranges.</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment"> @sa bm::aggregator</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 sample16.cpp</span></div>
<div class="line"><span class="comment"> \brief Example: how to use bm::aggregator<> for logical operations</span></div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment"> bm::aggregator<> uses cache blocking techniques and bandwidth optimizations</span></div>
<div class="line"><span class="comment"> to do logical operations (OR, AND, AND-SUB) faster, than if we do it by</span></div>
<div class="line"><span class="comment"> combining bit-vectors one by one, sequentially.</span></div>
<div class="line"><span class="comment">*/</span></div>
<div class="line"> </div>
<div class="line"><span class="preprocessor">#include <stdlib.h></span></div>
<div class="line"><span class="preprocessor">#include <iostream></span></div>
<div class="line"><span class="preprocessor">#include <vector></span></div>
<div class="line"><span class="preprocessor">#include <memory></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="bmaggregator_8h.html">bmaggregator.h</a>"</span></div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"><span class="comment">// Utility template function used to print container</span></div>
<div class="line"><span class="keyword">template</span><<span class="keyword">class</span> T> <span class="keywordtype">void</span> <a name="a0"></a><a class="code" href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a>(T first, T last)</div>
<div class="line">{</div>
<div class="line"> <span class="keywordflow">if</span> (first == last)</div>
<div class="line"> std::cout << <span class="stringliteral">"<EMPTY SET>"</span>;</div>
<div class="line"> <span class="keywordflow">else</span></div>
<div class="line"> <span class="keywordflow">for</span> (; first != last; ++first)</div>
<div class="line"> std::cout << *first << <span class="stringliteral">";"</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="keyword">const</span> <span class="keywordtype">unsigned</span> <a name="a1"></a><a class="code" href="sample16_8cpp.html#a1628f8ef83d2de474e2ee5bb37d065f8">max_vectors</a> = 10;</div>
<div class="line"> </div>
<div class="line"><span class="keywordtype">int</span> <a name="a2"></a><a class="code" href="sample16_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">// declare standalone aggregator for logical operations</span></div>
<div class="line"> <a name="_a3"></a><a class="code" href="classbm_1_1aggregator.html">bm::aggregator<bm::bvector<></a> > agg;</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// current version of aggregator is capped at 256 processing limit</span></div>
<div class="line"> <span class="keywordflow">if</span> (<a class="code" href="sample16_8cpp.html#a1628f8ef83d2de474e2ee5bb37d065f8">max_vectors</a> > agg.<a name="a4"></a><a class="code" href="classbm_1_1aggregator.html#a14653bc91e25d55509f8a9fd68c22400a8877828688940147abf65db89decb290">max_aggregator_cap</a>)</div>
<div class="line"> {</div>
<div class="line"> std::cerr << <span class="stringliteral">"Too many bit-vectors!"</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"> std::cout << <span class="stringliteral">"AGRUMENT (GROUP 0) SETS:"</span> << std::endl;</div>
<div class="line"> <span class="comment">// make vector of bit-vectors, set some bits</span></div>
<div class="line"> std::vector<std::unique_ptr<bm::bvector<> > > vect;</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="sample16_8cpp.html#a1628f8ef83d2de474e2ee5bb37d065f8">max_vectors</a>; ++i)</div>
<div class="line"> {</div>
<div class="line"> std::unique_ptr<bm::bvector<>> bv(<span class="keyword">new</span> <a name="_a5"></a><a class="code" href="classbm_1_1bvector.html">bm::bvector<></a>());</div>
<div class="line"> bv->set(i);</div>
<div class="line"> bv->set(i+1);</div>
<div class="line"> bv->set(10000);</div>
<div class="line"> bv->set(20000);</div>
<div class="line"> <a class="code" href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a>(bv->first(), bv->end());</div>
<div class="line"> bv->optimize();</div>
<div class="line"> vect.push_back(std::move(bv));</div>
<div class="line"> }</div>
<div class="line"> std::cout << std::endl;</div>
<div class="line"> </div>
<div class="line"> <span class="keywordflow">try</span></div>
<div class="line"> {</div>
<div class="line"> <span class="comment">// in a loop we add all agruments to the aggregator</span></div>
<div class="line"> <span class="comment">// (aggregator does not take ownership of pointers it receives)</span></div>
<div class="line"> <span class="comment">//</span></div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < vect.size(); ++i)</div>
<div class="line"> {</div>
<div class="line"> agg.<a name="a6"></a><a class="code" href="classbm_1_1aggregator.html#a49f8e30198af61d5f000266407f0861b">add</a>(vect[i].get());</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_res; <span class="comment">// target vector for aggregation</span></div>
<div class="line"> </div>
<div class="line"> agg.<a name="a7"></a><a class="code" href="classbm_1_1aggregator.html#a650fc3a5385c98a7b8bc7bf188ce4487">combine_or</a>(bv_res); <span class="comment">// perform logical OR on a vector group</span></div>
<div class="line"> </div>
<div class="line"> std::cout << <span class="stringliteral">"OR:"</span> << std::endl;</div>
<div class="line"> <a class="code" href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a>(bv_res.<a name="a8"></a><a class="code" href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">first</a>(), bv_res.<a name="a9"></a><a class="code" href="classbm_1_1bvector.html#a937cd13482984f234a5d94cc638c22b5">end</a>()); <span class="comment">// 0, 1, 2, 3, 4... 10000, 20000</span></div>
<div class="line"> </div>
<div class="line"> <span class="comment">// since we did not call bm::aggregator::reset() the vector group</span></div>
<div class="line"> <span class="comment">// still remains attached</span></div>
<div class="line"> </div>
<div class="line"> std::cout << <span class="stringliteral">"AND:"</span> << std::endl;</div>
<div class="line"> agg.<a name="a10"></a><a class="code" href="classbm_1_1aggregator.html#a6cb2c891e4be55d0846f88df1a251505">combine_and</a>(bv_res); <span class="comment">// AND on the same vector group</span></div>
<div class="line"> <a class="code" href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a>(bv_res.<a class="code" href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">first</a>(), bv_res.<a class="code" href="classbm_1_1bvector.html#a937cd13482984f234a5d94cc638c22b5">end</a>()); <span class="comment">// 10000, 20000</span></div>
<div class="line"> </div>
<div class="line"> agg.<a name="a11"></a><a class="code" href="classbm_1_1aggregator.html#a0b0a2add603cd4093bd0908d65213cfa">reset</a>(); <span class="comment">// reset the aggregator</span></div>
<div class="line"> </div>
<div class="line"> <span class="comment">// fused logical AND MINUS example</span></div>
<div class="line"> <span class="comment">// AND(vector-group-0) SUBstract (AND NOT) vector-group-1</span></div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < vect.size(); ++i)</div>
<div class="line"> {</div>
<div class="line"> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> group0 = 0; <span class="comment">// vector group 0</span></div>
<div class="line"> agg.<a class="code" href="classbm_1_1aggregator.html#a49f8e30198af61d5f000266407f0861b">add</a>(vect[i].get(), group0);</div>
<div class="line"> }</div>
<div class="line"> <span class="comment">// Note that we do not set vector group 1 yet, so operation just</span></div>
<div class="line"> <span class="comment">// runs as a regular AND MINUS an empty-set</span></div>
<div class="line"> </div>
<div class="line"> agg.<a name="a12"></a><a class="code" href="classbm_1_1aggregator.html#a5517cec5ddf0eb182475eb346c9b9a18">combine_and_sub</a>(bv_res); <span class="comment">// AND-SUB vector group1 and group2</span></div>
<div class="line"> </div>
<div class="line"> std::cout << <span class="stringliteral">"AND-SUB(empty):"</span> << std::endl;</div>
<div class="line"> <a class="code" href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a>(bv_res.<a class="code" href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">first</a>(), bv_res.<a class="code" href="classbm_1_1bvector.html#a937cd13482984f234a5d94cc638c22b5">end</a>()); <span class="comment">// 10000, 20000</span></div>
<div class="line"> </div>
<div class="line"> <a class="code" href="classbm_1_1bvector.html">bm::bvector<></a> bv_not { 10, 10000 };</div>
<div class="line"> agg.<a class="code" href="classbm_1_1aggregator.html#a49f8e30198af61d5f000266407f0861b">add</a>(&bv_not, 1); <span class="comment">// add to vector-group-1</span></div>
<div class="line"> </div>
<div class="line"> agg.<a class="code" href="classbm_1_1aggregator.html#a5517cec5ddf0eb182475eb346c9b9a18">combine_and_sub</a>(bv_res); <span class="comment">// AND-SUB vector group0 minus group1</span></div>
<div class="line"> </div>
<div class="line"> std::cout << <span class="stringliteral">"AND-SUB:"</span> << std::endl;</div>
<div class="line"> <a class="code" href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a>(bv_res.<a class="code" href="classbm_1_1bvector.html#a86b939f3aed555dc073e8c26e9efea71">first</a>(), bv_res.<a class="code" href="classbm_1_1bvector.html#a937cd13482984f234a5d94cc638c22b5">end</a>()); <span class="comment">// 20000</span></div>
<div class="line"> </div>
<div class="line"> agg.<a class="code" href="classbm_1_1aggregator.html#a0b0a2add603cd4093bd0908d65213cfa">reset</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"> agg.<a class="code" href="classbm_1_1aggregator.html#a0b0a2add603cd4093bd0908d65213cfa">reset</a>(); <span class="comment">// reset</span></div>
<div class="line"> <span class="keywordflow">throw</span>;</div>
<div class="line"> }</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"> </div>
<div class="line"> <span class="keywordflow">return</span> 0;</div>
<div class="line">}</div>
<div class="line"> </div>
<div class="line"> </div>
</div><!-- fragment --> </div><!-- contents -->
<div class="ttc" id="abmaggregator_8h_html"><div class="ttname"><a href="bmaggregator_8h.html">bmaggregator.h</a></div><div class="ttdoc">Algorithms for fast aggregation of N bvectors.</div></div>
<div class="ttc" id="aclassbm_1_1aggregator_html_a650fc3a5385c98a7b8bc7bf188ce4487"><div class="ttname"><a href="classbm_1_1aggregator.html#a650fc3a5385c98a7b8bc7bf188ce4487">bm::aggregator::combine_or</a></div><div class="ttdeci">void combine_or(bvector_type &bv_target)</div><div class="ttdoc">Aggregate added group of vectors using logical OR Operation does NOT perform an explicit reset of arg...</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00609">bmaggregator.h:609</a></div></div>
<div class="ttc" id="aclassbm_1_1aggregator_html_a6cb2c891e4be55d0846f88df1a251505"><div class="ttname"><a href="classbm_1_1aggregator.html#a6cb2c891e4be55d0846f88df1a251505">bm::aggregator::combine_and</a></div><div class="ttdeci">void combine_and(bvector_type &bv_target)</div><div class="ttdoc">Aggregate added group of vectors using logical AND Operation does NOT perform an explicit reset of ar...</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00617">bmaggregator.h:617</a></div></div>
<div class="ttc" id="aclassbm_1_1aggregator_html"><div class="ttname"><a href="classbm_1_1aggregator.html">bm::aggregator</a></div><div class="ttdoc">Algorithms for fast aggregation of a group of bit-vectors.</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00058">bmaggregator.h:58</a></div></div>
<div class="ttc" id="aclassbm_1_1aggregator_html_a5517cec5ddf0eb182475eb346c9b9a18"><div class="ttname"><a href="classbm_1_1aggregator.html#a5517cec5ddf0eb182475eb346c9b9a18">bm::aggregator::combine_and_sub</a></div><div class="ttdeci">bool combine_and_sub(bvector_type &bv_target)</div><div class="ttdoc">Aggregate added group of vectors using fused logical AND-SUB Operation does NOT perform an explicit r...</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00625">bmaggregator.h:625</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="asample16_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="sample16_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition:</b> <a href="sample16_8cpp_source.html#l00060">sample16.cpp:60</a></div></div>
<div class="ttc" id="aclassbm_1_1aggregator_html_a49f8e30198af61d5f000266407f0861b"><div class="ttname"><a href="classbm_1_1aggregator.html#a49f8e30198af61d5f000266407f0861b">bm::aggregator::add</a></div><div class="ttdeci">unsigned add(const bvector_type *bv, unsigned agr_group=0) BMNOEXCEPT</div><div class="ttdoc">Attach source bit-vector to a argument group (0 or 1).</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00576">bmaggregator.h:576</a></div></div>
<div class="ttc" id="asample16_8cpp_html_a1628f8ef83d2de474e2ee5bb37d065f8"><div class="ttname"><a href="sample16_8cpp.html#a1628f8ef83d2de474e2ee5bb37d065f8">max_vectors</a></div><div class="ttdeci">const unsigned max_vectors</div><div class="ttdef"><b>Definition:</b> <a href="sample16_8cpp_source.html#l00058">sample16.cpp:58</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="asample16_8cpp_html_a15ab1ec24c164cc91abcefb45a316cec"><div class="ttname"><a href="sample16_8cpp.html#a15ab1ec24c164cc91abcefb45a316cec">PrintContainer</a></div><div class="ttdeci">void PrintContainer(T first, T last)</div><div class="ttdef"><b>Definition:</b> <a href="sample16_8cpp_source.html#l00047">sample16.cpp:47</a></div></div>
<div class="ttc" id="aclassbm_1_1aggregator_html_a0b0a2add603cd4093bd0908d65213cfa"><div class="ttname"><a href="classbm_1_1aggregator.html#a0b0a2add603cd4093bd0908d65213cfa">bm::aggregator::reset</a></div><div class="ttdeci">void reset() BMNOEXCEPT</div><div class="ttdoc">Reset aggregate groups, forget all attached vectors.</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00542">bmaggregator.h:542</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_1aggregator_html_a14653bc91e25d55509f8a9fd68c22400a8877828688940147abf65db89decb290"><div class="ttname"><a href="classbm_1_1aggregator.html#a14653bc91e25d55509f8a9fd68c22400a8877828688940147abf65db89decb290">bm::aggregator::max_aggregator_cap</a></div><div class="ttdeci">@ max_aggregator_cap</div><div class="ttdef"><b>Definition:</b> <a href="bmaggregator_8h_source.html#l00071">bmaggregator.h:71</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>
|
