| <!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: kll/include/kll_helper_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_10f6c93aee96669dfb32574207aeb69c.html">kll</a></li><li class="navelem"><a class="el" href="dir_cf88e39abd5376065d05109bb16db9ef.html">include</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">kll_helper_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 KLL_HELPER_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#define KLL_HELPER_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 <algorithm></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <stdexcept></span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "common_defs.hpp"</span></div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespacedatasketches.html">datasketches</a> {</div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keywordtype">bool</span> kll_helper::is_even(uint32_t value) {</div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordflow">return</span> (value & 1) == 0;</div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> }</div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  </div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keywordtype">bool</span> kll_helper::is_odd(uint32_t value) {</div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">return</span> (value & 1) > 0;</div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> }</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> uint8_t kll_helper::floor_of_log2_of_fraction(uint64_t numer, uint64_t denom) {</div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (denom > numer) <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  uint8_t count = 0;</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  denom <<= 1;</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">if</span> (denom > numer) <span class="keywordflow">return</span> count;</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  count++;</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> }</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> uint8_t kll_helper::ub_on_num_levels(uint64_t n) {</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 1;</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">return</span> 1 + floor_of_log2_of_fraction(n, 1);</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> uint32_t kll_helper::compute_total_capacity(uint16_t k, uint8_t m, uint8_t num_levels) {</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  uint32_t total = 0;</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">for</span> (uint8_t h = 0; h < num_levels; h++) {</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  total += level_capacity(k, num_levels, h, m);</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>  <span class="keywordflow">return</span> total;</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</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> uint16_t kll_helper::level_capacity(uint16_t k, uint8_t numLevels, uint8_t height, uint8_t min_wid) {</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">if</span> (height >= numLevels) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"height >= numLevels"</span>);</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> uint8_t depth = numLevels - height - 1;</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span> std::max<uint16_t>(min_wid, int_cap_aux(k, depth));</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> }</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> uint16_t kll_helper::int_cap_aux(uint16_t k, uint8_t depth) {</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (depth > 60) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"depth > 60"</span>);</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (depth <= 30) <span class="keywordflow">return</span> int_cap_aux_aux(k, depth);</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">const</span> uint8_t half = depth / 2;</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> uint8_t rest = depth - half;</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> uint16_t tmp = int_cap_aux_aux(k, half);</div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span> int_cap_aux_aux(tmp, rest);</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span> }</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span> uint16_t kll_helper::int_cap_aux_aux(uint16_t k, uint8_t depth) {</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (depth > 30) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"depth > 30"</span>);</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> uint64_t twok = k << 1; <span class="comment">// for rounding, we pre-multiply by 2</span></div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> uint64_t tmp = (uint64_t) (((uint64_t) twok << depth) / powers_of_three[depth]);</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">const</span> uint64_t result = (tmp + 1) >> 1; <span class="comment">// then here we add 1 and divide by 2</span></div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (result > k) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"result > k"</span>);</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>uint16_t<span class="keyword">></span>(result);</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>  </div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span> uint64_t kll_helper::sum_the_sample_weights(uint8_t num_levels, <span class="keyword">const</span> uint32_t* levels) {</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  uint64_t total = 0;</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  uint64_t weight = 1;</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl < num_levels; lvl++) {</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  total += weight * (levels[lvl + 1] - levels[lvl]);</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  weight *= 2;</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">return</span> total;</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>  </div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="keywordtype">void</span> kll_helper::randomly_halve_down(T* buf, uint32_t start, uint32_t length) {</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (!is_even(length)) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"length must be even"</span>);</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">const</span> uint32_t half_length = length / 2;</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor">#ifdef KLL_VALIDATION</span></div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> uint32_t offset = deterministic_offset();</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> uint32_t offset = random_utils::random_bit();</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  uint32_t j = start + offset;</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">for</span> (uint32_t i = start; i < (start + half_length); i++) {</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (i != j) buf[i] = std::move(buf[j]);</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  j += 2;</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</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>  </div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="keywordtype">void</span> kll_helper::randomly_halve_up(T* buf, uint32_t start, uint32_t length) {</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> (!is_even(length)) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"length must be even"</span>);</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">const</span> uint32_t half_length = length / 2;</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor">#ifdef KLL_VALIDATION</span></div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> uint32_t offset = deterministic_offset();</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">const</span> uint32_t offset = random_utils::random_bit();</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  uint32_t j = (start + length) - 1 - offset;</div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">for</span> (uint32_t i = (start + length) - 1; i >= (start + half_length); i--) {</div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (i != j) buf[i] = std::move(buf[j]);</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  j -= 2;</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>  </div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// this version moves objects within the same buffer</span></div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// assumes that destination has initialized objects</span></div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// does not destroy the originals after the move</span></div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> C></div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="keywordtype">void</span> kll_helper::merge_sorted_arrays(T* buf, uint32_t start_a, uint32_t len_a, uint32_t start_b, uint32_t len_b, uint32_t start_c) {</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> uint32_t len_c = len_a + len_b;</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> uint32_t lim_a = start_a + len_a;</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">const</span> uint32_t lim_b = start_b + len_b;</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> uint32_t lim_c = start_c + len_c;</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>  uint32_t a = start_a;</div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  uint32_t b = start_b;</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">for</span> (uint32_t c = start_c; c < lim_c; c++) {</div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (a == lim_a) {</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (b != c) buf[c] = std::move(buf[b]);</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  b++;</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b == lim_b) {</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (a != c) buf[c] = std::move(buf[a]);</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  a++;</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (C()(buf[a], buf[b])) {</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (a != c) buf[c] = std::move(buf[a]);</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  a++;</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (b != c) buf[c] = std::move(buf[b]);</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  b++;</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">if</span> (a != lim_a || b != lim_b) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"inconsistent state"</span>);</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span> }</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="comment">// this version is to merge from two different buffers into a third buffer</span></div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// initializes objects is the destination buffer</span></div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// moves objects from buf_a and destroys the originals</span></div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// copies objects from buf_b</span></div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> C></div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="keywordtype">void</span> kll_helper::merge_sorted_arrays(<span class="keyword">const</span> T* buf_a, uint32_t start_a, uint32_t len_a, <span class="keyword">const</span> T* buf_b, uint32_t start_b, uint32_t len_b, T* buf_c, uint32_t start_c) {</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> uint32_t len_c = len_a + len_b;</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">const</span> uint32_t lim_a = start_a + len_a;</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">const</span> uint32_t lim_b = start_b + len_b;</div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">const</span> uint32_t lim_c = start_c + len_c;</div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  uint32_t a = start_a;</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  uint32_t b = start_b;</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>  <span class="keywordflow">for</span> (uint32_t c = start_c; c < lim_c; c++) {</div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (a == lim_a) {</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">new</span> (&buf_c[c]) T(buf_b[b++]);</div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b == lim_b) {</div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">new</span> (&buf_c[c]) T(std::move(buf_a[a]));</div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  buf_a[a++].~T();</div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (C()(buf_a[a], buf_b[b])) {</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">new</span> (&buf_c[c]) T(std::move(buf_a[a]));</div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  buf_a[a++].~T();</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">new</span> (&buf_c[c]) T(buf_b[b++]);</div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (a != lim_a || b != lim_b) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"inconsistent state"</span>);</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span> }</div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  </div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * Here is what we do for each level:</span></div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * If it does not need to be compacted, then simply copy it over.</span></div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> * Otherwise, it does need to be compacted, so...</span></div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * Copy zero or one guy over.</span></div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * If the level above is empty, halve up.</span></div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> * Else the level above is nonempty, so...</span></div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * halve down, then merge up.</span></div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * Adjust the boundaries of the level above.</span></div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * It can be proved that general_compress returns a sketch that satisfies the space constraints</span></div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> * no matter how much data is passed in.</span></div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> * All levels except for level zero must be sorted before calling this, and will still be</span></div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * sorted afterwards.</span></div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> * Level zero is not required to be sorted before, and may not be sorted afterwards.</span></div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> C></div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span> kll_helper::compress_result kll_helper::general_compress(uint16_t k, uint8_t m, uint8_t num_levels_in, T* items,</div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  uint32_t* in_levels, uint32_t* out_levels, <span class="keywordtype">bool</span> is_level_zero_sorted)</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="keywordflow">if</span> (num_levels_in == 0) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"num_levels_in == 0"</span>); <span class="comment">// things are too weird if zero levels are allowed</span></div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> uint32_t starting_item_count = in_levels[num_levels_in] - in_levels[0];</div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  uint8_t current_num_levels = num_levels_in;</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  uint32_t current_item_count = starting_item_count; <span class="comment">// decreases with each compaction</span></div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  uint32_t target_item_count = compute_total_capacity(k, m, current_num_levels); <span class="comment">// increases if we add levels</span></div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">bool</span> done_yet = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  out_levels[0] = 0;</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  uint8_t current_level = 0;</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">while</span> (!done_yet) {</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">// If we are at the current top level, add an empty level above it for convenience,</span></div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// but do not increment num_levels until later</span></div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (current_level == (current_num_levels - 1)) {</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  in_levels[current_level + 2] = in_levels[current_level + 1];</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">const</span> <span class="keyword">auto</span> raw_beg = in_levels[current_level];</div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">const</span> <span class="keyword">auto</span> raw_lim = in_levels[current_level + 1];</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">const</span> <span class="keyword">auto</span> raw_pop = raw_lim - raw_beg;</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">if</span> ((current_item_count < target_item_count) || (raw_pop < level_capacity(k, current_num_levels, current_level, m))) {</div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// move level over as is</span></div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// make sure we are not moving data upwards</span></div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (raw_beg < out_levels[current_level]) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"wrong move"</span>);</div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">if</span> (raw_beg != out_levels[current_level])</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  std::move(items + raw_beg, items + raw_lim, items + out_levels[current_level]);</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  out_levels[current_level + 1] = out_levels[current_level] + raw_pop;</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// The sketch is too full AND this level is too full, so we compact it</span></div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// Note: this can add a level and thus change the sketches capacities</span></div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> <span class="keyword">auto</span> pop_above = in_levels[current_level + 2] - raw_lim;</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> odd_pop = is_odd(raw_pop);</div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">const</span> <span class="keyword">auto</span> adj_beg = odd_pop ? 1 + raw_beg : raw_beg;</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">const</span> <span class="keyword">auto</span> adj_pop = odd_pop ? raw_pop - 1 : raw_pop;</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <span class="keyword">auto</span> half_adj_pop = adj_pop / 2;</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (odd_pop) { <span class="comment">// move one guy over</span></div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (out_levels[current_level] != raw_beg)</div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  items[out_levels[current_level]] = std::move(items[raw_beg]);</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  out_levels[current_level + 1] = out_levels[current_level] + 1;</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  } <span class="keywordflow">else</span> { <span class="comment">// even number of items</span></div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  out_levels[current_level + 1] = out_levels[current_level];</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="comment">// level zero might not be sorted, so we must sort it if we wish to compact it</span></div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> ((current_level == 0) && !is_level_zero_sorted) {</div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  std::sort(items + adj_beg, items + adj_beg + adj_pop, C());</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  </div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (pop_above == 0) { <span class="comment">// Level above is empty, so halve up</span></div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  randomly_halve_up(items, adj_beg, adj_pop);</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  } <span class="keywordflow">else</span> { <span class="comment">// Level above is nonempty, so halve down, then merge up</span></div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  randomly_halve_down(items, adj_beg, adj_pop);</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  merge_sorted_arrays<T, C>(items, adj_beg, half_adj_pop, raw_lim, pop_above, adj_beg + half_adj_pop);</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  }</div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// track the fact that we just eliminated some data</span></div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  current_item_count -= half_adj_pop;</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  </div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// adjust the boundaries of the level above</span></div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  in_levels[current_level + 1] = in_levels[current_level + 1] - half_adj_pop;</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  </div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// increment num_levels if we just compacted the old top level</span></div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// this creates some more capacity (the size of the new bottom level)</span></div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (current_level == (current_num_levels - 1)) {</div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  current_num_levels++;</div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  target_item_count += level_capacity(k, current_num_levels, 0, m);</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  } <span class="comment">// end of code for compacting a level</span></div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  </div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// determine whether we have processed all levels yet (including any new levels that we created)</span></div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">if</span> (current_level == (current_num_levels - 1)) done_yet = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  current_level++;</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  } <span class="comment">// end of loop over levels</span></div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">if</span> ((out_levels[current_num_levels] - out_levels[0]) != current_item_count) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"inconsistent state"</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>  <span class="keywordflow">for</span> (uint32_t i = current_item_count; i < starting_item_count; i++) items[i].~T();</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>  compress_result result;</div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  result.final_num_levels = current_num_levels;</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  result.final_capacity = target_item_count;</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  result.final_num_items = current_item_count;</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">return</span> result;</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span> }</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="keywordtype">void</span> kll_helper::copy_construct(<span class="keyword">const</span> T* src, <span class="keywordtype">size_t</span> src_first, <span class="keywordtype">size_t</span> src_last, T* dst, <span class="keywordtype">size_t</span> dst_first) {</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">while</span> (src_first != src_last) {</div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">new</span> (&dst[dst_first++]) T(src[src_first++]);</div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  }</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span> }</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="keywordtype">void</span> kll_helper::move_construct(T* src, <span class="keywordtype">size_t</span> src_first, <span class="keywordtype">size_t</span> src_last, T* dst, <span class="keywordtype">size_t</span> dst_first, <span class="keywordtype">bool</span> destroy) {</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">while</span> (src_first != src_last) {</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">new</span> (&dst[dst_first++]) T(std::move(src[src_first]));</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">if</span> (destroy) src[src_first].~T();</div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  src_first++;</div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  }</div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span> }</div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  </div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="preprocessor">#ifdef KLL_VALIDATION</span></div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span> uint32_t kll_helper::deterministic_offset() {</div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">const</span> uint32_t result(kll_next_offset);</div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  kll_next_offset = 1 - kll_next_offset;</div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">return</span> result;</div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span> }</div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  </div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span> } <span class="comment">/* namespace datasketches */</span></div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  </div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="preprocessor">#endif </span><span class="comment">// KLL_HELPER_IMPL_HPP_</span></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> |
