| <!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.9.1"/> |
| <meta name="viewport" content="width=device-width, initial-scale=1"/> |
| <title>datasketches-cpp: cpc/include/cpc_union_impl.hpp 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="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.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">datasketches-cpp |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.9.1 --> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| var searchBox = new SearchBox("searchBox", "search",false,'Search','.html'); |
| /* @license-end */ |
| </script> |
| <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('',true,false,'search.php','Search'); |
| $(document).ready(function() { init_search(); }); |
| }); |
| /* @license-end */</script> |
| <div id="main-nav"></div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_82f3a10095a8f2296c0cf5c491a57b02.html">cpc</a></li><li class="navelem"><a class="el" href="dir_fabb7854c43508dcbf81254d1daad42f.html">include</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">cpc_union_impl.hpp</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <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"> * Licensed to the Apache Software Foundation (ASF) under one</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * or more contributor license agreements. See the NOTICE file</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * distributed with this work for additional information</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * to you under the Apache License, Version 2.0 (the</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * "License"); you may not use this file except in compliance</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * with the License. You may obtain a copy of the License at</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"> * http://www.apache.org/licenses/LICENSE-2.0</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * Unless required by applicable law or agreed to in writing,</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * software distributed under the License is distributed on an</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * KIND, either express or implied. See the License for the</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * specific language governing permissions and limitations</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * under the License.</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>  </div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#ifndef CPC_UNION_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#define CPC_UNION_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "count_zeros.hpp"</span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <stdexcept></span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespacedatasketches.html">datasketches</a> {</div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#a7d54d46a338588afe9fb768cb0e22082"> 30</a></span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#a7d54d46a338588afe9fb768cb0e22082">cpc_union_alloc<A>::cpc_union_alloc</a>(uint8_t lg_k, uint64_t seed, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> lg_k(lg_k),</div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> seed(seed),</div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> accumulator(nullptr),</div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> bit_matrix(allocator)</div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> {</div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">if</span> (lg_k < cpc_constants::MIN_LG_K || lg_k > <a class="code" href="namespacedatasketches_1_1cpc__constants.html#ad15c7a6b3af91806e0a9743d27943d49">cpc_constants::MAX_LG_K</a>) {</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"lg_k must be >= "</span> + std::to_string(<a class="code" href="namespacedatasketches_1_1cpc__constants.html#a80c5dfefaf69318c0894ec34c34d0987">cpc_constants::MIN_LG_K</a>) + <span class="stringliteral">" and <= "</span> + std::to_string(<a class="code" href="namespacedatasketches_1_1cpc__constants.html#ad15c7a6b3af91806e0a9743d27943d49">cpc_constants::MAX_LG_K</a>) + <span class="stringliteral">": "</span> + std::to_string(lg_k));</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>  accumulator = <span class="keyword">new</span> (AllocCpc(allocator).allocate(1)) <a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a>(lg_k, seed, allocator);</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span> }</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#a58b7403d28fc1784030af8671a979a16"> 43</a></span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#a7d54d46a338588afe9fb768cb0e22082">cpc_union_alloc<A>::cpc_union_alloc</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a>& other):</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span> lg_k(other.lg_k),</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span> seed(other.seed),</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> accumulator(other.accumulator),</div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> bit_matrix(other.bit_matrix)</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span> {</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  accumulator = <span class="keyword">new</span> (AllocCpc(accumulator->get_allocator()).allocate(1)) <a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a>(*other.accumulator);</div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }</div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span> }</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#ace6ac3b163bb5b47c0a90c860e73ee9e"> 55</a></span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#a7d54d46a338588afe9fb768cb0e22082">cpc_union_alloc<A>::cpc_union_alloc</a>(<a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a>&& other) noexcept:</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span> lg_k(other.lg_k),</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span> seed(other.seed),</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span> accumulator(other.accumulator),</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span> bit_matrix(std::move(other.bit_matrix))</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>  other.accumulator = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span> }</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A>::~cpc_union_alloc</a>() {</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  AllocCpc allocator(accumulator->get_allocator());</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  accumulator->~cpc_sketch_alloc<A>();</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  allocator.deallocate(accumulator, 1);</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span> }</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#ae7b219e0931e711ebea10684e30cb538"> 74</a></span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a>& <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#ae7b219e0931e711ebea10684e30cb538">cpc_union_alloc<A>::operator=</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a>& other) {</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a> copy(other);</div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  std::swap(lg_k, copy.lg_k);</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  seed = copy.seed;</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::swap(accumulator, copy.accumulator);</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  bit_matrix = std::move(copy.bit_matrix);</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span> }</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#ae9b7627c7be9e2d8c386225668e3ed9b"> 84</a></span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a>& <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#ae7b219e0931e711ebea10684e30cb538">cpc_union_alloc<A>::operator=</a>(<a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A></a>&& other) noexcept {</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  std::swap(lg_k, other.lg_k);</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  seed = other.seed;</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  std::swap(accumulator, other.accumulator);</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  bit_matrix = std::move(other.bit_matrix);</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span> }</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#a3f9778e8f70f04ba8fbb0e1ccacc9fea"> 93</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#a3f9778e8f70f04ba8fbb0e1ccacc9fea">cpc_union_alloc<A>::update</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a>& sketch) {</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  internal_update(sketch);</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span> }</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#a7246a5fbecd788c3eb06206506058518"> 98</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#a3f9778e8f70f04ba8fbb0e1ccacc9fea">cpc_union_alloc<A>::update</a>(<a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a>&& sketch) {</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  internal_update(std::forward<<a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a>>(sketch));</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span> }</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A>::internal_update</a>(S&& sketch) {</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">const</span> uint16_t seed_hash_union = compute_seed_hash(seed);</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> uint16_t seed_hash_sketch = compute_seed_hash(sketch.seed);</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (seed_hash_union != seed_hash_sketch) {</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Incompatible seed hashes: "</span> + std::to_string(seed_hash_union) + <span class="stringliteral">", "</span></div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  + std::to_string(seed_hash_sketch));</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> <span class="keyword">auto</span> src_flavor = sketch.determine_flavor();</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::EMPTY == src_flavor) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (sketch.get_lg_k() < lg_k) reduce_k(sketch.get_lg_k());</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (sketch.get_lg_k() < lg_k) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"sketch lg_k < union lg_k"</span>);</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">if</span> (accumulator == <span class="keyword">nullptr</span> && bit_matrix.size() == 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"both accumulator and bit matrix are absent"</span>);</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::SPARSE == src_flavor && accumulator != <span class="keyword">nullptr</span>) { <span class="comment">// Case A</span></div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (bit_matrix.size() > 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"union bit_matrix is not expected"</span>);</div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> <span class="keyword">auto</span> initial_dest_flavor = accumulator->determine_flavor();</div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::EMPTY != initial_dest_flavor &&</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  cpc_sketch_alloc<A>::flavor::SPARSE != initial_dest_flavor) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong flavor"</span>);</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>  <span class="comment">// The following partially fixes the snowplow problem provided that the K's are equal.</span></div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::EMPTY == initial_dest_flavor && lg_k == sketch.get_lg_k()) {</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  *accumulator = std::forward<S>(sketch);</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  </div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  walk_table_updating_sketch(sketch.surprising_value_table);</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> <span class="keyword">auto</span> final_dst_flavor = accumulator->determine_flavor();</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// if the accumulator has graduated beyond sparse, switch to a bit matrix representation</span></div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (final_dst_flavor != cpc_sketch_alloc<A>::flavor::EMPTY && final_dst_flavor != cpc_sketch_alloc<A>::flavor::SPARSE) {</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  switch_to_bit_matrix();</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div> |
| <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div> |
| <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::SPARSE == src_flavor && bit_matrix.size() > 0) { <span class="comment">// Case B</span></div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"union accumulator != null"</span>);</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  or_table_into_matrix(sketch.surprising_value_table);</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::HYBRID != src_flavor && cpc_sketch_alloc<A>::flavor::PINNED != src_flavor</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  && cpc_sketch_alloc<A>::flavor::SLIDING != src_flavor) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong flavor"</span>);</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// source is past SPARSE mode, so make sure that dest is a bit matrix</span></div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (bit_matrix.size() > 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"union bit matrix is not expected"</span>);</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> <span class="keyword">auto</span> dst_flavor = accumulator->determine_flavor();</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::EMPTY != dst_flavor && cpc_sketch_alloc<A>::flavor::SPARSE != dst_flavor) {</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong flavor"</span>);</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  switch_to_bit_matrix();</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (bit_matrix.size() == 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"union bit_matrix is expected"</span>);</div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::HYBRID == src_flavor || cpc_sketch_alloc<A>::flavor::PINNED == src_flavor) { <span class="comment">// Case C</span></div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  or_window_into_matrix(sketch.sliding_window, sketch.window_offset, sketch.get_lg_k());</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  or_table_into_matrix(sketch.surprising_value_table);</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// SLIDING mode involves inverted logic, so we can't just walk the source sketch.</span></div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// Instead, we convert it to a bitMatrix that can be OR'ed into the destination.</span></div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">if</span> (cpc_sketch_alloc<A>::flavor::SLIDING != src_flavor) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong flavor"</span>); <span class="comment">// Case D</span></div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  vector_u64 src_matrix = sketch.build_bit_matrix();</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  or_matrix_into_matrix(src_matrix, sketch.get_lg_k());</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span> }</div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  </div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="classdatasketches_1_1cpc__union__alloc.html#a5ea0b7d39e7f95016af67975b743ec8b"> 174</a></span> <a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html#a5ea0b7d39e7f95016af67975b743ec8b">cpc_union_alloc<A>::get_result</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (bit_matrix.size() > 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"bit_matrix is not expected"</span>);</div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span> get_result_from_accumulator();</div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">if</span> (bit_matrix.size() == 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"bit_matrix is expected"</span>);</div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">return</span> get_result_from_bit_matrix();</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span> }</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a> <a class="code" href="classdatasketches_1_1cpc__union__alloc.html">cpc_union_alloc<A>::get_result_from_accumulator</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (lg_k != accumulator->get_lg_k()) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"lg_k != accumulator->lg_k"</span>);</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (accumulator->get_num_coupons() == 0) {</div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> <a class="code" href="classdatasketches_1_1cpc__sketch__alloc.html">cpc_sketch_alloc<A></a>(lg_k, seed, accumulator->get_allocator());</div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (accumulator->determine_flavor() != cpc_sketch_alloc<A>::flavor::SPARSE) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong flavor"</span>);</div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  cpc_sketch_alloc<A> copy(*accumulator);</div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  copy.was_merged = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">return</span> copy;</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span> }</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span> cpc_sketch_alloc<A> cpc_union_alloc<A>::get_result_from_bit_matrix()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">const</span> uint32_t k = 1 << lg_k;</div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">const</span> uint32_t num_coupons = count_bits_set_in_matrix(bit_matrix.data(), k);</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  </div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flavor = cpc_sketch_alloc<A>::determine_flavor(lg_k, num_coupons);</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (flavor != cpc_sketch_alloc<A>::flavor::HYBRID && flavor != cpc_sketch_alloc<A>::flavor::PINNED</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  && flavor != cpc_sketch_alloc<A>::flavor::SLIDING) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong flavor"</span>);</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  </div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">const</span> uint8_t offset = cpc_sketch_alloc<A>::determine_correct_offset(lg_k, num_coupons);</div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  </div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  vector_bytes sliding_window(k, 0, bit_matrix.get_allocator());</div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// don't need to zero the window's memory</span></div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  </div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// dynamically growing caused snowplow effect</span></div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  uint8_t table_lg_size = lg_k - 4; <span class="comment">// K/16; in some cases this will end up being oversized</span></div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (table_lg_size < 2) table_lg_size = 2;</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  u32_table<A> table(table_lg_size, 6 + lg_k, bit_matrix.get_allocator());</div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  </div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// the following should work even when the offset is zero</span></div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">const</span> uint64_t mask_for_clearing_window = (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(0xff) << offset) ^ UINT64_MAX;</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">const</span> uint64_t mask_for_flipping_early_zone = (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1) << offset) - 1;</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  uint64_t all_surprises_ored = 0;</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// The snowplow effect was caused by processing the rows in order,</span></div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// but we have fixed it by using a sufficiently large hash table.</span></div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i < k; i++) {</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  uint64_t pattern = bit_matrix[i];</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  sliding_window[i] = (pattern >> offset) & 0xff;</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  pattern &= mask_for_clearing_window;</div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  pattern ^= mask_for_flipping_early_zone; <span class="comment">// this flipping converts surprising 0's to 1's</span></div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  all_surprises_ored |= pattern;</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">while</span> (pattern != 0) {</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> uint8_t col = count_trailing_zeros_in_u64(pattern);</div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  pattern = pattern ^ (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1) << col); <span class="comment">// erase the 1</span></div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> uint32_t row_col = (i << 6) | col;</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordtype">bool</span> is_novel = table.maybe_insert(row_col);</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (!is_novel) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"is_novel != true"</span>);</div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  </div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// at this point we could shrink an oversized hash table, but the relative waste isn't very big</span></div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  uint8_t first_interesting_column = count_trailing_zeros_in_u64(all_surprises_ored);</div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">if</span> (first_interesting_column > offset) first_interesting_column = offset; <span class="comment">// corner case</span></div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  </div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// HIP-related fields will contain zeros, and that is okay</span></div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">return</span> cpc_sketch_alloc<A>(lg_k, num_coupons, first_interesting_column, std::move(table), std::move(sliding_window), <span class="keyword">false</span>, 0, 0, seed);</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span> }</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  </div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="keywordtype">void</span> cpc_union_alloc<A>::switch_to_bit_matrix() {</div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  bit_matrix = accumulator->build_bit_matrix();</div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  AllocCpc allocator(accumulator->get_allocator());</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  accumulator->~cpc_sketch_alloc<A>();</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  allocator.deallocate(accumulator, 1);</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  accumulator = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span> }</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  </div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="keywordtype">void</span> cpc_union_alloc<A>::walk_table_updating_sketch(<span class="keyword">const</span> u32_table<A>& table) {</div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">const</span> uint32_t* slots = table.get_slots();</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">const</span> uint32_t num_slots = 1 << table.get_lg_size();</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> uint64_t dst_mask = (((1 << accumulator->get_lg_k()) - 1) << 6) | 63; <span class="comment">// downsamples when dst lgK < src LgK</span></div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  </div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="comment">// Using a golden ratio stride fixes the snowplow effect.</span></div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> golden = 0.6180339887498949025;</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  uint32_t stride = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(golden * <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(num_slots));</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (stride < 2) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"stride < 2"</span>);</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (stride == ((stride >> 1) << 1)) stride += 1; <span class="comment">// force the stride to be odd</span></div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (stride < 3 || stride >= num_slots) <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">"stride out of range"</span>);</div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  </div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">for</span> (uint32_t i = 0, j = 0; i < num_slots; i++, j += stride) {</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  j &= num_slots - 1;</div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> uint32_t row_col = slots[j];</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (row_col != UINT32_MAX) {</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  accumulator->row_col_update(row_col & dst_mask);</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span> }</div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  </div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="keywordtype">void</span> cpc_union_alloc<A>::or_table_into_matrix(<span class="keyword">const</span> u32_table<A>& table) {</div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">const</span> uint32_t* slots = table.get_slots();</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">const</span> uint32_t num_slots = 1 << table.get_lg_size();</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">const</span> uint64_t dest_mask = (1 << lg_k) - 1; <span class="comment">// downsamples when dst lgK < sr LgK</span></div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i < num_slots; i++) {</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> uint32_t row_col = slots[i];</div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">if</span> (row_col != UINT32_MAX) {</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">const</span> uint8_t col = row_col & 63;</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> uint32_t row = row_col >> 6;</div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  bit_matrix[row & dest_mask] |= <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1) << col; <span class="comment">// set the bit</span></div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span> }</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="keywordtype">void</span> cpc_union_alloc<A>::or_window_into_matrix(<span class="keyword">const</span> vector_bytes& sliding_window, uint8_t offset, uint8_t src_lg_k) {</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (lg_k > src_lg_k) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"dst LgK > src LgK"</span>);</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> uint64_t dst_mask = (1 << lg_k) - 1; <span class="comment">// downsamples when dst lgK < src LgK</span></div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> uint32_t src_k = 1 << src_lg_k;</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">for</span> (uint32_t src_row = 0; src_row < src_k; src_row++) {</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  bit_matrix[src_row & dst_mask] |= <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(sliding_window[src_row]) << offset;</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span> }</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="keywordtype">void</span> cpc_union_alloc<A>::or_matrix_into_matrix(<span class="keyword">const</span> vector_u64& src_matrix, uint8_t src_lg_k) {</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> (lg_k > src_lg_k) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"dst LgK > src LgK"</span>);</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">const</span> uint64_t dst_mask = (1 << lg_k) - 1; <span class="comment">// downsamples when dst lgK < src LgK</span></div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">const</span> uint32_t src_k = 1 << src_lg_k;</div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">for</span> (uint32_t src_row = 0; src_row < src_k; src_row++) {</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  bit_matrix[src_row & dst_mask] |= src_matrix[src_row];</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span> }</div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="keyword">template</span><<span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="keywordtype">void</span> cpc_union_alloc<A>::reduce_k(uint8_t new_lg_k) {</div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (new_lg_k >= lg_k) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"new LgK >= union lgK"</span>);</div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (accumulator == <span class="keyword">nullptr</span> && bit_matrix.size() == 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"both accumulator and bit_matrix are absent"</span>);</div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  </div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (bit_matrix.size() > 0) { <span class="comment">// downsample the unioner's bit matrix</span></div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"accumulator is not null"</span>);</div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  vector_u64 old_matrix = std::move(bit_matrix);</div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">const</span> uint8_t old_lg_k = lg_k;</div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> uint32_t new_k = 1 << new_lg_k;</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  bit_matrix = vector_u64(new_k, 0, old_matrix.get_allocator());</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  lg_k = new_lg_k;</div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  or_matrix_into_matrix(old_matrix, old_lg_k);</div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  </div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">if</span> (accumulator != <span class="keyword">nullptr</span>) { <span class="comment">// downsample the unioner's sketch</span></div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (bit_matrix.size() > 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"bit_matrix is not expected"</span>);</div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">if</span> (!accumulator->is_empty()) {</div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  cpc_sketch_alloc<A> old_accumulator(*accumulator);</div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  *accumulator = cpc_sketch_alloc<A>(new_lg_k, seed, old_accumulator.get_allocator());</div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  walk_table_updating_sketch(old_accumulator.surprising_value_table);</div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  lg_k = new_lg_k;</div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  </div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> <span class="keyword">auto</span> final_new_flavor = accumulator->determine_flavor();</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// if the new sketch has graduated beyond sparse, convert to bit_matrix</span></div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span> (final_new_flavor != cpc_sketch_alloc<A>::flavor::EMPTY &&</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  final_new_flavor != cpc_sketch_alloc<A>::flavor::SPARSE) {</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  switch_to_bit_matrix();</div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"invalid state"</span>);</div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span> }</div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  </div> |
| <div class="line"><a name="l00348"></a><span class="lineno"> 348</span> } <span class="comment">/* namespace datasketches */</span></div> |
| <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  </div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="preprocessor">#endif</span></div> |
| <div class="ttc" id="aclassdatasketches_1_1cpc__sketch__alloc_html"><div class="ttname"><a href="classdatasketches_1_1cpc__sketch__alloc.html">datasketches::cpc_sketch_alloc</a></div><div class="ttdoc">High performance C++ implementation of Compressed Probabilistic Counting (CPC) Sketch.</div><div class="ttdef"><b>Definition:</b> cpc_sketch.hpp:64</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1cpc__union__alloc_html"><div class="ttname"><a href="classdatasketches_1_1cpc__union__alloc.html">datasketches::cpc_union_alloc</a></div><div class="ttdoc">High performance C++ implementation of Compressed Probabilistic Counting (CPC) Union.</div><div class="ttdef"><b>Definition:</b> cpc_union.hpp:40</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1cpc__union__alloc_html_a3f9778e8f70f04ba8fbb0e1ccacc9fea"><div class="ttname"><a href="classdatasketches_1_1cpc__union__alloc.html#a3f9778e8f70f04ba8fbb0e1ccacc9fea">datasketches::cpc_union_alloc::update</a></div><div class="ttdeci">void update(const cpc_sketch_alloc< A > &sketch)</div><div class="ttdoc">This method is to update the union with a given sketch (lvalue)</div><div class="ttdef"><b>Definition:</b> cpc_union_impl.hpp:93</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1cpc__union__alloc_html_a5ea0b7d39e7f95016af67975b743ec8b"><div class="ttname"><a href="classdatasketches_1_1cpc__union__alloc.html#a5ea0b7d39e7f95016af67975b743ec8b">datasketches::cpc_union_alloc::get_result</a></div><div class="ttdeci">cpc_sketch_alloc< A > get_result() const</div><div class="ttdoc">This method produces a copy of the current state of the union as a sketch.</div><div class="ttdef"><b>Definition:</b> cpc_union_impl.hpp:174</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1cpc__union__alloc_html_a7d54d46a338588afe9fb768cb0e22082"><div class="ttname"><a href="classdatasketches_1_1cpc__union__alloc.html#a7d54d46a338588afe9fb768cb0e22082">datasketches::cpc_union_alloc::cpc_union_alloc</a></div><div class="ttdeci">cpc_union_alloc(uint8_t lg_k=cpc_constants::DEFAULT_LG_K, uint64_t seed=DEFAULT_SEED, const A &allocator=A())</div><div class="ttdoc">Creates an instance of the union given the lg_k parameter and hash seed.</div><div class="ttdef"><b>Definition:</b> cpc_union_impl.hpp:30</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1cpc__union__alloc_html_ae7b219e0931e711ebea10684e30cb538"><div class="ttname"><a href="classdatasketches_1_1cpc__union__alloc.html#ae7b219e0931e711ebea10684e30cb538">datasketches::cpc_union_alloc::operator=</a></div><div class="ttdeci">cpc_union_alloc< A > & operator=(const cpc_union_alloc< A > &other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition:</b> cpc_union_impl.hpp:74</div></div> |
| <div class="ttc" id="anamespacedatasketches_1_1cpc__constants_html_a80c5dfefaf69318c0894ec34c34d0987"><div class="ttname"><a href="namespacedatasketches_1_1cpc__constants.html#a80c5dfefaf69318c0894ec34c34d0987">datasketches::cpc_constants::MIN_LG_K</a></div><div class="ttdeci">const uint8_t MIN_LG_K</div><div class="ttdoc">min log2 of K</div><div class="ttdef"><b>Definition:</b> cpc_common.hpp:32</div></div> |
| <div class="ttc" id="anamespacedatasketches_1_1cpc__constants_html_ad15c7a6b3af91806e0a9743d27943d49"><div class="ttname"><a href="namespacedatasketches_1_1cpc__constants.html#ad15c7a6b3af91806e0a9743d27943d49">datasketches::cpc_constants::MAX_LG_K</a></div><div class="ttdeci">const uint8_t MAX_LG_K</div><div class="ttdoc">max log2 of K</div><div class="ttdef"><b>Definition:</b> cpc_common.hpp:34</div></div> |
| <div class="ttc" id="anamespacedatasketches_html"><div class="ttname"><a href="namespacedatasketches.html">datasketches</a></div><div class="ttdoc">DataSketches namespace.</div><div class="ttdef"><b>Definition:</b> binomial_bounds.hpp:38</div></div> |
| </div><!-- fragment --></div><!-- contents --> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 |
| </small></address> |
| </body> |
| </html> |
