| <!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: quantiles/include/quantiles_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_cd6dde39990e390e8133ccee011656ea.html">quantiles</a></li><li class="navelem"><a class="el" href="dir_0c72de7c01a0490d64173f294d65fe37.html">include</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">quantiles_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 _QUANTILES_SKETCH_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#define _QUANTILES_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 <cmath></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <stdexcept></span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <iomanip></span></div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <sstream></span></div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "count_zeros.hpp"</span></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "conditional_forward.hpp"</span></div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">namespace </span><a class="code" href="namespacedatasketches.html">datasketches</a> {</div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  </div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="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="l00035"></a><span class="lineno"> 35</span> quantiles_sketch<T, C, A>::quantiles_sketch(uint16_t k, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> is_base_buffer_sorted_(true),</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> n_(0),</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> bit_pattern_(0),</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> base_buffer_(allocator_),</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> levels_(allocator_),</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span> min_item_(),</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span> max_item_(),</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> sorted_view_(nullptr)</div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> {</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  check_k(k_);</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  base_buffer_.reserve(2 * std::min(quantiles_constants::MIN_K, k));</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span> }</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="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="l00053"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a391bae83eaddd8b3b0828da495c23164"> 53</a></span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::quantiles_sketch</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>& other):</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span> comparator_(other.comparator_),</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span> allocator_(other.allocator_),</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span> is_base_buffer_sorted_(other.is_base_buffer_sorted_),</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span> k_(other.k_),</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span> n_(other.n_),</div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span> bit_pattern_(other.bit_pattern_),</div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span> base_buffer_(other.base_buffer_),</div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span> levels_(other.levels_),</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span> min_item_(other.min_item_),</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span> max_item_(other.max_item_),</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span> sorted_view_(nullptr)</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> {</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < levels_.size(); ++i) { </div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (levels_[i].capacity() != other.levels_[i].capacity()) {</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  levels_[i].reserve(other.levels_[i].capacity());</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span> }</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a29ce336cb446c2bbdc2f2c1e1a01f171"> 74</a></span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::quantiles_sketch</a>(<a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>&& other) noexcept:</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span> comparator_(other.comparator_),</div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span> allocator_(other.allocator_),</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span> is_base_buffer_sorted_(other.is_base_buffer_sorted_),</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span> k_(other.k_),</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span> n_(other.n_),</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span> bit_pattern_(other.bit_pattern_),</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span> base_buffer_(std::move(other.base_buffer_)),</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span> levels_(std::move(other.levels_)),</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span> min_item_(std::move(other.min_item_)),</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span> max_item_(std::move(other.max_item_)),</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span> sorted_view_(<span class="keyword">nullptr</span>)</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span> {}</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <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="l00089"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b"> 89</a></span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A></a>& <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">quantiles_sketch<T, C, A>::operator=</a>(<span class="keyword">const</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>& other) {</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A></a> copy(other);</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  std::swap(comparator_, copy.comparator_);</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  std::swap(allocator_, copy.allocator_);</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  std::swap(is_base_buffer_sorted_, copy.is_base_buffer_sorted_);</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  std::swap(k_, copy.k_);</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  std::swap(n_, copy.n_);</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::swap(bit_pattern_, copy.bit_pattern_);</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  std::swap(base_buffer_, copy.base_buffer_);</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  std::swap(levels_, copy.levels_);</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  std::swap(min_item_, copy.min_item_);</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  std::swap(max_item_, copy.max_item_);</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  reset_sorted_view();</div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span> }</div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <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="l00106"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae5f3c26a534b7396dd4444e2b2c5c7ec"> 106</a></span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A></a>& <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">quantiles_sketch<T, C, A>::operator=</a>(<a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>&& other) noexcept {</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  std::swap(comparator_, other.comparator_);</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  std::swap(allocator_, other.allocator_);</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::swap(is_base_buffer_sorted_, other.is_base_buffer_sorted_);</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::swap(k_, other.k_);</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::swap(n_, other.n_);</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::swap(bit_pattern_, other.bit_pattern_);</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::swap(base_buffer_, other.base_buffer_);</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  std::swap(levels_, other.levels_);</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::swap(min_item_, other.min_item_);</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::swap(max_item_, other.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"> 122</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::quantiles_sketch</a>(uint16_t k, uint64_t n, uint64_t bit_pattern,</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  Level&& base_buffer, VectorLevels&& levels,</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  optional<T>&& min_item, optional<T>&& max_item,</div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">bool</span> is_sorted, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span> is_base_buffer_sorted_(is_sorted),</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span> k_(k),</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span> n_(n),</div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span> bit_pattern_(bit_pattern),</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span> base_buffer_(std::move(base_buffer)),</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span> levels_(std::move(levels)),</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span> min_item_(std::move(min_item)),</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span> max_item_(std::move(max_item)),</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span> sorted_view_(nullptr)</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span> {</div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  uint32_t item_count = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(base_buffer_.size());</div> |
| <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">for</span> (Level& lvl : levels_) {</div> |
| <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  item_count += <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(lvl.size());</div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (item_count != compute_retained_items(k_, n_))</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Item count does not match value computed from k, n"</span>);</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span> }</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="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="l00147"></a><span class="lineno"> 147</span> <span class="keyword">template</span><<span class="keyword">typename</span> From, <span class="keyword">typename</span> FC, <span class="keyword">typename</span> FA></div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span> quantiles_sketch<T, C, A>::quantiles_sketch(<span class="keyword">const</span> quantiles_sketch<From, FC, FA>& other,</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span> is_base_buffer_sorted_(false),</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span> k_(other.get_k()),</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span> n_(other.get_n()),</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span> bit_pattern_(compute_bit_pattern(other.get_k(), other.get_n())),</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span> base_buffer_(allocator),</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span> levels_(allocator),</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span> min_item_(other.min_item_),</div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span> max_item_(other.max_item_),</div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span> sorted_view_(nullptr)</div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span> {</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  static_assert(std::is_constructible<T, From>::value,</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="stringliteral">"Type converting constructor requires new type to be constructible from existing type"</span>);</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  base_buffer_.reserve(2 * std::min(<a class="code" href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">quantiles_constants::MIN_K</a>, k_));</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  </div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (!other.is_empty()) {</div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// reserve space in levels</span></div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">const</span> uint8_t num_levels = compute_levels_needed(k_, n_);</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  levels_.reserve(num_levels);</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_levels; ++i) {</div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  Level level(allocator);</div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  level.reserve(k_);</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  levels_.push_back(std::move(level));</div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</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>  <span class="comment">// iterate through points, assigning to the correct level as needed</span></div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> pair : other) {</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">const</span> uint64_t wt = pair.second;</div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (wt == 1) {</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  base_buffer_.push_back(T(pair.first));</div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// resize where needed as if adding points via update()</span></div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">if</span> (base_buffer_.size() + 1 > base_buffer_.capacity()) {</div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_size = std::max(std::min(<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(2 * k_), 2 * base_buffer_.size()), <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(1));</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  base_buffer_.reserve(new_size);</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="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">const</span> uint8_t idx = count_trailing_zeros_in_u64(pair.second) - 1;</div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  levels_[idx].push_back(T(pair.first));</div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  </div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// validate that ordering within each level is preserved</span></div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// base_buffer_ can be considered unsorted for this purpose</span></div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_levels; ++i) {</div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">if</span> (!std::is_sorted(levels_[i].<a class="code" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">begin</a>(), levels_[i].<a class="code" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">end</a>(), comparator_)) {</div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Copy construction across types produces invalid sorting"</span>);</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span> }</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  </div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span> quantiles_sketch<T, C, A>::~quantiles_sketch() {</div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  reset_sorted_view();</div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span> }</div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  </div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</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="l00211"></a><span class="lineno"> 211</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdT></div> |
| <div class="line"><a name="l00212"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c"> 212</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">quantiles_sketch<T, C, A>::update</a>(FwdT&& item) {</div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</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(item);</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  max_item_.emplace(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_(item, *min_item_)) *min_item_ = item;</div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = 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>  </div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// if exceed capacity, grow until size 2k -- assumes eager processing</span></div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (base_buffer_.size() + 1 > base_buffer_.capacity()) grow_base_buffer();</div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  base_buffer_.push_back(std::forward<FwdT>(item));</div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  ++n_;</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (base_buffer_.size() > 1) is_base_buffer_sorted_ = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">if</span> (base_buffer_.size() == 2 * k_) process_full_base_buffer();</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"> 234</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdSk></div> |
| <div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec"> 235</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">quantiles_sketch<T, C, A>::merge</a>(FwdSk&& other) {</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (other.is_empty()) {</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span>; <span class="comment">// nothing to do</span></div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!other.is_estimation_mode()) {</div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// other is exact, stream in regardless of k</span></div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> item : other.base_buffer_) {</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  update(conditional_forward<FwdSk>(item));</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>  reset_sorted_view();</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  }</div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  </div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// other has data and is in estimation mode</span></div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (k_ == other.get_k()) {</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  standard_merge(*<span class="keyword">this</span>, std::forward<FwdSk>(other));</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k_ > other.get_k()) {</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a> sk_copy(std::forward<FwdSk>(other));</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  downsampling_merge(sk_copy, std::move(*<span class="keyword">this</span>));</div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  *<span class="keyword">this</span> = std::move(sk_copy);</div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  } <span class="keywordflow">else</span> { <span class="comment">// k_ < other.get_k()</span></div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  downsampling_merge(*<span class="keyword">this</span>, std::forward<FwdSk>(other));</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="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">// exact or empty</span></div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a> sk_copy(std::forward<FwdSk>(other));</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">if</span> (k_ <= other.get_k()) {</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (!is_empty()) {</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i < base_buffer_.size(); ++i) {</div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  sk_copy.<a class="code" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">update</a>(std::move(base_buffer_[i]));</div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  } <span class="keywordflow">else</span> { <span class="comment">// k_ > other.get_k()</span></div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  downsampling_merge(sk_copy, std::move(*<span class="keyword">this</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">this</span> = std::move(sk_copy);</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  reset_sorted_view();</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"> 276</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056"> 277</a></span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">quantiles_sketch<T, C, A>::serialize</a>(std::ostream& os, <span class="keyword">const</span> SerDe& <a class="code" href="structdatasketches_1_1serde.html">serde</a>)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">const</span> uint8_t preamble_longs = is_empty() ? PREAMBLE_LONGS_SHORT : PREAMBLE_LONGS_FULL;</div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  write(os, preamble_longs);</div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">const</span> uint8_t ser_ver = SERIAL_VERSION;</div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  write(os, ser_ver);</div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  write(os, family);</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  </div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// side-effect: sort base buffer since always compact</span></div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  std::sort(<span class="keyword">const_cast<</span>Level&<span class="keyword">></span>(base_buffer_).begin(), <span class="keyword">const_cast<</span>Level&<span class="keyword">></span>(base_buffer_).end(), comparator_);</div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">const_cast<</span><a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">></span>(<span class="keyword">this</span>)->is_base_buffer_sorted_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// empty, ordered, compact are valid flags</span></div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> uint8_t flags_byte(</div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  (is_empty() ? 1 << flags::IS_EMPTY : 0)</div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  | (1 << flags::IS_SORTED) <span class="comment">// always sorted as side effect noted above</span></div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  | (1 << flags::IS_COMPACT) <span class="comment">// always compact -- could be optional for numeric types?</span></div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  );</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  write(os, flags_byte);</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  write(os, k_);</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keyword">const</span> uint16_t unused = 0;</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  write(os, unused);</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>  <span class="keywordflow">if</span> (!is_empty()) {</div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  write(os, n_);</div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// min and max</span></div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, &*min_item_, 1);</div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, &*max_item_, 1);</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">// base buffer items</span></div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, base_buffer_.data(), <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span><span class="keyword">></span>(base_buffer_.size()));</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  </div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// levels, only when data is present</span></div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">for</span> (Level lvl : levels_) {</div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span> (lvl.size() > 0)</div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, lvl.data(), <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span><span class="keyword">></span>(lvl.size()));</div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span> }</div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</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> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">quantiles_sketch<T, C, A>::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe& <a class="code" href="structdatasketches_1_1serde.html">serde</a>) <span class="keyword">const</span> -> vector_bytes {</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = get_serialized_size_bytes(<a class="code" href="structdatasketches_1_1serde.html">serde</a>) + header_size_bytes;</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  vector_bytes bytes(size, 0, allocator_);</div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> uint8_t preamble_longs = is_empty() ? PREAMBLE_LONGS_SHORT : PREAMBLE_LONGS_FULL;</div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  ptr += copy_to_mem(preamble_longs, ptr);</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">const</span> uint8_t ser_ver = SERIAL_VERSION;</div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  ptr += copy_to_mem(ser_ver, ptr);</div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  ptr += copy_to_mem(family, ptr);</div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// side-effect: sort base buffer since always compact</span></div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  std::sort(<span class="keyword">const_cast<</span>Level&<span class="keyword">></span>(base_buffer_).begin(), <span class="keyword">const_cast<</span>Level&<span class="keyword">></span>(base_buffer_).end(), comparator_);</div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">const_cast<</span><a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">></span>(<span class="keyword">this</span>)->is_base_buffer_sorted_ = <span class="keyword">true</span>;</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">// empty, ordered, compact are valid flags</span></div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">const</span> uint8_t flags_byte(</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  (is_empty() ? 1 << flags::IS_EMPTY : 0)</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  | (1 << flags::IS_SORTED) <span class="comment">// always sorted as side effect noted above</span></div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  | (1 << flags::IS_COMPACT) <span class="comment">// always compact</span></div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  );</div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  ptr += copy_to_mem(flags_byte, ptr);</div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  ptr += copy_to_mem(k_, ptr);</div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  ptr += <span class="keyword">sizeof</span>(uint16_t); <span class="comment">// 2 unused bytes</span></div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span> (!is_empty()) {</div> |
| <div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  </div> |
| <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  ptr += copy_to_mem(n_, ptr);</div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div> |
| <div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// min and max</span></div> |
| <div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  ptr += <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, &*min_item_, 1);</div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  ptr += <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, &*max_item_, 1);</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">// base buffer items</span></div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">if</span> (base_buffer_.size() > 0)</div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  ptr += <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, base_buffer_.data(), <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span><span class="keyword">></span>(base_buffer_.size()));</div> |
| <div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  </div> |
| <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// levels, only when data is present</span></div> |
| <div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">for</span> (Level lvl : levels_) {</div> |
| <div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> (lvl.size() > 0)</div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  ptr += <a class="code" href="structdatasketches_1_1serde.html">serde</a>.<a class="code" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, lvl.data(), <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span><span class="keyword">></span>(lvl.size()));</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>  </div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">return</span> bytes;</div> |
| <div class="line"><a name="l00367"></a><span class="lineno"> 367</span> }</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</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="l00370"></a><span class="lineno"> 370</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">quantiles_sketch<T, C, A>::deserialize</a>(std::istream &is, <span class="keyword">const</span> SerDe& serde,</div> |
| <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A &allocator) -> quantiles_sketch {</div> |
| <div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_longs = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read<uint8_t>(is);</div> |
| <div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read<uint16_t>(is);</div> |
| <div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  read<uint16_t>(is); <span class="comment">// unused</span></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>  check_k(k);</div> |
| <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  check_serial_version(serial_version); <span class="comment">// a little redundant with the header check</span></div> |
| <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  check_family_id(family_id);</div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  check_header_validity(preamble_longs, flags_byte, serial_version);</div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  </div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</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="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = (flags_byte & (1 << flags::IS_EMPTY)) > 0;</div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (is_empty) {</div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">return</span> quantiles_sketch(k, comparator, allocator);</div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div> |
| <div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  </div> |
| <div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keyword">const</span> <span class="keyword">auto</span> items_seen = read<uint64_t>(is);</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  </div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_compact = (serial_version == 2) | ((flags_byte & (1 << flags::IS_COMPACT)) > 0);</div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_sorted = (flags_byte & (1 << flags::IS_SORTED)) > 0;</div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  </div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  optional<T> tmp; <span class="comment">// space to deserialize min and max</span></div> |
| <div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  optional<T> min_item;</div> |
| <div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  optional<T> max_item;</div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  </div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  serde.deserialize(is, &*tmp, 1);</div> |
| <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  min_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  serde.deserialize(is, &*tmp, 1);</div> |
| <div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  max_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  </div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (serial_version == 1) {</div> |
| <div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  read<uint64_t>(is); <span class="comment">// no longer used</span></div> |
| <div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div> |
| <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  </div> |
| <div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="comment">// allocate buffers as needed</span></div> |
| <div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(k, items_seen);</div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">const</span> uint64_t bit_pattern = compute_bit_pattern(k, items_seen);</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>  <span class="comment">// Java provides a compact storage layout for a sketch of primitive doubles. The C++ version</span></div> |
| <div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="comment">// does not currently operate sketches in compact mode, but will only serialize as compact</span></div> |
| <div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// to avoid complications around serialization of empty values for generic type T. We also need</span></div> |
| <div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// to be able to ingest either serialized format from Java.</span></div> |
| <div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  </div> |
| <div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="comment">// load base buffer</span></div> |
| <div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">const</span> uint32_t bb_items = compute_base_buffer_items(k, items_seen);</div> |
| <div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  uint32_t items_to_read = (levels_needed == 0 || is_compact) ? bb_items : 2 * k;</div> |
| <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  Level base_buffer = deserialize_array(is, bb_items, 2 * k, serde, allocator);</div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">if</span> (items_to_read > bb_items) { <span class="comment">// either equal or greater, never read fewer items</span></div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="comment">// read remaining items, but don't store them</span></div> |
| <div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  deserialize_array(is, items_to_read - bb_items, items_to_read - bb_items, serde, allocator);</div> |
| <div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</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="comment">// populate vector of Levels directly</span></div> |
| <div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  VectorLevels levels(allocator);</div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  levels.reserve(levels_needed);</div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordflow">if</span> (levels_needed > 0) {</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  uint64_t working_pattern = bit_pattern;</div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < levels_needed; ++i, working_pattern >>= 1) {</div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">if</span> ((working_pattern & 0x01) == 1) {</div> |
| <div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  Level level = deserialize_array(is, k, k, serde, allocator);</div> |
| <div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  levels.push_back(std::move(level));</div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  Level level(allocator);</div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  level.reserve(k);</div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  levels.push_back(std::move(level));</div> |
| <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  }</div> |
| <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  </div> |
| <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">return</span> quantiles_sketch(k, items_seen, bit_pattern,</div> |
| <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  std::move(base_buffer), std::move(levels), std::move(min_item), std::move(max_item), is_sorted,</div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  comparator, allocator);</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>  </div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</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="l00454"></a><span class="lineno"> 454</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="keyword">auto</span> quantiles_sketch<T, C, A>::deserialize_array(std::istream& is, uint32_t num_items, uint32_t capacity, <span class="keyword">const</span> SerDe& serde, <span class="keyword">const</span> A& allocator) -> Level {</div> |
| <div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  A alloc(allocator);</div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  std::unique_ptr<T, items_deleter> items(alloc.allocate(num_items), items_deleter(allocator, <span class="keyword">false</span>, num_items));</div> |
| <div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  serde.deserialize(is, items.get(), num_items);</div> |
| <div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// serde did not throw, enable destructors</span></div> |
| <div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</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="l00462"></a><span class="lineno"> 462</span>  </div> |
| <div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// successfully read, now put into a Level</span></div> |
| <div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  Level level(allocator);</div> |
| <div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  level.reserve(capacity);</div> |
| <div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  level.insert(level.begin(),</div> |
| <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  std::make_move_iterator(items.get()),</div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  std::make_move_iterator(items.get() + num_items));</div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">return</span> level;</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span> }</div> |
| <div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  </div> |
| <div class="line"><a name="l00472"></a><span class="lineno"> 472</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="l00473"></a><span class="lineno"> 473</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">quantiles_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& serde,</div> |
| <div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A &allocator) -> quantiles_sketch {</div> |
| <div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  ensure_minimum_memory(size, 8);</div> |
| <div class="line"><a name="l00477"></a><span class="lineno"> 477</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="l00478"></a><span class="lineno"> 478</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="l00479"></a><span class="lineno"> 479</span>  </div> |
| <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  uint8_t preamble_longs;</div> |
| <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  ptr += copy_from_mem(ptr, preamble_longs);</div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  uint8_t serial_version;</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  ptr += copy_from_mem(ptr, serial_version);</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  uint8_t family_id;</div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  ptr += copy_from_mem(ptr, family_id);</div> |
| <div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  uint8_t flags_byte;</div> |
| <div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  ptr += copy_from_mem(ptr, flags_byte);</div> |
| <div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  uint16_t k;</div> |
| <div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  ptr += copy_from_mem(ptr, k);</div> |
| <div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  uint16_t unused;</div> |
| <div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  ptr += copy_from_mem(ptr, unused);</div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  </div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  check_k(k);</div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  check_serial_version(serial_version); <span class="comment">// a little redundant with the header check</span></div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  check_family_id(family_id);</div> |
| <div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  check_header_validity(preamble_longs, flags_byte, serial_version);</div> |
| <div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  </div> |
| <div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = (flags_byte & (1 << flags::IS_EMPTY)) > 0;</div> |
| <div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (is_empty) {</div> |
| <div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">return</span> quantiles_sketch(k, comparator, allocator);</div> |
| <div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div> |
| <div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  </div> |
| <div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  ensure_minimum_memory(size, 16);</div> |
| <div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  uint64_t items_seen;</div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  ptr += copy_from_mem(ptr, items_seen);</div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  </div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_compact = (serial_version == 2) | ((flags_byte & (1 << flags::IS_COMPACT)) > 0);</div> |
| <div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_sorted = (flags_byte & (1 << flags::IS_SORTED)) > 0;</div> |
| <div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  </div> |
| <div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  optional<T> tmp; <span class="comment">// space to deserialize min and max</span></div> |
| <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  optional<T> min_item;</div> |
| <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  optional<T> max_item;</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>  ptr += serde.deserialize(ptr, end_ptr - ptr, &*tmp, 1);</div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  min_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, &*tmp, 1);</div> |
| <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div> |
| <div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  max_item.emplace(*tmp);</div> |
| <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  (*tmp).~T();</div> |
| <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  </div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (serial_version == 1) {</div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  uint64_t unused_long;</div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  ptr += copy_from_mem(ptr, unused_long); <span class="comment">// no longer used</span></div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  </div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// allocate buffers as needed</span></div> |
| <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(k, items_seen);</div> |
| <div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> uint64_t bit_pattern = compute_bit_pattern(k, items_seen);</div> |
| <div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  </div> |
| <div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="comment">// Java provides a compact storage layout for a sketch of primitive doubles. The C++ version</span></div> |
| <div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// does not currently operate sketches in compact mode, but will only serialize as compact</span></div> |
| <div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// to avoid complications around serialization of empty values for generic type T. We also need</span></div> |
| <div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// to be able to ingest either serialized format from Java.</span></div> |
| <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  </div> |
| <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// load base buffer</span></div> |
| <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keyword">const</span> uint32_t bb_items = compute_base_buffer_items(k, items_seen);</div> |
| <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  uint32_t items_to_read = (levels_needed == 0 || is_compact) ? bb_items : 2 * k;</div> |
| <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">auto</span> base_buffer_pair = deserialize_array(ptr, end_ptr - ptr, bb_items, 2 * k, serde, allocator);</div> |
| <div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  ptr += base_buffer_pair.second;</div> |
| <div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">if</span> (items_to_read > bb_items) { <span class="comment">// either equal or greater, never read fewer items</span></div> |
| <div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// read remaining items, only use to advance the pointer</span></div> |
| <div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">auto</span> extras = deserialize_array(ptr, end_ptr - ptr, items_to_read - bb_items, items_to_read - bb_items, serde, allocator);</div> |
| <div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  ptr += extras.second;</div> |
| <div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  }</div> |
| <div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  </div> |
| <div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// populate vector of Levels directly</span></div> |
| <div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  VectorLevels levels(allocator);</div> |
| <div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  levels.reserve(levels_needed);</div> |
| <div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">if</span> (levels_needed > 0) {</div> |
| <div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  uint64_t working_pattern = bit_pattern;</div> |
| <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < levels_needed; ++i, working_pattern >>= 1) {</div> |
| <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  </div> |
| <div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">if</span> ((working_pattern & 0x01) == 1) {</div> |
| <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">auto</span> pair = deserialize_array(ptr, end_ptr - ptr, k, k, serde, allocator);</div> |
| <div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  ptr += pair.second;</div> |
| <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  levels.push_back(std::move(pair.first));</div> |
| <div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  Level level(allocator);</div> |
| <div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  level.reserve(k);</div> |
| <div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  levels.push_back(std::move(level));</div> |
| <div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div> |
| <div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div> |
| <div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</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>  <span class="keywordflow">return</span> quantiles_sketch(k, items_seen, bit_pattern,</div> |
| <div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  std::move(base_buffer_pair.first), std::move(levels), std::move(min_item), std::move(max_item), is_sorted,</div> |
| <div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  comparator, allocator);</div> |
| <div class="line"><a name="l00570"></a><span class="lineno"> 570</span> }</div> |
| <div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  </div> |
| <div class="line"><a name="l00572"></a><span class="lineno"> 572</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="l00573"></a><span class="lineno"> 573</span> <span class="keyword">template</span><<span class="keyword">typename</span> SerDe></div> |
| <div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="keyword">auto</span> quantiles_sketch<T, C, A>::deserialize_array(<span class="keyword">const</span> <span class="keywordtype">void</span>* bytes, <span class="keywordtype">size_t</span> size, uint32_t num_items, uint32_t capacity, <span class="keyword">const</span> SerDe& serde, <span class="keyword">const</span> A& allocator)</div> |
| <div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  -> std::pair<Level, size_t> {</div> |
| <div class="line"><a name="l00576"></a><span class="lineno"> 576</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="l00577"></a><span class="lineno"> 577</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="l00578"></a><span class="lineno"> 578</span>  A alloc(allocator);</div> |
| <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  std::unique_ptr<T, items_deleter> items(alloc.allocate(num_items), items_deleter(allocator, <span class="keyword">false</span>, num_items));</div> |
| <div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, items.get(), num_items);</div> |
| <div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// serde did not throw, enable destructors</span></div> |
| <div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  </div> |
| <div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="comment">// succesfully read, now put into a Level</span></div> |
| <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  Level level(allocator);</div> |
| <div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  level.reserve(capacity);</div> |
| <div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  level.insert(level.begin(),</div> |
| <div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  std::make_move_iterator(items.get()),</div> |
| <div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  std::make_move_iterator(items.get() + num_items));</div> |
| <div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  </div> |
| <div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">return</span> std::pair<Level, size_t>(std::move(level), 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="l00592"></a><span class="lineno"> 592</span> }</div> |
| <div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  </div> |
| <div class="line"><a name="l00594"></a><span class="lineno"> 594</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="l00595"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda"> 595</a></span> string<A> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda">quantiles_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="l00596"></a><span class="lineno"> 596</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div> |
| <div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div> |
| <div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  std::ostringstream os;</div> |
| <div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  os << <span class="stringliteral">"### Quantiles Sketch summary:"</span> << std::endl;</div> |
| <div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  os << <span class="stringliteral">" K : "</span> << k_ << std::endl;</div> |
| <div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  os << <span class="stringliteral">" N : "</span> << n_ << std::endl;</div> |
| <div class="line"><a name="l00602"></a><span class="lineno"> 602</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="l00603"></a><span class="lineno"> 603</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="l00604"></a><span class="lineno"> 604</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="l00605"></a><span class="lineno"> 605</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="l00606"></a><span class="lineno"> 606</span>  os << <span class="stringliteral">" Levels (w/o BB): "</span> << levels_.size() << std::endl;</div> |
| <div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  os << <span class="stringliteral">" Used Levels : "</span> << count_valid_levels(bit_pattern_) << std::endl;</div> |
| <div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  os << <span class="stringliteral">" Retained items : "</span> << get_num_retained() << std::endl;</div> |
| <div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordflow">if</span> (!is_empty()) {</div> |
| <div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  os << <span class="stringliteral">" Min item : "</span> << *min_item_ << std::endl;</div> |
| <div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  os << <span class="stringliteral">" Max item : "</span> << *max_item_ << std::endl;</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>  os << <span class="stringliteral">"### End sketch summary"</span> << std::endl;</div> |
| <div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  </div> |
| <div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">if</span> (print_levels) {</div> |
| <div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  os << <span class="stringliteral">"### Quantiles Sketch levels:"</span> << std::endl;</div> |
| <div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  os << <span class="stringliteral">" index: items in use"</span> << std::endl;</div> |
| <div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  os << <span class="stringliteral">" BB: "</span> << base_buffer_.size() << std::endl;</div> |
| <div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">for</span> (uint8_t i = 0; i < levels_.size(); i++) {</div> |
| <div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  os << <span class="stringliteral">" "</span> << <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">></span>(i) << <span class="stringliteral">": "</span> << levels_[i].size() << std::endl;</div> |
| <div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  }</div> |
| <div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  os << <span class="stringliteral">"### End sketch levels"</span> << std::endl;</div> |
| <div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div> |
| <div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  </div> |
| <div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">if</span> (print_items) {</div> |
| <div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  os << <span class="stringliteral">"### Quantiles Sketch data:"</span> << std::endl;</div> |
| <div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  uint8_t level = 0;</div> |
| <div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  os << <span class="stringliteral">" BB:"</span> << std::endl;</div> |
| <div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> T& item : base_buffer_) {</div> |
| <div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  os << <span class="stringliteral">" "</span> << item << std::endl;</div> |
| <div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div> |
| <div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">for</span> (uint8_t i = 0; i < levels_.size(); ++i) {</div> |
| <div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  os << <span class="stringliteral">" level "</span> << <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">></span>(level) << <span class="stringliteral">":"</span> << std::endl;</div> |
| <div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> T& item : levels_[i]) {</div> |
| <div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  os << <span class="stringliteral">" "</span> << item << std::endl;</div> |
| <div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  }</div> |
| <div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  }</div> |
| <div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  os << <span class="stringliteral">"### End sketch data"</span> << std::endl;</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="keywordflow">return</span> string<A>(os.str().c_str(), allocator_);</div> |
| <div class="line"><a name="l00641"></a><span class="lineno"> 641</span> }</div> |
| <div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  </div> |
| <div class="line"><a name="l00643"></a><span class="lineno"> 643</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="l00644"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264"> 644</a></span> uint16_t <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">quantiles_sketch<T, C, A>::get_k</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">return</span> k_;</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>  </div> |
| <div class="line"><a name="l00648"></a><span class="lineno"> 648</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="l00649"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d"> 649</a></span> uint64_t <a class="code" href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d">quantiles_sketch<T, C, A>::get_n</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">return</span> n_;</div> |
| <div class="line"><a name="l00651"></a><span class="lineno"> 651</span> }</div> |
| <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  </div> |
| <div class="line"><a name="l00653"></a><span class="lineno"> 653</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="l00654"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a5a2b7a58dc85678d08752945ff655362"> 654</a></span> <span class="keywordtype">bool</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a5a2b7a58dc85678d08752945ff655362">quantiles_sketch<T, C, A>::is_empty</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> n_ == 0;</div> |
| <div class="line"><a name="l00656"></a><span class="lineno"> 656</span> }</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="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="l00659"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6"> 659</a></span> <span class="keywordtype">bool</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">quantiles_sketch<T, C, A>::is_estimation_mode</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">return</span> bit_pattern_ != 0;</div> |
| <div class="line"><a name="l00661"></a><span class="lineno"> 661</span> }</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="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="l00664"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14"> 664</a></span> uint32_t <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14">quantiles_sketch<T, C, A>::get_num_retained</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">return</span> compute_retained_items(k_, n_);</div> |
| <div class="line"><a name="l00666"></a><span class="lineno"> 666</span> }</div> |
| <div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  </div> |
| <div class="line"><a name="l00668"></a><span class="lineno"> 668</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="l00669"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af2fa890815acf3a1418ea8eee466075c"> 669</a></span> <span class="keyword">const</span> T& <a class="code" href="classdatasketches_1_1quantiles__sketch.html#af2fa890815acf3a1418ea8eee466075c">quantiles_sketch<T, C, A>::get_min_item</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00670"></a><span class="lineno"> 670</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="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">return</span> *min_item_;</div> |
| <div class="line"><a name="l00672"></a><span class="lineno"> 672</span> }</div> |
| <div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  </div> |
| <div class="line"><a name="l00674"></a><span class="lineno"> 674</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="l00675"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21"> 675</a></span> <span class="keyword">const</span> T& <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">quantiles_sketch<T, C, A>::get_max_item</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00676"></a><span class="lineno"> 676</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="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">return</span> *max_item_;</div> |
| <div class="line"><a name="l00678"></a><span class="lineno"> 678</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="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="l00681"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40"> 681</a></span> C <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40">quantiles_sketch<T, C, A>::get_comparator</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">return</span> comparator_;</div> |
| <div class="line"><a name="l00683"></a><span class="lineno"> 683</span> }</div> |
| <div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  </div> |
| <div class="line"><a name="l00685"></a><span class="lineno"> 685</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="l00686"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b"> 686</a></span> A <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">quantiles_sketch<T, C, A>::get_allocator</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">return</span> allocator_;</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="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div> |
| <div class="line"><a name="l00691"></a><span class="lineno"> 691</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="l00692"></a><span class="lineno"> 692</span> template<typename SerDe, typename TT, typename std::enable_if<std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00693"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716"> 693</a></span> <span class="keywordtype">size_t</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">quantiles_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="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div> |
| <div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">return</span> DATA_START + ((get_num_retained() + 2) * <span class="keyword">sizeof</span>(TT));</div> |
| <div class="line"><a name="l00696"></a><span class="lineno"> 696</span> }</div> |
| <div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  </div> |
| <div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="comment">// implementation for all other types</span></div> |
| <div class="line"><a name="l00699"></a><span class="lineno"> 699</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="l00700"></a><span class="lineno"> 700</span> template<typename SerDe, typename TT, typename std::enable_if<!std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="keywordtype">size_t</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">quantiles_sketch<T, C, A>::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe& <a class="code" href="structdatasketches_1_1serde.html">serde</a>)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div> |
| <div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordtype">size_t</span> size = DATA_START;</div> |
| <div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  size += serde.size_of_item(*min_item_);</div> |
| <div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  size += serde.size_of_item(*max_item_);</div> |
| <div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it: *<span class="keyword">this</span>) size += serde.size_of_item(it.first);</div> |
| <div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">return</span> size;</div> |
| <div class="line"><a name="l00708"></a><span class="lineno"> 708</span> }</div> |
| <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  </div> |
| <div class="line"><a name="l00710"></a><span class="lineno"> 710</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="l00711"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9"> 711</a></span> <span class="keywordtype">double</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">quantiles_sketch<T, C, A>::get_normalized_rank_error</a>(<span class="keywordtype">bool</span> is_pmf)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">return</span> get_normalized_rank_error(k_, is_pmf);</div> |
| <div class="line"><a name="l00713"></a><span class="lineno"> 713</span> }</div> |
| <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  </div> |
| <div class="line"><a name="l00715"></a><span class="lineno"> 715</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="l00716"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae957f61cebc92305fc758dcfad797a41"> 716</a></span> <span class="keywordtype">double</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">quantiles_sketch<T, C, A>::get_normalized_rank_error</a>(uint16_t k, <span class="keywordtype">bool</span> is_pmf) {</div> |
| <div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">return</span> is_pmf</div> |
| <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  ? 1.854 / std::pow(k, 0.9657)</div> |
| <div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  : 1.576 / std::pow(k, 0.9726);</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>  </div> |
| <div class="line"><a name="l00722"></a><span class="lineno"> 722</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="l00723"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00"> 723</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_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">quantiles_sketch<T, C, A>::get_sorted_view</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// allow side-effect of sorting the base buffer</span></div> |
| <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">if</span> (!is_base_buffer_sorted_) {</div> |
| <div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  std::sort(<span class="keyword">const_cast<</span>Level&<span class="keyword">></span>(base_buffer_).begin(), <span class="keyword">const_cast<</span>Level&<span class="keyword">></span>(base_buffer_).end(), comparator_);</div> |
| <div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keyword">const_cast<</span><a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">></span>(<span class="keyword">this</span>)->is_base_buffer_sorted_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  }</div> |
| <div class="line"><a name="l00729"></a><span class="lineno"> 729</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="l00730"></a><span class="lineno"> 730</span>  </div> |
| <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  uint64_t weight = 1;</div> |
| <div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  view.add(base_buffer_.begin(), base_buffer_.end(), weight);</div> |
| <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& level: levels_) {</div> |
| <div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  weight <<= 1;</div> |
| <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">if</span> (level.empty()) { <span class="keywordflow">continue</span>; }</div> |
| <div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  view.add(level.begin(), level.end(), weight);</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>  view.convert_to_cummulative();</div> |
| <div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">return</span> view;</div> |
| <div class="line"><a name="l00741"></a><span class="lineno"> 741</span> }</div> |
| <div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  </div> |
| <div class="line"><a name="l00743"></a><span class="lineno"> 743</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="l00744"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ac02fcfb6e706148458a2ef89390223a9"> 744</a></span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#ac02fcfb6e706148458a2ef89390223a9">quantiles_sketch<T, C, A>::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</span> -> quantile_return_type {</div> |
| <div class="line"><a name="l00745"></a><span class="lineno"> 745</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="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">if</span> ((rank < 0.0) || (rank > 1.0)) {</div> |
| <div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Normalized rank cannot be less than 0 or greater than 1"</span>);</div> |
| <div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  }</div> |
| <div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// possible side-effect: sorting base buffer</span></div> |
| <div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">return</span> sorted_view_->get_quantile(rank, inclusive);</div> |
| <div class="line"><a name="l00752"></a><span class="lineno"> 752</span> }</div> |
| <div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  </div> |
| <div class="line"><a name="l00754"></a><span class="lineno"> 754</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="l00755"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918"> 755</a></span> <span class="keywordtype">double</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">quantiles_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="l00756"></a><span class="lineno"> 756</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="l00757"></a><span class="lineno"> 757</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">return</span> sorted_view_->get_rank(item, inclusive);</div> |
| <div class="line"><a name="l00759"></a><span class="lineno"> 759</span> }</div> |
| <div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  </div> |
| <div class="line"><a name="l00761"></a><span class="lineno"> 761</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="l00762"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a44226b755e73883ea2c128876e35b1d1"> 762</a></span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a44226b755e73883ea2c128876e35b1d1">quantiles_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="l00763"></a><span class="lineno"> 763</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="l00764"></a><span class="lineno"> 764</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">return</span> sorted_view_->get_PMF(split_points, size, inclusive);</div> |
| <div class="line"><a name="l00766"></a><span class="lineno"> 766</span> }</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> <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="l00769"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a20a4d992209b2aa58614c998d143705c"> 769</a></span> <span class="keyword">auto</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#a20a4d992209b2aa58614c998d143705c">quantiles_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="l00770"></a><span class="lineno"> 770</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="l00771"></a><span class="lineno"> 771</span>  setup_sorted_view();</div> |
| <div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordflow">return</span> sorted_view_->get_CDF(split_points, size, inclusive);</div> |
| <div class="line"><a name="l00773"></a><span class="lineno"> 773</span> }</div> |
| <div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  </div> |
| <div class="line"><a name="l00775"></a><span class="lineno"> 775</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="l00776"></a><span class="lineno"> 776</span> uint32_t <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::compute_retained_items</a>(uint16_t k, uint64_t n) {</div> |
| <div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">const</span> uint32_t bb_count = compute_base_buffer_items(k, n);</div> |
| <div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keyword">const</span> uint64_t bit_pattern = compute_bit_pattern(k, n);</div> |
| <div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keyword">const</span> uint32_t valid_levels = count_valid_levels(bit_pattern);</div> |
| <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">return</span> bb_count + (k * valid_levels);</div> |
| <div class="line"><a name="l00781"></a><span class="lineno"> 781</span> }</div> |
| <div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  </div> |
| <div class="line"><a name="l00783"></a><span class="lineno"> 783</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="l00784"></a><span class="lineno"> 784</span> uint32_t quantiles_sketch<T, C, A>::compute_base_buffer_items(uint16_t k, uint64_t n) {</div> |
| <div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">return</span> n % (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(2) * k);</div> |
| <div class="line"><a name="l00786"></a><span class="lineno"> 786</span> }</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">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="l00789"></a><span class="lineno"> 789</span> uint64_t quantiles_sketch<T, C, A>::compute_bit_pattern(uint16_t k, uint64_t n) {</div> |
| <div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">return</span> n / (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(2) * k);</div> |
| <div class="line"><a name="l00791"></a><span class="lineno"> 791</span> }</div> |
| <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  </div> |
| <div class="line"><a name="l00793"></a><span class="lineno"> 793</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="l00794"></a><span class="lineno"> 794</span> uint32_t quantiles_sketch<T, C, A>::count_valid_levels(uint64_t bit_pattern) {</div> |
| <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  uint32_t count = 0;</div> |
| <div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">for</span> (; bit_pattern > 0; ++count) bit_pattern &= bit_pattern - 1;</div> |
| <div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">return</span> count;</div> |
| <div class="line"><a name="l00798"></a><span class="lineno"> 798</span> }</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">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="l00801"></a><span class="lineno"> 801</span> uint8_t quantiles_sketch<T, C, A>::compute_levels_needed(uint16_t k, uint64_t n) {</div> |
| <div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>uint8_t<span class="keyword">></span>(64U) - count_leading_zeros_in_u64(n / (2 * k));</div> |
| <div class="line"><a name="l00803"></a><span class="lineno"> 803</span> }</div> |
| <div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  </div> |
| <div class="line"><a name="l00805"></a><span class="lineno"> 805</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="l00806"></a><span class="lineno"> 806</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::check_k(uint16_t k) {</div> |
| <div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">if</span> (k < quantiles_constants::MIN_K || k > <a class="code" href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">quantiles_constants::MAX_K</a> || (k & (k - 1)) != 0) {</div> |
| <div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"k must be a power of 2 that is >= "</span></div> |
| <div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  + std::to_string(<a class="code" href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">quantiles_constants::MIN_K</a>) + <span class="stringliteral">" and <= "</span></div> |
| <div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  + std::to_string(<a class="code" href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">quantiles_constants::MAX_K</a>) + <span class="stringliteral">". Found: "</span> + std::to_string(k));</div> |
| <div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</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="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="l00815"></a><span class="lineno"> 815</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::check_serial_version(uint8_t serial_version) {</div> |
| <div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keywordflow">if</span> (serial_version == SERIAL_VERSION || serial_version == SERIAL_VERSION_1 || serial_version == SERIAL_VERSION_2)</div> |
| <div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption. Unrecognized serialization version: "</span> + std::to_string(serial_version));</div> |
| <div class="line"><a name="l00820"></a><span class="lineno"> 820</span> }</div> |
| <div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  </div> |
| <div class="line"><a name="l00822"></a><span class="lineno"> 822</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="l00823"></a><span class="lineno"> 823</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::check_family_id(uint8_t family_id) {</div> |
| <div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordflow">if</span> (family_id == FAMILY)</div> |
| <div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"Possible corruption. Family id does not indicate quantiles sketch: "</span> + std::to_string(family_id));</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>  </div> |
| <div class="line"><a name="l00830"></a><span class="lineno"> 830</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="l00831"></a><span class="lineno"> 831</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::check_header_validity(uint8_t preamble_longs, uint8_t flags_byte, uint8_t serial_version) {</div> |
| <div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> empty = (flags_byte & (1 << flags::IS_EMPTY)) > 0;</div> |
| <div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> compact = (flags_byte & (1 << flags::IS_COMPACT)) > 0;</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="keyword">const</span> uint8_t sw = (compact ? 1 : 0) + (2 * (empty ? 1 : 0))</div> |
| <div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  + (4 * (serial_version & 0xF)) + (32 * (preamble_longs & 0x3F));</div> |
| <div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordtype">bool</span> valid = <span class="keyword">true</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>  <span class="keywordflow">switch</span> (sw) { <span class="comment">// exhaustive list and description of all valid cases</span></div> |
| <div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">case</span> 38 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordflow">case</span> 164 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">case</span> 42 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">case</span> 72 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">case</span> 47 : <span class="keywordflow">break</span>; <span class="comment">// compact, empty, serVer = 3, preLongs = 1;</span></div> |
| <div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">case</span> 46 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">case</span> 79 : <span class="keywordflow">break</span>; <span class="comment">// compact, empty, serVer = 3, preLongs = 2;</span></div> |
| <div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keywordflow">case</span> 78 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keywordflow">case</span> 77 : <span class="keywordflow">break</span>; <span class="comment">// compact, !empty, serVer = 3, preLongs = 2;</span></div> |
| <div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">case</span> 76 : <span class="keywordflow">break</span>; </div> |
| <div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  default : <span class="comment">//all other case values are invalid</span></div> |
| <div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  valid = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  }</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>  <span class="keywordflow">if</span> (!valid) {</div> |
| <div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  std::ostringstream os;</div> |
| <div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  os << <span class="stringliteral">"Possible sketch corruption. Inconsistent state: "</span></div> |
| <div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  << <span class="stringliteral">"preamble_longs = "</span> << preamble_longs</div> |
| <div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  << <span class="stringliteral">", empty = "</span> << (empty ? <span class="stringliteral">"true"</span> : <span class="stringliteral">"false"</span>)</div> |
| <div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  << <span class="stringliteral">", serialization_version = "</span> << serial_version</div> |
| <div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  << <span class="stringliteral">", compact = "</span> << (compact ? <span class="stringliteral">"true"</span> : <span class="stringliteral">"false"</span>);</div> |
| <div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">throw</span> std::invalid_argument(os.str());</div> |
| <div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div> |
| <div class="line"><a name="l00863"></a><span class="lineno"> 863</span> }</div> |
| <div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  </div> |
| <div class="line"><a name="l00865"></a><span class="lineno"> 865</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="l00866"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01"> 866</a></span> <span class="keyword">typename</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::const_iterator</a> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">quantiles_sketch<T, C, A>::begin</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">return</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::const_iterator</a>(base_buffer_, levels_, k_, n_, <span class="keyword">false</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>  </div> |
| <div class="line"><a name="l00870"></a><span class="lineno"> 870</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="l00871"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1"> 871</a></span> <span class="keyword">typename</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::const_iterator</a> <a class="code" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">quantiles_sketch<T, C, A>::end</a>()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">return</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::const_iterator</a>(base_buffer_, levels_, k_, n_, <span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00873"></a><span class="lineno"> 873</span> }</div> |
| <div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  </div> |
| <div class="line"><a name="l00875"></a><span class="lineno"> 875</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="l00876"></a><span class="lineno"> 876</span> <span class="keywordtype">void</span> <a class="code" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch<T, C, A>::grow_base_buffer</a>() {</div> |
| <div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_size = std::max(std::min(<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(2 * k_), 2 * base_buffer_.size()), <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(1));</div> |
| <div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  base_buffer_.reserve(new_size);</div> |
| <div class="line"><a name="l00879"></a><span class="lineno"> 879</span> }</div> |
| <div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  </div> |
| <div class="line"><a name="l00881"></a><span class="lineno"> 881</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="l00882"></a><span class="lineno"> 882</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::process_full_base_buffer() {</div> |
| <div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// make sure there will be enough levels for the propagation</span></div> |
| <div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  grow_levels_if_needed(); <span class="comment">// note: n_ was already incremented by update() before this</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>  std::sort(base_buffer_.begin(), base_buffer_.end(), comparator_);</div> |
| <div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  in_place_propagate_carry(0,</div> |
| <div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  levels_[0], <span class="comment">// unused here, but 0 is guaranteed to exist</span></div> |
| <div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  base_buffer_,</div> |
| <div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">true</span>, *<span class="keyword">this</span>);</div> |
| <div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  base_buffer_.clear();</div> |
| <div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  is_base_buffer_sorted_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keywordflow">if</span> (n_ / (2 * k_) != bit_pattern_) {</div> |
| <div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Internal error: n / 2k ("</span> + std::to_string(n_ / 2 * k_)</div> |
| <div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  + <span class="stringliteral">" != bit_pattern "</span> + std::to_string(bit_pattern_));</div> |
| <div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  }</div> |
| <div class="line"><a name="l00897"></a><span class="lineno"> 897</span> }</div> |
| <div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  </div> |
| <div class="line"><a name="l00899"></a><span class="lineno"> 899</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="l00900"></a><span class="lineno"> 900</span> <span class="keywordtype">bool</span> quantiles_sketch<T, C, A>::grow_levels_if_needed() {</div> |
| <div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(k_, n_);</div> |
| <div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">if</span> (levels_needed == 0)</div> |
| <div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// don't need levels and might have small base buffer. Possible during merges.</span></div> |
| <div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  </div> |
| <div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// from here on, assume full size base buffer (2k) and at least one additional level</span></div> |
| <div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">if</span> (levels_needed <= levels_.size())</div> |
| <div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  </div> |
| <div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  Level empty_level(allocator_);</div> |
| <div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  empty_level.reserve(k_);</div> |
| <div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  levels_.push_back(std::move(empty_level));</div> |
| <div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00913"></a><span class="lineno"> 913</span> }</div> |
| <div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  </div> |
| <div class="line"><a name="l00915"></a><span class="lineno"> 915</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="l00916"></a><span class="lineno"> 916</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdV></div> |
| <div class="line"><a name="l00917"></a><span class="lineno"> 917</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::in_place_propagate_carry(uint8_t starting_level,</div> |
| <div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  FwdV&& buf_size_k, Level& buf_size_2k, </div> |
| <div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordtype">bool</span> apply_as_update,</div> |
| <div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  quantiles_sketch& sketch) {</div> |
| <div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">const</span> uint64_t bit_pattern = sketch.bit_pattern_;</div> |
| <div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k = sketch.k_;</div> |
| <div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  </div> |
| <div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  uint8_t ending_level = lowest_zero_bit_starting_at(bit_pattern, starting_level);</div> |
| <div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  </div> |
| <div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">if</span> (apply_as_update) {</div> |
| <div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="comment">// update version of computation</span></div> |
| <div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="comment">// its is okay for buf_size_k to be null in this case</span></div> |
| <div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  zip_buffer(buf_size_2k, sketch.levels_[ending_level]);</div> |
| <div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="comment">// merge_into version of computation</span></div> |
| <div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i < k; ++i) {</div> |
| <div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  sketch.levels_[ending_level].push_back(conditional_forward<FwdV>(buf_size_k[i]));</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>  </div> |
| <div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">for</span> (uint64_t lvl = starting_level; lvl < ending_level; lvl++) {</div> |
| <div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> ((bit_pattern & (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1) << lvl)) == 0) {</div> |
| <div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"unexpected empty level in bit_pattern"</span>);</div> |
| <div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div> |
| <div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  merge_two_size_k_buffers(</div> |
| <div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  sketch.levels_[lvl],</div> |
| <div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  sketch.levels_[ending_level],</div> |
| <div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  buf_size_2k, sketch.get_comparator());</div> |
| <div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  sketch.levels_[lvl].clear();</div> |
| <div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  sketch.levels_[ending_level].clear();</div> |
| <div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  zip_buffer(buf_size_2k, sketch.levels_[ending_level]);</div> |
| <div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  } <span class="comment">// end of loop over lower levels</span></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>  <span class="comment">// update bit pattern with binary-arithmetic ripple carry</span></div> |
| <div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  sketch.bit_pattern_ = bit_pattern + (<span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1) << starting_level);</div> |
| <div class="line"><a name="l00952"></a><span class="lineno"> 952</span> }</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> <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="l00955"></a><span class="lineno"> 955</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::zip_buffer(Level& buf_in, Level& buf_out) {</div> |
| <div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="preprocessor">#ifdef QUANTILES_VALIDATION</span></div> |
| <div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keyword">static</span> uint32_t next_offset = 0;</div> |
| <div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  uint32_t rand_offset = next_offset;</div> |
| <div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  next_offset = 1 - next_offset;</div> |
| <div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  uint32_t rand_offset = random_utils::random_bit();</div> |
| <div class="line"><a name="l00962"></a><span class="lineno"> 962</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keywordflow">if</span> ((buf_in.size() != 2 * buf_out.capacity())</div> |
| <div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  || (buf_out.size() > 0)) {</div> |
| <div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"zip_buffer requires buf_in.size() == "</span></div> |
| <div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="stringliteral">"2*buf_out.capacity() and empty buf_out"</span>);</div> |
| <div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  }</div> |
| <div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  </div> |
| <div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordtype">size_t</span> k = buf_out.capacity();</div> |
| <div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">for</span> (uint32_t i = rand_offset, o = 0; o < k; i += 2, ++o) {</div> |
| <div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  buf_out.push_back(std::move(buf_in[i]));</div> |
| <div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  }</div> |
| <div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  buf_in.clear();</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">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="l00977"></a><span class="lineno"> 977</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdV></div> |
| <div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::zip_buffer_with_stride(FwdV&& buf_in, Level& buf_out, uint16_t stride) {</div> |
| <div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="comment">// Random offset in range [0, stride)</span></div> |
| <div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  std::uniform_int_distribution<uint16_t> dist(0, stride - 1);</div> |
| <div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">const</span> uint16_t rand_offset = dist(random_utils::rand);</div> |
| <div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  </div> |
| <div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">if</span> ((buf_in.size() != stride * buf_out.capacity())</div> |
| <div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  || (buf_out.size() > 0)) {</div> |
| <div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"zip_buffer_with_stride requires buf_in.size() == "</span></div> |
| <div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="stringliteral">"stride*buf_out.capacity() and empty buf_out"</span>);</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>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> k = buf_out.capacity();</div> |
| <div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">for</span> (uint16_t i = rand_offset, o = 0; o < k; i += stride, ++o) {</div> |
| <div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  buf_out.push_back(conditional_forward<FwdV>(buf_in[i]));</div> |
| <div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  }</div> |
| <div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="comment">// do not clear input buffer</span></div> |
| <div class="line"><a name="l00994"></a><span class="lineno"> 994</span> }</div> |
| <div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  </div> |
| <div class="line"><a name="l00996"></a><span class="lineno"> 996</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="l00997"></a><span class="lineno"> 997</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::merge_two_size_k_buffers(Level& src_1, Level& src_2,</div> |
| <div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  Level& dst, <span class="keyword">const</span> C& comparator) {</div> |
| <div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordflow">if</span> (src_1.size() != src_2.size()</div> |
| <div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  || src_1.size() * 2 != dst.capacity()</div> |
| <div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  || dst.size() != 0) {</div> |
| <div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Input invariants violated in merge_two_size_k_buffers()"</span>);</div> |
| <div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div> |
| <div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  </div> |
| <div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keyword">auto</span> end1 = src_1.end(), end2 = src_2.end();</div> |
| <div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keyword">auto</span> it1 = src_1.begin(), it2 = src_2.begin();</div> |
| <div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  </div> |
| <div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="comment">// TODO: probably actually doing copies given Level&?</span></div> |
| <div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">while</span> (it1 != end1 && it2 != end2) {</div> |
| <div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">if</span> (comparator(*it1, *it2)) {</div> |
| <div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  dst.push_back(std::move(*it1++));</div> |
| <div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  dst.push_back(std::move(*it2++));</div> |
| <div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  }</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>  </div> |
| <div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">if</span> (it1 != end1) {</div> |
| <div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  dst.insert(dst.end(), it1, end1);</div> |
| <div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">if</span> (it2 == end2) { <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"it2 unexpectedly already at end of range"</span>); }</div> |
| <div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  dst.insert(dst.end(), it2, end2);</div> |
| <div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  }</div> |
| <div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> }</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> <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="l01026"></a><span class="lineno"> 1026</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdSk></div> |
| <div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::standard_merge(quantiles_sketch& tgt, FwdSk&& src) {</div> |
| <div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">if</span> (src.get_k() != tgt.get_k()) {</div> |
| <div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"src.get_k() != tgt.get_k()"</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="keywordflow">if</span> (src.is_empty()) {</div> |
| <div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</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>  uint64_t new_n = src.get_n() + tgt.get_n();</div> |
| <div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  </div> |
| <div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="comment">// move items from src's base buffer</span></div> |
| <div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i < src.base_buffer_.size(); ++i) {</div> |
| <div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  tgt.update(conditional_forward<FwdSk>(src.base_buffer_[i]));</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>  </div> |
| <div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="comment">// check (after moving raw items) if we need to extend levels array</span></div> |
| <div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  uint8_t levels_needed = compute_levels_needed(tgt.get_k(), new_n);</div> |
| <div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span> (levels_needed > tgt.levels_.size()) {</div> |
| <div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  tgt.levels_.reserve(levels_needed);</div> |
| <div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keywordflow">while</span> (tgt.levels_.size() < levels_needed) {</div> |
| <div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  Level empty_level(tgt.allocator_);</div> |
| <div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  empty_level.reserve(tgt.get_k());</div> |
| <div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  tgt.levels_.push_back(std::move(empty_level));</div> |
| <div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  }</div> |
| <div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div> |
| <div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  </div> |
| <div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  Level scratch_buf(tgt.allocator_);</div> |
| <div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  scratch_buf.reserve(2 * tgt.get_k());</div> |
| <div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  </div> |
| <div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  uint64_t src_pattern = src.bit_pattern_;</div> |
| <div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">for</span> (uint8_t src_lvl = 0; src_pattern != 0; ++src_lvl, src_pattern >>= 1) {</div> |
| <div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="keywordflow">if</span> ((src_pattern & 1) > 0) {</div> |
| <div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  scratch_buf.clear();</div> |
| <div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  </div> |
| <div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="comment">// propagate-carry</span></div> |
| <div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  in_place_propagate_carry(src_lvl,</div> |
| <div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  src.levels_[src_lvl], scratch_buf,</div> |
| <div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keyword">false</span>, tgt);</div> |
| <div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="comment">// update n_ at the end</span></div> |
| <div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  }</div> |
| <div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  }</div> |
| <div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  tgt.n_ = new_n;</div> |
| <div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordflow">if</span> ((tgt.get_n() / (2 * tgt.get_k())) != tgt.bit_pattern_) {</div> |
| <div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Failed internal consistency check after standard_merge()"</span>);</div> |
| <div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  }</div> |
| <div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  </div> |
| <div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="comment">// update min and max items</span></div> |
| <div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="comment">// can't just check is_empty() since min and max might not have been set if</span></div> |
| <div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// there were no base buffer items added via update()</span></div> |
| <div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">if</span> (!tgt.min_item_) {</div> |
| <div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  tgt.min_item_.emplace(conditional_forward<FwdSk>(*src.min_item_));</div> |
| <div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">if</span> (tgt.comparator_(*src.min_item_, *tgt.min_item_))</div> |
| <div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  *tgt.min_item_ = conditional_forward<FwdSk>(*src.min_item_);</div> |
| <div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  }</div> |
| <div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">if</span> (!tgt.max_item_) {</div> |
| <div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  tgt.max_item_.emplace(conditional_forward<FwdSk>(*src.max_item_));</div> |
| <div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="keywordflow">if</span> (tgt.comparator_(*tgt.max_item_, *src.max_item_))</div> |
| <div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  *tgt.max_item_ = conditional_forward<FwdSk>(*src.max_item_);</div> |
| <div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  }</div> |
| <div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> }</div> |
| <div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  </div> |
| <div class="line"><a name="l01090"></a><span class="lineno"> 1090</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="l01091"></a><span class="lineno"> 1091</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdSk></div> |
| <div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::downsampling_merge(quantiles_sketch& tgt, FwdSk&& src) {</div> |
| <div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">if</span> (src.get_k() % tgt.get_k() != 0) {</div> |
| <div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"src.get_k() is not a multiple of tgt.get_k()"</span>);</div> |
| <div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  }</div> |
| <div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">if</span> (src.is_empty()) {</div> |
| <div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  }</div> |
| <div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  </div> |
| <div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keyword">const</span> uint16_t downsample_factor = src.get_k() / tgt.get_k();</div> |
| <div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keyword">const</span> uint8_t lg_sample_factor = count_trailing_zeros_in_u32(downsample_factor);</div> |
| <div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  </div> |
| <div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keyword">const</span> uint64_t new_n = src.get_n() + tgt.get_n();</div> |
| <div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  </div> |
| <div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="comment">// move items from src's base buffer</span></div> |
| <div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i < src.base_buffer_.size(); ++i) {</div> |
| <div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  tgt.update(conditional_forward<FwdSk>(src.base_buffer_[i]));</div> |
| <div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  }</div> |
| <div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  </div> |
| <div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">// check (after moving raw items) if we need to extend levels array</span></div> |
| <div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(tgt.get_k(), new_n);</div> |
| <div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keywordflow">if</span> (levels_needed > tgt.levels_.size()) {</div> |
| <div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  tgt.levels_.reserve(levels_needed);</div> |
| <div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keywordflow">while</span> (tgt.levels_.size() < levels_needed) {</div> |
| <div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  Level empty_level(tgt.allocator_);</div> |
| <div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  empty_level.reserve(tgt.get_k());</div> |
| <div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  tgt.levels_.push_back(std::move(empty_level));</div> |
| <div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  }</div> |
| <div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  }</div> |
| <div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  </div> |
| <div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  Level down_buf(tgt.allocator_);</div> |
| <div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  down_buf.reserve(tgt.get_k());</div> |
| <div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  </div> |
| <div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  Level scratch_buf(tgt.allocator_);</div> |
| <div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  scratch_buf.reserve(2 * tgt.get_k());</div> |
| <div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  </div> |
| <div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  uint64_t src_pattern = src.bit_pattern_;</div> |
| <div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">for</span> (uint8_t src_lvl = 0; src_pattern != 0; ++src_lvl, src_pattern >>= 1) {</div> |
| <div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">if</span> ((src_pattern & 1) > 0) {</div> |
| <div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  down_buf.clear();</div> |
| <div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  scratch_buf.clear();</div> |
| <div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  </div> |
| <div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="comment">// zip with stride, leaving input buffer intact</span></div> |
| <div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  zip_buffer_with_stride(src.levels_[src_lvl], down_buf, downsample_factor);</div> |
| <div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  </div> |
| <div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="comment">// propagate-carry</span></div> |
| <div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  in_place_propagate_carry(src_lvl + lg_sample_factor,</div> |
| <div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  down_buf, scratch_buf,</div> |
| <div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">false</span>, tgt);</div> |
| <div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="comment">// update n_ at the end</span></div> |
| <div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  }</div> |
| <div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  }</div> |
| <div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  tgt.n_ = new_n;</div> |
| <div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">if</span> ((tgt.get_n() / (2 * tgt.get_k())) != tgt.bit_pattern_) {</div> |
| <div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"Failed internal consistency check after downsampling_merge()"</span>);</div> |
| <div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  }</div> |
| <div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  </div> |
| <div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="comment">// update min and max items</span></div> |
| <div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="comment">// can't just check is_empty() since min and max might not have been set if</span></div> |
| <div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="comment">// there were no base buffer items added via update()</span></div> |
| <div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="keywordflow">if</span> (!tgt.min_item_) {</div> |
| <div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  tgt.min_item_.emplace(conditional_forward<FwdSk>(*src.min_item_));</div> |
| <div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keywordflow">if</span> (tgt.comparator_(*src.min_item_, *tgt.min_item_))</div> |
| <div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  *tgt.min_item_ = conditional_forward<FwdSk>(*src.min_item_);</div> |
| <div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  }</div> |
| <div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">if</span> (!tgt.max_item_) {</div> |
| <div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  tgt.max_item_.emplace(conditional_forward<FwdSk>(*src.max_item_));</div> |
| <div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordflow">if</span> (tgt.comparator_(*tgt.max_item_, *src.max_item_))</div> |
| <div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  *tgt.max_item_ = conditional_forward<FwdSk>(*src.max_item_);</div> |
| <div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  }</div> |
| <div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> }</div> |
| <div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  </div> |
| <div class="line"><a name="l01165"></a><span class="lineno"> 1165</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="l01166"></a><span class="lineno"> 1166</span> uint8_t quantiles_sketch<T, C, A>::lowest_zero_bit_starting_at(uint64_t bits, uint8_t starting_bit) {</div> |
| <div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  uint8_t pos = starting_bit & 0X3F;</div> |
| <div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  uint64_t my_bits = bits >> pos;</div> |
| <div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  </div> |
| <div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keywordflow">while</span> ((my_bits & <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1)) != 0) {</div> |
| <div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  my_bits >>= 1;</div> |
| <div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  pos++;</div> |
| <div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  }</div> |
| <div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keywordflow">return</span> pos;</div> |
| <div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> }</div> |
| <div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  </div> |
| <div class="line"><a name="l01177"></a><span class="lineno"> 1177</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="l01178"></a><span class="lineno"> 1178</span> <span class="keyword">class </span>quantiles_sketch<T, C, A>::items_deleter {</div> |
| <div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  items_deleter(<span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> destroy, <span class="keywordtype">size_t</span> num): allocator_(allocator), destroy_(destroy), num_(num) {}</div> |
| <div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div> |
| <div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keywordflow">if</span> (destroy_) {</div> |
| <div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < num_; ++i) {</div> |
| <div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  ptr[i].~T();</div> |
| <div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  }</div> |
| <div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div> |
| <div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  allocator_.deallocate(ptr, num_);</div> |
| <div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  }</div> |
| <div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  }</div> |
| <div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keywordtype">void</span> set_destroy(<span class="keywordtype">bool</span> destroy) { destroy_ = destroy; }</div> |
| <div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  A allocator_;</div> |
| <div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordtype">bool</span> destroy_;</div> |
| <div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keywordtype">size_t</span> num_;</div> |
| <div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> };</div> |
| <div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  </div> |
| <div class="line"><a name="l01198"></a><span class="lineno"> 1198</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="l01199"></a><span class="lineno"> 1199</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::setup_sorted_view()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01201"></a><span class="lineno"> 1201</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="l01202"></a><span class="lineno"> 1202</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="l01203"></a><span class="lineno"> 1203</span>  }</div> |
| <div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> }</div> |
| <div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  </div> |
| <div class="line"><a name="l01206"></a><span class="lineno"> 1206</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="l01207"></a><span class="lineno"> 1207</span> <span class="keywordtype">void</span> quantiles_sketch<T, C, A>::reset_sorted_view() {</div> |
| <div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  sorted_view_->~quantiles_sorted_view();</div> |
| <div class="line"><a name="l01210"></a><span class="lineno"> 1210</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="l01211"></a><span class="lineno"> 1211</span>  AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div> |
| <div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  sorted_view_ = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  }</div> |
| <div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> }</div> |
| <div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  </div> |
| <div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment">// quantiles_sketch::const_iterator implementation</span></div> |
| <div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  </div> |
| <div class="line"><a name="l01218"></a><span class="lineno"> 1218</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="l01219"></a><span class="lineno"> 1219</span> quantiles_sketch<T, C, A>::const_iterator::const_iterator(<span class="keyword">const</span> Level& base_buffer,</div> |
| <div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">const</span> std::vector<Level, AllocLevel>& levels,</div> |
| <div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  uint16_t k,</div> |
| <div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  uint64_t n,</div> |
| <div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordtype">bool</span> is_end):</div> |
| <div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> base_buffer_(base_buffer),</div> |
| <div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> levels_(levels),</div> |
| <div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> level_(-1),</div> |
| <div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> index_(0),</div> |
| <div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> bb_count_(compute_base_buffer_items(k, n)),</div> |
| <div class="line"><a name="l01229"></a><span class="lineno"> 1229</span> bit_pattern_(compute_bit_pattern(k, n)),</div> |
| <div class="line"><a name="l01230"></a><span class="lineno"> 1230</span> weight_(1),</div> |
| <div class="line"><a name="l01231"></a><span class="lineno"> 1231</span> k_(k)</div> |
| <div class="line"><a name="l01232"></a><span class="lineno"> 1232</span> {</div> |
| <div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">if</span> (is_end) {</div> |
| <div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="comment">// if exact mode: index_ = n is end</span></div> |
| <div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="comment">// if sampling, level_ = max_level + 1 and index_ = 0 is end</span></div> |
| <div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">if</span> (bit_pattern_ == 0) <span class="comment">// only a valid check for exact mode in constructor</span></div> |
| <div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  index_ = <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(n);</div> |
| <div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keywordflow">else</span></div> |
| <div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  level_ = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(levels_.size());</div> |
| <div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  } <span class="keywordflow">else</span> { <span class="comment">// find first non-empty item</span></div> |
| <div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keywordflow">if</span> (bb_count_ == 0 && bit_pattern_ > 0) {</div> |
| <div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  level_ = 0;</div> |
| <div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  weight_ = 2;</div> |
| <div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="keywordflow">while</span> ((bit_pattern_ & 0x01) == 0) {</div> |
| <div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  weight_ *= 2;</div> |
| <div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  ++level_;</div> |
| <div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  bit_pattern_ >>= 1;</div> |
| <div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  }</div> |
| <div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  }</div> |
| <div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  }</div> |
| <div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> }</div> |
| <div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  </div> |
| <div class="line"><a name="l01253"></a><span class="lineno"> 1253</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="l01254"></a><span class="lineno"> 1254</span> <span class="keyword">typename</span> quantiles_sketch<T, C, A>::const_iterator& quantiles_sketch<T, C, A>::const_iterator::operator++() {</div> |
| <div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  ++index_;</div> |
| <div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  </div> |
| <div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordflow">if</span> ((level_ == -1 && index_ == base_buffer_.size() && levels_.size() > 0) || (level_ >= 0 && index_ == k_)) { <span class="comment">// go to the next non-empty level</span></div> |
| <div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  index_ = 0;</div> |
| <div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  ++level_;</div> |
| <div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordflow">if</span> (level_ > 0) bit_pattern_ = bit_pattern_ >> 1;</div> |
| <div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keywordflow">if</span> (bit_pattern_ == 0) <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  weight_ *= 2;</div> |
| <div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  } <span class="keywordflow">while</span> ((bit_pattern_ & <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1)) == 0);</div> |
| <div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  }</div> |
| <div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> }</div> |
| <div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  </div> |
| <div class="line"><a name="l01269"></a><span class="lineno"> 1269</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="l01270"></a><span class="lineno"> 1270</span> <span class="keyword">typename</span> quantiles_sketch<T, C, A>::const_iterator& quantiles_sketch<T, C, A>::const_iterator::operator++(<span class="keywordtype">int</span>) {</div> |
| <div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  const_iterator tmp(*<span class="keyword">this</span>);</div> |
| <div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  operator++();</div> |
| <div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">return</span> tmp;</div> |
| <div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> }</div> |
| <div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  </div> |
| <div class="line"><a name="l01276"></a><span class="lineno"> 1276</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="l01277"></a><span class="lineno"> 1277</span> <span class="keywordtype">bool</span> quantiles_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="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">return</span> level_ == other.level_ && index_ == other.index_;</div> |
| <div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> }</div> |
| <div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  </div> |
| <div class="line"><a name="l01281"></a><span class="lineno"> 1281</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="l01282"></a><span class="lineno"> 1282</span> <span class="keywordtype">bool</span> quantiles_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="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">return</span> !operator==(other);</div> |
| <div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> }</div> |
| <div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  </div> |
| <div class="line"><a name="l01286"></a><span class="lineno"> 1286</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="l01287"></a><span class="lineno"> 1287</span> <span class="keyword">auto</span> quantiles_sketch<T, C, A>::const_iterator::operator*() const -> reference {</div> |
| <div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keywordflow">return</span> value_type(level_ == -1 ? base_buffer_[index_] : levels_[level_][index_], weight_);</div> |
| <div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> }</div> |
| <div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  </div> |
| <div class="line"><a name="l01291"></a><span class="lineno"> 1291</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="l01292"></a><span class="lineno"> 1292</span> <span class="keyword">auto</span> quantiles_sketch<T, C, A>::const_iterator::operator->() const -> pointer {</div> |
| <div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> }</div> |
| <div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  </div> |
| <div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> } <span class="comment">/* namespace datasketches */</span></div> |
| <div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  </div> |
| <div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> <span class="preprocessor">#endif </span><span class="comment">// _QUANTILES_SKETCH_IMPL_HPP_</span></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html">datasketches::quantiles_sketch</a></div><div class="ttdoc">This is a stochastic streaming sketch that enables near-real time analysis of the approximate distrib...</div><div class="ttdef"><b>Definition:</b> quantiles_sketch.hpp:153</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::quantiles_sketch::get_comparator</a></div><div class="ttdeci">Comparator get_comparator() const</div><div class="ttdoc">Returns an instance of the comparator for this sketch.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:681</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::quantiles_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view< T, Comparator, Allocator > get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:723</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a1aeede739283c1ead07288c1022e5d1b"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">datasketches::quantiles_sketch::operator=</a></div><div class="ttdeci">quantiles_sketch & operator=(const quantiles_sketch &other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:89</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::quantiles_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> quantiles_sketch_impl.hpp:769</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::quantiles_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> quantiles_sketch_impl.hpp:664</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a3efad6c7f1aa59649203cc9f70cf36c9"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">datasketches::quantiles_sketch::get_normalized_rank_error</a></div><div class="ttdeci">double get_normalized_rank_error(bool is_pmf) const</div><div class="ttdoc">Gets the normalized rank error for this sketch.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:711</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::quantiles_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> quantiles_sketch_impl.hpp:762</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::quantiles_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> quantiles_sketch_impl.hpp:235</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::quantiles_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> quantiles_sketch_impl.hpp:212</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::quantiles_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> quantiles_sketch_impl.hpp:277</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::quantiles_sketch::to_string</a></div><div class="ttdeci">string< Allocator > 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> quantiles_sketch_impl.hpp:595</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::quantiles_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> quantiles_sketch_impl.hpp:644</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::quantiles_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> quantiles_sketch_impl.hpp:654</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a687ed2123bdc7e67fbda0c081e3acf21"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">datasketches::quantiles_sketch::get_max_item</a></div><div class="ttdeci">const T & get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:675</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a7350b4a67bcf6081017e1c42eef920d4"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">datasketches::quantiles_sketch::deserialize</a></div><div class="ttdeci">static quantiles_sketch deserialize(std::istream &is, const SerDe &sd=SerDe(), const Comparator &comparator=Comparator(), const Allocator &allocator=Allocator())</div><div class="ttdoc">This method deserializes a sketch from a given stream.</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::quantiles_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> quantiles_sketch_impl.hpp:755</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::quantiles_sketch::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const</div><div class="ttdoc">Returns the allocator for this sketch.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:686</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::quantiles_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 approximation to the data item associated with the given rank of a hypothetical sorted ver...</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:744</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_ac5337e7ce1f6a4ebcef233caf3e24c01"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">datasketches::quantiles_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> quantiles_sketch_impl.hpp:866</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::quantiles_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> quantiles_sketch_impl.hpp:693</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::quantiles_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> quantiles_sketch_impl.hpp:659</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_af2fa890815acf3a1418ea8eee466075c"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#af2fa890815acf3a1418ea8eee466075c">datasketches::quantiles_sketch::get_min_item</a></div><div class="ttdeci">const T & get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition:</b> quantiles_sketch_impl.hpp:669</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_af3d8f736304ab5d51319c00febfc0ad1"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">datasketches::quantiles_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> quantiles_sketch_impl.hpp:871</div></div> |
| <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::quantiles_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> quantiles_sketch_impl.hpp:649</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_1quantiles__constants_html_a3bd28528c16e8911658faff9c98b305f"><div class="ttname"><a href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">datasketches::quantiles_constants::MAX_K</a></div><div class="ttdeci">const uint16_t MAX_K</div><div class="ttdoc">maximum value of parameter K</div><div class="ttdef"><b>Definition:</b> quantiles_sketch.hpp:41</div></div> |
| <div class="ttc" id="anamespacedatasketches_1_1quantiles__constants_html_ab9f2b631adf46fe04a11814cd1018926"><div class="ttname"><a href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">datasketches::quantiles_constants::MIN_K</a></div><div class="ttdeci">const uint16_t MIN_K</div><div class="ttdoc">minimum value of parameter K</div><div class="ttdef"><b>Definition:</b> quantiles_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 class="ttc" id="astructdatasketches_1_1serde_html"><div class="ttname"><a href="structdatasketches_1_1serde.html">datasketches::serde</a></div><div class="ttdoc">Interface for serializing and deserializing items.</div><div class="ttdef"><b>Definition:</b> serde.hpp:34</div></div> |
| <div class="ttc" id="astructdatasketches_1_1serde_html_a6c83e1b2b2ec0c10698a155e60ef2b4c"><div class="ttname"><a href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">datasketches::serde::serialize</a></div><div class="ttdeci">void serialize(std::ostream &os, const T *items, unsigned num) const</div><div class="ttdoc">Stream serialization.</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> |
