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
|
<!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++: svsample07.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_60ad3397232c890bedcbff3508677be7.html">svsample07</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">svsample07.cpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="svsample07_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-2019 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 svsample07.cpp</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> Example of how to use bm::str_sparse_vector<> - succinct container for</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> sorted bit-transposed collection of integers</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"></span> </div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> \sa bm::sparse_vector</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> \sa bm::sparse_vector_scanner<>::lower_bound</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 svsample07.cpp</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> \brief Example: sparse_vector<> lower bound search</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 <algorithm></span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <stdexcept></span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="bm_8h.html">bm.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_8h.html">bmsparsevec.h</a>"</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="bmsparsevec__algo_8h.html">bmsparsevec_algo.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="svsample07_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="svsample07_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> <span class="comment">// generate collection of strings from integers and shuffle it</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="keyword">static</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="svsample07_8cpp.html#a7f07aebb0c5cf6572988b962533f1219"> 51</a></span> <span class="keywordtype">void</span> <a class="code" href="svsample07_8cpp.html#a7f07aebb0c5cf6572988b962533f1219">generate_set</a>(vector<unsigned>& vec)</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> {</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> max_coll = 50000;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  </div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  vec.resize(0);</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 10; i < max_coll; i += rand() % 3)</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  {</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  vec.emplace_back(i);</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  } <span class="comment">// for i</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// shuffle the data set</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  std::random_device rd;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  std::mt19937 g(rd());</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  std::shuffle(vec.begin(), vec.end(), g);</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> <span class="comment">// insertion sort takes data from unsorted vector places it into sparse vector</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// maintaining correct sorted order (for fast search)</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">//</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">static</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="svsample07_8cpp.html#a2fbfec2828ac41f6a2f61eb8e9489447"> 72</a></span> <span class="keywordtype">void</span> <a class="code" href="svsample07_8cpp.html#a2fbfec2828ac41f6a2f61eb8e9489447">insertion_sort</a>(<a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a>& sv, <span class="keyword">const</span> vector<unsigned>& vec)</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> {</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// scanner object is re-used throught the processing</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">//</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</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="l00077"></a><span class="lineno"> 77</span>  <a class="code" href="classbm_1_1sparse__vector.html#a0ce76a1e2cec9034664fb7ce4d5c23ae">sparse_vector_u32::size_type</a> pos;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> u : vec)</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>  <span class="keywordtype">bool</span> found = scanner.<a class="code" href="classbm_1_1sparse__vector__scanner.html#a829344ab84ab86e4c86688f4e1b366eb">lower_bound</a>(sv, u, pos);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  (void)found; <span class="comment">// just to silence the unused variable warning</span></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>  sv.<a class="code" href="classbm_1_1sparse__vector.html#a97f0faf155c31f487812a90679bda190">insert</a>(pos, u);</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="comment">// for u</span></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>  </div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="svsample07_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe"> 90</a></span> <span class="keywordtype">int</span> <a class="code" href="svsample07_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> {</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">try</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="classbm_1_1sparse__vector.html">sparse_vector_u32</a> sv;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  vector<unsigned> vec;</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <a class="code" href="svsample07_8cpp.html#a7f07aebb0c5cf6572988b962533f1219">generate_set</a>(vec);</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>  <a class="code" href="svsample07_8cpp.html#a2fbfec2828ac41f6a2f61eb8e9489447">insertion_sort</a>(sv, vec);</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>  sv.<a class="code" href="classbm_1_1sparse__vector.html#af9f218aa3af25cdfc9088cc0affdaa8f">optimize</a>(); <span class="comment">// mmemory optimization after active editing</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">// validate the results to match STL sort</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  std::sort(vec.begin(), vec.end());</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  vector<unsigned>::const_iterator vit = vec.begin();</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</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="l00107"></a><span class="lineno"> 107</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="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">for</span> (; it != it_end; ++it, ++vit)</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">unsigned</span> u = *it;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (*vit != u)</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  {</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  cerr << <span class="stringliteral">"Mismatch at:"</span> << u << <span class="stringliteral">"!="</span> << *vit << endl;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</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>  }</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  cout << <span class="stringliteral">"Sort validation Ok."</span> << endl;</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>  <span class="keywordflow">catch</span>(std::exception& ex)</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::cerr << ex.what() << std::endl;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</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>  <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div>
</div><!-- fragment --></div><!-- contents -->
<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_af9f218aa3af25cdfc9088cc0affdaa8f"><div class="ttname"><a href="classbm_1_1sparse__vector.html#af9f218aa3af25cdfc9088cc0affdaa8f">bm::sparse_vector::optimize</a></div><div class="ttdeci">void optimize(bm::word_t *temp_block=0, typename bvector_type::optmode opt_mode=bvector_type::opt_compress, typename sparse_vector< Val, BV >::statistics *stat=0)</div><div class="ttdoc">run memory optimization for all vector plains</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01728">bmsparsevec.h:1728</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="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_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_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="asvsample07_8cpp_html_a7f07aebb0c5cf6572988b962533f1219"><div class="ttname"><a href="svsample07_8cpp.html#a7f07aebb0c5cf6572988b962533f1219">generate_set</a></div><div class="ttdeci">static void generate_set(vector< unsigned > &vec)</div><div class="ttdef"><b>Definition:</b> <a href="svsample07_8cpp_source.html#l00051">svsample07.cpp:51</a></div></div>
<div class="ttc" id="asvsample07_8cpp_html_a2fbfec2828ac41f6a2f61eb8e9489447"><div class="ttname"><a href="svsample07_8cpp.html#a2fbfec2828ac41f6a2f61eb8e9489447">insertion_sort</a></div><div class="ttdeci">static void insertion_sort(sparse_vector_u32 &sv, const vector< unsigned > &vec)</div><div class="ttdef"><b>Definition:</b> <a href="svsample07_8cpp_source.html#l00072">svsample07.cpp:72</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="asvsample07_8cpp_html_a6285ce7ea16491e7b6e34d7007385b38"><div class="ttname"><a href="svsample07_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="svsample07_8cpp_source.html#l00046">svsample07.cpp:46</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector_html_a97f0faf155c31f487812a90679bda190"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a97f0faf155c31f487812a90679bda190">bm::sparse_vector::insert</a></div><div class="ttdeci">void insert(size_type idx, value_type v)</div><div class="ttdoc">insert specified element into container</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l01520">bmsparsevec.h:1520</a></div></div>
<div class="ttc" id="asvsample07_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="svsample07_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition:</b> <a href="svsample07_8cpp_source.html#l00090">svsample07.cpp:90</a></div></div>
<div class="ttc" id="aclassbm_1_1sparse__vector__scanner_html_a829344ab84ab86e4c86688f4e1b366eb"><div class="ttname"><a href="classbm_1_1sparse__vector__scanner.html#a829344ab84ab86e4c86688f4e1b366eb">bm::sparse_vector_scanner::lower_bound</a></div><div class="ttdeci">bool lower_bound(const SV &sv, const typename SV::value_type val, typename SV::size_type &pos)</div><div class="ttdoc">lower bound search for an array position</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec__algo_8h_source.html#l01721">bmsparsevec_algo.h:1721</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_a0ce76a1e2cec9034664fb7ce4d5c23ae"><div class="ttname"><a href="classbm_1_1sparse__vector.html#a0ce76a1e2cec9034664fb7ce4d5c23ae">bm::sparse_vector< unsigned, bm::bvector<> >::size_type</a></div><div class="ttdeci">bvector_type::size_type size_type</div><div class="ttdef"><b>Definition:</b> <a href="bmsparsevec_8h_source.html#l00087">bmsparsevec.h:87</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>
|
