| <!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_sketch_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_sketch_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_SKETCH_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#define KLL_SKETCH_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 <iostream></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <iomanip></span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <sstream></span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <stdexcept></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="preprocessor">#include "conditional_forward.hpp"</span></div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "count_zeros.hpp"</span></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "memory_operations.hpp"</span></div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "kll_helper.hpp"</span></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> <span class="keyword">namespace </span><a class="code" href="namespacedatasketches.html">datasketches</a> {</div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#afca1c904b4598d7a9548a40a802ed2b4"> 36</a></span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::kll_sketch</a>(uint16_t k, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span> k_(k),</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span> m_(kll_constants::DEFAULT_M),</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> min_k_(k),</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> num_levels_(1),</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> is_level_zero_sorted_(false),</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span> n_(0),</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span> levels_(2, 0, allocator),</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> items_(nullptr),</div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> items_size_(k_),</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span> min_item_(),</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span> max_item_(),</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span> sorted_view_(nullptr)</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>  <span class="keywordflow">if</span> (k < kll_constants::MIN_K || k > <a class="code" href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">kll_constants::MAX_K</a>) {</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"K must be >= "</span> + std::to_string(<a class="code" href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">kll_constants::MIN_K</a>) + <span class="stringliteral">" and <= "</span></div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  + std::to_string(<a class="code" href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">kll_constants::MAX_K</a>) + <span class="stringliteral">": "</span> + std::to_string(k));</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  levels_[0] = levels_[1] = k;</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  items_ = allocator_.allocate(items_size_);</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span> }</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> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#af7352580134284b937cb2510d192434e"> 61</a></span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::kll_sketch</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>& other):</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span> comparator_(other.comparator_),</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span> allocator_(other.allocator_),</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span> k_(other.k_),</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> m_(other.m_),</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span> min_k_(other.min_k_),</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span> num_levels_(other.num_levels_),</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span> is_level_zero_sorted_(other.is_level_zero_sorted_),</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span> n_(other.n_),</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span> levels_(other.levels_),</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span> items_(nullptr),</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span> items_size_(other.items_size_),</div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span> min_item_(other.min_item_),</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span> max_item_(other.max_item_),</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span> sorted_view_(nullptr)</div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span> {</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  items_ = allocator_.allocate(items_size_);</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = levels_[0]; i < levels_[num_levels_]; ++i) <span class="keyword">new</span> (&items_[i]) T(other.items_[i]);</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span> }</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#acd53c0366552f3211d54e4746e12f1fe"> 82</a></span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::kll_sketch</a>(<a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&& other) noexcept:</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span> comparator_(std::move(other.comparator_)),</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span> allocator_(std::move(other.allocator_)),</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span> k_(other.k_),</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span> m_(other.m_),</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span> min_k_(other.min_k_),</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span> num_levels_(other.num_levels_),</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span> is_level_zero_sorted_(other.is_level_zero_sorted_),</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span> n_(other.n_),</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span> levels_(std::move(other.levels_)),</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span> items_(other.items_),</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span> items_size_(other.items_size_),</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span> min_item_(std::move(other.min_item_)),</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span> max_item_(std::move(other.max_item_)),</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span> sorted_view_(<span class="keyword">nullptr</span>)</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span> {</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  other.items_ = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span> }</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44"> 102</a></span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A></a>& <a class="code" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">kll_sketch<T, C, A>::operator=</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>& other) {</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a> copy(other);</div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  std::swap(comparator_, copy.comparator_);</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  std::swap(allocator_, copy.allocator_);</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::swap(k_, copy.k_);</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  std::swap(m_, copy.m_);</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  std::swap(min_k_, copy.min_k_);</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::swap(num_levels_, copy.num_levels_);</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::swap(is_level_zero_sorted_, copy.is_level_zero_sorted_);</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::swap(n_, copy.n_);</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::swap(levels_, copy.levels_);</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::swap(items_, copy.items_);</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  std::swap(items_size_, copy.items_size_);</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::swap(min_item_, copy.min_item_);</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::swap(max_item_, copy.max_item_);</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  reset_sorted_view();</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span> }</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a3b0bad718ea491dd8176196d4b250ff4"> 122</a></span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A></a>& <a class="code" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">kll_sketch<T, C, A>::operator=</a>(<a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&& other) {</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  std::swap(comparator_, other.comparator_);</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  std::swap(allocator_, other.allocator_);</div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  std::swap(k_, other.k_);</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  std::swap(m_, other.m_);</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  std::swap(min_k_, other.min_k_);</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  std::swap(num_levels_, other.num_levels_);</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::swap(is_level_zero_sorted_, other.is_level_zero_sorted_);</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  std::swap(n_, other.n_);</div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::swap(levels_, other.levels_);</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  std::swap(items_, other.items_);</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  std::swap(items_size_, other.items_size_);</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  std::swap(min_item_, other.min_item_);</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  std::swap(max_item_, other.max_item_);</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  reset_sorted_view();</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">return</span> *<span class="keyword">this</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="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::~kll_sketch</a>() {</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (items_ != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> uint32_t begin = levels_[0];</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">const</span> uint32_t end = levels_[num_levels_];</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (uint32_t i = begin; i < end; i++) items_[i].~T();</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  allocator_.deallocate(items_, items_size_);</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  reset_sorted_view();</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span> }</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="keyword">template</span><<span class="keyword">typename</span> TT, <span class="keyword">typename</span> CC, <span class="keyword">typename</span> AA></div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span> kll_sketch<T, C, A>::kll_sketch(<span class="keyword">const</span> kll_sketch<TT, CC, AA>& other, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span> k_(other.k_),</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span> m_(other.m_),</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span> min_k_(other.min_k_),</div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span> num_levels_(other.num_levels_),</div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span> is_level_zero_sorted_(other.is_level_zero_sorted_),</div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span> n_(other.n_),</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span> levels_(other.levels_, allocator_),</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span> items_(nullptr),</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span> items_size_(other.items_size_),</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span> min_item_(other.min_item_),</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span> max_item_(other.max_item_),</div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span> sorted_view_(nullptr)</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>  static_assert(</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  std::is_constructible<T, TT>::value,</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="stringliteral">"Type converting constructor requires new type to be constructible from existing type"</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>  items_ = allocator_.allocate(items_size_);</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = levels_[0]; i < levels_[num_levels_]; ++i) <span class="keyword">new</span> (&items_[i]) T(other.items_[i]);</div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  check_sorting();</div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span> }</div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdT></div> |
| <div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c"> 180</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">kll_sketch<T, C, A>::update</a>(FwdT&& item) {</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</span>; }</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  update_min_max(<span class="keyword">static_cast<</span><span class="keyword">const </span>T&<span class="keyword">></span>(item)); <span class="comment">// min and max are always copies</span></div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">const</span> uint32_t index = internal_update();</div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">new</span> (&items_[index]) T(std::forward<FwdT>(item));</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  reset_sorted_view();</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="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::update_min_max</a>(<span class="keyword">const</span> T& item) {</div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">if</span> (is_empty()) {</div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  min_item_.emplace(item);</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  max_item_.emplace(item);</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> (comparator_(item, *min_item_)) *min_item_ = item;</div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = item;</div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span> }</div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span> uint32_t kll_sketch<T, C, A>::internal_update() {</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (levels_[0] == 0) compress_while_updating();</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  n_++;</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  is_level_zero_sorted_ = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">return</span> --levels_[0];</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>  </div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdSk></div> |
| <div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec"> 209</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">kll_sketch<T, C, A>::merge</a>(FwdSk&& other) {</div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (other.is_empty()) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (m_ != other.m_) {</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"incompatible M: "</span> + std::to_string(m_) + <span class="stringliteral">" and "</span> + std::to_string(other.m_));</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="keywordflow">if</span> (is_empty()) {</div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  min_item_.emplace(conditional_forward<FwdSk>(*other.min_item_));</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  max_item_.emplace(conditional_forward<FwdSk>(*other.max_item_));</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">if</span> (comparator_(*other.min_item_, *min_item_)) *min_item_ = conditional_forward<FwdSk>(*other.min_item_);</div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (comparator_(*max_item_, *other.max_item_)) *max_item_ = conditional_forward<FwdSk>(*other.max_item_);</div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> uint64_t final_n = n_ + other.n_;</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">for</span> (uint32_t i = other.levels_[0]; i < other.levels_[1]; i++) {</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> uint32_t index = internal_update();</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keyword">new</span> (&items_[index]) T(conditional_forward<FwdSk>(other.items_[i]));</div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> (other.num_levels_ >= 2) merge_higher_levels(other, final_n);</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  n_ = final_n;</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (other.is_estimation_mode()) min_k_ = std::min(min_k_, other.min_k_);</div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  assert_correct_total_weight();</div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  reset_sorted_view();</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span> }</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  </div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00234"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362"> 234</a></span> <span class="keywordtype">bool</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">kll_sketch<T, C, A>::is_empty</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> n_ == 0;</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</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> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00239"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264"> 239</a></span> uint16_t <a class="code" href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">kll_sketch<T, C, A>::get_k</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">return</span> k_;</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span> }</div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00244"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d"> 244</a></span> uint64_t <a class="code" href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">kll_sketch<T, C, A>::get_n</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">return</span> n_;</div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span> }</div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  </div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00249"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14"> 249</a></span> uint32_t <a class="code" href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">kll_sketch<T, C, A>::get_num_retained</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">return</span> levels_[num_levels_] - levels_[0];</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</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> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6"> 254</a></span> <span class="keywordtype">bool</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">kll_sketch<T, C, A>::is_estimation_mode</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">return</span> num_levels_ > 1;</div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span> }</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> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422"> 259</a></span> T <a class="code" href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">kll_sketch<T, C, A>::get_min_item</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"operation is undefined for an empty sketch"</span>);</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">return</span> *min_item_;</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span> }</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300"> 265</a></span> T <a class="code" href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">kll_sketch<T, C, A>::get_max_item</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"operation is undefined for an empty sketch"</span>);</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">return</span> *max_item_;</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>  </div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40"> 271</a></span> C <a class="code" href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">kll_sketch<T, C, A>::get_comparator</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">return</span> comparator_;</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> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00276"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b"> 276</a></span> A <a class="code" href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">kll_sketch<T, C, A>::get_allocator</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">return</span> allocator_;</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>  </div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918"> 281</a></span> <span class="keywordtype">double</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">kll_sketch<T, C, A>::get_rank</a>(<span class="keyword">const</span> T& item, <span class="keywordtype">bool</span> inclusive)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"operation is undefined for an empty sketch"</span>);</div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">return</span> sorted_view_->get_rank(item, inclusive);</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</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="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00288"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1"> 288</a></span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">kll_sketch<T, C, A>::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</span> -> vector_double {</div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"operation is undefined for an empty sketch"</span>);</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">return</span> sorted_view_->get_PMF(split_points, size, inclusive);</div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span> }</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c"> 295</a></span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">kll_sketch<T, C, A>::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</span> -> vector_double {</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"operation is undefined for an empty sketch"</span>);</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> sorted_view_->get_CDF(split_points, size, inclusive);</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> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00302"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9"> 302</a></span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">kll_sketch<T, C, A>::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</span> -> <a class="code" href="classdatasketches_1_1kll__sketch.html#aa796209b1ef5dc41e83ed8158f77d280">quantile_return_type</a> {</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"operation is undefined for an empty sketch"</span>);</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> ((rank < 0.0) || (rank > 1.0)) {</div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"normalized rank cannot be less than zero or greater than 1.0"</span>);</div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// may have a side effect of sorting level zero if needed</span></div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">return</span> sorted_view_->get_quantile(rank, inclusive);</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>  </div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850"> 313</a></span> <span class="keywordtype">double</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">kll_sketch<T, C, A>::get_normalized_rank_error</a>(<span class="keywordtype">bool</span> pmf)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> get_normalized_rank_error(min_k_, pmf);</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>  </div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span> template<typename TT, typename SerDe, typename std::enable_if<std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00320"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716"> 320</a></span> <span class="keywordtype">size_t</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">kll_sketch<T, C, A>::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">if</span> (num_levels_ == 1 && get_num_retained() == 1) {</div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">return</span> DATA_START_SINGLE_ITEM + <span class="keyword">sizeof</span>(TT);</div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span> DATA_START + num_levels_ * <span class="keyword">sizeof</span>(uint32_t) + (get_num_retained() + 2) * <span class="keyword">sizeof</span>(TT);</div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// implementation for all other types</span></div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span> template<typename TT, typename SerDe, typename std::enable_if<!std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="keywordtype">size_t</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">kll_sketch<T, C, A>::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe& sd)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">if</span> (num_levels_ == 1 && get_num_retained() == 1) {</div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">return</span> DATA_START_SINGLE_ITEM + sd.size_of_item(items_[levels_[0]]);</div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordtype">size_t</span> size = DATA_START + num_levels_ * <span class="keyword">sizeof</span>(uint32_t);</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  size += sd.size_of_item(*min_item_);</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  size += sd.size_of_item(*max_item_);</div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it: *<span class="keyword">this</span>) size += sd.size_of_item(it.first);</div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">return</span> size;</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="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span> template<typename TT, typename std::enable_if<std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b"> 348</a></span> <span class="keywordtype">size_t</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">kll_sketch<T, C, A>::get_max_serialized_size_bytes</a>(uint16_t k, uint64_t n) {</div> |
| <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> uint8_t num_levels = kll_helper::ub_on_num_levels(n);</div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">const</span> uint32_t max_num_retained = kll_helper::compute_total_capacity(k, kll_constants::DEFAULT_M, num_levels);</div> |
| <div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div> |
| <div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">return</span> DATA_START + num_levels * <span class="keyword">sizeof</span>(uint32_t) + (max_num_retained + 2) * <span class="keyword">sizeof</span>(TT);</div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span> }</div> |
| <div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  </div> |
| <div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment">// implementation for all other types</span></div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span> template<typename TT, typename std::enable_if<!std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00358"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a02cd0e67339d17d0b48f6f43bc26d381"> 358</a></span> <span class="keywordtype">size_t</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">kll_sketch<T, C, A>::get_max_serialized_size_bytes</a>(uint16_t k, uint64_t n, <span class="keywordtype">size_t</span> max_item_size_bytes) {</div> |
| <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> uint8_t num_levels = kll_helper::ub_on_num_levels(n);</div> |
| <div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">const</span> uint32_t max_num_retained = kll_helper::compute_total_capacity(k, kll_constants::DEFAULT_M, num_levels);</div> |
| <div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> DATA_START + num_levels * <span class="keyword">sizeof</span>(uint32_t) + (max_num_retained + 2) * max_item_size_bytes;</div> |
| <div class="line"><a name="l00363"></a><span class="lineno"> 363</span> }</div> |
| <div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div> |
| <div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00367"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056"> 367</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">kll_sketch<T, C, A>::serialize</a>(std::ostream& os, <span class="keyword">const</span> SerDe& sd)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item = n_ == 1;</div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keyword">const</span> uint8_t preamble_ints(is_empty() || is_single_item ? PREAMBLE_INTS_SHORT : PREAMBLE_INTS_FULL);</div> |
| <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  write(os, preamble_ints);</div> |
| <div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">const</span> uint8_t serial_version(is_single_item ? SERIAL_VERSION_2 : SERIAL_VERSION_1);</div> |
| <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  write(os, serial_version);</div> |
| <div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">const</span> uint8_t family(FAMILY);</div> |
| <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  write(os, family);</div> |
| <div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> uint8_t flags_byte(</div> |
| <div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  (is_empty() ? 1 << flags::IS_EMPTY : 0)</div> |
| <div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  | (is_level_zero_sorted_ ? 1 << flags::IS_LEVEL_ZERO_SORTED : 0)</div> |
| <div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  | (is_single_item ? 1 << flags::IS_SINGLE_ITEM : 0)</div> |
| <div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  );</div> |
| <div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  write(os, flags_byte);</div> |
| <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  write(os, k_);</div> |
| <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  write(os, m_);</div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">const</span> uint8_t unused = 0;</div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  write(os, unused);</div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span> (!is_single_item) {</div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  write(os, n_);</div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  write(os, min_k_);</div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  write(os, num_levels_);</div> |
| <div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  write(os, unused);</div> |
| <div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  write(os, levels_.data(), <span class="keyword">sizeof</span>(levels_[0]) * num_levels_);</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  sd.serialize(os, &*min_item_, 1);</div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  sd.serialize(os, &*max_item_, 1);</div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  sd.serialize(os, &items_[levels_[0]], get_num_retained());</div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span> }</div> |
| <div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  </div> |
| <div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">kll_sketch<T, C, A>::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe& sd) <span class="keyword">const</span> -> vector_bytes {</div> |
| <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item = n_ == 1;</div> |
| <div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = header_size_bytes + get_serialized_size_bytes(sd);</div> |
| <div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  vector_bytes bytes(size, 0, allocator_);</div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div> |
| <div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div> |
| <div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">const</span> uint8_t preamble_ints(is_empty() || is_single_item ? PREAMBLE_INTS_SHORT : PREAMBLE_INTS_FULL);</div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  ptr += copy_to_mem(preamble_ints, ptr);</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keyword">const</span> uint8_t serial_version(is_single_item ? SERIAL_VERSION_2 : SERIAL_VERSION_1);</div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  ptr += copy_to_mem(serial_version, ptr);</div> |
| <div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> uint8_t family(FAMILY);</div> |
| <div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  ptr += copy_to_mem(family, ptr);</div> |
| <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">const</span> uint8_t flags_byte(</div> |
| <div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  (is_empty() ? 1 << flags::IS_EMPTY : 0)</div> |
| <div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  | (is_level_zero_sorted_ ? 1 << flags::IS_LEVEL_ZERO_SORTED : 0)</div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  | (is_single_item ? 1 << flags::IS_SINGLE_ITEM : 0)</div> |
| <div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  );</div> |
| <div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  ptr += copy_to_mem(flags_byte, ptr);</div> |
| <div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  ptr += copy_to_mem(k_, ptr);</div> |
| <div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  ptr += copy_to_mem(m_, ptr);</div> |
| <div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// unused</span></div> |
| <div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">if</span> (!is_empty()) {</div> |
| <div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (!is_single_item) {</div> |
| <div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  ptr += copy_to_mem(n_, ptr);</div> |
| <div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  ptr += copy_to_mem(min_k_, ptr);</div> |
| <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  ptr += copy_to_mem(num_levels_, ptr);</div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// unused</span></div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  ptr += copy_to_mem(levels_.data(), ptr, <span class="keyword">sizeof</span>(levels_[0]) * num_levels_);</div> |
| <div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  ptr += sd.serialize(ptr, end_ptr - ptr, &*min_item_, 1);</div> |
| <div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  ptr += sd.serialize(ptr, end_ptr - ptr, &*max_item_, 1);</div> |
| <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  }</div> |
| <div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> bytes_remaining = end_ptr - ptr;</div> |
| <div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  ptr += sd.serialize(ptr, bytes_remaining, &items_[levels_[0]], get_num_retained());</div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> delta = ptr - bytes.data();</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">if</span> (delta != size) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"serialized size mismatch: "</span> + std::to_string(delta)</div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  + <span class="stringliteral">" != "</span> + std::to_string(size));</div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">return</span> bytes;</div> |
| <div class="line"><a name="l00438"></a><span class="lineno"> 438</span> }</div> |
| <div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  </div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span> kll_sketch<T, C, A> <a class="code" href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">kll_sketch<T, C, A>::deserialize</a>(std::istream& is, <span class="keyword">const</span> SerDe& sd,</div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator) {</div> |
| <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_ints = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read<uint16_t>(is);</div> |
| <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keyword">const</span> <span class="keyword">auto</span> m = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  read<uint8_t>(is); <span class="comment">// skip unused byte</span></div> |
| <div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  </div> |
| <div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  check_m(m);</div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  check_preamble_ints(preamble_ints, flags_byte);</div> |
| <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  check_serial_version(serial_version);</div> |
| <div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  check_family_id(family_id);</div> |
| <div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  </div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"error reading from std::istream"</span>);</div> |
| <div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte & (1 << flags::IS_EMPTY));</div> |
| <div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> kll_sketch(k, comparator, allocator);</div> |
| <div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  </div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  uint64_t n;</div> |
| <div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  uint16_t min_k;</div> |
| <div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  uint8_t num_levels;</div> |
| <div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte & (1 << flags::IS_SINGLE_ITEM)); <span class="comment">// used in serial version 2</span></div> |
| <div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (is_single_item) {</div> |
| <div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  n = 1;</div> |
| <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  min_k = k;</div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  num_levels = 1;</div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  n = read<uint64_t>(is);</div> |
| <div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  min_k = read<uint16_t>(is);</div> |
| <div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  num_levels = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  read<uint8_t>(is); <span class="comment">// skip unused byte</span></div> |
| <div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div> |
| <div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  vector_u32 levels(num_levels + 1, 0, allocator);</div> |
| <div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">const</span> uint32_t capacity(kll_helper::compute_total_capacity(k, m, num_levels));</div> |
| <div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">if</span> (is_single_item) {</div> |
| <div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  levels[0] = capacity - 1;</div> |
| <div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="comment">// the last integer in levels_ is not serialized because it can be derived</span></div> |
| <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  read(is, levels.data(), <span class="keyword">sizeof</span>(levels[0]) * num_levels);</div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  levels[num_levels] = capacity;</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  optional<T> tmp; <span class="comment">// space to deserialize min and max</span></div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  optional<T> min_item;</div> |
| <div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  optional<T> max_item;</div> |
| <div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">if</span> (!is_single_item) {</div> |
| <div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  sd.deserialize(is, &*tmp, 1);</div> |
| <div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  min_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  sd.deserialize(is, &*tmp, 1);</div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  max_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</div> |
| <div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  A alloc(allocator);</div> |
| <div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">auto</span> items_buffer_deleter = [capacity, &alloc](T* ptr) { alloc.deallocate(ptr, capacity); };</div> |
| <div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  std::unique_ptr<T, decltype(items_buffer_deleter)> items_buffer(alloc.allocate(capacity), items_buffer_deleter);</div> |
| <div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_items = levels[num_levels] - levels[0];</div> |
| <div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  sd.deserialize(is, &items_buffer.get()[levels[0]], num_items);</div> |
| <div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// serde call did not throw, repackage with destrtuctors</span></div> |
| <div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  std::unique_ptr<T, items_deleter> items(items_buffer.release(), items_deleter(levels[0], capacity, allocator));</div> |
| <div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_zero_sorted = (flags_byte & (1 << flags::IS_LEVEL_ZERO_SORTED)) > 0;</div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">if</span> (is_single_item) {</div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  min_item.emplace(items.get()[levels[0]]);</div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  max_item.emplace(items.get()[levels[0]]);</div> |
| <div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div> |
| <div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">if</span> (!is.good())</div> |
| <div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"error reading from std::istream"</span>);</div> |
| <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">return</span> kll_sketch(k, min_k, n, num_levels, std::move(levels), std::move(items), capacity,</div> |
| <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  std::move(min_item), std::move(max_item), is_level_zero_sorted, comparator);</div> |
| <div class="line"><a name="l00513"></a><span class="lineno"> 513</span> }</div> |
| <div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  </div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span> kll_sketch<T, C, A> <a class="code" href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">kll_sketch<T, C, A>::deserialize</a>(<span class="keyword">const</span> <span class="keywordtype">void</span>* bytes, <span class="keywordtype">size_t</span> size, <span class="keyword">const</span> SerDe& sd,</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator) {</div> |
| <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  ensure_minimum_memory(size, 8);</div> |
| <div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes);</div> |
| <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  uint8_t preamble_ints;</div> |
| <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  ptr += copy_from_mem(ptr, preamble_ints);</div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  uint8_t serial_version;</div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  ptr += copy_from_mem(ptr, serial_version);</div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  uint8_t family_id;</div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  ptr += copy_from_mem(ptr, family_id);</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  uint8_t flags_byte;</div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  ptr += copy_from_mem(ptr, flags_byte);</div> |
| <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  uint16_t k;</div> |
| <div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  ptr += copy_from_mem(ptr, k);</div> |
| <div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  uint8_t m;</div> |
| <div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  ptr += copy_from_mem(ptr, m);</div> |
| <div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// skip unused byte</span></div> |
| <div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  </div> |
| <div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  check_m(m);</div> |
| <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  check_preamble_ints(preamble_ints, flags_byte);</div> |
| <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  check_serial_version(serial_version);</div> |
| <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  check_family_id(family_id);</div> |
| <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  ensure_minimum_memory(size, preamble_ints * <span class="keyword">sizeof</span>(uint32_t));</div> |
| <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  </div> |
| <div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte & (1 << flags::IS_EMPTY));</div> |
| <div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> kll_sketch(k, comparator, allocator);</div> |
| <div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  </div> |
| <div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  uint64_t n;</div> |
| <div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  uint16_t min_k;</div> |
| <div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  uint8_t num_levels;</div> |
| <div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte & (1 << flags::IS_SINGLE_ITEM)); <span class="comment">// used in serial version 2</span></div> |
| <div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes) + size;</div> |
| <div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (is_single_item) {</div> |
| <div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  n = 1;</div> |
| <div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  min_k = k;</div> |
| <div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  num_levels = 1;</div> |
| <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  ptr += copy_from_mem(ptr, n);</div> |
| <div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  ptr += copy_from_mem(ptr, min_k);</div> |
| <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  ptr += copy_from_mem(ptr, num_levels);</div> |
| <div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// skip unused byte</span></div> |
| <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  }</div> |
| <div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  vector_u32 levels(num_levels + 1, 0, allocator);</div> |
| <div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keyword">const</span> uint32_t capacity(kll_helper::compute_total_capacity(k, m, num_levels));</div> |
| <div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (is_single_item) {</div> |
| <div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  levels[0] = capacity - 1;</div> |
| <div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// the last integer in levels_ is not serialized because it can be derived</span></div> |
| <div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  ptr += copy_from_mem(ptr, levels.data(), <span class="keyword">sizeof</span>(levels[0]) * num_levels);</div> |
| <div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  }</div> |
| <div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  levels[num_levels] = capacity;</div> |
| <div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  optional<T> tmp; <span class="comment">// space to deserialize min and max</span></div> |
| <div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  optional<T> min_item;</div> |
| <div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  optional<T> max_item;</div> |
| <div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">if</span> (!is_single_item) {</div> |
| <div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, &*tmp, 1);</div> |
| <div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  min_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, &*tmp, 1);</div> |
| <div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  max_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  }</div> |
| <div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  A alloc(allocator);</div> |
| <div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keyword">auto</span> items_buffer_deleter = [capacity, &alloc](T* ptr) { alloc.deallocate(ptr, capacity); };</div> |
| <div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  std::unique_ptr<T, decltype(items_buffer_deleter)> items_buffer(alloc.allocate(capacity), items_buffer_deleter);</div> |
| <div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_items = levels[num_levels] - levels[0];</div> |
| <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, &items_buffer.get()[levels[0]], num_items);</div> |
| <div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">// serde call did not throw, repackage with destrtuctors</span></div> |
| <div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  std::unique_ptr<T, items_deleter> items(items_buffer.release(), items_deleter(levels[0], capacity, allocator));</div> |
| <div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> delta = ptr - <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes);</div> |
| <div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (delta != size) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"deserialized size mismatch: "</span> + std::to_string(delta) + <span class="stringliteral">" != "</span> + std::to_string(size));</div> |
| <div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_zero_sorted = (flags_byte & (1 << flags::IS_LEVEL_ZERO_SORTED)) > 0;</div> |
| <div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (is_single_item) {</div> |
| <div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  min_item.emplace(items.get()[levels[0]]);</div> |
| <div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  max_item.emplace(items.get()[levels[0]]);</div> |
| <div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div> |
| <div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">return</span> kll_sketch(k, min_k, n, num_levels, std::move(levels), std::move(items), capacity,</div> |
| <div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  std::move(min_item), std::move(max_item), is_level_zero_sorted, comparator);</div> |
| <div class="line"><a name="l00597"></a><span class="lineno"> 597</span> }</div> |
| <div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div> |
| <div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"> * Gets the normalized rank error given k and pmf.</span></div> |
| <div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> * k - the configuration parameter</span></div> |
| <div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> * pmf - if true, returns the "double-sided" normalized rank error for the get_PMF() function.</span></div> |
| <div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * Otherwise, it is the "single-sided" normalized rank error for all the other queries.</span></div> |
| <div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * Constants were derived as the best fit to 99 percentile empirically measured max error in thousands of trials</span></div> |
| <div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="keywordtype">double</span> <a class="code" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">kll_sketch<T, C, A>::get_normalized_rank_error</a>(uint16_t k, <span class="keywordtype">bool</span> pmf) {</div> |
| <div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">return</span> pmf</div> |
| <div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  ? 2.446 / pow(k, 0.9433)</div> |
| <div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  : 2.296 / pow(k, 0.9723);</div> |
| <div class="line"><a name="l00611"></a><span class="lineno"> 611</span> }</div> |
| <div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  </div> |
| <div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment">// for deserialization</span></div> |
| <div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00615"></a><span class="lineno"> 615</span> kll_sketch<T, C, A>::kll_sketch(uint16_t k, uint16_t min_k, uint64_t n, uint8_t num_levels, vector_u32&& levels,</div> |
| <div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  std::unique_ptr<T, items_deleter> items, uint32_t items_size, optional<T>&& min_item,</div> |
| <div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  optional<T>&& max_item, <span class="keywordtype">bool</span> is_level_zero_sorted, <span class="keyword">const</span> C& comparator):</div> |
| <div class="line"><a name="l00618"></a><span class="lineno"> 618</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00619"></a><span class="lineno"> 619</span> allocator_(levels.get_allocator()),</div> |
| <div class="line"><a name="l00620"></a><span class="lineno"> 620</span> k_(k),</div> |
| <div class="line"><a name="l00621"></a><span class="lineno"> 621</span> m_(kll_constants::DEFAULT_M),</div> |
| <div class="line"><a name="l00622"></a><span class="lineno"> 622</span> min_k_(min_k),</div> |
| <div class="line"><a name="l00623"></a><span class="lineno"> 623</span> num_levels_(num_levels),</div> |
| <div class="line"><a name="l00624"></a><span class="lineno"> 624</span> is_level_zero_sorted_(is_level_zero_sorted),</div> |
| <div class="line"><a name="l00625"></a><span class="lineno"> 625</span> n_(n),</div> |
| <div class="line"><a name="l00626"></a><span class="lineno"> 626</span> levels_(std::move(levels)),</div> |
| <div class="line"><a name="l00627"></a><span class="lineno"> 627</span> items_(items.release()),</div> |
| <div class="line"><a name="l00628"></a><span class="lineno"> 628</span> items_size_(items_size),</div> |
| <div class="line"><a name="l00629"></a><span class="lineno"> 629</span> min_item_(std::move(min_item)),</div> |
| <div class="line"><a name="l00630"></a><span class="lineno"> 630</span> max_item_(std::move(max_item)),</div> |
| <div class="line"><a name="l00631"></a><span class="lineno"> 631</span> sorted_view_(nullptr)</div> |
| <div class="line"><a name="l00632"></a><span class="lineno"> 632</span> {}</div> |
| <div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  </div> |
| <div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment">// The following code is only valid in the special case of exactly reaching capacity while updating.</span></div> |
| <div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment">// It cannot be used while merging, while reducing k, or anything else.</span></div> |
| <div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::compress_while_updating(<span class="keywordtype">void</span>) {</div> |
| <div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">const</span> uint8_t level = find_level_to_compact();</div> |
| <div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  </div> |
| <div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="comment">// It is important to add the new top level right here. Be aware that this operation</span></div> |
| <div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">// grows the buffer and shifts the data and also the boundaries of the data and grows the</span></div> |
| <div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// levels array and increments num_levels_</span></div> |
| <div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">if</span> (level == (num_levels_ - 1)) {</div> |
| <div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  add_empty_top_level_to_completely_full_sketch();</div> |
| <div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div> |
| <div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div> |
| <div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keyword">const</span> uint32_t raw_beg = levels_[level];</div> |
| <div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">const</span> uint32_t raw_lim = levels_[level + 1];</div> |
| <div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">// +2 is OK because we already added a new top level if necessary</span></div> |
| <div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keyword">const</span> uint32_t pop_above = levels_[level + 2] - raw_lim;</div> |
| <div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> uint32_t raw_pop = raw_lim - raw_beg;</div> |
| <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> odd_pop = kll_helper::is_odd(raw_pop);</div> |
| <div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">const</span> uint32_t adj_beg = odd_pop ? raw_beg + 1 : raw_beg;</div> |
| <div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">const</span> uint32_t adj_pop = odd_pop ? raw_pop - 1 : raw_pop;</div> |
| <div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keyword">const</span> uint32_t half_adj_pop = adj_pop / 2;</div> |
| <div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keyword">const</span> uint32_t destroy_beg = levels_[0];</div> |
| <div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  </div> |
| <div class="line"><a name="l00658"></a><span class="lineno"> 658</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="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// sort_level_zero() is not used here because of the adjustment for odd number of items</span></div> |
| <div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">if</span> ((level == 0) && !is_level_zero_sorted_) {</div> |
| <div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  std::sort(items_ + adj_beg, items_ + adj_beg + adj_pop, comparator_);</div> |
| <div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  }</div> |
| <div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">if</span> (pop_above == 0) {</div> |
| <div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  kll_helper::randomly_halve_up(items_, adj_beg, adj_pop);</div> |
| <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  kll_helper::randomly_halve_down(items_, adj_beg, adj_pop);</div> |
| <div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  kll_helper::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="l00668"></a><span class="lineno"> 668</span>  }</div> |
| <div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  levels_[level + 1] -= half_adj_pop; <span class="comment">// adjust boundaries of the level above</span></div> |
| <div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">if</span> (odd_pop) {</div> |
| <div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  levels_[level] = levels_[level + 1] - 1; <span class="comment">// the current level now contains one item</span></div> |
| <div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">if</span> (levels_[level] != raw_beg) items_[levels_[level]] = std::move(items_[raw_beg]); <span class="comment">// namely this leftover guy</span></div> |
| <div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  levels_[level] = levels_[level + 1]; <span class="comment">// the current level is now empty</span></div> |
| <div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  }</div> |
| <div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  </div> |
| <div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="comment">// verify that we freed up half_adj_pop array slots just below the current level</span></div> |
| <div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">if</span> (levels_[level] != (raw_beg + half_adj_pop)) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"compaction error"</span>);</div> |
| <div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  </div> |
| <div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// finally, we need to shift up the data in the levels below</span></div> |
| <div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// so that the freed-up space can be used by level zero</span></div> |
| <div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">if</span> (level > 0) {</div> |
| <div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">const</span> uint32_t amount = raw_beg - levels_[0];</div> |
| <div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  std::move_backward(items_ + levels_[0], items_ + levels_[0] + amount, items_ + levels_[0] + half_adj_pop + amount);</div> |
| <div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl < level; lvl++) levels_[lvl] += half_adj_pop;</div> |
| <div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div> |
| <div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i < half_adj_pop; i++) items_[i + destroy_beg].~T();</div> |
| <div class="line"><a name="l00688"></a><span class="lineno"> 688</span> }</div> |
| <div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  </div> |
| <div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00691"></a><span class="lineno"> 691</span> uint8_t kll_sketch<T, C, A>::find_level_to_compact()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  uint8_t level = 0;</div> |
| <div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">if</span> (level >= num_levels_) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"capacity calculation error"</span>);</div> |
| <div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keyword">const</span> uint32_t pop = levels_[level + 1] - levels_[level];</div> |
| <div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">const</span> uint32_t cap = kll_helper::level_capacity(k_, num_levels_, level, m_);</div> |
| <div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">if</span> (pop >= cap) {</div> |
| <div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">return</span> level;</div> |
| <div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  }</div> |
| <div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  level++;</div> |
| <div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div> |
| <div class="line"><a name="l00702"></a><span class="lineno"> 702</span> }</div> |
| <div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  </div> |
| <div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::add_empty_top_level_to_completely_full_sketch() {</div> |
| <div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">const</span> uint32_t cur_total_cap = levels_[num_levels_];</div> |
| <div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  </div> |
| <div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// make sure that we are following a certain growth scheme</span></div> |
| <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">if</span> (levels_[0] != 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"full sketch expected"</span>);</div> |
| <div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">if</span> (items_size_ != cur_total_cap) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"current capacity mismatch"</span>);</div> |
| <div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  </div> |
| <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// note that merging MIGHT over-grow levels_, in which case we might not have to grow it here</span></div> |
| <div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keyword">const</span> uint8_t new_levels_size = num_levels_ + 2;</div> |
| <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">if</span> (levels_.size() < new_levels_size) {</div> |
| <div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  levels_.resize(new_levels_size);</div> |
| <div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  }</div> |
| <div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  </div> |
| <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keyword">const</span> uint32_t delta_cap = kll_helper::level_capacity(k_, num_levels_ + 1, 0, m_);</div> |
| <div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">const</span> uint32_t new_total_cap = cur_total_cap + delta_cap;</div> |
| <div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  </div> |
| <div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">// move (and shift) the current data into the new buffer</span></div> |
| <div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  T* new_buf = allocator_.allocate(new_total_cap);</div> |
| <div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  kll_helper::move_construct<T>(items_, 0, cur_total_cap, new_buf, delta_cap, <span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  allocator_.deallocate(items_, items_size_);</div> |
| <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  items_ = new_buf;</div> |
| <div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  items_size_ = new_total_cap;</div> |
| <div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  </div> |
| <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// this loop includes the old "extra" index at the top</span></div> |
| <div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">for</span> (uint8_t i = 0; i <= num_levels_; i++) {</div> |
| <div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  levels_[i] += delta_cap;</div> |
| <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  }</div> |
| <div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  </div> |
| <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">if</span> (levels_[num_levels_] != new_total_cap) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"new capacity mismatch"</span>);</div> |
| <div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  </div> |
| <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  num_levels_++;</div> |
| <div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  levels_[num_levels_] = new_total_cap; <span class="comment">// initialize the new "extra" index at the top</span></div> |
| <div class="line"><a name="l00737"></a><span class="lineno"> 737</span> }</div> |
| <div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  </div> |
| <div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::sort_level_zero() {</div> |
| <div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordflow">if</span> (!is_level_zero_sorted_) {</div> |
| <div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  std::sort(items_ + levels_[0], items_ + levels_[1], comparator_);</div> |
| <div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  is_level_zero_sorted_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  }</div> |
| <div class="line"><a name="l00745"></a><span class="lineno"> 745</span> }</div> |
| <div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  </div> |
| <div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::check_sorting()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// not checking level 0</span></div> |
| <div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">for</span> (uint8_t level = 1; level < num_levels_; ++level) {</div> |
| <div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">const</span> <span class="keyword">auto</span> from = items_ + levels_[level];</div> |
| <div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keyword">const</span> <span class="keyword">auto</span> to = items_ + levels_[level + 1];</div> |
| <div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordflow">if</span> (!std::is_sorted(from, to, comparator_)) {</div> |
| <div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"levels must be sorted"</span>);</div> |
| <div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div> |
| <div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div> |
| <div class="line"><a name="l00757"></a><span class="lineno"> 757</span> }</div> |
| <div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div> |
| <div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00760"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00"> 760</a></span> <a class="code" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view<T, C, A></a> <a class="code" href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">kll_sketch<T, C, A>::get_sorted_view</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">const_cast<</span><a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>*<span class="keyword">></span>(<span class="keyword">this</span>)->sort_level_zero(); <span class="comment">// allow this side effect</span></div> |
| <div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <a class="code" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view<T, C, A></a> view(get_num_retained(), comparator_, allocator_);</div> |
| <div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">for</span> (uint8_t level = 0; level < num_levels_; ++level) {</div> |
| <div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keyword">const</span> <span class="keyword">auto</span> from = items_ + levels_[level];</div> |
| <div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keyword">const</span> <span class="keyword">auto</span> to = items_ + levels_[level + 1]; <span class="comment">// exclusive</span></div> |
| <div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  view.add(from, to, 1ULL << level);</div> |
| <div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  }</div> |
| <div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  view.convert_to_cummulative();</div> |
| <div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">return</span> view;</div> |
| <div class="line"><a name="l00770"></a><span class="lineno"> 770</span> }</div> |
| <div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  </div> |
| <div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="keyword">template</span><<span class="keyword">typename</span> O></div> |
| <div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::merge_higher_levels</a>(O&& other, uint64_t final_n) {</div> |
| <div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keyword">const</span> uint32_t tmp_num_items = get_num_retained() + other.get_num_retained_above_level_zero();</div> |
| <div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  A alloc(allocator_);</div> |
| <div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">auto</span> tmp_items_deleter = [tmp_num_items, &alloc](T* ptr) { alloc.deallocate(ptr, tmp_num_items); }; <span class="comment">// no destructor needed</span></div> |
| <div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keyword">const</span> std::unique_ptr<T, decltype(tmp_items_deleter)> workbuf(allocator_.allocate(tmp_num_items), tmp_items_deleter);</div> |
| <div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keyword">const</span> uint8_t ub = kll_helper::ub_on_num_levels(final_n);</div> |
| <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> work_levels_size = ub + 2; <span class="comment">// ub+1 does not work</span></div> |
| <div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  vector_u32 worklevels(work_levels_size, 0, allocator_);</div> |
| <div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  vector_u32 outlevels(work_levels_size, 0, allocator_);</div> |
| <div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  </div> |
| <div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keyword">const</span> uint8_t provisional_num_levels = std::max(num_levels_, other.num_levels_);</div> |
| <div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  </div> |
| <div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  populate_work_arrays(std::forward<O>(other), workbuf.get(), worklevels.data(), provisional_num_levels);</div> |
| <div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  </div> |
| <div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">const</span> kll_helper::compress_result result = kll_helper::general_compress<T, C>(k_, m_, provisional_num_levels, workbuf.get(),</div> |
| <div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  worklevels.data(), outlevels.data(), is_level_zero_sorted_);</div> |
| <div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  </div> |
| <div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// ub can sometimes be much bigger</span></div> |
| <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">if</span> (result.final_num_levels > ub) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"merge error"</span>);</div> |
| <div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  </div> |
| <div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// now we need to transfer the results back into "this" sketch</span></div> |
| <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">if</span> (result.final_capacity != items_size_) {</div> |
| <div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  allocator_.deallocate(items_, items_size_);</div> |
| <div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  items_size_ = result.final_capacity;</div> |
| <div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  items_ = allocator_.allocate(items_size_);</div> |
| <div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div> |
| <div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keyword">const</span> uint32_t free_space_at_bottom = result.final_capacity - result.final_num_items;</div> |
| <div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  kll_helper::move_construct<T>(workbuf.get(), outlevels[0], outlevels[0] + result.final_num_items, items_, free_space_at_bottom, <span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  </div> |
| <div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_levels_size = result.final_num_levels + 1;</div> |
| <div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">if</span> (levels_.size() < new_levels_size) {</div> |
| <div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  levels_.resize(new_levels_size);</div> |
| <div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  }</div> |
| <div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keyword">const</span> uint32_t offset = free_space_at_bottom - outlevels[0];</div> |
| <div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl < levels_.size(); lvl++) { <span class="comment">// includes the "extra" index</span></div> |
| <div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  levels_[lvl] = outlevels[lvl] + offset;</div> |
| <div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  }</div> |
| <div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  num_levels_ = result.final_num_levels;</div> |
| <div class="line"><a name="l00812"></a><span class="lineno"> 812</span> }</div> |
| <div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  </div> |
| <div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment">// this leaves items_ uninitialized (all objects moved out and destroyed)</span></div> |
| <div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdSk></div> |
| <div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::populate_work_arrays(FwdSk&& other, T* workbuf, uint32_t* worklevels, uint8_t provisional_num_levels) {</div> |
| <div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  worklevels[0] = 0;</div> |
| <div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  </div> |
| <div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="comment">// the level zero data from "other" was already inserted into "this"</span></div> |
| <div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  kll_helper::move_construct<T>(items_, levels_[0], levels_[1], workbuf, 0, <span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  worklevels[1] = safe_level_size(0);</div> |
| <div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  </div> |
| <div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordflow">for</span> (uint8_t lvl = 1; lvl < provisional_num_levels; lvl++) {</div> |
| <div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">const</span> uint32_t self_pop = safe_level_size(lvl);</div> |
| <div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keyword">const</span> uint32_t other_pop = other.safe_level_size(lvl);</div> |
| <div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  worklevels[lvl + 1] = worklevels[lvl] + self_pop + other_pop;</div> |
| <div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  </div> |
| <div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordflow">if</span> ((self_pop > 0) && (other_pop == 0)) {</div> |
| <div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  kll_helper::move_construct<T>(items_, levels_[lvl], levels_[lvl] + self_pop, workbuf, worklevels[lvl], <span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((self_pop == 0) && (other_pop > 0)) {</div> |
| <div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = other.levels_[lvl], j = worklevels[lvl]; i < other.levels_[lvl] + other_pop; ++i, ++j) {</div> |
| <div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keyword">new</span> (&workbuf[j]) T(conditional_forward<FwdSk>(other.items_[i]));</div> |
| <div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</div> |
| <div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((self_pop > 0) && (other_pop > 0)) {</div> |
| <div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  kll_helper::merge_sorted_arrays<T, C>(items_, levels_[lvl], self_pop, other.items_, other.levels_[lvl], other_pop, workbuf, worklevels[lvl]);</div> |
| <div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div> |
| <div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  }</div> |
| <div class="line"><a name="l00839"></a><span class="lineno"> 839</span> }</div> |
| <div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  </div> |
| <div class="line"><a name="l00841"></a><span class="lineno"> 841</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00842"></a><span class="lineno"> 842</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::assert_correct_total_weight()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keyword">const</span> uint64_t total(kll_helper::sum_the_sample_weights(num_levels_, levels_.data()));</div> |
| <div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">if</span> (total != n_) {</div> |
| <div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Total weight does not match N"</span>);</div> |
| <div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  }</div> |
| <div class="line"><a name="l00847"></a><span class="lineno"> 847</span> }</div> |
| <div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  </div> |
| <div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00850"></a><span class="lineno"> 850</span> uint32_t kll_sketch<T, C, A>::safe_level_size(uint8_t level)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">if</span> (level >= num_levels_) <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keywordflow">return</span> levels_[level + 1] - levels_[level];</div> |
| <div class="line"><a name="l00853"></a><span class="lineno"> 853</span> }</div> |
| <div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  </div> |
| <div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00856"></a><span class="lineno"> 856</span> uint32_t kll_sketch<T, C, A>::get_num_retained_above_level_zero()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">if</span> (num_levels_ == 1) <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">return</span> levels_[num_levels_] - levels_[1];</div> |
| <div class="line"><a name="l00859"></a><span class="lineno"> 859</span> }</div> |
| <div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  </div> |
| <div class="line"><a name="l00861"></a><span class="lineno"> 861</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00862"></a><span class="lineno"> 862</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::check_m(uint8_t m) {</div> |
| <div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keywordflow">if</span> (m != kll_constants::DEFAULT_M) {</div> |
| <div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption: M must be "</span> + std::to_string(kll_constants::DEFAULT_M)</div> |
| <div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  + <span class="stringliteral">": "</span> + std::to_string(m));</div> |
| <div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  }</div> |
| <div class="line"><a name="l00867"></a><span class="lineno"> 867</span> }</div> |
| <div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  </div> |
| <div class="line"><a name="l00869"></a><span class="lineno"> 869</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00870"></a><span class="lineno"> 870</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::check_preamble_ints(uint8_t preamble_ints, uint8_t flags_byte) {</div> |
| <div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte & (1 << flags::IS_EMPTY));</div> |
| <div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte & (1 << flags::IS_SINGLE_ITEM));</div> |
| <div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keywordflow">if</span> (is_empty || is_single_item) {</div> |
| <div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">if</span> (preamble_ints != PREAMBLE_INTS_SHORT) {</div> |
| <div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption: preamble ints must be "</span></div> |
| <div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  + std::to_string(PREAMBLE_INTS_SHORT) + <span class="stringliteral">" for an empty or single item sketch: "</span> + std::to_string(preamble_ints));</div> |
| <div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  }</div> |
| <div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordflow">if</span> (preamble_ints != PREAMBLE_INTS_FULL) {</div> |
| <div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption: preamble ints must be "</span></div> |
| <div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  + std::to_string(PREAMBLE_INTS_FULL) + <span class="stringliteral">" for a sketch with more than one item: "</span> + std::to_string(preamble_ints));</div> |
| <div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div> |
| <div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div> |
| <div class="line"><a name="l00884"></a><span class="lineno"> 884</span> }</div> |
| <div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  </div> |
| <div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::check_serial_version(uint8_t serial_version) {</div> |
| <div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordflow">if</span> (serial_version != SERIAL_VERSION_1 && serial_version != SERIAL_VERSION_2) {</div> |
| <div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption: serial version mismatch: expected "</span></div> |
| <div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  + std::to_string(SERIAL_VERSION_1) + <span class="stringliteral">" or "</span> + std::to_string(SERIAL_VERSION_2)</div> |
| <div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  + <span class="stringliteral">", got "</span> + std::to_string(serial_version));</div> |
| <div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  }</div> |
| <div class="line"><a name="l00893"></a><span class="lineno"> 893</span> }</div> |
| <div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  </div> |
| <div class="line"><a name="l00895"></a><span class="lineno"> 895</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00896"></a><span class="lineno"> 896</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::check_family_id(uint8_t family_id) {</div> |
| <div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">if</span> (family_id != FAMILY) {</div> |
| <div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption: family mismatch: expected "</span></div> |
| <div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  + std::to_string(FAMILY) + <span class="stringliteral">", got "</span> + std::to_string(family_id));</div> |
| <div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  }</div> |
| <div class="line"><a name="l00901"></a><span class="lineno"> 901</span> }</div> |
| <div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  </div> |
| <div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00904"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda"> 904</a></span> string<A> <a class="code" href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">kll_sketch<T, C, A>::to_string</a>(<span class="keywordtype">bool</span> print_levels, <span class="keywordtype">bool</span> print_items)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div> |
| <div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div> |
| <div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  std::ostringstream os;</div> |
| <div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  os << <span class="stringliteral">"### KLL sketch summary:"</span> << std::endl;</div> |
| <div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  os << <span class="stringliteral">" K : "</span> << k_ << std::endl;</div> |
| <div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  os << <span class="stringliteral">" min K : "</span> << min_k_ << std::endl;</div> |
| <div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  os << <span class="stringliteral">" M : "</span> << (<span class="keywordtype">unsigned</span> int) m_ << std::endl;</div> |
| <div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  os << <span class="stringliteral">" N : "</span> << n_ << std::endl;</div> |
| <div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  os << <span class="stringliteral">" Epsilon : "</span> << std::setprecision(3) << get_normalized_rank_error(<span class="keyword">false</span>) * 100 << <span class="stringliteral">"%"</span> << std::endl;</div> |
| <div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  os << <span class="stringliteral">" Epsilon PMF : "</span> << get_normalized_rank_error(<span class="keyword">true</span>) * 100 << <span class="stringliteral">"%"</span> << std::endl;</div> |
| <div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  os << <span class="stringliteral">" Empty : "</span> << (is_empty() ? <span class="stringliteral">"true"</span> : <span class="stringliteral">"false"</span>) << std::endl;</div> |
| <div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  os << <span class="stringliteral">" Estimation mode: "</span> << (is_estimation_mode() ? <span class="stringliteral">"true"</span> : <span class="stringliteral">"false"</span>) << std::endl;</div> |
| <div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  os << <span class="stringliteral">" Levels : "</span> << (<span class="keywordtype">unsigned</span> int) num_levels_ << std::endl;</div> |
| <div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  os << <span class="stringliteral">" Sorted : "</span> << (is_level_zero_sorted_ ? <span class="stringliteral">"true"</span> : <span class="stringliteral">"false"</span>) << std::endl;</div> |
| <div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  os << <span class="stringliteral">" Capacity items : "</span> << items_size_ << std::endl;</div> |
| <div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  os << <span class="stringliteral">" Retained items : "</span> << get_num_retained() << std::endl;</div> |
| <div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">if</span> (!is_empty()) {</div> |
| <div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  os << <span class="stringliteral">" Min item : "</span> << *min_item_ << std::endl;</div> |
| <div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  os << <span class="stringliteral">" Max item : "</span> << *max_item_ << std::endl;</div> |
| <div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  }</div> |
| <div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  os << <span class="stringliteral">"### End sketch summary"</span> << std::endl;</div> |
| <div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  </div> |
| <div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">if</span> (print_levels) {</div> |
| <div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  os << <span class="stringliteral">"### KLL sketch levels:"</span> << std::endl;</div> |
| <div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  os << <span class="stringliteral">" index: nominal capacity, actual size"</span> << std::endl;</div> |
| <div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">for</span> (uint8_t i = 0; i < num_levels_; i++) {</div> |
| <div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  os << <span class="stringliteral">" "</span> << (<span class="keywordtype">unsigned</span> int) i << <span class="stringliteral">": "</span> << kll_helper::level_capacity(k_, num_levels_, i, m_) << <span class="stringliteral">", "</span> << safe_level_size(i) << std::endl;</div> |
| <div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  }</div> |
| <div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  os << <span class="stringliteral">"### End sketch levels"</span> << std::endl;</div> |
| <div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  }</div> |
| <div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  </div> |
| <div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">if</span> (print_items) {</div> |
| <div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  os << <span class="stringliteral">"### KLL sketch data:"</span> << std::endl;</div> |
| <div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  uint8_t level = 0;</div> |
| <div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">while</span> (level < num_levels_) {</div> |
| <div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keyword">const</span> uint32_t from_index = levels_[level];</div> |
| <div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keyword">const</span> uint32_t to_index = levels_[level + 1]; <span class="comment">// exclusive</span></div> |
| <div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">if</span> (from_index < to_index) {</div> |
| <div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  os << <span class="stringliteral">" level "</span> << (<span class="keywordtype">unsigned</span> int) level << <span class="stringliteral">":"</span> << std::endl;</div> |
| <div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  }</div> |
| <div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keywordflow">for</span> (uint32_t i = from_index; i < to_index; i++) {</div> |
| <div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  os << <span class="stringliteral">" "</span> << items_[i] << std::endl;</div> |
| <div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div> |
| <div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  level++;</div> |
| <div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  }</div> |
| <div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  os << <span class="stringliteral">"### End sketch data"</span> << std::endl;</div> |
| <div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div> |
| <div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">return</span> string<A>(os.str().c_str(), allocator_);</div> |
| <div class="line"><a name="l00953"></a><span class="lineno"> 953</span> }</div> |
| <div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  </div> |
| <div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00956"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea"> 956</a></span> <span class="keyword">typename</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::const_iterator</a> <a class="code" href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">kll_sketch<T, C, A>::begin</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keywordflow">return</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::const_iterator</a>(items_, levels_.data(), num_levels_);</div> |
| <div class="line"><a name="l00958"></a><span class="lineno"> 958</span> }</div> |
| <div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  </div> |
| <div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00961"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb"> 961</a></span> <span class="keyword">typename</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::const_iterator</a> <a class="code" href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">kll_sketch<T, C, A>::end</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordflow">return</span> <a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch<T, C, A>::const_iterator</a>(<span class="keyword">nullptr</span>, levels_.data(), num_levels_);</div> |
| <div class="line"><a name="l00963"></a><span class="lineno"> 963</span> }</div> |
| <div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  </div> |
| <div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="keyword">class </span><a class="code" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a><T, C, A>::items_deleter {</div> |
| <div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  items_deleter(uint32_t start, uint32_t num, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  allocator_(allocator), start_(start), num_(num) {}</div> |
| <div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div> |
| <div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keywordflow">for</span> (uint32_t i = start_; i < num_; ++i) ptr[i].~T();</div> |
| <div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  allocator_.deallocate(ptr, num_);</div> |
| <div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div> |
| <div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  }</div> |
| <div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  A allocator_;</div> |
| <div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  uint32_t start_;</div> |
| <div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  uint32_t num_;</div> |
| <div class="line"><a name="l00980"></a><span class="lineno"> 980</span> };</div> |
| <div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  </div> |
| <div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::setup_sorted_view()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">using</span> AllocSortedView = <span class="keyword">typename</span> std::allocator_traits<A>::template rebind_alloc<quantiles_sorted_view<T, C, A>>;</div> |
| <div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) quantiles_sorted_view<T, C, A>(get_sorted_view());</div> |
| <div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  }</div> |
| <div class="line"><a name="l00988"></a><span class="lineno"> 988</span> }</div> |
| <div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  </div> |
| <div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="keywordtype">void</span> kll_sketch<T, C, A>::reset_sorted_view() {</div> |
| <div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  sorted_view_->~quantiles_sorted_view();</div> |
| <div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keyword">using</span> AllocSortedView = <span class="keyword">typename</span> std::allocator_traits<A>::template rebind_alloc<quantiles_sorted_view<T, C, A>>;</div> |
| <div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div> |
| <div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  sorted_view_ = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  }</div> |
| <div class="line"><a name="l00998"></a><span class="lineno"> 998</span> }</div> |
| <div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  </div> |
| <div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> <span class="comment">// kll_sketch::const_iterator implementation</span></div> |
| <div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  </div> |
| <div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> kll_sketch<T, C, A>::const_iterator::const_iterator(<span class="keyword">const</span> T* items, <span class="keyword">const</span> uint32_t* levels, <span class="keyword">const</span> uint8_t num_levels):</div> |
| <div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> items(items), levels(levels), num_levels(num_levels), index(items == nullptr ? levels[num_levels] : levels[0]), level(items == nullptr ? num_levels : 0), weight(1)</div> |
| <div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> {}</div> |
| <div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  </div> |
| <div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> <span class="keyword">typename</span> kll_sketch<T, C, A>::const_iterator& kll_sketch<T, C, A>::const_iterator::operator++() {</div> |
| <div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  ++index;</div> |
| <div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">if</span> (index == levels[level + 1]) { <span class="comment">// go to the next non-empty level</span></div> |
| <div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  ++level;</div> |
| <div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  weight *= 2;</div> |
| <div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  } <span class="keywordflow">while</span> (level < num_levels && levels[level] == levels[level + 1]);</div> |
| <div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  }</div> |
| <div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> }</div> |
| <div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  </div> |
| <div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="keyword">typename</span> kll_sketch<T, C, A>::const_iterator& kll_sketch<T, C, A>::const_iterator::operator++(<span class="keywordtype">int</span>) {</div> |
| <div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  const_iterator tmp(*<span class="keyword">this</span>);</div> |
| <div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  operator++();</div> |
| <div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">return</span> tmp;</div> |
| <div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> }</div> |
| <div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  </div> |
| <div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="keywordtype">bool</span> kll_sketch<T, C, A>::const_iterator::operator==(<span class="keyword">const</span> const_iterator& other)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">return</span> index == other.index;</div> |
| <div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> }</div> |
| <div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  </div> |
| <div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="keywordtype">bool</span> kll_sketch<T, C, A>::const_iterator::operator!=(<span class="keyword">const</span> const_iterator& other)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keywordflow">return</span> !operator==(other);</div> |
| <div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> }</div> |
| <div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  </div> |
| <div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="keyword">auto</span> kll_sketch<T, C, A>::const_iterator::operator*() const -> reference {</div> |
| <div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">return</span> value_type(items[index], weight);</div> |
| <div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> }</div> |
| <div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  </div> |
| <div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> <span class="keyword">auto</span> kll_sketch<T, C, A>::const_iterator::operator->() const -> pointer {</div> |
| <div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l01044"></a><span class="lineno"> 1044</span> }</div> |
| <div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  </div> |
| <div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> } <span class="comment">/* namespace datasketches */</span></div> |
| <div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  </div> |
| <div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> <span class="preprocessor">#endif</span></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html">datasketches::kll_sketch</a></div><div class="ttdoc">Implementation of a very compact quantiles sketch with lazy compaction scheme and nearly optimal accu...</div><div class="ttdef"><b>Definition:</b> kll_sketch.hpp:166</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::kll_sketch::get_comparator</a></div><div class="ttdeci">C get_comparator() const</div><div class="ttdoc">Returns an instance of the comparator for this sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:271</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::kll_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view< T, C, A > get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:760</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0d934088182b8615c2fa34a4716d7d44"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">datasketches::kll_sketch::operator=</a></div><div class="ttdeci">kll_sketch & operator=(const kll_sketch &other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:102</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::kll_sketch::get_CDF</a></div><div class="ttdeci">vector_double get_CDF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Cumulative Distribution Function (CDF), which is the cumulative analo...</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:295</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a288af208cb43c6bdd67b788dc92037ea"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">datasketches::kll_sketch::begin</a></div><div class="ttdeci">const_iterator begin() const</div><div class="ttdoc">Iterator pointing to the first item in the sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:956</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::kll_sketch::get_num_retained</a></div><div class="ttdeci">uint32_t get_num_retained() const</div><div class="ttdoc">Returns the number of retained items (samples) in the sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:249</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a3f2a0c95cd2c88854ec9b9ab7088f419"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">datasketches::kll_sketch::deserialize</a></div><div class="ttdeci">static kll_sketch deserialize(std::istream &is, const SerDe &sd=SerDe(), const C &comparator=C(), const A &allocator=A())</div><div class="ttdoc">This method deserializes a sketch from a given stream.</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::kll_sketch::get_PMF</a></div><div class="ttdeci">vector_double get_PMF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Probability Mass Function (PMF) of the input stream given a set of sp...</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:288</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::kll_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &&other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:209</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a4cdb10e4f2949d55d29421c6e381a300"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">datasketches::kll_sketch::get_max_item</a></div><div class="ttdeci">T get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:265</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5194060fd9b11a856cfb47e59801a3eb"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">datasketches::kll_sketch::end</a></div><div class="ttdeci">const_iterator end() const</div><div class="ttdoc">Iterator pointing to the past-the-end item in the sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:961</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::kll_sketch::update</a></div><div class="ttdeci">void update(FwdT &&item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:180</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::kll_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &os, const SerDe &sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch into a given stream in a binary form.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:367</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::kll_sketch::to_string</a></div><div class="ttdeci">string< A > to_string(bool print_levels=false, bool print_items=false) const</div><div class="ttdoc">Prints a summary of the sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:904</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::kll_sketch::get_k</a></div><div class="ttdeci">uint16_t get_k() const</div><div class="ttdoc">Returns configured parameter k.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:239</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::kll_sketch::is_empty</a></div><div class="ttdeci">bool is_empty() const</div><div class="ttdoc">Returns true if this sketch is empty.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:234</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::kll_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &item, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the normalized rank of the given item from 0 to 1, inclusive.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:281</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::kll_sketch::get_allocator</a></div><div class="ttdeci">A get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:276</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa3f3769ba3fae6fa0e8a0bd65fef5422"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">datasketches::kll_sketch::get_min_item</a></div><div class="ttdeci">T get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:259</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa796209b1ef5dc41e83ed8158f77d280"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa796209b1ef5dc41e83ed8158f77d280">datasketches::kll_sketch::quantile_return_type</a></div><div class="ttdeci">typename quantiles_sorted_view< T, C, A >::quantile_return_type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttdef"><b>Definition:</b> kll_sketch.hpp:178</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::kll_sketch::get_quantile</a></div><div class="ttdeci">quantile_return_type get_quantile(double rank, bool inclusive=true) const</div><div class="ttdoc">Returns an item from the sketch that is the best approximation to an item from the original stream wi...</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:302</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::kll_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:320</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_adb2232570b4977756cddd02b4b6b845b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">datasketches::kll_sketch::get_max_serialized_size_bytes</a></div><div class="ttdeci">static size_t get_max_serialized_size_bytes(uint16_t k, uint64_t n)</div><div class="ttdoc">Returns upper bound on the serialized size of a sketch given a parameter k and stream length.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:348</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae08ba9502b0403ad4448d649ce29b850"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">datasketches::kll_sketch::get_normalized_rank_error</a></div><div class="ttdeci">double get_normalized_rank_error(bool pmf) const</div><div class="ttdoc">Gets the approximate rank error of this sketch normalized as a fraction between zero and one.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:313</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::kll_sketch::is_estimation_mode</a></div><div class="ttdeci">bool is_estimation_mode() const</div><div class="ttdoc">Returns true if this sketch is in estimation mode.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:254</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::kll_sketch::get_n</a></div><div class="ttdeci">uint64_t get_n() const</div><div class="ttdoc">Returns the length of the input stream.</div><div class="ttdef"><b>Definition:</b> kll_sketch_impl.hpp:244</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sorted__view_html"><div class="ttname"><a href="classdatasketches_1_1quantiles__sorted__view.html">datasketches::quantiles_sorted_view< T, C, A ></a></div></div> |
| <div class="ttc" id="anamespacedatasketches_1_1kll__constants_html_a3bd28528c16e8911658faff9c98b305f"><div class="ttname"><a href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">datasketches::kll_constants::MAX_K</a></div><div class="ttdeci">const uint16_t MAX_K</div><div class="ttdoc">max value of parameter K</div><div class="ttdef"><b>Definition:</b> kll_sketch.hpp:41</div></div> |
| <div class="ttc" id="anamespacedatasketches_1_1kll__constants_html_ab9f2b631adf46fe04a11814cd1018926"><div class="ttname"><a href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">datasketches::kll_constants::MIN_K</a></div><div class="ttdeci">const uint16_t MIN_K</div><div class="ttdoc">min value of parameter K</div><div class="ttdef"><b>Definition:</b> kll_sketch.hpp:39</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> |
