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
|
<!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++: Sparse vector algorithms</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="summary">
<a href="#nested-classes">Data Structures</a> |
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">Sparse vector algorithms<div class="ingroups"><a class="el" href="group__bmagic.html">BitMagic Library</a> » <a class="el" href="group__svector.html">Sparse and compressed vectors</a></div></div> </div>
</div><!--header-->
<div class="contents">
<p>Sparse vector algorithms.
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for Sparse vector algorithms:</div>
<div class="dyncontent">
<div class="center"><img src="group__svalgo.png" border="0" usemap="#group____svalgo" alt=""/></div>
<map name="group____svalgo" id="group____svalgo">
<area shape="rect" href="group__svector.html" title="Sparse vector for integer types using bit transposition transform." alt="" coords="5,15,168,55"/>
<area shape="rect" title="Sparse vector algorithms." alt="" coords="217,22,383,47"/>
<area shape="rect" href="group__setalgo.html" title="Set algebra algorithms using bit-vectors, arrays. Binary metrics and distances. Random sub-sets." alt="" coords="591,22,733,47"/>
</map>
</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Data Structures</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classbm_1_1sparse__vector__scanner.html">bm::sparse_vector_scanner< SV ></a></td></tr>
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">algorithms for <a class="el" href="classbm_1_1sparse__vector.html" title="sparse vector with runtime compression using bit transposition method">sparse_vector</a> scan/search <a href="classbm_1_1sparse__vector__scanner.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classbm_1_1set2set__11__transform.html">bm::set2set_11_transform< SV ></a></td></tr>
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">Integer set to set transformation (functional image in groups theory) <a href="https://en.wikipedia.org/wiki/Image_(mathematics)">https://en.wikipedia.org/wiki/Image_(mathematics)</a> <a href="classbm_1_1set2set__11__transform.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ga8db8490605da59d92640ef10c848fffd"><td class="memTemplParams" colspan="2">template<typename SV > </td></tr>
<tr class="memitem:ga8db8490605da59d92640ef10c848fffd"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__svalgo.html#ga8db8490605da59d92640ef10c848fffd">bm::dynamic_range_clip_high</a> (SV &svect, unsigned high_bit)</td></tr>
<tr class="memdesc:ga8db8490605da59d92640ef10c848fffd"><td class="mdescLeft"> </td><td class="mdescRight">Clip dynamic range for signal higher than specified. <a href="group__svalgo.html#ga8db8490605da59d92640ef10c848fffd">More...</a><br /></td></tr>
<tr class="separator:ga8db8490605da59d92640ef10c848fffd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga8b03276545d726ad90e26e54945531fb"><td class="memTemplParams" colspan="2">template<typename SV > </td></tr>
<tr class="memitem:ga8b03276545d726ad90e26e54945531fb"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__svalgo.html#ga8b03276545d726ad90e26e54945531fb">bm::dynamic_range_clip_low</a> (SV &svect, unsigned low_bit)</td></tr>
<tr class="memdesc:ga8b03276545d726ad90e26e54945531fb"><td class="mdescLeft"> </td><td class="mdescRight">Clip dynamic range for signal lower than specified (boost) <a href="group__svalgo.html#ga8b03276545d726ad90e26e54945531fb">More...</a><br /></td></tr>
<tr class="separator:ga8b03276545d726ad90e26e54945531fb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ga5b8ca92c5fff30f5b741fc95fe2b3199"><td class="memTemplParams" colspan="2">template<typename SV > </td></tr>
<tr class="memitem:ga5b8ca92c5fff30f5b741fc95fe2b3199"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__svalgo.html#ga5b8ca92c5fff30f5b741fc95fe2b3199">bm::sparse_vector_find_first_mismatch</a> (const SV &sv1, const SV &sv2, typename SV::size_type &midx, <a class="el" href="group__bvector.html#gab0835910831729c806840cd5c8f40b2b">bm::null_support</a> null_proc=<a class="el" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a>)</td></tr>
<tr class="memdesc:ga5b8ca92c5fff30f5b741fc95fe2b3199"><td class="mdescLeft"> </td><td class="mdescRight">Find first mismatch (element which is different) between two sparse vectors (uses linear scan in bit-vector plains) <a href="group__svalgo.html#ga5b8ca92c5fff30f5b741fc95fe2b3199">More...</a><br /></td></tr>
<tr class="separator:ga5b8ca92c5fff30f5b741fc95fe2b3199"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:gab1650345bdfd57d5b161d91bd8947bec"><td class="memTemplParams" colspan="2">template<typename SV1 , typename SV2 > </td></tr>
<tr class="memitem:gab1650345bdfd57d5b161d91bd8947bec"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="group__svalgo.html#gab1650345bdfd57d5b161d91bd8947bec">bm::sparse_vector_find_mismatch</a> (typename <a class="el" href="strsvsample05_8cpp.html#a4ca03dfc387c36e69ea916426572acdc">SV1::bvector_type</a> &bv, const SV1 &sv1, const SV2 &sv2, <a class="el" href="group__bvector.html#gab0835910831729c806840cd5c8f40b2b">bm::null_support</a> null_proc)</td></tr>
<tr class="memdesc:gab1650345bdfd57d5b161d91bd8947bec"><td class="mdescLeft"> </td><td class="mdescRight">Find mismatch vector, indicating positions of mismatch between two sparse vectors (uses linear scan in bit-vector plains) <a href="group__svalgo.html#gab1650345bdfd57d5b161d91bd8947bec">More...</a><br /></td></tr>
<tr class="separator:gab1650345bdfd57d5b161d91bd8947bec"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<p>Sparse vector algorithms. </p>
<h2 class="groupheader">Function Documentation</h2>
<a id="ga8db8490605da59d92640ef10c848fffd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga8db8490605da59d92640ef10c848fffd">◆ </a></span>dynamic_range_clip_high()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename SV > </div>
<table class="memname">
<tr>
<td class="memname">void bm::dynamic_range_clip_high </td>
<td>(</td>
<td class="paramtype">SV & </td>
<td class="paramname"><em>svect</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"><em>high_bit</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Clip dynamic range for signal higher than specified. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">svect</td><td>- sparse vector to do clipping </td></tr>
<tr><td class="paramname">high_bit</td><td>- max bit (inclusive) allowed for this signal vector</td></tr>
</table>
</dd>
</dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="group__svalgo.html#ga8b03276545d726ad90e26e54945531fb" title="Clip dynamic range for signal lower than specified (boost)">dynamic_range_clip_low</a> </dd></dl>
<p class="definition">Definition at line <a class="el" href="bmsparsevec__algo_8h_source.html#l00064">64</a> of file <a class="el" href="bmsparsevec__algo_8h_source.html">bmsparsevec_algo.h</a>.</p>
<p class="reference">References <a class="el" href="bm_8h_source.html#l04809">bm::bvector< Alloc >::bit_or()</a>, and <a class="el" href="bmdef_8h_source.html#l00130">BM_ASSERT</a>.</p>
</div>
</div>
<a id="ga8b03276545d726ad90e26e54945531fb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga8b03276545d726ad90e26e54945531fb">◆ </a></span>dynamic_range_clip_low()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename SV > </div>
<table class="memname">
<tr>
<td class="memname">void bm::dynamic_range_clip_low </td>
<td>(</td>
<td class="paramtype">SV & </td>
<td class="paramname"><em>svect</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"><em>low_bit</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Clip dynamic range for signal lower than specified (boost) </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">svect</td><td>- sparse vector to do clipping </td></tr>
<tr><td class="paramname">low_bit</td><td>- low bit (inclusive) allowed for this signal vector</td></tr>
</table>
</dd>
</dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="group__svalgo.html#ga8db8490605da59d92640ef10c848fffd" title="Clip dynamic range for signal higher than specified.">dynamic_range_clip_high</a> </dd></dl>
<p class="definition">Definition at line <a class="el" href="bmsparsevec__algo_8h_source.html#l00105">105</a> of file <a class="el" href="bmsparsevec__algo_8h_source.html">bmsparsevec_algo.h</a>.</p>
<p class="reference">References <a class="el" href="bm_8h_source.html#l04809">bm::bvector< Alloc >::bit_or()</a>, and <a class="el" href="bmdef_8h_source.html#l00130">BM_ASSERT</a>.</p>
</div>
</div>
<a id="ga5b8ca92c5fff30f5b741fc95fe2b3199"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga5b8ca92c5fff30f5b741fc95fe2b3199">◆ </a></span>sparse_vector_find_first_mismatch()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename SV > </div>
<table class="memname">
<tr>
<td class="memname">bool bm::sparse_vector_find_first_mismatch </td>
<td>(</td>
<td class="paramtype">const SV & </td>
<td class="paramname"><em>sv1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const SV & </td>
<td class="paramname"><em>sv2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">typename SV::size_type & </td>
<td class="paramname"><em>midx</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="group__bvector.html#gab0835910831729c806840cd5c8f40b2b">bm::null_support</a> </td>
<td class="paramname"><em>null_proc</em> = <code><a class="el" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79">bm::use_null</a></code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Find first mismatch (element which is different) between two sparse vectors (uses linear scan in bit-vector plains) </p>
<p>Function works with both NULL and NOT NULL vectors NULL means unassigned (uncertainty), so first mismatch NULL is a mismatch even if values in vectors can be formally the same (i.e. 0)</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">sv1</td><td>- vector 1 </td></tr>
<tr><td class="paramname">sv2</td><td>- vector 2 </td></tr>
<tr><td class="paramname">midx</td><td>- mismatch index </td></tr>
<tr><td class="paramname">null_proc</td><td>- defines if we want to include (not) NULL vector into comparison (<a class="el" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79" title="support "non-assigned" or "NULL" logic">bm::use_null</a>) or not. By default search takes NULL vector into account</td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true if mismatch found</dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="group__svalgo.html#gab1650345bdfd57d5b161d91bd8947bec" title="Find mismatch vector, indicating positions of mismatch between two sparse vectors (uses linear scan i...">sparse_vector_find_mismatch</a> </dd></dl>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="svsample09_8cpp-example.html#a5">svsample09.cpp</a>, and <a class="el" href="xsample06_8cpp-example.html#a10">xsample06.cpp</a>.</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="bmsparsevec__algo_8h_source.html#l00170">170</a> of file <a class="el" href="bmsparsevec__algo_8h_source.html">bmsparsevec_algo.h</a>.</p>
<p class="reference">References <a class="el" href="bmdef_8h_source.html#l00130">BM_ASSERT</a>, <a class="el" href="bmconst_8h_source.html#l00108">bm::id_max</a>, <a class="el" href="bm_8h_source.html#l02256">bm::bvector< Alloc >::resize()</a>, and <a class="el" href="bmconst_8h_source.html#l00215">bm::use_null</a>.</p>
<p class="reference">Referenced by <a class="el" href="xsample06_8cpp_source.html#l00141">compare_sv()</a>, <a class="el" href="svsample09_8cpp_source.html#l00053">main()</a>, and <a class="el" href="xsample06_8cpp_source.html#l00288">test_mismatch_search()</a>.</p>
</div>
</div>
<a id="gab1650345bdfd57d5b161d91bd8947bec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#gab1650345bdfd57d5b161d91bd8947bec">◆ </a></span>sparse_vector_find_mismatch()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename SV1 , typename SV2 > </div>
<table class="memname">
<tr>
<td class="memname">void bm::sparse_vector_find_mismatch </td>
<td>(</td>
<td class="paramtype">typename <a class="el" href="strsvsample05_8cpp.html#a4ca03dfc387c36e69ea916426572acdc">SV1::bvector_type</a> & </td>
<td class="paramname"><em>bv</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const SV1 & </td>
<td class="paramname"><em>sv1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const SV2 & </td>
<td class="paramname"><em>sv2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="group__bvector.html#gab0835910831729c806840cd5c8f40b2b">bm::null_support</a> </td>
<td class="paramname"><em>null_proc</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Find mismatch vector, indicating positions of mismatch between two sparse vectors (uses linear scan in bit-vector plains) </p>
<p>Function works with both NULL and NOT NULL vectors</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">bv</td><td>- [out] - bit-ector with mismatch positions indicated as 1s </td></tr>
<tr><td class="paramname">sv1</td><td>- vector 1 </td></tr>
<tr><td class="paramname">sv2</td><td>- vector 2 </td></tr>
<tr><td class="paramname">null_proc</td><td>- rules of processing for (not) NULL plain <a class="el" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2bae19c8188787ebf7fa405e5d957a4568a" title="do not support NULL values">bm::no_null</a> - NULLs from both vectors are treated as uncertainty and NOT included into final result <a class="el" href="group__bvector.html#ggab0835910831729c806840cd5c8f40b2ba095db184b37a1341cbbbf813a70aed79" title="support "non-assigned" or "NULL" logic">bm::use_null</a> - difference in NULLs accounted into the result</td></tr>
</table>
</dd>
</dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="group__svalgo.html#ga5b8ca92c5fff30f5b741fc95fe2b3199" title="Find first mismatch (element which is different) between two sparse vectors (uses linear scan in bit-...">sparse_vector_find_first_mismatch</a> </dd></dl>
<p class="definition">Definition at line <a class="el" href="bmsparsevec__algo_8h_source.html#l00330">330</a> of file <a class="el" href="bmsparsevec__algo_8h_source.html">bmsparsevec_algo.h</a>.</p>
<p class="reference">References <a class="el" href="bm_8h_source.html#l00789">bm::bvector< Alloc >::mem_pool_guard::assign_if_not_set()</a>, <a class="el" href="bm_8h_source.html#l04809">bm::bvector< Alloc >::bit_or()</a>, <a class="el" href="bm_8h_source.html#l04906">bm::bvector< Alloc >::bit_xor()</a>, <a class="el" href="bmdef_8h_source.html#l00130">BM_ASSERT</a>, <a class="el" href="bm_8h_source.html#l02987">bm::bvector< Alloc >::invert()</a>, <a class="el" href="bmconst_8h_source.html#l00216">bm::no_null</a>, <a class="el" href="bm_8h_source.html#l00131">bm::bvector< Alloc >::opt_none</a>, <a class="el" href="bm_8h_source.html#l02256">bm::bvector< Alloc >::resize()</a>, <a class="el" href="bm_8h_source.html#l01258">bm::bvector< Alloc >::size()</a>, <a class="el" href="bmconst_8h_source.html#l00215">bm::use_null</a>, and <a class="el" href="bmfunc_8h_source.html#l00909">bm::xor_swap()</a>.</p>
</div>
</div>
</div><!-- contents -->
<!-- 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>
|