You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@datasketches.apache.org by gi...@apache.org on 2026/02/11 18:05:41 UTC

(datasketches-cpp) branch gh-pages updated: deploy: 4f069a3056672d45694ac12505a5a14d7fce1a02

This is an automated email from the ASF dual-hosted git repository.

github-bot pushed a commit to branch gh-pages
in repository https://gitbox.apache.org/repos/asf/datasketches-cpp.git


The following commit(s) were added to refs/heads/gh-pages by this push:
     new 2d3f13c  deploy: 4f069a3056672d45694ac12505a5a14d7fce1a02
2d3f13c is described below

commit 2d3f13c2fc442012aae75fe56b1a45cc18ea3a17
Author: leerho <le...@users.noreply.github.com>
AuthorDate: Wed Feb 11 18:05:36 2026 +0000

    deploy: 4f069a3056672d45694ac12505a5a14d7fce1a02
---
 docs/master/ebpps__sample__impl_8hpp_source.html   | 1011 ++++----
 docs/master/kll__sketch_8hpp_source.html           |   48 +-
 docs/master/kll__sketch__impl_8hpp_source.html     | 2135 ++++++++--------
 docs/master/quantiles__sketch_8hpp_source.html     |   46 +-
 .../quantiles__sketch__impl_8hpp_source.html       | 2609 ++++++++++----------
 docs/master/req__sketch_8hpp_source.html           |   52 +-
 docs/master/req__sketch__impl_8hpp_source.html     | 1691 ++++++-------
 7 files changed, 3814 insertions(+), 3778 deletions(-)

diff --git a/docs/master/ebpps__sample__impl_8hpp_source.html b/docs/master/ebpps__sample__impl_8hpp_source.html
index 5ce7acc..a0372a8 100644
--- a/docs/master/ebpps__sample__impl_8hpp_source.html
+++ b/docs/master/ebpps__sample__impl_8hpp_source.html
@@ -111,512 +111,521 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
 <div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;string&gt;</span></div>
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;sstream&gt;</span></div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>ebpps_sample&lt;T,A&gt;::ebpps_sample(uint32_t reserved_size, <span class="keyword">const</span> A&amp; allocator) :</div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  allocator_(allocator),</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  c_(0.0),</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  partial_item_(),</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>  data_(allocator)</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  {</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    data_.reserve(reserved_size);</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>  }</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>ebpps_sample&lt;T,A&gt;::ebpps_sample(std::vector&lt;T, A&gt;&amp;&amp; data, optional&lt;T&gt;&amp;&amp; partial_item, <span class="keywordtype">double</span> c, <span class="keyword">const</span> A&amp; allocator) :</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>  allocator_(allocator),</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  c_(c),</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>  partial_item_(partial_item),</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  data_(data, allocator)</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  {}</div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT&gt;</div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::replace_content(TT&amp;&amp; item, <span class="keywordtype">double</span> theta) {</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  c_ = theta;</div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  data_.clear();</div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  partial_item_.reset();</div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>  <span class="keywordflow">if</span> (theta == 1.0) {</div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    data_.emplace_back(std::forward&lt;TT&gt;(item));</div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    partial_item_.emplace(std::forward&lt;TT&gt;(item));</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>  }</div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">auto</span> ebpps_sample&lt;T,A&gt;::get_sample() const -&gt; result_type {</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  <span class="keywordtype">double</span> unused;</div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c_, &amp;unused);</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> include_partial = next_double() &lt; c_frac;</div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  <span class="keyword">const</span> uint32_t result_size = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size()) + (include_partial ? 1 : 0);</div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  result_type result;</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  result.reserve(result_size);</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>  std::copy(data_.begin(), data_.end(), std::back_inserter(result));</div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>  <span class="keywordflow">if</span> (include_partial)</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    result.emplace_back(<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T&amp;<span class="keyword">&gt;</span>(*partial_item_));</div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  </div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  <span class="keywordflow">return</span> result;</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::downsample(<span class="keywordtype">double</span> theta) {</div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>  <span class="keywordflow">if</span> (theta &gt;= 1.0) <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_c = theta * c_;</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  <span class="keywordtype">double</span> new_c_int;</div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_c_frac = std::modf(new_c, &amp;new_c_int);</div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  <span class="keywordtype">double</span> c_int;</div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c_, &amp;c_int);</div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  <span class="keywordflow">if</span> (new_c_int == 0.0) {</div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">// no full items retained</span></div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">if</span> (next_double() &gt; (c_frac / c_)) {</div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>      swap_with_partial();</div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    data_.clear();</div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_c_int == c_int) {</div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// no items deleted</span></div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">if</span> (next_double() &gt; (1 - theta * c_frac)/(1 - new_c_frac)) {</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>      swap_with_partial();</div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    }</div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordflow">if</span> (next_double() &lt; theta * c_frac) {</div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>      <span class="comment">// subsample data in random order; last item is partial</span></div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>      <span class="comment">// create sample size new_c_int then swap_with_partial()</span></div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>      subsample(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(new_c_int));</div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>      swap_with_partial();</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>      <span class="comment">// create sample size new_c_int + 1 then move_one_to_partial)</span></div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>      subsample(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(new_c_int) + 1);</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>      move_one_to_partial();</div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  }</div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>  <span class="keywordflow">if</span> (new_c == new_c_int)</div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    partial_item_.reset();</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  c_ = new_c;</div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSample&gt;</div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::merge(FwdSample&amp;&amp; other) {</div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>  <span class="keywordtype">double</span> c_int;</div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c_, &amp;c_int);</div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>  <span class="keywordtype">double</span> unused;</div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> other_c_frac = std::modf(other.c_, &amp;unused);</div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>  <span class="comment">// update c_ here but do NOT recompute fractional part yet</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>  c_ += other.c_;</div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; other.data_.size(); ++i)</div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    data_.emplace_back(conditional_forward&lt;FwdSample&gt;(other.data_[i]));</div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>  <span class="comment">// This modifies the original algorithm slightly due to numeric</span></div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>  <span class="comment">// precision issues. Specifically, the test if c_frac + other_c_frac == 1.0</span></div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>  <span class="comment">// happens before tests for &lt; 1.0 or &gt; 1.0 and can also be triggered</span></div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>  <span class="comment">// if c_ == floor(c_) (the updated value of c_, not the input).</span></div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>  <span class="comment">//</span></div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>  <span class="comment">// We can still run into issues where c_frac + other_c_frac == epsilon</span></div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>  <span class="comment">// and the first case would have ideally triggered. As a result, we must</span></div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>  <span class="comment">// check if the partial item exists before adding to the data_ vector.</span></div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>  <span class="keywordflow">if</span> (c_frac == 0.0 &amp;&amp; other_c_frac == 0.0) {</div>
-<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    partial_item_.reset();</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c_frac + other_c_frac == 1.0 || c_ == std::floor(c_)) {</div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordflow">if</span> (next_double() &lt;= c_frac) {</div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>      <span class="keywordflow">if</span> (partial_item_)</div>
-<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        data_.emplace_back(std::move(*partial_item_));</div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>      <span class="keywordflow">if</span> (other.partial_item_)</div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        data_.emplace_back(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    }</div>
-<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    partial_item_.reset();</div>
-<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c_frac + other_c_frac &lt; 1.0) {</div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="keywordflow">if</span> (next_double() &gt; c_frac / (c_frac + other_c_frac)) {</div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>      set_partial(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    }</div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>  } <span class="keywordflow">else</span> { <span class="comment">// c_frac + other_c_frac &gt; 1</span></div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keywordflow">if</span> (next_double() &lt;= (1 - c_frac) / ((1 - c_frac) + (1 - other_c_frac))) {</div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>      data_.emplace_back(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
-<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>      data_.emplace_back(std::move(*partial_item_));</div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>      partial_item_.reset();</div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>      set_partial(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    }</div>
-<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>  }</div>
-<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>}</div>
-<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>string&lt;A&gt; ebpps_sample&lt;T ,A&gt;::to_string()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>  std::ostringstream oss;</div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>  oss &lt;&lt; <span class="stringliteral">&quot;   sample:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>  uint32_t idx = 0;</div>
-<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> T&amp; item : data_)</div>
-<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    oss &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; idx++ &lt;&lt; <span class="stringliteral">&quot;:\t&quot;</span> &lt;&lt; item &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>  oss &lt;&lt; <span class="stringliteral">&quot;   partial: &quot;</span>;</div>
-<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>  <span class="keywordflow">if</span> (<span class="keywordtype">bool</span>(partial_item_))</div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    oss &lt;&lt; (*partial_item_) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>  <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    oss &lt;&lt; <span class="stringliteral">&quot;NULL&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>  <span class="keywordflow">return</span> oss.str();</div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>}</div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::subsample(uint32_t num_samples) {</div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>  <span class="comment">// we can perform a Fisher-Yates style shuffle, stopping after</span></div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>  <span class="comment">// num_samples points since subsequent swaps would only be</span></div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>  <span class="comment">// between items after num_samples. This is valid since a</span></div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>  <span class="comment">// point from anywhere in the initial array would be eligible</span></div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>  <span class="comment">// to end up in the final subsample.</span></div>
-<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
-<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>  <span class="keywordflow">if</span> (num_samples == data_.size()) <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>  <span class="keyword">auto</span> erase_start = data_.begin();</div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>  uint32_t data_len = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size());</div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; num_samples; ++i, ++erase_start) {</div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    uint32_t j = i + random_idx(data_len - i);</div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    std::swap(data_[i], data_[j]);</div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>  }</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>  data_.erase(erase_start, data_.end());</div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>}</div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdItem&gt;</div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::set_partial(FwdItem&amp;&amp; item) {</div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>  <span class="keywordflow">if</span> (partial_item_)</div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    *partial_item_ = conditional_forward&lt;FwdItem&gt;(item);</div>
-<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>  <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    partial_item_.emplace(conditional_forward&lt;FwdItem&gt;(item));</div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}</div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::move_one_to_partial() {</div>
-<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> idx = random_idx(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size()));</div>
-<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>  <span class="comment">// swap selected item to end so we can delete it easily</span></div>
-<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> last_idx = data_.size() - 1;</div>
-<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  <span class="keywordflow">if</span> (idx != last_idx) {</div>
-<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::swap(data_[idx], data_[last_idx]);</div>
-<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>  }</div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>  set_partial(std::move(data_[last_idx]));</div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>  data_.pop_back();</div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>}</div>
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
-<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::swap_with_partial() {</div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>  <span class="keywordflow">if</span> (partial_item_) {</div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> idx = random_idx(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size()));</div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    std::swap(data_[idx], *partial_item_);</div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    move_one_to_partial();</div>
-<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>  }</div>
-<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>}</div>
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
-<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::reset() {</div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>  c_ = 0.0;</div>
-<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>  partial_item_.reset();</div>
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>  data_.clear();</div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>}</div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
-<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="keywordtype">double</span> ebpps_sample&lt;T,A&gt;::get_c()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>  <span class="keywordflow">return</span> c_;</div>
-<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>}</div>
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="keyword">auto</span> ebpps_sample&lt;T,A&gt;::get_full_items() const -&gt; result_type {</div>
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>  <span class="keywordflow">return</span> result_type(data_);</div>
-<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>}</div>
-<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
-<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="keywordtype">bool</span> ebpps_sample&lt;T,A&gt;::has_partial_item()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>  <span class="keywordflow">return</span> bool(partial_item_);</div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>}</div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>T ebpps_sample&lt;T,A&gt;::get_partial_item()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>  <span class="keywordflow">if</span> (!partial_item_) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;Call to get_partial_item() when no partial item exists&quot;</span>);</div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>  <span class="keywordflow">return</span> *partial_item_;</div>
-<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>}</div>
-<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span> </div>
-<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>uint32_t ebpps_sample&lt;T,A&gt;::random_idx(uint32_t max) {</div>
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>  <span class="keyword">static</span> std::uniform_int_distribution&lt;uint32_t&gt; dist;</div>
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>  <span class="keywordflow">return</span> dist(random_utils::rand, std::uniform_int_distribution&lt;uint32_t&gt;::param_type(0, max - 1));</div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>}</div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span> </div>
-<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="keywordtype">double</span> ebpps_sample&lt;T,A&gt;::next_double() {</div>
-<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>  <span class="keywordflow">return</span> random_utils::next_double(random_utils::rand);</div>
-<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>}</div>
-<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span> </div>
-<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>uint32_t ebpps_sample&lt;T,A&gt;::get_num_retained_items()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size() + (partial_item_ ? 1 : 0));</div>
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>}</div>
-<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
-<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span><span class="keywordtype">size_t</span> ebpps_sample&lt;T, A&gt;::get_serialized_size_bytes(<span class="keyword">const</span> SerDe&amp;)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>  <span class="keywordflow">if</span> (c_ == 0.0)</div>
-<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>  <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(c_) + (data_.size() + (partial_item_ ? 1 : 0)) * <span class="keyword">sizeof</span>(T);</div>
-<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>}</div>
-<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
-<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="comment">// implementation for all other types</span></div>
-<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="keywordtype">size_t</span> ebpps_sample&lt;T, A&gt;::get_serialized_size_bytes(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>  <span class="keywordflow">if</span> (c_ == 0.0) <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
-<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>  <span class="keywordtype">size_t</span> num_bytes = <span class="keyword">sizeof</span>(c_);</div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : data_)</div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    num_bytes += sd.size_of_item(it);</div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span> </div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>  <span class="keywordflow">if</span> (partial_item_)</div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    num_bytes += sd.size_of_item(*partial_item_);</div>
-<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
-<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>  <span class="keywordflow">return</span> num_bytes;</div>
-<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>}</div>
-<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
-<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="keywordtype">size_t</span> ebpps_sample&lt;T,A&gt;::serialize(uint8_t* ptr, <span class="keyword">const</span> uint8_t* end_ptr, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>  uint8_t* st_ptr = ptr;</div>
-<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>  </div>
-<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>  ensure_minimum_memory(end_ptr - ptr, <span class="keyword">sizeof</span>(c_));</div>
-<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>  ptr += copy_to_mem(c_, ptr);</div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>  ptr += sd.serialize(ptr, end_ptr - ptr, data_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(data_.size()));</div>
-<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span> </div>
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>  <span class="keywordflow">if</span> (partial_item_) {</div>
-<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*partial_item_, 1);</div>
-<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  }</div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span> </div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>  <span class="keywordflow">return</span> ptr - st_ptr;</div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>}</div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span> </div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::serialize(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>  write(os, c_);</div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>  sd.serialize(os, data_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(data_.size()));</div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span> </div>
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>  <span class="keywordflow">if</span> (partial_item_)</div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    sd.serialize(os, &amp;*partial_item_, 1);</div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span> </div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  <span class="keywordflow">if</span> (!os.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error writing to std::ostream&quot;</span>);</div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>}</div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> </div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>std::pair&lt;ebpps_sample&lt;T, A&gt;, <span class="keywordtype">size_t</span>&gt; ebpps_sample&lt;T, A&gt;::deserialize(<span class="keyword">const</span> uint8_t* ptr, <span class="keywordtype">size_t</span> size, <span class="keyword">const</span> SerDe&amp; sd, <span class="keyword">const</span> A&amp; allocator) {</div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>  <span class="keyword">const</span> uint8_t* st_ptr = ptr;</div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
-<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span> </div>
-<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>  ensure_minimum_memory(size, <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
-<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>  <span class="keywordtype">double</span> c;</div>
-<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>  ptr += copy_from_mem(ptr, c);</div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>  <span class="keywordflow">if</span> (c &lt; 0.0)</div>
-<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;sketch image has C &lt; 0.0 during deserializaiton&quot;</span>);</div>
-<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span> </div>
-<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>  <span class="keywordtype">double</span> c_int;</div>
-<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c, &amp;c_int);</div>
-<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial = c_frac != 0.0;</div>
-<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>  <span class="keyword">const</span> uint32_t num_full_items = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(c_int);</div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>  A alloc(allocator);</div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_full_items), items_deleter(allocator, <span class="keyword">false</span>, num_full_items));</div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, items.get(), num_full_items);</div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  std::vector&lt;T, A&gt; data(std::make_move_iterator(items.get()),</div>
-<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>                         std::make_move_iterator(items.get() + num_full_items),</div>
-<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>                         allocator);</div>
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
-<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>  optional&lt;T&gt; partial_item;</div>
-<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>  <span class="keywordflow">if</span> (has_partial) {</div>
-<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    optional&lt;T&gt; tmp; <span class="comment">// space to deserialize</span></div>
-<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="comment">// serde did not throw so place item and clean up</span></div>
-<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    partial_item.emplace(*tmp);</div>
-<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>  }</div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  <span class="keywordflow">return</span> std::pair&lt;ebpps_sample&lt;T,A&gt;, <span class="keywordtype">size_t</span>&gt;(</div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    ebpps_sample&lt;T,A&gt;(std::move(data), std::move(partial_item), c, allocator),</div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    ptr - st_ptr);</div>
-<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>}</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>ebpps_sample&lt;T,A&gt;::ebpps_sample(uint32_t reserved_size, <span class="keyword">const</span> A&amp; allocator) :</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  allocator_(allocator),</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  c_(0.0),</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>  partial_item_(),</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  data_(allocator)</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>  {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    data_.reserve(reserved_size);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>ebpps_sample&lt;T,A&gt;::ebpps_sample(std::vector&lt;T, A&gt;&amp;&amp; data, optional&lt;T&gt;&amp;&amp; partial_item, <span class="keywordtype">double</span> c, <span class="keyword">const</span> A&amp; allocator) :</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  allocator_(allocator),</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>  c_(c),</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  partial_item_(partial_item),</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  data_(data, allocator)</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>  {}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT&gt;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::replace_content(TT&amp;&amp; item, <span class="keywordtype">double</span> theta) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  c_ = theta;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  data_.clear();</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>  partial_item_.reset();</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>  <span class="keywordflow">if</span> (theta == 1.0) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    data_.emplace_back(std::forward&lt;TT&gt;(item));</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    partial_item_.emplace(std::forward&lt;TT&gt;(item));</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>  }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="keyword">auto</span> ebpps_sample&lt;T,A&gt;::get_sample() const -&gt; result_type {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  <span class="keywordtype">double</span> unused;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c_, &amp;unused);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> include_partial = next_double() &lt; c_frac;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  <span class="keyword">const</span> uint32_t result_size = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size()) + (include_partial ? 1 : 0);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  result_type result;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>  result.reserve(result_size);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>  std::copy(data_.begin(), data_.end(), std::back_inserter(result));</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  <span class="keywordflow">if</span> (include_partial)</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    result.emplace_back(<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T&amp;<span class="keyword">&gt;</span>(*partial_item_));</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>  <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::downsample(<span class="keywordtype">double</span> theta) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>  <span class="keywordflow">if</span> (theta &gt;= 1.0) <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_c = theta * c_;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  <span class="keywordtype">double</span> new_c_int;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> new_c_frac = std::modf(new_c, &amp;new_c_int);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  <span class="keywordtype">double</span> c_int;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c_, &amp;c_int);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  <span class="keywordflow">if</span> (new_c_int == 0.0) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// no full items retained</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">if</span> (next_double() &gt; (c_frac / c_)) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>      swap_with_partial();</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    data_.clear();</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_c_int == c_int) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// no items deleted</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">if</span> (next_double() &gt; (1 - theta * c_frac)/(1 - new_c_frac)) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>      swap_with_partial();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">if</span> (next_double() &lt; theta * c_frac) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>      <span class="comment">// subsample data in random order; last item is partial</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>      <span class="comment">// create sample size new_c_int then swap_with_partial()</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>      subsample(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(new_c_int));</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>      swap_with_partial();</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>      <span class="comment">// create sample size new_c_int + 1 then move_one_to_partial)</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>      subsample(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(new_c_int) + 1);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>      move_one_to_partial();</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>  <span class="keywordflow">if</span> (new_c == new_c_int)</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    partial_item_.reset();</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>  c_ = new_c;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSample&gt;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::merge(FwdSample&amp;&amp; other) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>  <span class="keywordtype">double</span> c_int;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c_, &amp;c_int);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  <span class="keywordtype">double</span> unused;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> other_c_frac = std::modf(other.c_, &amp;unused);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>  <span class="comment">// update c_ here but do NOT recompute fractional part yet</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  c_ += other.c_;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; other.data_.size(); ++i)</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    data_.emplace_back(conditional_forward&lt;FwdSample&gt;(other.data_[i]));</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>  <span class="comment">// This modifies the original algorithm slightly due to numeric</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>  <span class="comment">// precision issues. Specifically, the test if c_frac + other_c_frac == 1.0</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>  <span class="comment">// happens before tests for &lt; 1.0 or &gt; 1.0 and can also be triggered</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>  <span class="comment">// if c_ == floor(c_) (the updated value of c_, not the input).</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>  <span class="comment">// We can still run into issues where c_frac + other_c_frac == epsilon</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>  <span class="comment">// and the first case would have ideally triggered. As a result, we must</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>  <span class="comment">// check if the partial item exists before adding to the data_ vector.</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>  <span class="keywordflow">if</span> (c_frac == 0.0 &amp;&amp; other_c_frac == 0.0) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    partial_item_.reset();</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c_frac + other_c_frac == 1.0 || c_ == std::floor(c_)) {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordflow">if</span> (next_double() &lt;= c_frac) {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>      <span class="keywordflow">if</span> (partial_item_)</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        data_.emplace_back(std::move(*partial_item_));</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>      <span class="keywordflow">if</span> (other.partial_item_)</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        data_.emplace_back(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    partial_item_.reset();</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c_frac + other_c_frac &lt; 1.0) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">if</span> (next_double() &gt; c_frac / (c_frac + other_c_frac)) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>      set_partial(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>  } <span class="keywordflow">else</span> { <span class="comment">// c_frac + other_c_frac &gt; 1</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">if</span> (next_double() &lt;= (1 - c_frac) / ((1 - c_frac) + (1 - other_c_frac))) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>      data_.emplace_back(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>      data_.emplace_back(std::move(*partial_item_));</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>      partial_item_.reset();</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>      set_partial(conditional_forward&lt;FwdSample&gt;(*other.partial_item_));</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>  }</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>}</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>string&lt;A&gt; ebpps_sample&lt;T ,A&gt;::to_string()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>  std::ostringstream oss;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>  oss &lt;&lt; <span class="stringliteral">&quot;   sample:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>  uint32_t idx = 0;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> T&amp; item : data_)</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    oss &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; idx++ &lt;&lt; <span class="stringliteral">&quot;:\t&quot;</span> &lt;&lt; item &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>  oss &lt;&lt; <span class="stringliteral">&quot;   partial: &quot;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>  <span class="keywordflow">if</span> (<span class="keywordtype">bool</span>(partial_item_))</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    oss &lt;&lt; (*partial_item_) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    oss &lt;&lt; <span class="stringliteral">&quot;NULL&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>  <span class="keywordflow">return</span> oss.str();</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::subsample(uint32_t num_samples) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>  <span class="comment">// we can perform a Fisher-Yates style shuffle, stopping after</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>  <span class="comment">// num_samples points since subsequent swaps would only be</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>  <span class="comment">// between items after num_samples. This is valid since a</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>  <span class="comment">// point from anywhere in the initial array would be eligible</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>  <span class="comment">// to end up in the final subsample.</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>  <span class="keywordflow">if</span> (num_samples == data_.size()) <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>  <span class="keyword">auto</span> erase_start = data_.begin();</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>  uint32_t data_len = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size());</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; num_samples; ++i, ++erase_start) {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    uint32_t j = i + random_idx(data_len - i);</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::swap(data_[i], data_[j]);</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>  }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>  data_.erase(erase_start, data_.end());</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>}</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdItem&gt;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::set_partial(FwdItem&amp;&amp; item) {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>  <span class="keywordflow">if</span> (partial_item_)</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    *partial_item_ = conditional_forward&lt;FwdItem&gt;(item);</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    partial_item_.emplace(conditional_forward&lt;FwdItem&gt;(item));</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>}</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::move_one_to_partial() {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> idx = random_idx(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size()));</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>  <span class="comment">// swap selected item to end so we can delete it easily</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> last_idx = data_.size() - 1;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>  <span class="keywordflow">if</span> (idx != last_idx) {</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::swap(data_[idx], data_[last_idx]);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>  }</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  set_partial(std::move(data_[last_idx]));</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>  data_.pop_back();</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>}</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::swap_with_partial() {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>  <span class="keywordflow">if</span> (partial_item_) {</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> idx = random_idx(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size()));</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    std::swap(data_[idx], *partial_item_);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    move_one_to_partial();</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>  }</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>}</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::reset() {</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>  c_ = 0.0;</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>  partial_item_.reset();</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>  data_.clear();</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>}</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span> </div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="keywordtype">double</span> ebpps_sample&lt;T,A&gt;::get_c()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>  <span class="keywordflow">return</span> c_;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>}</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> </div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="keyword">auto</span> ebpps_sample&lt;T,A&gt;::get_full_items() const -&gt; result_type {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>  <span class="keywordflow">return</span> result_type(data_);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>}</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="keywordtype">bool</span> ebpps_sample&lt;T,A&gt;::has_partial_item()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>  <span class="keywordflow">return</span> bool(partial_item_);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>}</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>T ebpps_sample&lt;T,A&gt;::get_partial_item()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>  <span class="keywordflow">if</span> (!partial_item_) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;Call to get_partial_item() when no partial item exists&quot;</span>);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>  <span class="keywordflow">return</span> *partial_item_;</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>}</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span> </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>uint32_t ebpps_sample&lt;T,A&gt;::random_idx(uint32_t max) {</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>  <span class="keyword">static</span> std::uniform_int_distribution&lt;uint32_t&gt; dist;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>  <span class="keywordflow">return</span> dist(random_utils::rand, std::uniform_int_distribution&lt;uint32_t&gt;::param_type(0, max - 1));</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>}</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="keywordtype">double</span> ebpps_sample&lt;T,A&gt;::next_double() {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>  <span class="keywordflow">return</span> random_utils::next_double(random_utils::rand);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>}</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>uint32_t ebpps_sample&lt;T,A&gt;::get_num_retained_items()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(data_.size() + (partial_item_ ? 1 : 0));</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>}</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="keywordtype">size_t</span> ebpps_sample&lt;T, A&gt;::get_serialized_size_bytes(<span class="keyword">const</span> SerDe&amp;)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>  <span class="keywordflow">if</span> (c_ == 0.0)</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(c_) + (data_.size() + (partial_item_ ? 1 : 0)) * <span class="keyword">sizeof</span>(T);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>}</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span> </div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="comment">// implementation for all other types</span></div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span><span class="keywordtype">size_t</span> ebpps_sample&lt;T, A&gt;::get_serialized_size_bytes(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>  <span class="keywordflow">if</span> (c_ == 0.0) <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>  <span class="keywordtype">size_t</span> num_bytes = <span class="keyword">sizeof</span>(c_);</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : data_)</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    num_bytes += sd.size_of_item(it);</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span> </div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>  <span class="keywordflow">if</span> (partial_item_)</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    num_bytes += sd.size_of_item(*partial_item_);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>  <span class="keywordflow">return</span> num_bytes;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>}</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span> </div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span><span class="keywordtype">size_t</span> ebpps_sample&lt;T,A&gt;::serialize(uint8_t* ptr, <span class="keyword">const</span> uint8_t* end_ptr, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>  uint8_t* st_ptr = ptr;</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>  </div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>  ensure_minimum_memory(end_ptr - ptr, <span class="keyword">sizeof</span>(c_));</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>  ptr += copy_to_mem(c_, ptr);</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>  ptr += sd.serialize(ptr, end_ptr - ptr, data_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(data_.size()));</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span> </div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>  <span class="keywordflow">if</span> (partial_item_) {</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*partial_item_, 1);</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  }</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span> </div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>  <span class="keywordflow">return</span> ptr - st_ptr;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>}</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span> </div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="keywordtype">void</span> ebpps_sample&lt;T,A&gt;::serialize(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>  write(os, c_);</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>  sd.serialize(os, data_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(data_.size()));</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  <span class="keywordflow">if</span> (partial_item_)</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    sd.serialize(os, &amp;*partial_item_, 1);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="keywordflow">if</span> (!os.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error writing to std::ostream&quot;</span>);</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>}</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span> </div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>std::pair&lt;ebpps_sample&lt;T, A&gt;, <span class="keywordtype">size_t</span>&gt; ebpps_sample&lt;T, A&gt;::deserialize(<span class="keyword">const</span> uint8_t* ptr, <span class="keywordtype">size_t</span> size, <span class="keyword">const</span> SerDe&amp; sd, <span class="keyword">const</span> A&amp; allocator) {</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  <span class="keyword">const</span> uint8_t* st_ptr = ptr;</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span> </div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>  ensure_minimum_memory(size, <span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>  <span class="keywordtype">double</span> c;</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>  ptr += copy_from_mem(ptr, c);</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>  <span class="keywordflow">if</span> (c &lt; 0.0)</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;sketch image has C &lt; 0.0 during deserializaiton&quot;</span>);</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span> </div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>  <span class="keywordtype">double</span> c_int;</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c, &amp;c_int);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial = c_frac != 0.0;</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span> </div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>  <span class="keyword">const</span> uint32_t num_full_items = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(c_int);</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>  A alloc(allocator);</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_full_items), items_deleter(allocator, <span class="keyword">false</span>, num_full_items));</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, items.get(), num_full_items);</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>  std::vector&lt;T, A&gt; data(std::make_move_iterator(items.get()),</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>                         std::make_move_iterator(items.get() + num_full_items),</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>                         allocator);</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>  optional&lt;T&gt; partial_item;</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>  <span class="keywordflow">if</span> (has_partial) {</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    <span class="comment">// Space to deserialize.</span></div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span> </div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <span class="comment">// serde did not throw so place item and clean up</span></div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    partial_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>  }</div>
 <div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span> </div>
-<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>ebpps_sample&lt;T, A&gt; ebpps_sample&lt;T, A&gt;::deserialize(std::istream&amp; is, <span class="keyword">const</span> SerDe&amp; sd, <span class="keyword">const</span> A&amp; allocator) {</div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c = read&lt;double&gt;(is);</div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  <span class="keywordflow">if</span> (c &lt; 0.0)</div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;sketch image has C &lt; 0.0 during deserializaiton&quot;</span>);</div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span> </div>
-<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>  <span class="keywordtype">double</span> c_int;</div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c, &amp;c_int);</div>
-<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial = c_frac != 0.0;</div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span> </div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>  <span class="keyword">const</span> uint32_t num_full_items = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(c_int);</div>
-<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>  A alloc(allocator);</div>
-<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_full_items), items_deleter(allocator, <span class="keyword">false</span>, num_full_items));</div>
-<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  sd.deserialize(is, items.get(), num_full_items);</div>
-<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>  std::vector&lt;T, A&gt; data(std::make_move_iterator(items.get()),</div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>                         std::make_move_iterator(items.get() + num_full_items),</div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>                         allocator);</div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
-<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>  optional&lt;T&gt; partial_item;</div>
-<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>  <span class="keywordflow">if</span> (has_partial) {</div>
-<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    optional&lt;T&gt; tmp; <span class="comment">// space to deserialize</span></div>
-<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>    sd.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>    <span class="comment">// serde did not throw so place item and clean up</span></div>
-<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    partial_item.emplace(*tmp);</div>
-<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>  }</div>
-<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span> </div>
-<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span> </div>
-<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  <span class="keywordflow">return</span> ebpps_sample&lt;T,A&gt;(std::move(data), std::move(partial_item), c, allocator);</div>
-<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>}</div>
-<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span> </div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span> </div>
-<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator ebpps_sample&lt;T, A&gt;::begin()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>  <span class="keywordflow">return</span> const_iterator(<span class="keyword">this</span>);</div>
-<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>}</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>  <span class="keywordflow">return</span> std::pair&lt;ebpps_sample&lt;T,A&gt;, <span class="keywordtype">size_t</span>&gt;(</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    ebpps_sample&lt;T,A&gt;(std::move(data), std::move(partial_item), c, allocator),</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    ptr - st_ptr);</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>}</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span> </div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>ebpps_sample&lt;T, A&gt; ebpps_sample&lt;T, A&gt;::deserialize(std::istream&amp; is, <span class="keyword">const</span> SerDe&amp; sd, <span class="keyword">const</span> A&amp; allocator) {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c = read&lt;double&gt;(is);</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>  <span class="keywordflow">if</span> (c &lt; 0.0)</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;sketch image has C &lt; 0.0 during deserializaiton&quot;</span>);</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span> </div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>  <span class="keywordtype">double</span> c_int;</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(c, &amp;c_int);</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial = c_frac != 0.0;</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span> </div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>  <span class="keyword">const</span> uint32_t num_full_items = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(c_int);</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>  A alloc(allocator);</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_full_items), items_deleter(allocator, <span class="keyword">false</span>, num_full_items));</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>  sd.deserialize(is, items.get(), num_full_items);</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>  std::vector&lt;T, A&gt; data(std::make_move_iterator(items.get()),</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>                         std::make_move_iterator(items.get() + num_full_items),</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>                         allocator);</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span> </div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  optional&lt;T&gt; partial_item;</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  <span class="keywordflow">if</span> (has_partial) {</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <span class="comment">// Space to deserialize.</span></div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span> </div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    sd.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    <span class="comment">// serde did not throw so place item and clean up</span></div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    partial_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>  }</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span> </div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
 <div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span> </div>
-<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator ebpps_sample&lt;T, A&gt;::end()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>  <span class="keywordflow">return</span> const_iterator(<span class="keyword">nullptr</span>);</div>
-<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>}</div>
-<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span> </div>
-<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span> </div>
-<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span><span class="comment">// -------- ebpps_sketch::const_iterator implementation ---------</span></div>
-<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span> </div>
-<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>ebpps_sample&lt;T, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> ebpps_sample* sample) :</div>
-<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>  sample_(sample),</div>
-<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>  idx_(0),</div>
-<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>  use_partial_(false)</div>
-<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>{</div>
-<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>  <span class="keywordflow">if</span> (sample == <span class="keyword">nullptr</span>)</div>
-<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>  <span class="keywordflow">return</span> ebpps_sample&lt;T,A&gt;(std::move(data), std::move(partial_item), c, allocator);</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>}</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span> </div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span> </div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator ebpps_sample&lt;T, A&gt;::begin()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>  <span class="keywordflow">return</span> const_iterator(<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>}</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span> </div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator ebpps_sample&lt;T, A&gt;::end()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>  <span class="keywordflow">return</span> const_iterator(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>}</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span> </div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span> </div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span><span class="comment">// -------- ebpps_sketch::const_iterator implementation ---------</span></div>
 <div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
-<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>  <span class="comment">// determine in advance if we use the partial item</span></div>
-<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>  <span class="keywordtype">double</span> c_int;</div>
-<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(sample_-&gt;get_c(), &amp;c_int);</div>
-<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>  use_partial_ = sample-&gt;next_double() &lt; c_frac;</div>
-<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span> </div>
-<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>  <span class="comment">// sample with no items</span></div>
-<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>  <span class="keywordflow">if</span> (sample_-&gt;data_.size() == 0 &amp;&amp; use_partial_) {</div>
-<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    idx_ = PARTIAL_IDX;</div>
-<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>  }</div>
-<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span> </div>
-<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>  <span class="keywordflow">if</span> (sample_-&gt;c_== 0.0 || (sample_-&gt;data_.size() == 0 &amp;&amp; !sample_-&gt;has_partial_item())) { sample_ = <span class="keyword">nullptr</span>; }</div>
-<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>}</div>
-<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span> </div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>ebpps_sample&lt;T, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> const_iterator&amp; other) :</div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  sample_(other.sample_),</div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>  idx_(other.idx_),</div>
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  use_partial_(other.use_partial_)</div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>{}</div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span> </div>
-<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator&amp; ebpps_sample&lt;T, A&gt;::const_iterator::operator++() {</div>
-<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>  <span class="keywordflow">if</span> (sample_ == <span class="keyword">nullptr</span>)</div>
-<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (idx_ == PARTIAL_IDX) {</div>
-<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>    idx_ = sample_-&gt;data_.size();</div>
-<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>    sample_ = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>    <span class="keywordflow">return</span> * <span class="keyword">this</span>;</div>
-<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>  }</div>
-<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span> </div>
-<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>  ++idx_;</div>
-<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span> </div>
-<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>  <span class="keywordflow">if</span> (idx_ == sample_-&gt;data_.size()) {</div>
-<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    <span class="keywordflow">if</span> (use_partial_)</div>
-<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>      idx_ = PARTIAL_IDX;</div>
-<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>      sample_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>ebpps_sample&lt;T, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> ebpps_sample* sample) :</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>  sample_(sample),</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>  idx_(0),</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>  use_partial_(false)</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>{</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>  <span class="keywordflow">if</span> (sample == <span class="keyword">nullptr</span>)</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span> </div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>  <span class="comment">// determine in advance if we use the partial item</span></div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>  <span class="keywordtype">double</span> c_int;</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> c_frac = std::modf(sample_-&gt;get_c(), &amp;c_int);</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>  use_partial_ = sample-&gt;next_double() &lt; c_frac;</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span> </div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>  <span class="comment">// sample with no items</span></div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  <span class="keywordflow">if</span> (sample_-&gt;data_.size() == 0 &amp;&amp; use_partial_) {</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    idx_ = PARTIAL_IDX;</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  }</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span> </div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>  <span class="keywordflow">if</span> (sample_-&gt;c_== 0.0 || (sample_-&gt;data_.size() == 0 &amp;&amp; !sample_-&gt;has_partial_item())) { sample_ = <span class="keyword">nullptr</span>; }</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>}</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>ebpps_sample&lt;T, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> const_iterator&amp; other) :</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  sample_(other.sample_),</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>  idx_(other.idx_),</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>  use_partial_(other.use_partial_)</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>{}</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span> </div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator&amp; ebpps_sample&lt;T, A&gt;::const_iterator::operator++() {</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>  <span class="keywordflow">if</span> (sample_ == <span class="keyword">nullptr</span>)</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (idx_ == PARTIAL_IDX) {</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    idx_ = sample_-&gt;data_.size();</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    sample_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    <span class="keywordflow">return</span> * <span class="keyword">this</span>;</div>
 <div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>  }</div>
 <div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span> </div>
-<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>}</div>
-<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span> </div>
-<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator&amp; ebpps_sample&lt;T, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) {</div>
-<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  operator++();</div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>  <span class="keywordflow">return</span> tmp;</div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>}</div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span> </div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span><span class="keywordtype">bool</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>  <span class="keywordflow">if</span> (sample_ != other.sample_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>  <span class="keywordflow">if</span> (sample_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// end (and we know other.sample_ is also null)</span></div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>  <span class="keywordflow">return</span> idx_ == other.idx_;</div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>}</div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span> </div>
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span><span class="keywordtype">bool</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  <span class="keywordflow">return</span> !operator==(other);</div>
-<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>}</div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span> </div>
-<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span><span class="keyword">auto</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
-<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>  <span class="keywordflow">if</span> (idx_ == PARTIAL_IDX)</div>
-<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>    <span class="keywordflow">return</span> *(sample_-&gt;partial_item_);</div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>  <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>    <span class="keywordflow">return</span> sample_-&gt;data_[idx_];</div>
-<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>}</div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span> </div>
-<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span><span class="keyword">auto</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
-<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>}</div>
-<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span> </div>
-<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span><span class="keyword">class </span>ebpps_sample&lt;T, A&gt;::items_deleter {</div>
-<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>  <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>  items_deleter(<span class="keyword">const</span> A&amp; 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 id="l00516" name="l00516"></a><span class="lineno">  516</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div>
-<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>    <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>      <span class="keywordflow">if</span> (destroy_) {</div>
-<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_; ++i) {</div>
-<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>          ptr[i].~T();</div>
-<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>        }</div>
-<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>      }</div>
-<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>      allocator_.deallocate(ptr, num_);</div>
-<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    }</div>
-<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  }</div>
-<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  <span class="keywordtype">void</span> set_destroy(<span class="keywordtype">bool</span> destroy) { destroy_ = destroy; }</div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  A allocator_;</div>
-<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  <span class="keywordtype">bool</span> destroy_;</div>
-<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>  <span class="keywordtype">size_t</span> num_;</div>
-<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>};</div>
-<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span> </div>
-<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span> </div>
-<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>} <span class="comment">// namespace datasketches</span></div>
-<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span> </div>
-<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span><span class="preprocessor">#endif </span><span class="comment">// _EBPPS_SAMPLE_IMPL_HPP_</span></div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>  ++idx_;</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span> </div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>  <span class="keywordflow">if</span> (idx_ == sample_-&gt;data_.size()) {</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    <span class="keywordflow">if</span> (use_partial_)</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>      idx_ = PARTIAL_IDX;</div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>      sample_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>  }</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span> </div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>}</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span> </div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span><span class="keyword">typename</span> ebpps_sample&lt;T, A&gt;::const_iterator&amp; ebpps_sample&lt;T, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) {</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>  operator++();</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>  <span class="keywordflow">return</span> tmp;</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>}</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span> </div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span><span class="keywordtype">bool</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>  <span class="keywordflow">if</span> (sample_ != other.sample_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>  <span class="keywordflow">if</span> (sample_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// end (and we know other.sample_ is also null)</span></div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>  <span class="keywordflow">return</span> idx_ == other.idx_;</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>}</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span> </div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span><span class="keywordtype">bool</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>  <span class="keywordflow">return</span> !operator==(other);</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>}</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span> </div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span><span class="keyword">auto</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>  <span class="keywordflow">if</span> (idx_ == PARTIAL_IDX)</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>    <span class="keywordflow">return</span> *(sample_-&gt;partial_item_);</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>    <span class="keywordflow">return</span> sample_-&gt;data_[idx_];</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>}</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span> </div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span><span class="keyword">auto</span> ebpps_sample&lt;T, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>}</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span> </div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span><span class="keyword">class </span>ebpps_sample&lt;T, A&gt;::items_deleter {</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>  <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>  items_deleter(<span class="keyword">const</span> A&amp; 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 id="l00525" name="l00525"></a><span class="lineno">  525</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>    <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>      <span class="keywordflow">if</span> (destroy_) {</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_; ++i) {</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>          ptr[i].~T();</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>        }</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>      }</div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>      allocator_.deallocate(ptr, num_);</div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>    }</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>  }</div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>  <span class="keywordtype">void</span> set_destroy(<span class="keywordtype">bool</span> destroy) { destroy_ = destroy; }</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>  <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  A allocator_;</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  <span class="keywordtype">bool</span> destroy_;</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>  <span class="keywordtype">size_t</span> num_;</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>};</div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span> </div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span> </div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>} <span class="comment">// namespace datasketches</span></div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span> </div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span><span class="preprocessor">#endif </span><span class="comment">// _EBPPS_SAMPLE_IMPL_HPP_</span></div>
 <div class="ttc" id="anamespacedatasketches_html"><div class="ttname"><a href="namespacedatasketches.html">datasketches</a></div><div class="ttdoc">DataSketches namespace.</div><div class="ttdef"><b>Definition</b> binomial_bounds.hpp:38</div></div>
 </div><!-- fragment --></div><!-- contents -->
 <!-- start footer part -->
diff --git a/docs/master/kll__sketch_8hpp_source.html b/docs/master/kll__sketch_8hpp_source.html
index 144709d..6749de2 100644
--- a/docs/master/kll__sketch_8hpp_source.html
+++ b/docs/master/kll__sketch_8hpp_source.html
@@ -366,33 +366,33 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span> </div>
 <div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span><span class="preprocessor">#endif</span></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html">datasketches::kll_sketch</a></div><div class="ttdoc">Implementation of a very compact quantiles sketch with lazy compaction scheme and nearly optimal accu...</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:166</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::kll_sketch::get_comparator</a></div><div class="ttdeci">C get_comparator() const</div><div class="ttdoc">Returns an instance of the comparator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:271</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::kll_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, C, A &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:760</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0d934088182b8615c2fa34a4716d7d44"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">datasketches::kll_sketch::operator=</a></div><div class="ttdeci">kll_sketch &amp; operator=(const kll_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:102</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::kll_sketch::get_comparator</a></div><div class="ttdeci">C get_comparator() const</div><div class="ttdoc">Returns an instance of the comparator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:272</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::kll_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, C, A &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:769</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0d934088182b8615c2fa34a4716d7d44"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">datasketches::kll_sketch::operator=</a></div><div class="ttdeci">kll_sketch &amp; operator=(const kll_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:103</div></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a1d0c269c23926e93b1c7a9c00e86af97"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a1d0c269c23926e93b1c7a9c00e86af97">datasketches::kll_sketch::serialize</a></div><div class="ttdeci">vector_bytes serialize(unsigned header_size_bytes=0, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch as a vector of bytes.</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::kll_sketch::get_CDF</a></div><div class="ttdeci">vector_double get_CDF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Cumulative Distribution Function (CDF), which is the cumulative analo...</div><div class= [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a288af208cb43c6bdd67b788dc92037ea"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">datasketches::kll_sketch::begin</a></div><div class="ttdeci">const_iterator begin() const</div><div class="ttdoc">Iterator pointing to the first item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:956</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::kll_sketch::get_num_retained</a></div><div class="ttdeci">uint32_t get_num_retained() const</div><div class="ttdoc">Returns the number of retained items (samples) in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:249</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::kll_sketch::get_CDF</a></div><div class="ttdeci">vector_double get_CDF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Cumulative Distribution Function (CDF), which is the cumulative analo...</div><div class= [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a288af208cb43c6bdd67b788dc92037ea"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">datasketches::kll_sketch::begin</a></div><div class="ttdeci">const_iterator begin() const</div><div class="ttdoc">Iterator pointing to the first item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:965</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::kll_sketch::get_num_retained</a></div><div class="ttdeci">uint32_t get_num_retained() const</div><div class="ttdoc">Returns the number of retained items (samples) in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:250</div></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a3f2a0c95cd2c88854ec9b9ab7088f419"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">datasketches::kll_sketch::deserialize</a></div><div class="ttdeci">static kll_sketch deserialize(std::istream &amp;is, const SerDe &amp;sd=SerDe(), const C &amp;comparator=C(), const A &amp;allocator=A())</div><div class="ttdoc">This method deserializes a sketch from a given stream.</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::kll_sketch::get_PMF</a></div><div class="ttdeci">vector_double get_PMF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Probability Mass Function (PMF) of the input stream given a set of sp...</div><div class= [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::kll_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:209</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a4cdb10e4f2949d55d29421c6e381a300"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">datasketches::kll_sketch::get_max_item</a></div><div class="ttdeci">T get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:265</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5194060fd9b11a856cfb47e59801a3eb"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">datasketches::kll_sketch::end</a></div><div class="ttdeci">const_iterator end() const</div><div class="ttdoc">Iterator pointing to the past-the-end item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:961</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::kll_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:180</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::kll_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch into a given stream in a binary form.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::kll_sketch::to_string</a></div><div class="ttdeci">string&lt; A &gt; to_string(bool print_levels=false, bool print_items=false) const</div><div class="ttdoc">Prints a summary of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:904</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::kll_sketch::get_k</a></div><div class="ttdeci">uint16_t get_k() const</div><div class="ttdoc">Returns configured parameter k.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:239</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::kll_sketch::is_empty</a></div><div class="ttdeci">bool is_empty() const</div><div class="ttdoc">Returns true if this sketch is empty.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:234</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::kll_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;item, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the normalized rank of the given item from 0 to 1, inclusive.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::kll_sketch::get_allocator</a></div><div class="ttdeci">A get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:276</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa3f3769ba3fae6fa0e8a0bd65fef5422"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">datasketches::kll_sketch::get_min_item</a></div><div class="ttdeci">T get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:259</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::kll_sketch::get_PMF</a></div><div class="ttdeci">vector_double get_PMF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Probability Mass Function (PMF) of the input stream given a set of sp...</div><div class= [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::kll_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:210</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a4cdb10e4f2949d55d29421c6e381a300"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">datasketches::kll_sketch::get_max_item</a></div><div class="ttdeci">T get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:266</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5194060fd9b11a856cfb47e59801a3eb"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">datasketches::kll_sketch::end</a></div><div class="ttdeci">const_iterator end() const</div><div class="ttdoc">Iterator pointing to the past-the-end item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:970</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::kll_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:181</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::kll_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch into a given stream in a binary form.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::kll_sketch::to_string</a></div><div class="ttdeci">string&lt; A &gt; to_string(bool print_levels=false, bool print_items=false) const</div><div class="ttdoc">Prints a summary of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:913</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::kll_sketch::get_k</a></div><div class="ttdeci">uint16_t get_k() const</div><div class="ttdoc">Returns configured parameter k.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:240</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::kll_sketch::is_empty</a></div><div class="ttdeci">bool is_empty() const</div><div class="ttdoc">Returns true if this sketch is empty.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:235</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::kll_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;item, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the normalized rank of the given item from 0 to 1, inclusive.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::kll_sketch::get_allocator</a></div><div class="ttdeci">A get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:277</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa3f3769ba3fae6fa0e8a0bd65fef5422"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">datasketches::kll_sketch::get_min_item</a></div><div class="ttdeci">T get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:260</div></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa796209b1ef5dc41e83ed8158f77d280"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa796209b1ef5dc41e83ed8158f77d280">datasketches::kll_sketch::quantile_return_type</a></div><div class="ttdeci">typename quantiles_sorted_view&lt; T, C, A &gt;::quantile_return_type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:178</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::kll_sketch::get_quantile</a></div><div class="ttdeci">quantile_return_type get_quantile(double rank, bool inclusive=true) const</div><div class="ttdoc">Returns an item from the sketch that is the best approximation to an item from the original stream wi...</div><div class="ttdef"> [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::kll_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_adb2232570b4977756cddd02b4b6b845b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">datasketches::kll_sketch::get_max_serialized_size_bytes</a></div><div class="ttdeci">static size_t get_max_serialized_size_bytes(uint16_t k, uint64_t n)</div><div class="ttdoc">Returns upper bound on the serialized size of a sketch given a parameter k and stream length.</div><div class="ttdef"> [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae08ba9502b0403ad4448d649ce29b850"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">datasketches::kll_sketch::get_normalized_rank_error</a></div><div class="ttdeci">double get_normalized_rank_error(bool pmf) const</div><div class="ttdoc">Gets the approximate rank error of this sketch normalized as a fraction between zero and one.</div><div class="ttdef"><b>Definition</b> kll_s [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::kll_sketch::is_estimation_mode</a></div><div class="ttdeci">bool is_estimation_mode() const</div><div class="ttdoc">Returns true if this sketch is in estimation mode.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:254</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::kll_sketch::get_n</a></div><div class="ttdeci">uint64_t get_n() const</div><div class="ttdoc">Returns the length of the input stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:244</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::kll_sketch::get_quantile</a></div><div class="ttdeci">quantile_return_type get_quantile(double rank, bool inclusive=true) const</div><div class="ttdoc">Returns an item from the sketch that is the best approximation to an item from the original stream wi...</div><div class="ttdef"> [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::kll_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_adb2232570b4977756cddd02b4b6b845b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">datasketches::kll_sketch::get_max_serialized_size_bytes</a></div><div class="ttdeci">static size_t get_max_serialized_size_bytes(uint16_t k, uint64_t n)</div><div class="ttdoc">Returns upper bound on the serialized size of a sketch given a parameter k and stream length.</div><div class="ttdef"> [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae08ba9502b0403ad4448d649ce29b850"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">datasketches::kll_sketch::get_normalized_rank_error</a></div><div class="ttdeci">double get_normalized_rank_error(bool pmf) const</div><div class="ttdoc">Gets the approximate rank error of this sketch normalized as a fraction between zero and one.</div><div class="ttdef"><b>Definition</b> kll_s [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::kll_sketch::is_estimation_mode</a></div><div class="ttdeci">bool is_estimation_mode() const</div><div class="ttdoc">Returns true if this sketch is in estimation mode.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:255</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::kll_sketch::get_n</a></div><div class="ttdeci">uint64_t get_n() const</div><div class="ttdoc">Returns the length of the input stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:245</div></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_afdd7e72ffdee78a8f96d8160a154d81a"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#afdd7e72ffdee78a8f96d8160a154d81a">datasketches::kll_sketch::deserialize</a></div><div class="ttdeci">static kll_sketch deserialize(const void *bytes, size_t size, const SerDe &amp;sd=SerDe(), const C &amp;comparator=C(), const A &amp;allocator=A())</div><div class="ttdoc">This method deserializes a sketch from a given array of  [...]
 <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</a></div><div class="ttdoc">Sorted view for quantiles sketches (REQ, KLL and Quantiles)</div><div class="ttdef"><b>Definition</b> quantiles_sorted_view.hpp:38</div></div>
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sorted__view_html_a5ab4905c4f3ebeb14de4e7a2f5d92832"><div class="ttname"><a href="classdatasketches_1_1quantiles__sorted__view.html#a5ab4905c4f3ebeb14de4e7a2f5d92832">datasketches::quantiles_sorted_view::quantile_return_type</a></div><div class="ttdeci">typename std::conditional&lt; std::is_arithmetic&lt; T &gt;::value, T, const T &amp; &gt;::type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttde [...]
diff --git a/docs/master/kll__sketch__impl_8hpp_source.html b/docs/master/kll__sketch__impl_8hpp_source.html
index 1a0b3c5..a157951 100644
--- a/docs/master/kll__sketch__impl_8hpp_source.html
+++ b/docs/master/kll__sketch__impl_8hpp_source.html
@@ -107,1113 +107,1122 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
 <div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;sstream&gt;</span></div>
 <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;stdexcept&gt;</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &quot;conditional_forward.hpp&quot;</span></div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &quot;count_zeros.hpp&quot;</span></div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &quot;memory_operations.hpp&quot;</span></div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &quot;kll_helper.hpp&quot;</span></div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#afca1c904b4598d7a9548a40a802ed2b4">   36</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::kll_sketch</a>(uint16_t k, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>comparator_(comparator),</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>allocator_(allocator),</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>k_(k),</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>m_(kll_constants::DEFAULT_M),</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>min_k_(k),</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>num_levels_(1),</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>is_level_zero_sorted_(false),</div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>n_(0),</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>levels_(2, 0, allocator),</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>items_(nullptr),</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>items_size_(k_),</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>min_item_(),</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>max_item_(),</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>{</div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>  <span class="keywordflow">if</span> (k &lt; kll_constants::MIN_K || k &gt; <a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">kll_constants::MAX_K</a>) {</div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;K must be &gt;= &quot;</span> + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">kll_constants::MIN_K</a>) + <span class="stringliteral">&quot; and &lt;= &quot;</span></div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">kll_constants::MAX_K</a>) + <span class="stringliteral">&quot;: &quot;</span> + std::to_string(k));</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  }</div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  levels_[0] = levels_[1] = k;</div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  items_ = allocator_.allocate(items_size_);</div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &quot;conditional_forward.hpp&quot;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &quot;count_zeros.hpp&quot;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &quot;memory_operations.hpp&quot;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &quot;kll_helper.hpp&quot;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#afca1c904b4598d7a9548a40a802ed2b4">   37</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::kll_sketch</a>(uint16_t k, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>comparator_(comparator),</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>allocator_(allocator),</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>k_(k),</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>m_(kll_constants::DEFAULT_M),</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>min_k_(k),</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>num_levels_(1),</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>is_level_zero_sorted_(false),</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>n_(0),</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>levels_(2, 0, allocator),</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>items_(nullptr),</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>items_size_(k_),</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>min_item_(),</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>max_item_(),</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>{</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>  <span class="keywordflow">if</span> (k &lt; kll_constants::MIN_K || k &gt; <a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">kll_constants::MAX_K</a>) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;K must be &gt;= &quot;</span> + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">kll_constants::MIN_K</a>) + <span class="stringliteral">&quot; and &lt;= &quot;</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">kll_constants::MAX_K</a>) + <span class="stringliteral">&quot;: &quot;</span> + std::to_string(k));</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  levels_[0] = levels_[1] = k;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>  items_ = allocator_.allocate(items_size_);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
 </div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#af7352580134284b937cb2510d192434e">   61</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::kll_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&amp; other):</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>comparator_(other.comparator_),</div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>allocator_(other.allocator_),</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>k_(other.k_),</div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>m_(other.m_),</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>min_k_(other.min_k_),</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>num_levels_(other.num_levels_),</div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>is_level_zero_sorted_(other.is_level_zero_sorted_),</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>n_(other.n_),</div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>levels_(other.levels_),</div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>items_(nullptr),</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>items_size_(other.items_size_),</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>min_item_(other.min_item_),</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>max_item_(other.max_item_),</div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>{</div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  items_ = allocator_.allocate(items_size_);</div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = levels_[0]; i &lt; levels_[num_levels_]; ++i) <span class="keyword">new</span> (&amp;items_[i]) T(other.items_[i]);</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#af7352580134284b937cb2510d192434e">   62</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::kll_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&amp; other):</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>comparator_(other.comparator_),</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>allocator_(other.allocator_),</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>k_(other.k_),</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>m_(other.m_),</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>min_k_(other.min_k_),</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>num_levels_(other.num_levels_),</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>is_level_zero_sorted_(other.is_level_zero_sorted_),</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>n_(other.n_),</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>levels_(other.levels_),</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>items_(nullptr),</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>items_size_(other.items_size_),</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>min_item_(other.min_item_),</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>max_item_(other.max_item_),</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>{</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  items_ = allocator_.allocate(items_size_);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = levels_[0]; i &lt; levels_[num_levels_]; ++i) <span class="keyword">new</span> (&amp;items_[i]) T(other.items_[i]);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
 </div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#acd53c0366552f3211d54e4746e12f1fe">   82</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::kll_sketch</a>(<a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&amp;&amp; other) <span class="keyword">noexcept</span>:</div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>comparator_(std::move(other.comparator_)),</div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>allocator_(std::move(other.allocator_)),</div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>k_(other.k_),</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>m_(other.m_),</div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>min_k_(other.min_k_),</div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>num_levels_(other.num_levels_),</div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>is_level_zero_sorted_(other.is_level_zero_sorted_),</div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>n_(other.n_),</div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>levels_(std::move(other.levels_)),</div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>items_(other.items_),</div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>items_size_(other.items_size_),</div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>min_item_(std::move(other.min_item_)),</div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>max_item_(std::move(other.max_item_)),</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>sorted_view_(<span class="keyword">nullptr</span>)</div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>{</div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  other.items_ = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#acd53c0366552f3211d54e4746e12f1fe">   83</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::kll_sketch</a>(<a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&amp;&amp; other) <span class="keyword">noexcept</span>:</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>comparator_(std::move(other.comparator_)),</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>allocator_(std::move(other.allocator_)),</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>k_(other.k_),</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>m_(other.m_),</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>min_k_(other.min_k_),</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>num_levels_(other.num_levels_),</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>is_level_zero_sorted_(other.is_level_zero_sorted_),</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>n_(other.n_),</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>levels_(std::move(other.levels_)),</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>items_(other.items_),</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>items_size_(other.items_size_),</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>min_item_(std::move(other.min_item_)),</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>max_item_(std::move(other.max_item_)),</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>sorted_view_(<span class="keyword">nullptr</span>)</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>{</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  other.items_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
 </div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">  102</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">kll_sketch&lt;T, C, A&gt;::operator=</a>(<span class="keyword">const</span> <a class="code hl_cla [...]
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a> copy(other);</div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  std::swap(comparator_, copy.comparator_);</div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  std::swap(allocator_, copy.allocator_);</div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  std::swap(k_, copy.k_);</div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  std::swap(m_, copy.m_);</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  std::swap(min_k_, copy.min_k_);</div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  std::swap(num_levels_, copy.num_levels_);</div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  std::swap(is_level_zero_sorted_, copy.is_level_zero_sorted_);</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  std::swap(n_, copy.n_);</div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  std::swap(levels_, copy.levels_);</div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  std::swap(items_, copy.items_);</div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  std::swap(items_size_, copy.items_size_);</div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>  std::swap(min_item_, copy.min_item_);</div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>  std::swap(max_item_, copy.max_item_);</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">  103</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">kll_sketch&lt;T, C, A&gt;::operator=</a>(<span class="keyword">const</span> <a class="code hl_cla [...]
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a> copy(other);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  std::swap(comparator_, copy.comparator_);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  std::swap(allocator_, copy.allocator_);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  std::swap(k_, copy.k_);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  std::swap(m_, copy.m_);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  std::swap(min_k_, copy.min_k_);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  std::swap(num_levels_, copy.num_levels_);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  std::swap(is_level_zero_sorted_, copy.is_level_zero_sorted_);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  std::swap(n_, copy.n_);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  std::swap(levels_, copy.levels_);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  std::swap(items_, copy.items_);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>  std::swap(items_size_, copy.items_size_);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>  std::swap(min_item_, copy.min_item_);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>  std::swap(max_item_, copy.max_item_);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}</div>
 </div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a3b0bad718ea491dd8176196d4b250ff4">  122</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">kll_sketch&lt;T, C, A&gt;::operator=</a>(<a class="code hl_class" href="classdatasketches_1_1kll_ [...]
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>  std::swap(comparator_, other.comparator_);</div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>  std::swap(allocator_, other.allocator_);</div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>  std::swap(k_, other.k_);</div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>  std::swap(m_, other.m_);</div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>  std::swap(min_k_, other.min_k_);</div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  std::swap(num_levels_, other.num_levels_);</div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>  std::swap(is_level_zero_sorted_, other.is_level_zero_sorted_);</div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>  std::swap(n_, other.n_);</div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>  std::swap(levels_, other.levels_);</div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  std::swap(items_, other.items_);</div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>  std::swap(items_size_, other.items_size_);</div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>  std::swap(min_item_, other.min_item_);</div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>  std::swap(max_item_, other.max_item_);</div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>}</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a3b0bad718ea491dd8176196d4b250ff4">  123</a></span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">kll_sketch&lt;T, C, A&gt;::operator=</a>(<a class="code hl_class" href="classdatasketches_1_1kll_ [...]
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>  std::swap(comparator_, other.comparator_);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>  std::swap(allocator_, other.allocator_);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>  std::swap(k_, other.k_);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>  std::swap(m_, other.m_);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  std::swap(min_k_, other.min_k_);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>  std::swap(num_levels_, other.num_levels_);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>  std::swap(is_level_zero_sorted_, other.is_level_zero_sorted_);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>  std::swap(n_, other.n_);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  std::swap(levels_, other.levels_);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>  std::swap(items_, other.items_);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>  std::swap(items_size_, other.items_size_);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>  std::swap(min_item_, other.min_item_);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>  std::swap(max_item_, other.max_item_);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>}</div>
 </div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::~kll_sketch</a>() {</div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>  <span class="keywordflow">if</span> (items_ != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keyword">const</span> uint32_t begin = levels_[0];</div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keyword">const</span> uint32_t end = levels_[num_levels_];</div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">for</span> (uint32_t i = begin; i &lt; end; i++) items_[i].~T();</div>
-<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    allocator_.deallocate(items_, items_size_);</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>  }</div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>}</div>
-<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT, <span class="keyword">typename</span> CC, <span class="keyword">typename</span> AA&gt;</div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>kll_sketch&lt;T, C, A&gt;::kll_sketch(<span class="keyword">const</span> kll_sketch&lt;TT, CC, AA&gt;&amp; other, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>comparator_(comparator),</div>
-<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>allocator_(allocator),</div>
-<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>k_(other.k_),</div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>m_(other.m_),</div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>min_k_(other.min_k_),</div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>num_levels_(other.num_levels_),</div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>is_level_zero_sorted_(other.is_level_zero_sorted_),</div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>n_(other.n_),</div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>levels_(other.levels_, allocator_),</div>
-<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>items_(nullptr),</div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>items_size_(other.items_size_),</div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>min_item_(other.min_item_),</div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>max_item_(other.max_item_),</div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>{</div>
-<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>  <span class="keyword">static_assert</span>(</div>
-<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::is_constructible&lt;T, TT&gt;::value,</div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="stringliteral">&quot;Type converting constructor requires new type to be constructible from existing type&quot;</span></div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>  );</div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>  items_ = allocator_.allocate(items_size_);</div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = levels_[0]; i &lt; levels_[num_levels_]; ++i) <span class="keyword">new</span> (&amp;items_[i]) T(other.items_[i]);</div>
-<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>  check_sorting();</div>
-<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>}</div>
-<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
-<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdT&gt;</div>
-<div class="foldopen" id="foldopen00180" data-start="{" data-end="}">
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">  180</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">kll_sketch&lt;T, C, A&gt;::update</a>(FwdT&amp;&amp; item) {</div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</span>; }</div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>  update_min_max(<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T&amp;<span class="keyword">&gt;</span>(item)); <span class="comment">// min and max are always copies</span></div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>  <span class="keyword">const</span> uint32_t index = internal_update();</div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>  <span class="keyword">new</span> (&amp;items_[index]) T(std::forward&lt;FwdT&gt;(item));</div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::~kll_sketch</a>() {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>  <span class="keywordflow">if</span> (items_ != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keyword">const</span> uint32_t begin = levels_[0];</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keyword">const</span> uint32_t end = levels_[num_levels_];</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordflow">for</span> (uint32_t i = begin; i &lt; end; i++) items_[i].~T();</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    allocator_.deallocate(items_, items_size_);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>  }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>}</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT, <span class="keyword">typename</span> CC, <span class="keyword">typename</span> AA&gt;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>kll_sketch&lt;T, C, A&gt;::kll_sketch(<span class="keyword">const</span> kll_sketch&lt;TT, CC, AA&gt;&amp; other, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>comparator_(comparator),</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>allocator_(allocator),</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>k_(other.k_),</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>m_(other.m_),</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>min_k_(other.min_k_),</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>num_levels_(other.num_levels_),</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>is_level_zero_sorted_(other.is_level_zero_sorted_),</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>n_(other.n_),</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>levels_(other.levels_, allocator_),</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>items_(nullptr),</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>items_size_(other.items_size_),</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>min_item_(other.min_item_),</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>max_item_(other.max_item_),</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>{</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>  <span class="keyword">static_assert</span>(</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::is_constructible&lt;T, TT&gt;::value,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="stringliteral">&quot;Type converting constructor requires new type to be constructible from existing type&quot;</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>  );</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>  items_ = allocator_.allocate(items_size_);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = levels_[0]; i &lt; levels_[num_levels_]; ++i) <span class="keyword">new</span> (&amp;items_[i]) T(other.items_[i]);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>  check_sorting();</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>}</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdT&gt;</div>
+<div class="foldopen" id="foldopen00181" data-start="{" data-end="}">
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">  181</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">kll_sketch&lt;T, C, A&gt;::update</a>(FwdT&amp;&amp; item) {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</span>; }</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>  update_min_max(<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T&amp;<span class="keyword">&gt;</span>(item)); <span class="comment">// min and max are always copies</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>  <span class="keyword">const</span> uint32_t index = internal_update();</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>  <span class="keyword">new</span> (&amp;items_[index]) T(std::forward&lt;FwdT&gt;(item));</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>}</div>
 </div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::update_min_max</a>(<span class="keyword">const</span> T&amp; item) {</div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    min_item_.emplace(item);</div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    max_item_.emplace(item);</div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keywordflow">if</span> (comparator_(item, *min_item_)) *min_item_ = item;</div>
-<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = item;</div>
-<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>  }</div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>}</div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>uint32_t kll_sketch&lt;T, C, A&gt;::internal_update() {</div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>  <span class="keywordflow">if</span> (levels_[0] == 0) compress_while_updating();</div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>  n_++;</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>  is_level_zero_sorted_ = <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>  <span class="keywordflow">return</span> --levels_[0];</div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>}</div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
-<div class="foldopen" id="foldopen00209" data-start="{" data-end="}">
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">  209</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">kll_sketch&lt;T, C, A&gt;::merge</a>(FwdSk&amp;&amp; other) {</div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>  <span class="keywordflow">if</span> (other.is_empty()) <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>  <span class="keywordflow">if</span> (m_ != other.m_) {</div>
-<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;incompatible M: &quot;</span> + std::to_string(m_) + <span class="stringliteral">&quot; and &quot;</span> + std::to_string(other.m_));</div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>  }</div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.min_item_));</div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.max_item_));</div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">if</span> (comparator_(*other.min_item_, *min_item_)) *min_item_ = conditional_forward&lt;FwdSk&gt;(*other.min_item_);</div>
-<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, *other.max_item_)) *max_item_ = conditional_forward&lt;FwdSk&gt;(*other.max_item_);</div>
-<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>  }</div>
-<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  <span class="keyword">const</span> uint64_t final_n = n_ + other.n_;</div>
-<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>  <span class="keywordflow">for</span> (uint32_t i = other.levels_[0]; i &lt; other.levels_[1]; i++) {</div>
-<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <span class="keyword">const</span> uint32_t index = internal_update();</div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keyword">new</span> (&amp;items_[index]) T(conditional_forward&lt;FwdSk&gt;(other.items_[i]));</div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>  }</div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  <span class="keywordflow">if</span> (other.num_levels_ &gt;= 2) merge_higher_levels(other, final_n);</div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>  n_ = final_n;</div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>  <span class="keywordflow">if</span> (other.is_estimation_mode()) min_k_ = std::min(min_k_, other.min_k_);</div>
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>  assert_correct_total_weight();</div>
-<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>}</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::update_min_max</a>(<span class="keyword">const</span> T&amp; item) {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    min_item_.emplace(item);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    max_item_.emplace(item);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">if</span> (comparator_(item, *min_item_)) *min_item_ = item;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = item;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>  }</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>}</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>uint32_t kll_sketch&lt;T, C, A&gt;::internal_update() {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>  <span class="keywordflow">if</span> (levels_[0] == 0) compress_while_updating();</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>  n_++;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>  is_level_zero_sorted_ = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>  <span class="keywordflow">return</span> --levels_[0];</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>}</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
+<div class="foldopen" id="foldopen00210" data-start="{" data-end="}">
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">  210</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">kll_sketch&lt;T, C, A&gt;::merge</a>(FwdSk&amp;&amp; other) {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>  <span class="keywordflow">if</span> (other.is_empty()) <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>  <span class="keywordflow">if</span> (m_ != other.m_) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;incompatible M: &quot;</span> + std::to_string(m_) + <span class="stringliteral">&quot; and &quot;</span> + std::to_string(other.m_));</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>  }</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.min_item_));</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.max_item_));</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <span class="keywordflow">if</span> (comparator_(*other.min_item_, *min_item_)) *min_item_ = conditional_forward&lt;FwdSk&gt;(*other.min_item_);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, *other.max_item_)) *max_item_ = conditional_forward&lt;FwdSk&gt;(*other.max_item_);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  }</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>  <span class="keyword">const</span> uint64_t final_n = n_ + other.n_;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>  <span class="keywordflow">for</span> (uint32_t i = other.levels_[0]; i &lt; other.levels_[1]; i++) {</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keyword">const</span> uint32_t index = internal_update();</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keyword">new</span> (&amp;items_[index]) T(conditional_forward&lt;FwdSk&gt;(other.items_[i]));</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  }</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>  <span class="keywordflow">if</span> (other.num_levels_ &gt;= 2) merge_higher_levels(other, final_n);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>  n_ = final_n;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>  <span class="keywordflow">if</span> (other.is_estimation_mode()) min_k_ = std::min(min_k_, other.min_k_);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>  assert_correct_total_weight();</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>}</div>
 </div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span> </div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00234" data-start="{" data-end="}">
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">  234</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">kll_sketch&lt;T, C, A&gt;::is_empty</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>  <span class="keywordflow">return</span> n_ == 0;</div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>}</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">  235</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">kll_sketch&lt;T, C, A&gt;::is_empty</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>  <span class="keywordflow">return</span> n_ == 0;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>}</div>
 </div>
-<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
-<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00239" data-start="{" data-end="}">
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">  239</a></span>uint16_t <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">kll_sketch&lt;T, C, A&gt;::get_k</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>  <span class="keywordflow">return</span> k_;</div>
-<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>}</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span> </div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00240" data-start="{" data-end="}">
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">  240</a></span>uint16_t <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">kll_sketch&lt;T, C, A&gt;::get_k</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>  <span class="keywordflow">return</span> k_;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>}</div>
 </div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
-<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00244" data-start="{" data-end="}">
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">  244</a></span>uint64_t <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">kll_sketch&lt;T, C, A&gt;::get_n</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>  <span class="keywordflow">return</span> n_;</div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>}</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00245" data-start="{" data-end="}">
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">  245</a></span>uint64_t <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">kll_sketch&lt;T, C, A&gt;::get_n</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>  <span class="keywordflow">return</span> n_;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>}</div>
 </div>
-<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span> </div>
-<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00249" data-start="{" data-end="}">
-<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">  249</a></span>uint32_t <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">kll_sketch&lt;T, C, A&gt;::get_num_retained</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>  <span class="keywordflow">return</span> levels_[num_levels_] - levels_[0];</div>
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>}</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">  250</a></span>uint32_t <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">kll_sketch&lt;T, C, A&gt;::get_num_retained</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>  <span class="keywordflow">return</span> levels_[num_levels_] - levels_[0];</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>}</div>
 </div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> </div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00254" data-start="{" data-end="}">
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">  254</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">kll_sketch&lt;T, C, A&gt;::is_estimation_mode</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>  <span class="keywordflow">return</span> num_levels_ &gt; 1;</div>
-<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>}</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">  255</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">kll_sketch&lt;T, C, A&gt;::is_estimation_mode</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>  <span class="keywordflow">return</span> num_levels_ &gt; 1;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>}</div>
 </div>
-<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
-<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00259" data-start="{" data-end="}">
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">  259</a></span>T <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">kll_sketch&lt;T, C, A&gt;::get_min_item</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>  <span class="keywordflow">return</span> *min_item_;</div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>}</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00260" data-start="{" data-end="}">
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">  260</a></span>T <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">kll_sketch&lt;T, C, A&gt;::get_min_item</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>  <span class="keywordflow">return</span> *min_item_;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
 </div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00265" data-start="{" data-end="}">
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">  265</a></span>T <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">kll_sketch&lt;T, C, A&gt;::get_max_item</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>  <span class="keywordflow">return</span> *max_item_;</div>
-<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>}</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00266" data-start="{" data-end="}">
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">  266</a></span>T <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">kll_sketch&lt;T, C, A&gt;::get_max_item</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>  <span class="keywordflow">return</span> *max_item_;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>}</div>
 </div>
-<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00271" data-start="{" data-end="}">
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">  271</a></span>C <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">kll_sketch&lt;T, C, A&gt;::get_comparator</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>  <span class="keywordflow">return</span> comparator_;</div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>}</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00272" data-start="{" data-end="}">
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">  272</a></span>C <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">kll_sketch&lt;T, C, A&gt;::get_comparator</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>  <span class="keywordflow">return</span> comparator_;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>}</div>
 </div>
-<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
-<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00276" data-start="{" data-end="}">
-<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">  276</a></span>A <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">kll_sketch&lt;T, C, A&gt;::get_allocator</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>  <span class="keywordflow">return</span> allocator_;</div>
-<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>}</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span> </div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00277" data-start="{" data-end="}">
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">  277</a></span>A <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">kll_sketch&lt;T, C, A&gt;::get_allocator</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>  <span class="keywordflow">return</span> allocator_;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>}</div>
 </div>
-<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00281" data-start="{" data-end="}">
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">  281</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">kll_sketch&lt;T, C, A&gt;::get_rank</a>(<span class="keyword">const</span> T&amp; item, <span class="keywordtype">bool</span> inclusive)<span class="keyword"> con [...]
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_rank(item, inclusive);</div>
-<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>}</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00282" data-start="{" data-end="}">
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">  282</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">kll_sketch&lt;T, C, A&gt;::get_rank</a>(<span class="keyword">const</span> T&amp; item, <span class="keywordtype">bool</span> inclusive)<span class="keyword"> con [...]
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_rank(item, inclusive);</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>}</div>
 </div>
-<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span> </div>
-<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00288" data-start="{" data-end="}">
-<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">  288</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">kll_sketch&lt;T, C, A&gt;::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
-<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_PMF(split_points, size, inclusive);</div>
-<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>}</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00289" data-start="{" data-end="}">
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">  289</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">kll_sketch&lt;T, C, A&gt;::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_PMF(split_points, size, inclusive);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>}</div>
 </div>
-<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
-<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00295" data-start="{" data-end="}">
-<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">  295</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">kll_sketch&lt;T, C, A&gt;::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
-<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_CDF(split_points, size, inclusive);</div>
-<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>}</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span> </div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00296" data-start="{" data-end="}">
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">  296</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">kll_sketch&lt;T, C, A&gt;::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_CDF(split_points, size, inclusive);</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>}</div>
 </div>
-<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00302" data-start="{" data-end="}">
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">  302</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">kll_sketch&lt;T, C, A&gt;::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</ [...]
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>  <span class="keywordflow">if</span> ((rank &lt; 0.0) || (rank &gt; 1.0)) {</div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;normalized rank cannot be less than zero or greater than 1.0&quot;</span>);</div>
-<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>  }</div>
-<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>  <span class="comment">// may have a side effect of sorting level zero if needed</span></div>
-<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_quantile(rank, inclusive);</div>
-<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>}</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00303" data-start="{" data-end="}">
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">  303</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">kll_sketch&lt;T, C, A&gt;::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</ [...]
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>  <span class="keywordflow">if</span> ((rank &lt; 0.0) || (rank &gt; 1.0)) {</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;normalized rank cannot be less than zero or greater than 1.0&quot;</span>);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>  }</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>  <span class="comment">// may have a side effect of sorting level zero if needed</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_quantile(rank, inclusive);</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>}</div>
 </div>
-<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00313" data-start="{" data-end="}">
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">  313</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">kll_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(<span class="keywordtype">bool</span> pmf)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>  <span class="keywordflow">return</span> get_normalized_rank_error(min_k_, pmf);</div>
-<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>}</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span> </div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00314" data-start="{" data-end="}">
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">  314</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">kll_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(<span class="keywordtype">bool</span> pmf)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>  <span class="keywordflow">return</span> get_normalized_rank_error(min_k_, pmf);</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>}</div>
 </div>
-<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span> </div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="foldopen" id="foldopen00320" data-start="{" data-end="}">
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">  320</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">kll_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp;)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div>
-<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  <span class="keywordflow">if</span> (num_levels_ == 1 &amp;&amp; get_num_retained() == 1) {</div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="keywordflow">return</span> DATA_START_SINGLE_ITEM + <span class="keyword">sizeof</span>(TT);</div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>  }</div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>  <span class="keywordflow">return</span> DATA_START + num_levels_ * <span class="keyword">sizeof</span>(uint32_t) + (get_num_retained() + 2) * <span class="keyword">sizeof</span>(TT);</div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>}</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00321" data-start="{" data-end="}">
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">  321</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">kll_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp;)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  <span class="keywordflow">if</span> (num_levels_ == 1 &amp;&amp; get_num_retained() == 1) {</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    <span class="keywordflow">return</span> DATA_START_SINGLE_ITEM + <span class="keyword">sizeof</span>(TT);</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>  }</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>  <span class="keywordflow">return</span> DATA_START + num_levels_ * <span class="keyword">sizeof</span>(uint32_t) + (get_num_retained() + 2) * <span class="keyword">sizeof</span>(TT);</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>}</div>
 </div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="comment">// implementation for all other types</span></div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">kll_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div>
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>  <span class="keywordflow">if</span> (num_levels_ == 1 &amp;&amp; get_num_retained() == 1) {</div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    <span class="keywordflow">return</span> DATA_START_SINGLE_ITEM + sd.size_of_item(items_[levels_[0]]);</div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>  }</div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="keywordtype">size_t</span> size = DATA_START + num_levels_ * <span class="keyword">sizeof</span>(uint32_t);</div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>  size += sd.size_of_item(*min_item_);</div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>  size += sd.size_of_item(*max_item_);</div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it: *this) size += sd.size_of_item(it.first);</div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>  <span class="keywordflow">return</span> size;</div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>}</div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span> </div>
-<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
-<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>template&lt;typename TT, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="foldopen" id="foldopen00348" data-start="{" data-end="}">
-<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">  348</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">kll_sketch&lt;T, C, A&gt;::get_max_serialized_size_bytes</a>(uint16_t k, uint64_t n) {</div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>  <span class="keyword">const</span> uint8_t num_levels = kll_helper::ub_on_num_levels(n);</div>
-<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>  <span class="keyword">const</span> uint32_t max_num_retained = kll_helper::compute_total_capacity(k, kll_constants::DEFAULT_M, num_levels);</div>
-<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
-<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>  <span class="keywordflow">return</span> DATA_START + num_levels * <span class="keyword">sizeof</span>(uint32_t) + (max_num_retained + 2) * <span class="keyword">sizeof</span>(TT);</div>
-<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>}</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span> </div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="comment">// implementation for all other types</span></div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">kll_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  <span class="keywordflow">if</span> (num_levels_ == 1 &amp;&amp; get_num_retained() == 1) {</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keywordflow">return</span> DATA_START_SINGLE_ITEM + sd.size_of_item(items_[levels_[0]]);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  }</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>  <span class="keywordtype">size_t</span> size = DATA_START + num_levels_ * <span class="keyword">sizeof</span>(uint32_t);</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>  size += sd.size_of_item(*min_item_);</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>  size += sd.size_of_item(*max_item_);</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it: *this) size += sd.size_of_item(it.first);</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>  <span class="keywordflow">return</span> size;</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>}</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span> </div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>template&lt;typename TT, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00349" data-start="{" data-end="}">
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">  349</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">kll_sketch&lt;T, C, A&gt;::get_max_serialized_size_bytes</a>(uint16_t k, uint64_t n) {</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>  <span class="keyword">const</span> uint8_t num_levels = kll_helper::ub_on_num_levels(n);</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>  <span class="keyword">const</span> uint32_t max_num_retained = kll_helper::compute_total_capacity(k, kll_constants::DEFAULT_M, num_levels);</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>  <span class="keywordflow">return</span> DATA_START + num_levels * <span class="keyword">sizeof</span>(uint32_t) + (max_num_retained + 2) * <span class="keyword">sizeof</span>(TT);</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>}</div>
 </div>
-<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span> </div>
-<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span><span class="comment">// implementation for all other types</span></div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>template&lt;typename TT, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="foldopen" id="foldopen00358" data-start="{" data-end="}">
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a02cd0e67339d17d0b48f6f43bc26d381">  358</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">kll_sketch&lt;T, C, A&gt;::get_max_serialized_size_bytes</a>(uint16_t k, uint64_t n, <span class="keywordtype">size_t</span> max_item_size_bytes) {</div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>  <span class="keyword">const</span> uint8_t num_levels = kll_helper::ub_on_num_levels(n);</div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  <span class="keyword">const</span> uint32_t max_num_retained = kll_helper::compute_total_capacity(k, kll_constants::DEFAULT_M, num_levels);</div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  <span class="keywordflow">return</span> DATA_START + num_levels * <span class="keyword">sizeof</span>(uint32_t) + (max_num_retained + 2) * max_item_size_bytes;</div>
-<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>}</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="comment">// implementation for all other types</span></div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>template&lt;typename TT, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00359" data-start="{" data-end="}">
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a02cd0e67339d17d0b48f6f43bc26d381">  359</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">kll_sketch&lt;T, C, A&gt;::get_max_serialized_size_bytes</a>(uint16_t k, uint64_t n, <span class="keywordtype">size_t</span> max_item_size_bytes) {</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  <span class="keyword">const</span> uint8_t num_levels = kll_helper::ub_on_num_levels(n);</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  <span class="keyword">const</span> uint32_t max_num_retained = kll_helper::compute_total_capacity(k, kll_constants::DEFAULT_M, num_levels);</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  <span class="comment">// the last integer in the levels_ array is not serialized because it can be derived</span></div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>  <span class="keywordflow">return</span> DATA_START + num_levels * <span class="keyword">sizeof</span>(uint32_t) + (max_num_retained + 2) * max_item_size_bytes;</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>}</div>
 </div>
-<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span> </div>
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="foldopen" id="foldopen00367" data-start="{" data-end="}">
-<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">  367</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">kll_sketch&lt;T, C, A&gt;::serialize</a>(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item = n_ == 1;</div>
-<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>  <span class="keyword">const</span> uint8_t preamble_ints(is_empty() || is_single_item ? PREAMBLE_INTS_SHORT : PREAMBLE_INTS_FULL);</div>
-<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>  write(os, preamble_ints);</div>
-<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>  <span class="keyword">const</span> uint8_t serial_version(is_single_item ? SERIAL_VERSION_2 : SERIAL_VERSION_1);</div>
-<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>  write(os, serial_version);</div>
-<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>  <span class="keyword">const</span> uint8_t family(FAMILY);</div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  write(os, family);</div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    | (is_level_zero_sorted_ ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
-<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    | (is_single_item ? 1 &lt;&lt; flags::IS_SINGLE_ITEM : 0)</div>
-<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>  );</div>
-<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>  write(os, flags_byte);</div>
-<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>  write(os, k_);</div>
-<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>  write(os, m_);</div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  <span class="keyword">const</span> uint8_t unused = 0;</div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  write(os, unused);</div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  <span class="keywordflow">if</span> (!is_single_item) {</div>
-<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    write(os, n_);</div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    write(os, min_k_);</div>
-<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    write(os, num_levels_);</div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    write(os, unused);</div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    write(os, levels_.data(), <span class="keyword">sizeof</span>(levels_[0]) * num_levels_);</div>
-<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    sd.serialize(os, &amp;*min_item_, 1);</div>
-<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    sd.serialize(os, &amp;*max_item_, 1);</div>
-<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  }</div>
-<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>  sd.serialize(os, &amp;items_[levels_[0]], get_num_retained());</div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>}</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="foldopen" id="foldopen00368" data-start="{" data-end="}">
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">  368</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">kll_sketch&lt;T, C, A&gt;::serialize</a>(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item = n_ == 1;</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>  <span class="keyword">const</span> uint8_t preamble_ints(is_empty() || is_single_item ? PREAMBLE_INTS_SHORT : PREAMBLE_INTS_FULL);</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>  write(os, preamble_ints);</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>  <span class="keyword">const</span> uint8_t serial_version(is_single_item ? SERIAL_VERSION_2 : SERIAL_VERSION_1);</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>  write(os, serial_version);</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  <span class="keyword">const</span> uint8_t family(FAMILY);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  write(os, family);</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    | (is_level_zero_sorted_ ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    | (is_single_item ? 1 &lt;&lt; flags::IS_SINGLE_ITEM : 0)</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>  );</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>  write(os, flags_byte);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>  write(os, k_);</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  write(os, m_);</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  <span class="keyword">const</span> uint8_t unused = 0;</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>  write(os, unused);</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>  <span class="keywordflow">if</span> (!is_single_item) {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    write(os, n_);</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    write(os, min_k_);</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    write(os, num_levels_);</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    write(os, unused);</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    write(os, levels_.data(), <span class="keyword">sizeof</span>(levels_[0]) * num_levels_);</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    sd.serialize(os, &amp;*min_item_, 1);</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    sd.serialize(os, &amp;*max_item_, 1);</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>  }</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>  sd.serialize(os, &amp;items_[levels_[0]], get_num_retained());</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>}</div>
 </div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span> </div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">kll_sketch&lt;T, C, A&gt;::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe&amp; sd) <span class="keyword">const</span> -&gt; vector_bytes {</div>
-<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item = n_ == 1;</div>
-<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = header_size_bytes + get_serialized_size_bytes(sd);</div>
-<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>  vector_bytes bytes(size, 0, allocator_);</div>
-<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div>
-<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
-<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  <span class="keyword">const</span> uint8_t preamble_ints(is_empty() || is_single_item ? PREAMBLE_INTS_SHORT : PREAMBLE_INTS_FULL);</div>
-<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  ptr += copy_to_mem(preamble_ints, ptr);</div>
-<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>  <span class="keyword">const</span> uint8_t serial_version(is_single_item ? SERIAL_VERSION_2 : SERIAL_VERSION_1);</div>
-<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>  ptr += copy_to_mem(serial_version, ptr);</div>
-<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>  <span class="keyword">const</span> uint8_t family(FAMILY);</div>
-<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  ptr += copy_to_mem(family, ptr);</div>
-<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
-<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
-<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    | (is_level_zero_sorted_ ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    | (is_single_item ? 1 &lt;&lt; flags::IS_SINGLE_ITEM : 0)</div>
-<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>  );</div>
-<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>  ptr += copy_to_mem(flags_byte, ptr);</div>
-<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>  ptr += copy_to_mem(k_, ptr);</div>
-<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>  ptr += copy_to_mem(m_, ptr);</div>
-<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// unused</span></div>
-<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    <span class="keywordflow">if</span> (!is_single_item) {</div>
-<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>      ptr += copy_to_mem(n_, ptr);</div>
-<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>      ptr += copy_to_mem(min_k_, ptr);</div>
-<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>      ptr += copy_to_mem(num_levels_, ptr);</div>
-<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>      ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// unused</span></div>
-<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>      ptr += copy_to_mem(levels_.data(), ptr, <span class="keyword">sizeof</span>(levels_[0]) * num_levels_);</div>
-<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*min_item_, 1);</div>
-<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*max_item_, 1);</div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    }</div>
-<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> bytes_remaining = end_ptr - ptr;</div>
-<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    ptr += sd.serialize(ptr, bytes_remaining, &amp;items_[levels_[0]], get_num_retained());</div>
-<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>  }</div>
-<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> delta = ptr - bytes.data();</div>
-<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>  <span class="keywordflow">if</span> (delta != size) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;serialized size mismatch: &quot;</span> + std::to_string(delta)</div>
-<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>      + <span class="stringliteral">&quot; != &quot;</span> + std::to_string(size));</div>
-<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>  <span class="keywordflow">return</span> bytes;</div>
-<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>}</div>
-<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span> </div>
-<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>kll_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">kll_sketch&lt;T, C, A&gt;::deserialize</a>(std::istream&amp; is, <span class="keyword">const</span> SerDe&amp; sd,</div>
-<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator) {</div>
-<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_ints = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read&lt;uint16_t&gt;(is);</div>
-<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>  <span class="keyword">const</span> <span class="keyword">auto</span> m = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>  read&lt;uint8_t&gt;(is); <span class="comment">// skip unused byte</span></div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span> </div>
-<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>  check_m(m);</div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  check_preamble_ints(preamble_ints, flags_byte);</div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>  check_serial_version(serial_version);</div>
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  check_family_id(family_id);</div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span> </div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY));</div>
-<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> kll_sketch(k, comparator, allocator);</div>
-<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span> </div>
-<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>  uint64_t n;</div>
-<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  uint16_t min_k;</div>
-<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>  uint8_t num_levels;</div>
-<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte &amp; (1 &lt;&lt; flags::IS_SINGLE_ITEM)); <span class="comment">// used in serial version 2</span></div>
-<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
-<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>    n = 1;</div>
-<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>    min_k = k;</div>
-<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>    num_levels = 1;</div>
-<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    n = read&lt;uint64_t&gt;(is);</div>
-<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    min_k = read&lt;uint16_t&gt;(is);</div>
-<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    num_levels = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    read&lt;uint8_t&gt;(is); <span class="comment">// skip unused byte</span></div>
-<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>  }</div>
-<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>  vector_u32 levels(num_levels + 1, 0, allocator);</div>
-<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>  <span class="keyword">const</span> uint32_t capacity(kll_helper::compute_total_capacity(k, m, num_levels));</div>
-<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
-<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    levels[0] = capacity - 1;</div>
-<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    <span class="comment">// the last integer in levels_ is not serialized because it can be derived</span></div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    read(is, levels.data(), <span class="keyword">sizeof</span>(levels[0]) * num_levels);</div>
-<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>  }</div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  levels[num_levels] = capacity;</div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>  optional&lt;T&gt; tmp; <span class="comment">// space to deserialize min and max</span></div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span> </div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">kll_sketch&lt;T, C, A&gt;::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe&amp; sd) <span class="keyword">const</span> -&gt; vector_bytes {</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item = n_ == 1;</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = header_size_bytes + get_serialized_size_bytes(sd);</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>  vector_bytes bytes(size, 0, allocator_);</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  <span class="keyword">const</span> uint8_t preamble_ints(is_empty() || is_single_item ? PREAMBLE_INTS_SHORT : PREAMBLE_INTS_FULL);</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>  ptr += copy_to_mem(preamble_ints, ptr);</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>  <span class="keyword">const</span> uint8_t serial_version(is_single_item ? SERIAL_VERSION_2 : SERIAL_VERSION_1);</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>  ptr += copy_to_mem(serial_version, ptr);</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  <span class="keyword">const</span> uint8_t family(FAMILY);</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  ptr += copy_to_mem(family, ptr);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    | (is_level_zero_sorted_ ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    | (is_single_item ? 1 &lt;&lt; flags::IS_SINGLE_ITEM : 0)</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>  );</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>  ptr += copy_to_mem(flags_byte, ptr);</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>  ptr += copy_to_mem(k_, ptr);</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>  ptr += copy_to_mem(m_, ptr);</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// unused</span></div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>    <span class="keywordflow">if</span> (!is_single_item) {</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>      ptr += copy_to_mem(n_, ptr);</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>      ptr += copy_to_mem(min_k_, ptr);</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>      ptr += copy_to_mem(num_levels_, ptr);</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>      ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// unused</span></div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>      ptr += copy_to_mem(levels_.data(), ptr, <span class="keyword">sizeof</span>(levels_[0]) * num_levels_);</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*min_item_, 1);</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*max_item_, 1);</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    }</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> bytes_remaining = end_ptr - ptr;</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    ptr += sd.serialize(ptr, bytes_remaining, &amp;items_[levels_[0]], get_num_retained());</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>  }</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> delta = ptr - bytes.data();</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>  <span class="keywordflow">if</span> (delta != size) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;serialized size mismatch: &quot;</span> + std::to_string(delta)</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>      + <span class="stringliteral">&quot; != &quot;</span> + std::to_string(size));</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>  <span class="keywordflow">return</span> bytes;</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>}</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span> </div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>kll_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">kll_sketch&lt;T, C, A&gt;::deserialize</a>(std::istream&amp; is, <span class="keyword">const</span> SerDe&amp; sd,</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator) {</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_ints = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read&lt;uint16_t&gt;(is);</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>  <span class="keyword">const</span> <span class="keyword">auto</span> m = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>  read&lt;uint8_t&gt;(is); <span class="comment">// skip unused byte</span></div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span> </div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  check_m(m);</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>  check_preamble_ints(preamble_ints, flags_byte);</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  check_serial_version(serial_version);</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>  check_family_id(family_id);</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span> </div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY));</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> kll_sketch(k, comparator, allocator);</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span> </div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  uint64_t n;</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>  uint16_t min_k;</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>  uint8_t num_levels;</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte &amp; (1 &lt;&lt; flags::IS_SINGLE_ITEM)); <span class="comment">// used in serial version 2</span></div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>    n = 1;</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>    min_k = k;</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    num_levels = 1;</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    n = read&lt;uint64_t&gt;(is);</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    min_k = read&lt;uint16_t&gt;(is);</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    num_levels = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    read&lt;uint8_t&gt;(is); <span class="comment">// skip unused byte</span></div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>  }</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>  vector_u32 levels(num_levels + 1, 0, allocator);</div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>  <span class="keyword">const</span> uint32_t capacity(kll_helper::compute_total_capacity(k, m, num_levels));</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    levels[0] = capacity - 1;</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    <span class="comment">// the last integer in levels_ is not serialized because it can be derived</span></div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    read(is, levels.data(), <span class="keyword">sizeof</span>(levels[0]) * num_levels);</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  }</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>  levels[num_levels] = capacity;</div>
 <div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>  optional&lt;T&gt; min_item;</div>
 <div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>  optional&lt;T&gt; max_item;</div>
 <div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>  <span class="keywordflow">if</span> (!is_single_item) {</div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>    sd.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    min_item.emplace(*tmp);</div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>    sd.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    max_item.emplace(*tmp);</div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  }</div>
-<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>  A alloc(allocator);</div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>  <span class="keyword">auto</span> items_buffer_deleter = [capacity, &amp;alloc](T* ptr) { alloc.deallocate(ptr, capacity); };</div>
-<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>  std::unique_ptr&lt;T, <span class="keyword">decltype</span>(items_buffer_deleter)&gt; items_buffer(alloc.allocate(capacity), items_buffer_deleter);</div>
-<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_items = levels[num_levels] - levels[0];</div>
-<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>  sd.deserialize(is, &amp;items_buffer.get()[levels[0]], num_items);</div>
-<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>  <span class="comment">// serde call did not throw, repackage with destrtuctors</span></div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>  std::unique_ptr&lt;T, items_deleter&gt; items(items_buffer.release(), items_deleter(levels[0], capacity, allocator));</div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_zero_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED)) &gt; 0;</div>
-<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>    min_item.emplace(items.get()[levels[0]]);</div>
-<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    max_item.emplace(items.get()[levels[0]]);</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>  }</div>
-<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>  <span class="keywordflow">if</span> (!is.good())</div>
-<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>    <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>  <span class="keywordflow">return</span> kll_sketch(k, min_k, n, num_levels, std::move(levels), std::move(items), capacity,</div>
-<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>      std::move(min_item), std::move(max_item), is_level_zero_sorted, comparator);</div>
-<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>}</div>
-<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span> </div>
-<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>kll_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">kll_sketch&lt;T, C, A&gt;::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&amp; sd,</div>
-<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator) {</div>
-<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>  ensure_minimum_memory(size, 8);</div>
-<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
-<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>  uint8_t preamble_ints;</div>
-<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>  ptr += copy_from_mem(ptr, preamble_ints);</div>
-<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>  uint8_t serial_version;</div>
-<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>  ptr += copy_from_mem(ptr, serial_version);</div>
-<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  uint8_t family_id;</div>
-<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  ptr += copy_from_mem(ptr, family_id);</div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  uint8_t flags_byte;</div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  ptr += copy_from_mem(ptr, flags_byte);</div>
-<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  uint16_t k;</div>
-<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>  ptr += copy_from_mem(ptr, k);</div>
-<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>  uint8_t m;</div>
-<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>  ptr += copy_from_mem(ptr, m);</div>
-<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// skip unused byte</span></div>
-<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span> </div>
-<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>  check_m(m);</div>
-<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>  check_preamble_ints(preamble_ints, flags_byte);</div>
-<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  check_serial_version(serial_version);</div>
-<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  check_family_id(family_id);</div>
-<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>  ensure_minimum_memory(size, preamble_ints * <span class="keyword">sizeof</span>(uint32_t));</div>
-<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span> </div>
-<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY));</div>
-<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> kll_sketch(k, comparator, allocator);</div>
-<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span> </div>
-<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>  uint64_t n;</div>
-<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>  uint16_t min_k;</div>
-<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>  uint8_t num_levels;</div>
-<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte &amp; (1 &lt;&lt; flags::IS_SINGLE_ITEM)); <span class="comment">// used in serial version 2</span></div>
-<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
-<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
-<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>    n = 1;</div>
-<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>    min_k = k;</div>
-<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>    num_levels = 1;</div>
-<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>    ptr += copy_from_mem(ptr, n);</div>
-<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>    ptr += copy_from_mem(ptr, min_k);</div>
-<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>    ptr += copy_from_mem(ptr, num_levels);</div>
-<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>    ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// skip unused byte</span></div>
-<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>  }</div>
-<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>  vector_u32 levels(num_levels + 1, 0, allocator);</div>
-<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>  <span class="keyword">const</span> uint32_t capacity(kll_helper::compute_total_capacity(k, m, num_levels));</div>
-<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
-<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    levels[0] = capacity - 1;</div>
-<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    <span class="comment">// the last integer in levels_ is not serialized because it can be derived</span></div>
-<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>    ptr += copy_from_mem(ptr, levels.data(), <span class="keyword">sizeof</span>(levels[0]) * num_levels);</div>
-<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>  }</div>
-<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>  levels[num_levels] = capacity;</div>
-<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>  optional&lt;T&gt; tmp; <span class="comment">// space to deserialize min and max</span></div>
-<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>  optional&lt;T&gt; min_item;</div>
-<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>  optional&lt;T&gt; max_item;</div>
-<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>  <span class="keywordflow">if</span> (!is_single_item) {</div>
-<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>    min_item.emplace(*tmp);</div>
-<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    max_item.emplace(*tmp);</div>
-<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>  }</div>
-<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>  A alloc(allocator);</div>
-<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>  <span class="keyword">auto</span> items_buffer_deleter = [capacity, &amp;alloc](T* ptr) { alloc.deallocate(ptr, capacity); };</div>
-<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>  std::unique_ptr&lt;T, <span class="keyword">decltype</span>(items_buffer_deleter)&gt; items_buffer(alloc.allocate(capacity), items_buffer_deleter);</div>
-<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_items = levels[num_levels] - levels[0];</div>
-<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;items_buffer.get()[levels[0]], num_items);</div>
-<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>  <span class="comment">// serde call did not throw, repackage with destrtuctors</span></div>
-<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>  std::unique_ptr&lt;T, items_deleter&gt; items(items_buffer.release(), items_deleter(levels[0], capacity, allocator));</div>
-<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> delta = ptr - <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
-<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>  <span class="keywordflow">if</span> (delta != size) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;deserialized size mismatch: &quot;</span> + std::to_string(delta) + <span class="stringliteral">&quot; != &quot;</span> + std::to_string(size));</div>
-<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_zero_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED)) &gt; 0;</div>
-<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
-<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>    min_item.emplace(items.get()[levels[0]]);</div>
-<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>    max_item.emplace(items.get()[levels[0]]);</div>
-<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>  }</div>
-<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>  <span class="keywordflow">return</span> kll_sketch(k, min_k, n, num_levels, std::move(levels), std::move(items), capacity,</div>
-<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>      std::move(min_item), std::move(max_item), is_level_zero_sorted, comparator);</div>
-<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>}</div>
-<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span> </div>
-<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span><span class="comment">/*</span></div>
-<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span><span class="comment"> * Gets the normalized rank error given k and pmf.</span></div>
-<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span><span class="comment"> * k - the configuration parameter</span></div>
-<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span><span class="comment"> * pmf - if true, returns the &quot;double-sided&quot; normalized rank error for the get_PMF() function.</span></div>
-<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span><span class="comment"> * Otherwise, it is the &quot;single-sided&quot; normalized rank error for all the other queries.</span></div>
-<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span><span class="comment"> * Constants were derived as the best fit to 99 percentile empirically measured max error in thousands of trials</span></div>
-<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">kll_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(uint16_t k, <span class="keywordtype">bool</span> pmf) {</div>
-<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>  <span class="keywordflow">return</span> pmf</div>
-<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>      ? 2.446 / pow(k, 0.9433)</div>
-<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>      : 2.296 / pow(k, 0.9723);</div>
-<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>}</div>
-<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span> </div>
-<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span><span class="comment">// for deserialization</span></div>
-<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>kll_sketch&lt;T, C, A&gt;::kll_sketch(uint16_t k, uint16_t min_k, uint64_t n, uint8_t num_levels, vector_u32&amp;&amp; levels,</div>
-<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>    std::unique_ptr&lt;T, items_deleter&gt; items, uint32_t items_size, optional&lt;T&gt;&amp;&amp; min_item,</div>
-<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>    optional&lt;T&gt;&amp;&amp; max_item, <span class="keywordtype">bool</span> is_level_zero_sorted, <span class="keyword">const</span> C&amp; comparator):</div>
-<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>comparator_(comparator),</div>
-<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>allocator_(levels.get_allocator()),</div>
-<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>k_(k),</div>
-<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>m_(kll_constants::DEFAULT_M),</div>
-<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>min_k_(min_k),</div>
-<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>num_levels_(num_levels),</div>
-<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>is_level_zero_sorted_(is_level_zero_sorted),</div>
-<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>n_(n),</div>
-<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>levels_(std::move(levels)),</div>
-<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>items_(items.release()),</div>
-<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>items_size_(items_size),</div>
-<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>min_item_(std::move(min_item)),</div>
-<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>max_item_(std::move(max_item)),</div>
-<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>{}</div>
-<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span> </div>
-<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span><span class="comment">// The following code is only valid in the special case of exactly reaching capacity while updating.</span></div>
-<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span><span class="comment">// It cannot be used while merging, while reducing k, or anything else.</span></div>
-<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::compress_while_updating(<span class="keywordtype">void</span>) {</div>
-<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>  <span class="keyword">const</span> uint8_t level = find_level_to_compact();</div>
-<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span> </div>
-<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>  <span class="comment">// It is important to add the new top level right here. Be aware that this operation</span></div>
-<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>  <span class="comment">// grows the buffer and shifts the data and also the boundaries of the data and grows the</span></div>
-<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>  <span class="comment">// levels array and increments num_levels_</span></div>
-<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>  <span class="keywordflow">if</span> (level == (num_levels_ - 1)) {</div>
-<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>    add_empty_top_level_to_completely_full_sketch();</div>
-<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>  }</div>
-<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span> </div>
-<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>  <span class="keyword">const</span> uint32_t raw_beg = levels_[level];</div>
-<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>  <span class="keyword">const</span> uint32_t raw_lim = levels_[level + 1];</div>
-<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>  <span class="comment">// +2 is OK because we already added a new top level if necessary</span></div>
-<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>  <span class="keyword">const</span> uint32_t pop_above = levels_[level + 2] - raw_lim;</div>
-<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>  <span class="keyword">const</span> uint32_t raw_pop = raw_lim - raw_beg;</div>
-<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> odd_pop = kll_helper::is_odd(raw_pop);</div>
-<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>  <span class="keyword">const</span> uint32_t adj_beg = odd_pop ? raw_beg + 1 : raw_beg;</div>
-<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>  <span class="keyword">const</span> uint32_t adj_pop = odd_pop ? raw_pop - 1 : raw_pop;</div>
-<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>  <span class="keyword">const</span> uint32_t half_adj_pop = adj_pop / 2;</div>
-<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>  <span class="keyword">const</span> uint32_t destroy_beg = levels_[0];</div>
-<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span> </div>
-<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>  <span class="comment">// level zero might not be sorted, so we must sort it if we wish to compact it</span></div>
-<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>  <span class="comment">// sort_level_zero() is not used here because of the adjustment for odd number of items</span></div>
-<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>  <span class="keywordflow">if</span> ((level == 0) &amp;&amp; !is_level_zero_sorted_) {</div>
-<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>    std::sort(items_ + adj_beg, items_ + adj_beg + adj_pop, comparator_);</div>
-<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>  }</div>
-<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>  <span class="keywordflow">if</span> (pop_above == 0) {</div>
-<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    kll_helper::randomly_halve_up(items_, adj_beg, adj_pop);</div>
-<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>    kll_helper::randomly_halve_down(items_, adj_beg, adj_pop);</div>
-<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>    kll_helper::merge_sorted_arrays&lt;T, C&gt;(items_, adj_beg, half_adj_pop, raw_lim, pop_above, adj_beg + half_adj_pop);</div>
-<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>  }</div>
-<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>  levels_[level + 1] -= half_adj_pop; <span class="comment">// adjust boundaries of the level above</span></div>
-<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span>  <span class="keywordflow">if</span> (odd_pop) {</div>
-<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>    levels_[level] = levels_[level + 1] - 1; <span class="comment">// the current level now contains one item</span></div>
-<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>    <span class="keywordflow">if</span> (levels_[level] != raw_beg) items_[levels_[level]] = std::move(items_[raw_beg]); <span class="comment">// namely this leftover guy</span></div>
-<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>    levels_[level] = levels_[level + 1]; <span class="comment">// the current level is now empty</span></div>
-<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>  }</div>
-<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span> </div>
-<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>  <span class="comment">// verify that we freed up half_adj_pop array slots just below the current level</span></div>
-<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>  <span class="keywordflow">if</span> (levels_[level] != (raw_beg + half_adj_pop)) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;compaction error&quot;</span>);</div>
-<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span> </div>
-<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>  <span class="comment">// finally, we need to shift up the data in the levels below</span></div>
-<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>  <span class="comment">// so that the freed-up space can be used by level zero</span></div>
-<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>  <span class="keywordflow">if</span> (level &gt; 0) {</div>
-<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>    <span class="keyword">const</span> uint32_t amount = raw_beg - levels_[0];</div>
-<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>    std::move_backward(items_ + levels_[0], items_ + levels_[0] + amount, items_ + levels_[0] + half_adj_pop + amount);</div>
-<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>    <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl &lt; level; lvl++) levels_[lvl] += half_adj_pop;</div>
-<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span>  }</div>
-<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; half_adj_pop; i++) items_[i + destroy_beg].~T();</div>
-<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>}</div>
-<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span> </div>
-<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>uint8_t kll_sketch&lt;T, C, A&gt;::find_level_to_compact()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>  uint8_t level = 0;</div>
-<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span>    <span class="keywordflow">if</span> (level &gt;= num_levels_) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;capacity calculation error&quot;</span>);</div>
-<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span>    <span class="keyword">const</span> uint32_t pop = levels_[level + 1] - levels_[level];</div>
-<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>    <span class="keyword">const</span> uint32_t cap = kll_helper::level_capacity(k_, num_levels_, level, m_);</div>
-<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>    <span class="keywordflow">if</span> (pop &gt;= cap) {</div>
-<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span>      <span class="keywordflow">return</span> level;</div>
-<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span>    }</div>
-<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>    level++;</div>
-<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>  }</div>
-<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>}</div>
-<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span> </div>
-<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::add_empty_top_level_to_completely_full_sketch() {</div>
-<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span>  <span class="keyword">const</span> uint32_t cur_total_cap = levels_[num_levels_];</div>
-<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span> </div>
-<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>  <span class="comment">// make sure that we are following a certain growth scheme</span></div>
-<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>  <span class="keywordflow">if</span> (levels_[0] != 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;full sketch expected&quot;</span>);</div>
-<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>  <span class="keywordflow">if</span> (items_size_ != cur_total_cap) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;current capacity mismatch&quot;</span>);</div>
-<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span> </div>
-<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>  <span class="comment">// note that merging MIGHT over-grow levels_, in which case we might not have to grow it here</span></div>
-<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>  <span class="keyword">const</span> uint8_t new_levels_size = num_levels_ + 2;</div>
-<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>  <span class="keywordflow">if</span> (levels_.size() &lt; new_levels_size) {</div>
-<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span>    levels_.resize(new_levels_size);</div>
-<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span>  }</div>
-<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span> </div>
-<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>  <span class="keyword">const</span> uint32_t delta_cap = kll_helper::level_capacity(k_, num_levels_ + 1, 0, m_);</div>
-<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>  <span class="keyword">const</span> uint32_t new_total_cap = cur_total_cap + delta_cap;</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>    <span class="comment">// Space to deserialize min and max.</span></div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>    <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>    T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    sd.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    min_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    sd.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>    max_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>  }</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>  A alloc(allocator);</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>  <span class="keyword">auto</span> items_buffer_deleter = [capacity, &amp;alloc](T* ptr) { alloc.deallocate(ptr, capacity); };</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>  std::unique_ptr&lt;T, <span class="keyword">decltype</span>(items_buffer_deleter)&gt; items_buffer(alloc.allocate(capacity), items_buffer_deleter);</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_items = levels[num_levels] - levels[0];</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>  sd.deserialize(is, &amp;items_buffer.get()[levels[0]], num_items);</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>  <span class="comment">// serde call did not throw, repackage with destrtuctors</span></div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>  std::unique_ptr&lt;T, items_deleter&gt; items(items_buffer.release(), items_deleter(levels[0], capacity, allocator));</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_zero_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED)) &gt; 0;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>    min_item.emplace(items.get()[levels[0]]);</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>    max_item.emplace(items.get()[levels[0]]);</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>  }</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>  <span class="keywordflow">if</span> (!is.good())</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>    <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>  <span class="keywordflow">return</span> kll_sketch(k, min_k, n, num_levels, std::move(levels), std::move(items), capacity,</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>      std::move(min_item), std::move(max_item), is_level_zero_sorted, comparator);</div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>}</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span> </div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>kll_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">kll_sketch&lt;T, C, A&gt;::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&amp; sd,</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator) {</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>  ensure_minimum_memory(size, 8);</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  uint8_t preamble_ints;</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  ptr += copy_from_mem(ptr, preamble_ints);</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  uint8_t serial_version;</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  ptr += copy_from_mem(ptr, serial_version);</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>  uint8_t family_id;</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>  ptr += copy_from_mem(ptr, family_id);</div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>  uint8_t flags_byte;</div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>  ptr += copy_from_mem(ptr, flags_byte);</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>  uint16_t k;</div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>  ptr += copy_from_mem(ptr, k);</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>  uint8_t m;</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  ptr += copy_from_mem(ptr, m);</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// skip unused byte</span></div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span> </div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>  check_m(m);</div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>  check_preamble_ints(preamble_ints, flags_byte);</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>  check_serial_version(serial_version);</div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>  check_family_id(family_id);</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>  ensure_minimum_memory(size, preamble_ints * <span class="keyword">sizeof</span>(uint32_t));</div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span> </div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY));</div>
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> kll_sketch(k, comparator, allocator);</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span> </div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>  uint64_t n;</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>  uint16_t min_k;</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>  uint8_t num_levels;</div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte &amp; (1 &lt;&lt; flags::IS_SINGLE_ITEM)); <span class="comment">// used in serial version 2</span></div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>    n = 1;</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>    min_k = k;</div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>    num_levels = 1;</div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>    ptr += copy_from_mem(ptr, n);</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>    ptr += copy_from_mem(ptr, min_k);</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>    ptr += copy_from_mem(ptr, num_levels);</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    ptr += <span class="keyword">sizeof</span>(uint8_t); <span class="comment">// skip unused byte</span></div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>  }</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>  vector_u32 levels(num_levels + 1, 0, allocator);</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>  <span class="keyword">const</span> uint32_t capacity(kll_helper::compute_total_capacity(k, m, num_levels));</div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>    levels[0] = capacity - 1;</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>    <span class="comment">// the last integer in levels_ is not serialized because it can be derived</span></div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>    ptr += copy_from_mem(ptr, levels.data(), <span class="keyword">sizeof</span>(levels[0]) * num_levels);</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>  }</div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>  levels[num_levels] = capacity;</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>  optional&lt;T&gt; min_item;</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>  optional&lt;T&gt; max_item;</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>  <span class="keywordflow">if</span> (!is_single_item) {</div>
+<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>    <span class="comment">// Space to deserialize min and max.</span></div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>    <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>    T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span> </div>
+<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>    min_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>    max_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>  }</div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>  A alloc(allocator);</div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>  <span class="keyword">auto</span> items_buffer_deleter = [capacity, &amp;alloc](T* ptr) { alloc.deallocate(ptr, capacity); };</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>  std::unique_ptr&lt;T, <span class="keyword">decltype</span>(items_buffer_deleter)&gt; items_buffer(alloc.allocate(capacity), items_buffer_deleter);</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_items = levels[num_levels] - levels[0];</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>  ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;items_buffer.get()[levels[0]], num_items);</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>  <span class="comment">// serde call did not throw, repackage with destrtuctors</span></div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>  std::unique_ptr&lt;T, items_deleter&gt; items(items_buffer.release(), items_deleter(levels[0], capacity, allocator));</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> delta = ptr - <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>  <span class="keywordflow">if</span> (delta != size) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;deserialized size mismatch: &quot;</span> + std::to_string(delta) + <span class="stringliteral">&quot; != &quot;</span> + std::to_string(size));</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_zero_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED)) &gt; 0;</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>  <span class="keywordflow">if</span> (is_single_item) {</div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>    min_item.emplace(items.get()[levels[0]]);</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>    max_item.emplace(items.get()[levels[0]]);</div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>  }</div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>  <span class="keywordflow">return</span> kll_sketch(k, min_k, n, num_levels, std::move(levels), std::move(items), capacity,</div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>      std::move(min_item), std::move(max_item), is_level_zero_sorted, comparator);</div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>}</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span> </div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="comment"> * Gets the normalized rank error given k and pmf.</span></div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span><span class="comment"> * k - the configuration parameter</span></div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span><span class="comment"> * pmf - if true, returns the &quot;double-sided&quot; normalized rank error for the get_PMF() function.</span></div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span><span class="comment"> * Otherwise, it is the &quot;single-sided&quot; normalized rank error for all the other queries.</span></div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span><span class="comment"> * Constants were derived as the best fit to 99 percentile empirically measured max error in thousands of trials</span></div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">kll_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(uint16_t k, <span class="keywordtype">bool</span> pmf) {</div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>  <span class="keywordflow">return</span> pmf</div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>      ? 2.446 / pow(k, 0.9433)</div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>      : 2.296 / pow(k, 0.9723);</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>}</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span> </div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span><span class="comment">// for deserialization</span></div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>kll_sketch&lt;T, C, A&gt;::kll_sketch(uint16_t k, uint16_t min_k, uint64_t n, uint8_t num_levels, vector_u32&amp;&amp; levels,</div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>    std::unique_ptr&lt;T, items_deleter&gt; items, uint32_t items_size, optional&lt;T&gt;&amp;&amp; min_item,</div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    optional&lt;T&gt;&amp;&amp; max_item, <span class="keywordtype">bool</span> is_level_zero_sorted, <span class="keyword">const</span> C&amp; comparator):</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>comparator_(comparator),</div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>allocator_(levels.get_allocator()),</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>k_(k),</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>m_(kll_constants::DEFAULT_M),</div>
+<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>min_k_(min_k),</div>
+<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>num_levels_(num_levels),</div>
+<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>is_level_zero_sorted_(is_level_zero_sorted),</div>
+<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>n_(n),</div>
+<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>levels_(std::move(levels)),</div>
+<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>items_(items.release()),</div>
+<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>items_size_(items_size),</div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>min_item_(std::move(min_item)),</div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>max_item_(std::move(max_item)),</div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>{}</div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span> </div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span><span class="comment">// The following code is only valid in the special case of exactly reaching capacity while updating.</span></div>
+<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span><span class="comment">// It cannot be used while merging, while reducing k, or anything else.</span></div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::compress_while_updating(<span class="keywordtype">void</span>) {</div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>  <span class="keyword">const</span> uint8_t level = find_level_to_compact();</div>
+<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span> </div>
+<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>  <span class="comment">// It is important to add the new top level right here. Be aware that this operation</span></div>
+<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>  <span class="comment">// grows the buffer and shifts the data and also the boundaries of the data and grows the</span></div>
+<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>  <span class="comment">// levels array and increments num_levels_</span></div>
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>  <span class="keywordflow">if</span> (level == (num_levels_ - 1)) {</div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>    add_empty_top_level_to_completely_full_sketch();</div>
+<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>  }</div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span> </div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>  <span class="keyword">const</span> uint32_t raw_beg = levels_[level];</div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span>  <span class="keyword">const</span> uint32_t raw_lim = levels_[level + 1];</div>
+<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>  <span class="comment">// +2 is OK because we already added a new top level if necessary</span></div>
+<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>  <span class="keyword">const</span> uint32_t pop_above = levels_[level + 2] - raw_lim;</div>
+<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>  <span class="keyword">const</span> uint32_t raw_pop = raw_lim - raw_beg;</div>
+<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> odd_pop = kll_helper::is_odd(raw_pop);</div>
+<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>  <span class="keyword">const</span> uint32_t adj_beg = odd_pop ? raw_beg + 1 : raw_beg;</div>
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>  <span class="keyword">const</span> uint32_t adj_pop = odd_pop ? raw_pop - 1 : raw_pop;</div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>  <span class="keyword">const</span> uint32_t half_adj_pop = adj_pop / 2;</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>  <span class="keyword">const</span> uint32_t destroy_beg = levels_[0];</div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span> </div>
+<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>  <span class="comment">// level zero might not be sorted, so we must sort it if we wish to compact it</span></div>
+<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>  <span class="comment">// sort_level_zero() is not used here because of the adjustment for odd number of items</span></div>
+<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>  <span class="keywordflow">if</span> ((level == 0) &amp;&amp; !is_level_zero_sorted_) {</div>
+<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span>    std::sort(items_ + adj_beg, items_ + adj_beg + adj_pop, comparator_);</div>
+<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>  }</div>
+<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>  <span class="keywordflow">if</span> (pop_above == 0) {</div>
+<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>    kll_helper::randomly_halve_up(items_, adj_beg, adj_pop);</div>
+<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>    kll_helper::randomly_halve_down(items_, adj_beg, adj_pop);</div>
+<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>    kll_helper::merge_sorted_arrays&lt;T, C&gt;(items_, adj_beg, half_adj_pop, raw_lim, pop_above, adj_beg + half_adj_pop);</div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>  }</div>
+<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>  levels_[level + 1] -= half_adj_pop; <span class="comment">// adjust boundaries of the level above</span></div>
+<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>  <span class="keywordflow">if</span> (odd_pop) {</div>
+<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    levels_[level] = levels_[level + 1] - 1; <span class="comment">// the current level now contains one item</span></div>
+<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>    <span class="keywordflow">if</span> (levels_[level] != raw_beg) items_[levels_[level]] = std::move(items_[raw_beg]); <span class="comment">// namely this leftover guy</span></div>
+<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>    levels_[level] = levels_[level + 1]; <span class="comment">// the current level is now empty</span></div>
+<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>  }</div>
+<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span> </div>
+<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span>  <span class="comment">// verify that we freed up half_adj_pop array slots just below the current level</span></div>
+<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>  <span class="keywordflow">if</span> (levels_[level] != (raw_beg + half_adj_pop)) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;compaction error&quot;</span>);</div>
+<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span> </div>
+<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span>  <span class="comment">// finally, we need to shift up the data in the levels below</span></div>
+<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span>  <span class="comment">// so that the freed-up space can be used by level zero</span></div>
+<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>  <span class="keywordflow">if</span> (level &gt; 0) {</div>
+<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>    <span class="keyword">const</span> uint32_t amount = raw_beg - levels_[0];</div>
+<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span>    std::move_backward(items_ + levels_[0], items_ + levels_[0] + amount, items_ + levels_[0] + half_adj_pop + amount);</div>
+<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span>    <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl &lt; level; lvl++) levels_[lvl] += half_adj_pop;</div>
+<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span>  }</div>
+<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; half_adj_pop; i++) items_[i + destroy_beg].~T();</div>
+<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>}</div>
+<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span> </div>
+<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>uint8_t kll_sketch&lt;T, C, A&gt;::find_level_to_compact()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>  uint8_t level = 0;</div>
+<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>    <span class="keywordflow">if</span> (level &gt;= num_levels_) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;capacity calculation error&quot;</span>);</div>
+<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>    <span class="keyword">const</span> uint32_t pop = levels_[level + 1] - levels_[level];</div>
+<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span>    <span class="keyword">const</span> uint32_t cap = kll_helper::level_capacity(k_, num_levels_, level, m_);</div>
+<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span>    <span class="keywordflow">if</span> (pop &gt;= cap) {</div>
+<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span>      <span class="keywordflow">return</span> level;</div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>    }</div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>    level++;</div>
+<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>  }</div>
+<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>}</div>
+<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span> </div>
+<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::add_empty_top_level_to_completely_full_sketch() {</div>
+<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span>  <span class="keyword">const</span> uint32_t cur_total_cap = levels_[num_levels_];</div>
+<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span> </div>
+<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>  <span class="comment">// make sure that we are following a certain growth scheme</span></div>
+<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>  <span class="keywordflow">if</span> (levels_[0] != 0) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;full sketch expected&quot;</span>);</div>
+<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>  <span class="keywordflow">if</span> (items_size_ != cur_total_cap) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;current capacity mismatch&quot;</span>);</div>
 <div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span> </div>
-<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>  <span class="comment">// move (and shift) the current data into the new buffer</span></div>
-<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span>  T* new_buf = allocator_.allocate(new_total_cap);</div>
-<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span>  kll_helper::move_construct&lt;T&gt;(items_, 0, cur_total_cap, new_buf, delta_cap, <span class="keyword">true</span>);</div>
-<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span>  allocator_.deallocate(items_, items_size_);</div>
-<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span>  items_ = new_buf;</div>
-<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>  items_size_ = new_total_cap;</div>
-<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span> </div>
-<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>  <span class="comment">// this loop includes the old &quot;extra&quot; index at the top</span></div>
-<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span>  <span class="keywordflow">for</span> (uint8_t i = 0; i &lt;= num_levels_; i++) {</div>
-<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span>    levels_[i] += delta_cap;</div>
-<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>  }</div>
-<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span> </div>
-<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>  <span class="keywordflow">if</span> (levels_[num_levels_] != new_total_cap) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;new capacity mismatch&quot;</span>);</div>
-<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span> </div>
-<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>  num_levels_++;</div>
-<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>  levels_[num_levels_] = new_total_cap; <span class="comment">// initialize the new &quot;extra&quot; index at the top</span></div>
-<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>}</div>
-<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span> </div>
-<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::sort_level_zero() {</div>
-<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span>  <span class="keywordflow">if</span> (!is_level_zero_sorted_) {</div>
-<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span>    std::sort(items_ + levels_[0], items_ + levels_[1], comparator_);</div>
-<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span>    is_level_zero_sorted_ = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>  }</div>
-<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>}</div>
-<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span> </div>
-<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_sorting()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>  <span class="comment">// not checking level 0</span></div>
-<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>  <span class="keywordflow">for</span> (uint8_t level = 1; level &lt; num_levels_; ++level) {</div>
-<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span>    <span class="keyword">const</span> <span class="keyword">auto</span> from = items_ + levels_[level];</div>
-<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>    <span class="keyword">const</span> <span class="keyword">auto</span> to = items_ + levels_[level + 1];</div>
-<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span>    <span class="keywordflow">if</span> (!std::is_sorted(from, to, comparator_)) {</div>
-<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;levels must be sorted&quot;</span>);</div>
-<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>    }</div>
-<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>  }</div>
-<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>}</div>
-<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span> </div>
-<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00760" data-start="{" data-end="}">
-<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">  760</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">kll_sketch&lt;T, C, A&gt;::get_sorted_view</a>()<span class="keyword"> const </ [...]
-<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>  <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;sort_level_zero(); <span class="comment">// allow this side effect</span></div>
-<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> view(get_num_retained(), comparator_, allocator_);</div>
-<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>  <span class="keywordflow">for</span> (uint8_t level = 0; level &lt; num_levels_; ++level) {</div>
-<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>    <span class="keyword">const</span> <span class="keyword">auto</span> from = items_ + levels_[level];</div>
-<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>    <span class="keyword">const</span> <span class="keyword">auto</span> to = items_ + levels_[level + 1]; <span class="comment">// exclusive</span></div>
-<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>    view.add(from, to, 1ULL &lt;&lt; level);</div>
-<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>  }</div>
-<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span>  view.convert_to_cummulative();</div>
-<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span>  <span class="keywordflow">return</span> view;</div>
-<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span>}</div>
+<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>  <span class="comment">// note that merging MIGHT over-grow levels_, in which case we might not have to grow it here</span></div>
+<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span>  <span class="keyword">const</span> uint8_t new_levels_size = num_levels_ + 2;</div>
+<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span>  <span class="keywordflow">if</span> (levels_.size() &lt; new_levels_size) {</div>
+<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span>    levels_.resize(new_levels_size);</div>
+<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span>  }</div>
+<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span> </div>
+<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span>  <span class="keyword">const</span> uint32_t delta_cap = kll_helper::level_capacity(k_, num_levels_ + 1, 0, m_);</div>
+<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>  <span class="keyword">const</span> uint32_t new_total_cap = cur_total_cap + delta_cap;</div>
+<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span> </div>
+<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span>  <span class="comment">// move (and shift) the current data into the new buffer</span></div>
+<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>  T* new_buf = allocator_.allocate(new_total_cap);</div>
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>  kll_helper::move_construct&lt;T&gt;(items_, 0, cur_total_cap, new_buf, delta_cap, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>  allocator_.deallocate(items_, items_size_);</div>
+<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>  items_ = new_buf;</div>
+<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>  items_size_ = new_total_cap;</div>
+<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span> </div>
+<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>  <span class="comment">// this loop includes the old &quot;extra&quot; index at the top</span></div>
+<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span>  <span class="keywordflow">for</span> (uint8_t i = 0; i &lt;= num_levels_; i++) {</div>
+<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span>    levels_[i] += delta_cap;</div>
+<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>  }</div>
+<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span> </div>
+<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span>  <span class="keywordflow">if</span> (levels_[num_levels_] != new_total_cap) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;new capacity mismatch&quot;</span>);</div>
+<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span> </div>
+<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>  num_levels_++;</div>
+<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>  levels_[num_levels_] = new_total_cap; <span class="comment">// initialize the new &quot;extra&quot; index at the top</span></div>
+<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>}</div>
+<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span> </div>
+<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::sort_level_zero() {</div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>  <span class="keywordflow">if</span> (!is_level_zero_sorted_) {</div>
+<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span>    std::sort(items_ + levels_[0], items_ + levels_[1], comparator_);</div>
+<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>    is_level_zero_sorted_ = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span>  }</div>
+<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>}</div>
+<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span> </div>
+<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_sorting()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>  <span class="comment">// not checking level 0</span></div>
+<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span>  <span class="keywordflow">for</span> (uint8_t level = 1; level &lt; num_levels_; ++level) {</div>
+<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span>    <span class="keyword">const</span> <span class="keyword">auto</span> from = items_ + levels_[level];</div>
+<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>    <span class="keyword">const</span> <span class="keyword">auto</span> to = items_ + levels_[level + 1];</div>
+<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span>    <span class="keywordflow">if</span> (!std::is_sorted(from, to, comparator_)) {</div>
+<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;levels must be sorted&quot;</span>);</div>
+<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>    }</div>
+<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>  }</div>
+<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>}</div>
+<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span> </div>
+<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00769" data-start="{" data-end="}">
+<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">  769</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">kll_sketch&lt;T, C, A&gt;::get_sorted_view</a>()<span class="keyword"> const </ [...]
+<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span>  <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;sort_level_zero(); <span class="comment">// allow this side effect</span></div>
+<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> view(get_num_retained(), comparator_, allocator_);</div>
+<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>  <span class="keywordflow">for</span> (uint8_t level = 0; level &lt; num_levels_; ++level) {</div>
+<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>    <span class="keyword">const</span> <span class="keyword">auto</span> from = items_ + levels_[level];</div>
+<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>    <span class="keyword">const</span> <span class="keyword">auto</span> to = items_ + levels_[level + 1]; <span class="comment">// exclusive</span></div>
+<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>    view.add(from, to, 1ULL &lt;&lt; level);</div>
+<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span>  }</div>
+<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span>  view.convert_to_cummulative();</div>
+<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span>  <span class="keywordflow">return</span> view;</div>
+<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>}</div>
 </div>
-<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span> </div>
-<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> O&gt;</div>
-<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::merge_higher_levels</a>(O&amp;&amp; other, uint64_t final_n) {</div>
-<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>  <span class="keyword">const</span> uint32_t tmp_num_items = get_num_retained() + other.get_num_retained_above_level_zero();</div>
-<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span>  A alloc(allocator_);</div>
-<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span>  <span class="keyword">auto</span> tmp_items_deleter = [tmp_num_items, &amp;alloc](T* ptr) { alloc.deallocate(ptr, tmp_num_items); }; <span class="comment">// no destructor needed</span></div>
-<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span>  <span class="keyword">const</span> std::unique_ptr&lt;T, <span class="keyword">decltype</span>(tmp_items_deleter)&gt; workbuf(allocator_.allocate(tmp_num_items), tmp_items_deleter);</div>
-<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>  <span class="keyword">const</span> uint8_t ub = kll_helper::ub_on_num_levels(final_n);</div>
-<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> work_levels_size = ub + 2; <span class="comment">// ub+1 does not work</span></div>
-<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>  vector_u32 worklevels(work_levels_size, 0, allocator_);</div>
-<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>  vector_u32 outlevels(work_levels_size, 0, allocator_);</div>
-<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span> </div>
-<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>  <span class="keyword">const</span> uint8_t provisional_num_levels = std::max(num_levels_, other.num_levels_);</div>
-<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span> </div>
-<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>  populate_work_arrays(std::forward&lt;O&gt;(other), workbuf.get(), worklevels.data(), provisional_num_levels);</div>
-<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span> </div>
-<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>  <span class="keyword">const</span> kll_helper::compress_result result = kll_helper::general_compress&lt;T, C&gt;(k_, m_, provisional_num_levels, workbuf.get(),</div>
-<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>      worklevels.data(), outlevels.data(), is_level_zero_sorted_);</div>
-<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span> </div>
-<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>  <span class="comment">// ub can sometimes be much bigger</span></div>
-<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span>  <span class="keywordflow">if</span> (result.final_num_levels &gt; ub) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;merge error&quot;</span>);</div>
-<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span> </div>
-<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span>  <span class="comment">// now we need to transfer the results back into &quot;this&quot; sketch</span></div>
-<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>  <span class="keywordflow">if</span> (result.final_capacity != items_size_) {</div>
-<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>    allocator_.deallocate(items_, items_size_);</div>
-<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>    items_size_ = result.final_capacity;</div>
-<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span>    items_ = allocator_.allocate(items_size_);</div>
-<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span>  }</div>
-<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>  <span class="keyword">const</span> uint32_t free_space_at_bottom = result.final_capacity - result.final_num_items;</div>
-<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>  kll_helper::move_construct&lt;T&gt;(workbuf.get(), outlevels[0], outlevels[0] + result.final_num_items, items_, free_space_at_bottom, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span> </div>
+<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> O&gt;</div>
+<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::merge_higher_levels</a>(O&amp;&amp; other, uint64_t final_n) {</div>
+<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>  <span class="keyword">const</span> uint32_t tmp_num_items = get_num_retained() + other.get_num_retained_above_level_zero();</div>
+<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span>  A alloc(allocator_);</div>
+<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>  <span class="keyword">auto</span> tmp_items_deleter = [tmp_num_items, &amp;alloc](T* ptr) { alloc.deallocate(ptr, tmp_num_items); }; <span class="comment">// no destructor needed</span></div>
+<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span>  <span class="keyword">const</span> std::unique_ptr&lt;T, <span class="keyword">decltype</span>(tmp_items_deleter)&gt; workbuf(allocator_.allocate(tmp_num_items), tmp_items_deleter);</div>
+<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>  <span class="keyword">const</span> uint8_t ub = kll_helper::ub_on_num_levels(final_n);</div>
+<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> work_levels_size = ub + 2; <span class="comment">// ub+1 does not work</span></div>
+<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>  vector_u32 worklevels(work_levels_size, 0, allocator_);</div>
+<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>  vector_u32 outlevels(work_levels_size, 0, allocator_);</div>
+<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span> </div>
+<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span>  <span class="keyword">const</span> uint8_t provisional_num_levels = std::max(num_levels_, other.num_levels_);</div>
+<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span> </div>
+<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>  populate_work_arrays(std::forward&lt;O&gt;(other), workbuf.get(), worklevels.data(), provisional_num_levels);</div>
+<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span> </div>
+<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>  <span class="keyword">const</span> kll_helper::compress_result result = kll_helper::general_compress&lt;T, C&gt;(k_, m_, provisional_num_levels, workbuf.get(),</div>
+<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span>      worklevels.data(), outlevels.data(), is_level_zero_sorted_);</div>
+<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span> </div>
+<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>  <span class="comment">// ub can sometimes be much bigger</span></div>
+<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>  <span class="keywordflow">if</span> (result.final_num_levels &gt; ub) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;merge error&quot;</span>);</div>
 <div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span> </div>
-<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_levels_size = result.final_num_levels + 1;</div>
-<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span>  <span class="keywordflow">if</span> (levels_.size() &lt; new_levels_size) {</div>
-<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>    levels_.resize(new_levels_size);</div>
-<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span>  }</div>
-<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>  <span class="keyword">const</span> uint32_t offset = free_space_at_bottom - outlevels[0];</div>
-<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>  <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl &lt; levels_.size(); lvl++) { <span class="comment">// includes the &quot;extra&quot; index</span></div>
-<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>    levels_[lvl] = outlevels[lvl] + offset;</div>
-<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>  }</div>
-<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span>  num_levels_ = result.final_num_levels;</div>
-<div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>}</div>
-<div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span> </div>
-<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span><span class="comment">// this leaves items_ uninitialized (all objects moved out and destroyed)</span></div>
-<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
-<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::populate_work_arrays(FwdSk&amp;&amp; other, T* workbuf, uint32_t* worklevels, uint8_t provisional_num_levels) {</div>
-<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>  worklevels[0] = 0;</div>
-<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span> </div>
-<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>  <span class="comment">// the level zero data from &quot;other&quot; was already inserted into &quot;this&quot;</span></div>
-<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>  kll_helper::move_construct&lt;T&gt;(items_, levels_[0], levels_[1], workbuf, 0, <span class="keyword">true</span>);</div>
-<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span>  worklevels[1] = safe_level_size(0);</div>
-<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span> </div>
-<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>  <span class="keywordflow">for</span> (uint8_t lvl = 1; lvl &lt; provisional_num_levels; lvl++) {</div>
-<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>    <span class="keyword">const</span> uint32_t self_pop = safe_level_size(lvl);</div>
-<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span>    <span class="keyword">const</span> uint32_t other_pop = other.safe_level_size(lvl);</div>
-<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>    worklevels[lvl + 1] = worklevels[lvl] + self_pop + other_pop;</div>
+<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span>  <span class="comment">// now we need to transfer the results back into &quot;this&quot; sketch</span></div>
+<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span>  <span class="keywordflow">if</span> (result.final_capacity != items_size_) {</div>
+<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>    allocator_.deallocate(items_, items_size_);</div>
+<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span>    items_size_ = result.final_capacity;</div>
+<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>    items_ = allocator_.allocate(items_size_);</div>
+<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>  }</div>
+<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>  <span class="keyword">const</span> uint32_t free_space_at_bottom = result.final_capacity - result.final_num_items;</div>
+<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>  kll_helper::move_construct&lt;T&gt;(workbuf.get(), outlevels[0], outlevels[0] + result.final_num_items, items_, free_space_at_bottom, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span> </div>
+<div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_levels_size = result.final_num_levels + 1;</div>
+<div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span>  <span class="keywordflow">if</span> (levels_.size() &lt; new_levels_size) {</div>
+<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span>    levels_.resize(new_levels_size);</div>
+<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span>  }</div>
+<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>  <span class="keyword">const</span> uint32_t offset = free_space_at_bottom - outlevels[0];</div>
+<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span>  <span class="keywordflow">for</span> (uint8_t lvl = 0; lvl &lt; levels_.size(); lvl++) { <span class="comment">// includes the &quot;extra&quot; index</span></div>
+<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>    levels_[lvl] = outlevels[lvl] + offset;</div>
+<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span>  }</div>
+<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>  num_levels_ = result.final_num_levels;</div>
+<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>}</div>
+<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span> </div>
+<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span><span class="comment">// this leaves items_ uninitialized (all objects moved out and destroyed)</span></div>
+<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
+<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::populate_work_arrays(FwdSk&amp;&amp; other, T* workbuf, uint32_t* worklevels, uint8_t provisional_num_levels) {</div>
+<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>  worklevels[0] = 0;</div>
 <div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span> </div>
-<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span>    <span class="keywordflow">if</span> ((self_pop &gt; 0) &amp;&amp; (other_pop == 0)) {</div>
-<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span>      kll_helper::move_construct&lt;T&gt;(items_, levels_[lvl], levels_[lvl] + self_pop, workbuf, worklevels[lvl], <span class="keyword">true</span>);</div>
-<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((self_pop == 0) &amp;&amp; (other_pop &gt; 0)) {</div>
-<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span>      <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = other.levels_[lvl], j = worklevels[lvl]; i &lt; other.levels_[lvl] + other_pop; ++i, ++j) {</div>
-<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span>        <span class="keyword">new</span> (&amp;workbuf[j]) T(conditional_forward&lt;FwdSk&gt;(other.items_[i]));</div>
-<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span>      }</div>
-<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((self_pop &gt; 0) &amp;&amp; (other_pop &gt; 0)) {</div>
-<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>      kll_helper::merge_sorted_arrays&lt;T, C&gt;(items_, levels_[lvl], self_pop, other.items_, other.levels_[lvl], other_pop, workbuf, worklevels[lvl]);</div>
-<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>    }</div>
-<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span>  }</div>
-<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span>}</div>
-<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span> </div>
-<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::assert_correct_total_weight()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span>  <span class="keyword">const</span> uint64_t total(kll_helper::sum_the_sample_weights(num_levels_, levels_.data()));</div>
-<div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span>  <span class="keywordflow">if</span> (total != n_) {</div>
-<div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Total weight does not match N&quot;</span>);</div>
-<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>  }</div>
-<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span>}</div>
-<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span> </div>
-<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span>uint32_t kll_sketch&lt;T, C, A&gt;::safe_level_size(uint8_t level)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span>  <span class="keywordflow">if</span> (level &gt;= num_levels_) <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span>  <span class="keywordflow">return</span> levels_[level + 1] - levels_[level];</div>
-<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span>}</div>
-<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span> </div>
-<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span>uint32_t kll_sketch&lt;T, C, A&gt;::get_num_retained_above_level_zero()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span>  <span class="keywordflow">if</span> (num_levels_ == 1) <span class="keywordflow">return</span> 0;</div>
-<div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span>  <span class="keywordflow">return</span> levels_[num_levels_] - levels_[1];</div>
-<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>}</div>
-<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span> </div>
-<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_m(uint8_t m) {</div>
-<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span>  <span class="keywordflow">if</span> (m != kll_constants::DEFAULT_M) {</div>
-<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: M must be &quot;</span> + std::to_string(kll_constants::DEFAULT_M)</div>
-<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span>        + <span class="stringliteral">&quot;: &quot;</span> + std::to_string(m));</div>
-<div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span>  }</div>
-<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>}</div>
-<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span> </div>
-<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_preamble_ints(uint8_t preamble_ints, uint8_t flags_byte) {</div>
-<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY));</div>
-<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte &amp; (1 &lt;&lt; flags::IS_SINGLE_ITEM));</div>
-<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span>  <span class="keywordflow">if</span> (is_empty || is_single_item) {</div>
-<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span>    <span class="keywordflow">if</span> (preamble_ints != PREAMBLE_INTS_SHORT) {</div>
-<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span>      <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: preamble ints must be &quot;</span></div>
-<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>          + std::to_string(PREAMBLE_INTS_SHORT) + <span class="stringliteral">&quot; for an empty or single item sketch: &quot;</span> + std::to_string(preamble_ints));</div>
-<div class="line"><a id="l00877" name="l00877"></a><span class="lineno">  877</span>    }</div>
-<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>    <span class="keywordflow">if</span> (preamble_ints != PREAMBLE_INTS_FULL) {</div>
-<div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span>      <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: preamble ints must be &quot;</span></div>
-<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span>          + std::to_string(PREAMBLE_INTS_FULL) + <span class="stringliteral">&quot; for a sketch with more than one item: &quot;</span> + std::to_string(preamble_ints));</div>
-<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span>    }</div>
-<div class="line"><a id="l00883" name="l00883"></a><span class="lineno">  883</span>  }</div>
-<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span>}</div>
-<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span> </div>
-<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_serial_version(uint8_t serial_version) {</div>
-<div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span>  <span class="keywordflow">if</span> (serial_version != SERIAL_VERSION_1 &amp;&amp; serial_version != SERIAL_VERSION_2) {</div>
-<div class="line"><a id="l00889" name="l00889"></a><span class="lineno">  889</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: serial version mismatch: expected &quot;</span></div>
-<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span>        + std::to_string(SERIAL_VERSION_1) + <span class="stringliteral">&quot; or &quot;</span> + std::to_string(SERIAL_VERSION_2)</div>
-<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>        + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(serial_version));</div>
+<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span>  <span class="comment">// the level zero data from &quot;other&quot; was already inserted into &quot;this&quot;</span></div>
+<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span>  kll_helper::move_construct&lt;T&gt;(items_, levels_[0], levels_[1], workbuf, 0, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span>  worklevels[1] = safe_level_size(0);</div>
+<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span> </div>
+<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span>  <span class="keywordflow">for</span> (uint8_t lvl = 1; lvl &lt; provisional_num_levels; lvl++) {</div>
+<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span>    <span class="keyword">const</span> uint32_t self_pop = safe_level_size(lvl);</div>
+<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span>    <span class="keyword">const</span> uint32_t other_pop = other.safe_level_size(lvl);</div>
+<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>    worklevels[lvl + 1] = worklevels[lvl] + self_pop + other_pop;</div>
+<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span> </div>
+<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span>    <span class="keywordflow">if</span> ((self_pop &gt; 0) &amp;&amp; (other_pop == 0)) {</div>
+<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span>      kll_helper::move_construct&lt;T&gt;(items_, levels_[lvl], levels_[lvl] + self_pop, workbuf, worklevels[lvl], <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((self_pop == 0) &amp;&amp; (other_pop &gt; 0)) {</div>
+<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span>      <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = other.levels_[lvl], j = worklevels[lvl]; i &lt; other.levels_[lvl] + other_pop; ++i, ++j) {</div>
+<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span>        <span class="keyword">new</span> (&amp;workbuf[j]) T(conditional_forward&lt;FwdSk&gt;(other.items_[i]));</div>
+<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span>      }</div>
+<div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((self_pop &gt; 0) &amp;&amp; (other_pop &gt; 0)) {</div>
+<div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>      kll_helper::merge_sorted_arrays&lt;T, C&gt;(items_, levels_[lvl], self_pop, other.items_, other.levels_[lvl], other_pop, workbuf, worklevels[lvl]);</div>
+<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>    }</div>
+<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span>  }</div>
+<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span>}</div>
+<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span> </div>
+<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::assert_correct_total_weight()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span>  <span class="keyword">const</span> uint64_t total(kll_helper::sum_the_sample_weights(num_levels_, levels_.data()));</div>
+<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span>  <span class="keywordflow">if</span> (total != n_) {</div>
+<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Total weight does not match N&quot;</span>);</div>
+<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>  }</div>
+<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span>}</div>
+<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span> </div>
+<div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>uint32_t kll_sketch&lt;T, C, A&gt;::safe_level_size(uint8_t level)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span>  <span class="keywordflow">if</span> (level &gt;= num_levels_) <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span>  <span class="keywordflow">return</span> levels_[level + 1] - levels_[level];</div>
+<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span>}</div>
+<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span> </div>
+<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span>uint32_t kll_sketch&lt;T, C, A&gt;::get_num_retained_above_level_zero()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span>  <span class="keywordflow">if</span> (num_levels_ == 1) <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>  <span class="keywordflow">return</span> levels_[num_levels_] - levels_[1];</div>
+<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span>}</div>
+<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span> </div>
+<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_m(uint8_t m) {</div>
+<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span>  <span class="keywordflow">if</span> (m != kll_constants::DEFAULT_M) {</div>
+<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: M must be &quot;</span> + std::to_string(kll_constants::DEFAULT_M)</div>
+<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span>        + <span class="stringliteral">&quot;: &quot;</span> + std::to_string(m));</div>
+<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span>  }</div>
+<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>}</div>
+<div class="line"><a id="l00877" name="l00877"></a><span class="lineno">  877</span> </div>
+<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_preamble_ints(uint8_t preamble_ints, uint8_t flags_byte) {</div>
+<div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty(flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY));</div>
+<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_single_item(flags_byte &amp; (1 &lt;&lt; flags::IS_SINGLE_ITEM));</div>
+<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span>  <span class="keywordflow">if</span> (is_empty || is_single_item) {</div>
+<div class="line"><a id="l00883" name="l00883"></a><span class="lineno">  883</span>    <span class="keywordflow">if</span> (preamble_ints != PREAMBLE_INTS_SHORT) {</div>
+<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span>      <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: preamble ints must be &quot;</span></div>
+<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span>          + std::to_string(PREAMBLE_INTS_SHORT) + <span class="stringliteral">&quot; for an empty or single item sketch: &quot;</span> + std::to_string(preamble_ints));</div>
+<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span>    }</div>
+<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span>    <span class="keywordflow">if</span> (preamble_ints != PREAMBLE_INTS_FULL) {</div>
+<div class="line"><a id="l00889" name="l00889"></a><span class="lineno">  889</span>      <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: preamble ints must be &quot;</span></div>
+<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span>          + std::to_string(PREAMBLE_INTS_FULL) + <span class="stringliteral">&quot; for a sketch with more than one item: &quot;</span> + std::to_string(preamble_ints));</div>
+<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>    }</div>
 <div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span>  }</div>
 <div class="line"><a id="l00893" name="l00893"></a><span class="lineno">  893</span>}</div>
 <div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span> </div>
 <div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_family_id(uint8_t family_id) {</div>
-<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span>  <span class="keywordflow">if</span> (family_id != FAMILY) {</div>
-<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: family mismatch: expected &quot;</span></div>
-<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span>        + std::to_string(FAMILY) + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(family_id));</div>
-<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>  }</div>
-<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span>}</div>
-<div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span> </div>
-<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00904" data-start="{" data-end="}">
-<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">  904</a></span>string&lt;A&gt; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">kll_sketch&lt;T, C, A&gt;::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 id="l00905" name="l00905"></a><span class="lineno">  905</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div>
-<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div>
-<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span>  std::ostringstream os;</div>
-<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span>  os &lt;&lt; <span class="stringliteral">&quot;### KLL sketch summary:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span>  os &lt;&lt; <span class="stringliteral">&quot;   K              : &quot;</span> &lt;&lt; k_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span>  os &lt;&lt; <span class="stringliteral">&quot;   min K          : &quot;</span> &lt;&lt; min_k_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span>  os &lt;&lt; <span class="stringliteral">&quot;   M              : &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) m_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span>  os &lt;&lt; <span class="stringliteral">&quot;   N              : &quot;</span> &lt;&lt; n_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon        : &quot;</span> &lt;&lt; std::setprecision(3) &lt;&lt; get_normalized_rank_error(<span class="keyword">false</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon PMF    : &quot;</span> &lt;&lt; get_normalized_rank_error(<span class="keyword">true</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span>  os &lt;&lt; <span class="stringliteral">&quot;   Empty          : &quot;</span> &lt;&lt; (is_empty() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span>  os &lt;&lt; <span class="stringliteral">&quot;   Estimation mode: &quot;</span> &lt;&lt; (is_estimation_mode() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span>  os &lt;&lt; <span class="stringliteral">&quot;   Levels         : &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) num_levels_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span>  os &lt;&lt; <span class="stringliteral">&quot;   Sorted         : &quot;</span> &lt;&lt; (is_level_zero_sorted_ ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span>  os &lt;&lt; <span class="stringliteral">&quot;   Capacity items : &quot;</span> &lt;&lt; items_size_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span>  os &lt;&lt; <span class="stringliteral">&quot;   Retained items : &quot;</span> &lt;&lt; get_num_retained() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span>    os &lt;&lt; <span class="stringliteral">&quot;   Min item      : &quot;</span> &lt;&lt; *min_item_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span>    os &lt;&lt; <span class="stringliteral">&quot;   Max item      : &quot;</span> &lt;&lt; *max_item_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span>  }</div>
-<div class="line"><a id="l00925" name="l00925"></a><span class="lineno">  925</span>  os &lt;&lt; <span class="stringliteral">&quot;### End sketch summary&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span> </div>
-<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span>  <span class="keywordflow">if</span> (print_levels) {</div>
-<div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span>    os &lt;&lt; <span class="stringliteral">&quot;### KLL sketch levels:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span>    os &lt;&lt; <span class="stringliteral">&quot;   index: nominal capacity, actual size&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; num_levels_; i++) {</div>
-<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>      os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; kll_helper::level_capacity(k_, num_levels_, i, m_) &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; safe_level_size(i) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span>    }</div>
-<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch levels&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span>  }</div>
+<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_serial_version(uint8_t serial_version) {</div>
+<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span>  <span class="keywordflow">if</span> (serial_version != SERIAL_VERSION_1 &amp;&amp; serial_version != SERIAL_VERSION_2) {</div>
+<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: serial version mismatch: expected &quot;</span></div>
+<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span>        + std::to_string(SERIAL_VERSION_1) + <span class="stringliteral">&quot; or &quot;</span> + std::to_string(SERIAL_VERSION_2)</div>
+<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>        + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(serial_version));</div>
+<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span>  }</div>
+<div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span>}</div>
+<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span> </div>
+<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::check_family_id(uint8_t family_id) {</div>
+<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span>  <span class="keywordflow">if</span> (family_id != FAMILY) {</div>
+<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: family mismatch: expected &quot;</span></div>
+<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span>        + std::to_string(FAMILY) + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(family_id));</div>
+<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span>  }</div>
+<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span>}</div>
+<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span> </div>
+<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00913" data-start="{" data-end="}">
+<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">  913</a></span>string&lt;A&gt; <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">kll_sketch&lt;T, C, A&gt;::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 id="l00914" name="l00914"></a><span class="lineno">  914</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div>
+<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div>
+<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span>  std::ostringstream os;</div>
+<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span>  os &lt;&lt; <span class="stringliteral">&quot;### KLL sketch summary:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span>  os &lt;&lt; <span class="stringliteral">&quot;   K              : &quot;</span> &lt;&lt; k_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span>  os &lt;&lt; <span class="stringliteral">&quot;   min K          : &quot;</span> &lt;&lt; min_k_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span>  os &lt;&lt; <span class="stringliteral">&quot;   M              : &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) m_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span>  os &lt;&lt; <span class="stringliteral">&quot;   N              : &quot;</span> &lt;&lt; n_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon        : &quot;</span> &lt;&lt; std::setprecision(3) &lt;&lt; get_normalized_rank_error(<span class="keyword">false</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon PMF    : &quot;</span> &lt;&lt; get_normalized_rank_error(<span class="keyword">true</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span>  os &lt;&lt; <span class="stringliteral">&quot;   Empty          : &quot;</span> &lt;&lt; (is_empty() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00925" name="l00925"></a><span class="lineno">  925</span>  os &lt;&lt; <span class="stringliteral">&quot;   Estimation mode: &quot;</span> &lt;&lt; (is_estimation_mode() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span>  os &lt;&lt; <span class="stringliteral">&quot;   Levels         : &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) num_levels_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span>  os &lt;&lt; <span class="stringliteral">&quot;   Sorted         : &quot;</span> &lt;&lt; (is_level_zero_sorted_ ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span>  os &lt;&lt; <span class="stringliteral">&quot;   Capacity items : &quot;</span> &lt;&lt; items_size_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span>  os &lt;&lt; <span class="stringliteral">&quot;   Retained items : &quot;</span> &lt;&lt; get_num_retained() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>    os &lt;&lt; <span class="stringliteral">&quot;   Min item      : &quot;</span> &lt;&lt; *min_item_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span>    os &lt;&lt; <span class="stringliteral">&quot;   Max item      : &quot;</span> &lt;&lt; *max_item_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span>  }</div>
+<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span>  os &lt;&lt; <span class="stringliteral">&quot;### End sketch summary&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span> </div>
-<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>  <span class="keywordflow">if</span> (print_items) {</div>
-<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>    os &lt;&lt; <span class="stringliteral">&quot;### KLL sketch data:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span>    uint8_t level = 0;</div>
-<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>    <span class="keywordflow">while</span> (level &lt; num_levels_) {</div>
-<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>      <span class="keyword">const</span> uint32_t from_index = levels_[level];</div>
-<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span>      <span class="keyword">const</span> uint32_t to_index = levels_[level + 1]; <span class="comment">// exclusive</span></div>
-<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span>      <span class="keywordflow">if</span> (from_index &lt; to_index) {</div>
-<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span>        os &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) level &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span>      }</div>
-<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span>      <span class="keywordflow">for</span> (uint32_t i = from_index; i &lt; to_index; i++) {</div>
-<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span>        os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; items_[i] &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span>      }</div>
-<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>      level++;</div>
-<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>    }</div>
-<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch data&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span>  }</div>
-<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span>  <span class="keywordflow">return</span> string&lt;A&gt;(os.str().c_str(), allocator_);</div>
-<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span>}</div>
+<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>  <span class="keywordflow">if</span> (print_levels) {</div>
+<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>    os &lt;&lt; <span class="stringliteral">&quot;### KLL sketch levels:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span>    os &lt;&lt; <span class="stringliteral">&quot;   index: nominal capacity, actual size&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; num_levels_; i++) {</div>
+<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>      os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; kll_helper::level_capacity(k_, num_levels_, i, m_) &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; safe_level_size(i) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span>    }</div>
+<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch levels&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span>  }</div>
+<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span> </div>
+<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span>  <span class="keywordflow">if</span> (print_items) {</div>
+<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span>    os &lt;&lt; <span class="stringliteral">&quot;### KLL sketch data:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span>    uint8_t level = 0;</div>
+<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>    <span class="keywordflow">while</span> (level &lt; num_levels_) {</div>
+<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>      <span class="keyword">const</span> uint32_t from_index = levels_[level];</div>
+<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span>      <span class="keyword">const</span> uint32_t to_index = levels_[level + 1]; <span class="comment">// exclusive</span></div>
+<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span>      <span class="keywordflow">if</span> (from_index &lt; to_index) {</div>
+<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span>        os &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) level &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span>      }</div>
+<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span>      <span class="keywordflow">for</span> (uint32_t i = from_index; i &lt; to_index; i++) {</div>
+<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span>        os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; items_[i] &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00956" name="l00956"></a><span class="lineno">  956</span>      }</div>
+<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>      level++;</div>
+<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span>    }</div>
+<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch data&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span>  }</div>
+<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span>  <span class="keywordflow">return</span> string&lt;A&gt;(os.str().c_str(), allocator_);</div>
+<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span>}</div>
 </div>
-<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span> </div>
-<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00956" data-start="{" data-end="}">
-<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">  956</a></span><span class="keyword">typename</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">kll_sketch&lt;T, C, A&gt;::begin</a>()<span clas [...]
-<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a>(items_, levels_.data(), num_levels_);</div>
-<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span>}</div>
+<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span> </div>
+<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00965" data-start="{" data-end="}">
+<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">  965</a></span><span class="keyword">typename</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">kll_sketch&lt;T, C, A&gt;::begin</a>()<span clas [...]
+<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a>(items_, levels_.data(), num_levels_);</div>
+<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span>}</div>
 </div>
-<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span> </div>
-<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00961" data-start="{" data-end="}">
-<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">  961</a></span><span class="keyword">typename</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">kll_sketch&lt;T, C, A&gt;::end</a>()<span class= [...]
-<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a>(<span class="keyword">nullptr</span>, levels_.data(), num_levels_);</div>
-<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span>}</div>
+<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span> </div>
+<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00970" data-start="{" data-end="}">
+<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"><a class="line" href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">  970</a></span><span class="keyword">typename</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">kll_sketch&lt;T, C, A&gt;::end</a>()<span class= [...]
+<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch&lt;T, C, A&gt;::const_iterator</a>(<span class="keyword">nullptr</span>, levels_.data(), num_levels_);</div>
+<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>}</div>
 </div>
-<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span> </div>
-<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span><span class="keyword">class </span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&lt;T, C, A&gt;::items_deleter {</div>
-<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span>  <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span>  items_deleter(uint32_t start, uint32_t num, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span>    allocator_(allocator), start_(start), num_(num) {}</div>
-<div class="line"><a id="l00970" name="l00970"></a><span class="lineno">  970</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div>
-<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span>    <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>      <span class="keywordflow">for</span> (uint32_t i = start_; i &lt; num_; ++i) ptr[i].~T();</div>
-<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span>      allocator_.deallocate(ptr, num_);</div>
-<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span>    }</div>
-<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span>  }</div>
-<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>  <span class="keyword">private</span>:</div>
-<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span>  A allocator_;</div>
-<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span>  uint32_t start_;</div>
-<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span>  uint32_t num_;</div>
-<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span>};</div>
-<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span> </div>
-<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::setup_sorted_view()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
-<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span>    sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) quantiles_sorted_view&lt;T, C, A&gt;(get_sorted_view());</div>
-<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span>  }</div>
-<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>}</div>
-<div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span> </div>
-<div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::reset_sorted_view() {</div>
-<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span>    sorted_view_-&gt;~quantiles_sorted_view();</div>
+<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span> </div>
+<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span><span class="keyword">class </span><a class="code hl_class" href="classdatasketches_1_1kll__sketch.html">kll_sketch</a>&lt;T, C, A&gt;::items_deleter {</div>
+<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>  <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span>  items_deleter(uint32_t start, uint32_t num, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span>    allocator_(allocator), start_(start), num_(num) {}</div>
+<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div>
+<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span>    <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span>      <span class="keywordflow">for</span> (uint32_t i = start_; i &lt; num_; ++i) ptr[i].~T();</div>
+<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span>      allocator_.deallocate(ptr, num_);</div>
+<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span>    }</div>
+<div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span>  }</div>
+<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>  <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span>  A allocator_;</div>
+<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span>  uint32_t start_;</div>
+<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>  uint32_t num_;</div>
+<div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span>};</div>
+<div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span> </div>
+<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::setup_sorted_view()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
-<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span>    AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div>
-<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span>    sorted_view_ = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span>  }</div>
-<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span>}</div>
-<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span> </div>
-<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span><span class="comment">// kll_sketch::const_iterator implementation</span></div>
-<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> </div>
-<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>kll_sketch&lt;T, C, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> T* items, <span class="keyword">const</span> uint32_t* levels, <span class="keyword">const</span> uint8_t num_levels):</div>
-<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span>items(items), levels(levels), num_levels(num_levels), index(items == nullptr ? levels[num_levels] : levels[0]), level(items == nullptr ? num_levels : 0), weight(1)</div>
-<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span>{}</div>
-<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> </div>
-<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span><span class="keyword">typename</span> kll_sketch&lt;T, C, A&gt;::const_iterator&amp; kll_sketch&lt;T, C, A&gt;::const_iterator::operator++() {</div>
-<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>  ++index;</div>
-<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">if</span> (index == levels[level + 1]) { <span class="comment">// go to the next non-empty level</span></div>
-<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>      ++level;</div>
-<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>      weight *= 2;</div>
-<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>    } <span class="keywordflow">while</span> (level &lt; num_levels &amp;&amp; levels[level] == levels[level + 1]);</div>
-<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>  }</div>
-<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span>}</div>
-<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> </div>
-<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span><span class="keyword">typename</span> kll_sketch&lt;T, C, A&gt;::const_iterator&amp; kll_sketch&lt;T, C, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) {</div>
-<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
-<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>  operator++();</div>
-<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">return</span> tmp;</div>
-<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span>}</div>
-<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> </div>
-<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span><span class="keywordtype">bool</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">return</span> index == other.index;</div>
-<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>}</div>
-<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> </div>
-<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span><span class="keywordtype">bool</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span>  <span class="keywordflow">return</span> !operator==(other);</div>
-<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span>}</div>
-<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> </div>
-<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span><span class="keyword">auto</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
-<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">return</span> value_type(items[index], weight);</div>
-<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span>}</div>
-<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> </div>
-<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span><span class="keyword">auto</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
-<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
-<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span>}</div>
-<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> </div>
-<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>} <span class="comment">/* namespace datasketches */</span></div>
-<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> </div>
-<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span>    sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) quantiles_sorted_view&lt;T, C, A&gt;(get_sorted_view());</div>
+<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span>  }</div>
+<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span>}</div>
+<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span> </div>
+<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span><span class="keywordtype">void</span> kll_sketch&lt;T, C, A&gt;::reset_sorted_view() {</div>
+<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span>    sorted_view_-&gt;~quantiles_sorted_view();</div>
+<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
+<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span>    AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div>
+<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span>    sorted_view_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span>  }</div>
+<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span>}</div>
+<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> </div>
+<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span><span class="comment">// kll_sketch::const_iterator implementation</span></div>
+<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> </div>
+<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>kll_sketch&lt;T, C, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> T* items, <span class="keyword">const</span> uint32_t* levels, <span class="keyword">const</span> uint8_t num_levels):</div>
+<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>items(items), levels(levels), num_levels(num_levels), index(items == nullptr ? levels[num_levels] : levels[0]), level(items == nullptr ? num_levels : 0), weight(1)</div>
+<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>{}</div>
+<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> </div>
+<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span><span class="keyword">typename</span> kll_sketch&lt;T, C, A&gt;::const_iterator&amp; kll_sketch&lt;T, C, A&gt;::const_iterator::operator++() {</div>
+<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>  ++index;</div>
+<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">if</span> (index == levels[level + 1]) { <span class="comment">// go to the next non-empty level</span></div>
+<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>      ++level;</div>
+<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>      weight *= 2;</div>
+<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span>    } <span class="keywordflow">while</span> (level &lt; num_levels &amp;&amp; levels[level] == levels[level + 1]);</div>
+<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span>  }</div>
+<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span>}</div>
+<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> </div>
+<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span><span class="keyword">typename</span> kll_sketch&lt;T, C, A&gt;::const_iterator&amp; kll_sketch&lt;T, C, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) {</div>
+<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
+<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span>  operator++();</div>
+<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">return</span> tmp;</div>
+<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span>}</div>
+<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> </div>
+<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span><span class="keywordtype">bool</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span>  <span class="keywordflow">return</span> index == other.index;</div>
+<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span>}</div>
+<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> </div>
+<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span><span class="keywordtype">bool</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">return</span> !operator==(other);</div>
+<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span>}</div>
+<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> </div>
+<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span><span class="keyword">auto</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
+<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">return</span> value_type(items[index], weight);</div>
+<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>}</div>
+<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> </div>
+<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span><span class="keyword">auto</span> kll_sketch&lt;T, C, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
+<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
+<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span>}</div>
+<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> </div>
+<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span>} <span class="comment">/* namespace datasketches */</span></div>
+<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> </div>
+<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span><span class="preprocessor">#endif</span></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html">datasketches::kll_sketch</a></div><div class="ttdoc">Implementation of a very compact quantiles sketch with lazy compaction scheme and nearly optimal accu...</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:166</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::kll_sketch::get_comparator</a></div><div class="ttdeci">C get_comparator() const</div><div class="ttdoc">Returns an instance of the comparator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:271</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::kll_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, C, A &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:760</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0d934088182b8615c2fa34a4716d7d44"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">datasketches::kll_sketch::operator=</a></div><div class="ttdeci">kll_sketch &amp; operator=(const kll_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:102</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::kll_sketch::get_CDF</a></div><div class="ttdeci">vector_double get_CDF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Cumulative Distribution Function (CDF), which is the cumulative analo...</div><div class= [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a288af208cb43c6bdd67b788dc92037ea"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">datasketches::kll_sketch::begin</a></div><div class="ttdeci">const_iterator begin() const</div><div class="ttdoc">Iterator pointing to the first item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:956</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::kll_sketch::get_num_retained</a></div><div class="ttdeci">uint32_t get_num_retained() const</div><div class="ttdoc">Returns the number of retained items (samples) in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:249</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::kll_sketch::get_comparator</a></div><div class="ttdeci">C get_comparator() const</div><div class="ttdoc">Returns an instance of the comparator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:272</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::kll_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, C, A &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:769</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a0d934088182b8615c2fa34a4716d7d44"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a0d934088182b8615c2fa34a4716d7d44">datasketches::kll_sketch::operator=</a></div><div class="ttdeci">kll_sketch &amp; operator=(const kll_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:103</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::kll_sketch::get_CDF</a></div><div class="ttdeci">vector_double get_CDF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Cumulative Distribution Function (CDF), which is the cumulative analo...</div><div class= [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a288af208cb43c6bdd67b788dc92037ea"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a288af208cb43c6bdd67b788dc92037ea">datasketches::kll_sketch::begin</a></div><div class="ttdeci">const_iterator begin() const</div><div class="ttdoc">Iterator pointing to the first item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:965</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::kll_sketch::get_num_retained</a></div><div class="ttdeci">uint32_t get_num_retained() const</div><div class="ttdoc">Returns the number of retained items (samples) in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:250</div></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a3f2a0c95cd2c88854ec9b9ab7088f419"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a3f2a0c95cd2c88854ec9b9ab7088f419">datasketches::kll_sketch::deserialize</a></div><div class="ttdeci">static kll_sketch deserialize(std::istream &amp;is, const SerDe &amp;sd=SerDe(), const C &amp;comparator=C(), const A &amp;allocator=A())</div><div class="ttdoc">This method deserializes a sketch from a given stream.</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::kll_sketch::get_PMF</a></div><div class="ttdeci">vector_double get_PMF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Probability Mass Function (PMF) of the input stream given a set of sp...</div><div class= [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::kll_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:209</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a4cdb10e4f2949d55d29421c6e381a300"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">datasketches::kll_sketch::get_max_item</a></div><div class="ttdeci">T get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:265</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5194060fd9b11a856cfb47e59801a3eb"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">datasketches::kll_sketch::end</a></div><div class="ttdeci">const_iterator end() const</div><div class="ttdoc">Iterator pointing to the past-the-end item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:961</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::kll_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:180</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::kll_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch into a given stream in a binary form.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::kll_sketch::to_string</a></div><div class="ttdeci">string&lt; A &gt; to_string(bool print_levels=false, bool print_items=false) const</div><div class="ttdoc">Prints a summary of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:904</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::kll_sketch::get_k</a></div><div class="ttdeci">uint16_t get_k() const</div><div class="ttdoc">Returns configured parameter k.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:239</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::kll_sketch::is_empty</a></div><div class="ttdeci">bool is_empty() const</div><div class="ttdoc">Returns true if this sketch is empty.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:234</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::kll_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;item, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the normalized rank of the given item from 0 to 1, inclusive.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::kll_sketch::get_allocator</a></div><div class="ttdeci">A get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:276</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa3f3769ba3fae6fa0e8a0bd65fef5422"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">datasketches::kll_sketch::get_min_item</a></div><div class="ttdeci">T get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:259</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::kll_sketch::get_PMF</a></div><div class="ttdeci">vector_double get_PMF(const T *split_points, uint32_t size, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the Probability Mass Function (PMF) of the input stream given a set of sp...</div><div class= [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::kll_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:210</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a4cdb10e4f2949d55d29421c6e381a300"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a4cdb10e4f2949d55d29421c6e381a300">datasketches::kll_sketch::get_max_item</a></div><div class="ttdeci">T get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:266</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5194060fd9b11a856cfb47e59801a3eb"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5194060fd9b11a856cfb47e59801a3eb">datasketches::kll_sketch::end</a></div><div class="ttdeci">const_iterator end() const</div><div class="ttdoc">Iterator pointing to the past-the-end item in the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:970</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::kll_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:181</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::kll_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch into a given stream in a binary form.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::kll_sketch::to_string</a></div><div class="ttdeci">string&lt; A &gt; to_string(bool print_levels=false, bool print_items=false) const</div><div class="ttdoc">Prints a summary of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:913</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::kll_sketch::get_k</a></div><div class="ttdeci">uint16_t get_k() const</div><div class="ttdoc">Returns configured parameter k.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:240</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::kll_sketch::is_empty</a></div><div class="ttdeci">bool is_empty() const</div><div class="ttdoc">Returns true if this sketch is empty.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:235</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::kll_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;item, bool inclusive=true) const</div><div class="ttdoc">Returns an approximation to the normalized rank of the given item from 0 to 1, inclusive.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::kll_sketch::get_allocator</a></div><div class="ttdeci">A get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:277</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa3f3769ba3fae6fa0e8a0bd65fef5422"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa3f3769ba3fae6fa0e8a0bd65fef5422">datasketches::kll_sketch::get_min_item</a></div><div class="ttdeci">T get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:260</div></div>
 <div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_aa796209b1ef5dc41e83ed8158f77d280"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#aa796209b1ef5dc41e83ed8158f77d280">datasketches::kll_sketch::quantile_return_type</a></div><div class="ttdeci">typename quantiles_sorted_view&lt; T, C, A &gt;::quantile_return_type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:178</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::kll_sketch::get_quantile</a></div><div class="ttdeci">quantile_return_type get_quantile(double rank, bool inclusive=true) const</div><div class="ttdoc">Returns an item from the sketch that is the best approximation to an item from the original stream wi...</div><div class="ttdef"> [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::kll_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_adb2232570b4977756cddd02b4b6b845b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">datasketches::kll_sketch::get_max_serialized_size_bytes</a></div><div class="ttdeci">static size_t get_max_serialized_size_bytes(uint16_t k, uint64_t n)</div><div class="ttdoc">Returns upper bound on the serialized size of a sketch given a parameter k and stream length.</div><div class="ttdef"> [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae08ba9502b0403ad4448d649ce29b850"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">datasketches::kll_sketch::get_normalized_rank_error</a></div><div class="ttdeci">double get_normalized_rank_error(bool pmf) const</div><div class="ttdoc">Gets the approximate rank error of this sketch normalized as a fraction between zero and one.</div><div class="ttdef"><b>Definition</b> kll_s [...]
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::kll_sketch::is_estimation_mode</a></div><div class="ttdeci">bool is_estimation_mode() const</div><div class="ttdoc">Returns true if this sketch is in estimation mode.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:254</div></div>
-<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::kll_sketch::get_n</a></div><div class="ttdeci">uint64_t get_n() const</div><div class="ttdoc">Returns the length of the input stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:244</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::kll_sketch::get_quantile</a></div><div class="ttdeci">quantile_return_type get_quantile(double rank, bool inclusive=true) const</div><div class="ttdoc">Returns an item from the sketch that is the best approximation to an item from the original stream wi...</div><div class="ttdef"> [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::kll_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition</b> kll_sketch_im [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_adb2232570b4977756cddd02b4b6b845b"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#adb2232570b4977756cddd02b4b6b845b">datasketches::kll_sketch::get_max_serialized_size_bytes</a></div><div class="ttdeci">static size_t get_max_serialized_size_bytes(uint16_t k, uint64_t n)</div><div class="ttdoc">Returns upper bound on the serialized size of a sketch given a parameter k and stream length.</div><div class="ttdef"> [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae08ba9502b0403ad4448d649ce29b850"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae08ba9502b0403ad4448d649ce29b850">datasketches::kll_sketch::get_normalized_rank_error</a></div><div class="ttdeci">double get_normalized_rank_error(bool pmf) const</div><div class="ttdoc">Gets the approximate rank error of this sketch normalized as a fraction between zero and one.</div><div class="ttdef"><b>Definition</b> kll_s [...]
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::kll_sketch::is_estimation_mode</a></div><div class="ttdeci">bool is_estimation_mode() const</div><div class="ttdoc">Returns true if this sketch is in estimation mode.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:255</div></div>
+<div class="ttc" id="aclassdatasketches_1_1kll__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1kll__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::kll_sketch::get_n</a></div><div class="ttdeci">uint64_t get_n() const</div><div class="ttdoc">Returns the length of the input stream.</div><div class="ttdef"><b>Definition</b> kll_sketch_impl.hpp:245</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</a></div><div class="ttdoc">Sorted view for quantiles sketches (REQ, KLL and Quantiles)</div><div class="ttdef"><b>Definition</b> quantiles_sorted_view.hpp:38</div></div>
 <div class="ttc" id="anamespacedatasketches_1_1kll__constants_html_a3bd28528c16e8911658faff9c98b305f"><div class="ttname"><a href="namespacedatasketches_1_1kll__constants.html#a3bd28528c16e8911658faff9c98b305f">datasketches::kll_constants::MAX_K</a></div><div class="ttdeci">const uint16_t MAX_K</div><div class="ttdoc">max value of parameter K</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:41</div></div>
 <div class="ttc" id="anamespacedatasketches_1_1kll__constants_html_ab9f2b631adf46fe04a11814cd1018926"><div class="ttname"><a href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">datasketches::kll_constants::MIN_K</a></div><div class="ttdeci">const uint16_t MIN_K</div><div class="ttdoc">min value of parameter K</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:39</div></div>
diff --git a/docs/master/quantiles__sketch_8hpp_source.html b/docs/master/quantiles__sketch_8hpp_source.html
index 29fc715..3a8a938 100644
--- a/docs/master/quantiles__sketch_8hpp_source.html
+++ b/docs/master/quantiles__sketch_8hpp_source.html
@@ -366,34 +366,34 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span> </div>
 <div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span><span class="preprocessor">#endif </span><span class="comment">// _QUANTILES_SKETCH_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&lt; T, Comparator, Allocator &gt; 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.h [...]
+<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:690</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&lt; T, Comparator, Allocator &gt; 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.h [...]
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a19c140a63e6b0d34f4354c41d93e5e6c"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a19c140a63e6b0d34f4354c41d93e5e6c">datasketches::quantiles_sketch::quantiles_sketch</a></div><div class="ttdeci">quantiles_sketch(uint16_t k=quantiles_constants::DEFAULT_K, const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">Constructor.</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 &amp; operator=(const quantiles_sketch &amp;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_a1aeede739283c1ead07288c1022e5d1b"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">datasketches::quantiles_sketch::operator=</a></div><div class="ttdeci">quantiles_sketch &amp; operator=(const quantiles_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> quantiles_sketch_impl.hpp:90</div></div>
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a1d0c269c23926e93b1c7a9c00e86af97"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a1d0c269c23926e93b1c7a9c00e86af97">datasketches::quantiles_sketch::serialize</a></div><div class="ttdeci">vector_bytes serialize(unsigned header_size_bytes=0, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch as a vector of bytes.</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 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 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 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 &amp;&amp;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 &amp;&amp;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 &amp;os, const SerDe &amp;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> qu [...]
-<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&lt; Allocator &gt; 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.h [...]
-<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 &amp; 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_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 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:673</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:720< [...]
+<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 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 &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> quantiles_sketch_impl.hpp:236</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 &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> quantiles_sketch_impl.hpp:213</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 &amp;os, const SerDe &amp;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> qu [...]
+<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&lt; Allocator &gt; 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.h [...]
+<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:653</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:663</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 &amp; 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:684</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 &amp;is, const SerDe &amp;sd=SerDe(), const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">This met [...]
-<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 &amp;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 [...]
+<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 &amp;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 [...]
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_a84d709e8662d6467f0565bda59ee9f61"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#a84d709e8662d6467f0565bda59ee9f61">datasketches::quantiles_sketch::deserialize</a></div><div class="ttdeci">static quantiles_sketch deserialize(const void *bytes, size_t size, const SerDe &amp;sd=SerDe(), const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc [...]
-<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="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 &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition [...]
-<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_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:695</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="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:875</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 &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition [...]
+<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:668</div></div>
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sketch_html_aebff865d9a4828eb346de6be97135bdc"><div class="ttname"><a href="classdatasketches_1_1quantiles__sketch.html#aebff865d9a4828eb346de6be97135bdc">datasketches::quantiles_sketch::quantiles_sketch</a></div><div class="ttdeci">quantiles_sketch(const quantiles_sketch&lt; From, FC, FA &gt; &amp;other, const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">Type converting  [...]
-<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 &amp; 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__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 &amp; 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:678</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:880</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:658</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</a></div><div class="ttdoc">Sorted view for quantiles sketches (REQ, KLL and Quantiles)</div><div class="ttdef"><b>Definition</b> quantiles_sorted_view.hpp:38</div></div>
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sorted__view_html_a5ab4905c4f3ebeb14de4e7a2f5d92832"><div class="ttname"><a href="classdatasketches_1_1quantiles__sorted__view.html#a5ab4905c4f3ebeb14de4e7a2f5d92832">datasketches::quantiles_sorted_view::quantile_return_type</a></div><div class="ttdeci">typename std::conditional&lt; std::is_arithmetic&lt; T &gt;::value, T, const T &amp; &gt;::type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttde [...]
 <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>
diff --git a/docs/master/quantiles__sketch__impl_8hpp_source.html b/docs/master/quantiles__sketch__impl_8hpp_source.html
index d8e473c..2d1eee6 100644
--- a/docs/master/quantiles__sketch__impl_8hpp_source.html
+++ b/docs/master/quantiles__sketch__impl_8hpp_source.html
@@ -108,1356 +108,1365 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;stdexcept&gt;</span></div>
 <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
 <div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;sstream&gt;</span></div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &quot;count_zeros.hpp&quot;</span></div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &quot;conditional_forward.hpp&quot;</span></div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch(uint16_t k, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>comparator_(comparator),</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>allocator_(allocator),</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>is_base_buffer_sorted_(true),</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>k_(k),</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>n_(0),</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>bit_pattern_(0),</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>base_buffer_(allocator_),</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>levels_(allocator_),</div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>min_item_(),</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>max_item_(),</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>{</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>  check_k(k_);</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  base_buffer_.reserve(2 * std::min(quantiles_constants::MIN_K, k));</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a391bae83eaddd8b3b0828da495c23164">   53</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>&amp; other):</div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>comparator_(other.comparator_),</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>allocator_(other.allocator_),</div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>is_base_buffer_sorted_(other.is_base_buffer_sorted_),</div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>k_(other.k_),</div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>n_(other.n_),</div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>bit_pattern_(other.bit_pattern_),</div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>base_buffer_(other.base_buffer_),</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>levels_(other.levels_),</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>min_item_(other.min_item_),</div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>max_item_(other.max_item_),</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>{</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; levels_.size(); ++i) { </div>
-<div class="line"><a id="l00067" 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 id="l00068" name="l00068"></a><span class="lineno">   68</span>      levels_[i].reserve(other.levels_[i].capacity());</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  }</div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &quot;count_zeros.hpp&quot;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &quot;conditional_forward.hpp&quot;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch(uint16_t k, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>comparator_(comparator),</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>allocator_(allocator),</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>is_base_buffer_sorted_(true),</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>k_(k),</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>n_(0),</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>bit_pattern_(0),</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>base_buffer_(allocator_),</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>levels_(allocator_),</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>min_item_(),</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>max_item_(),</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>{</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  check_k(k_);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  base_buffer_.reserve(2 * std::min(quantiles_constants::MIN_K, k));</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a391bae83eaddd8b3b0828da495c23164">   54</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>&amp; other):</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>comparator_(other.comparator_),</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>allocator_(other.allocator_),</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>is_base_buffer_sorted_(other.is_base_buffer_sorted_),</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>k_(other.k_),</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>n_(other.n_),</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>bit_pattern_(other.bit_pattern_),</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>base_buffer_(other.base_buffer_),</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>levels_(other.levels_),</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>min_item_(other.min_item_),</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>max_item_(other.max_item_),</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>{</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; levels_.size(); ++i) { </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">if</span> (levels_[i].capacity() != other.levels_[i].capacity()) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>      levels_[i].reserve(other.levels_[i].capacity());</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
 </div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a29ce336cb446c2bbdc2f2c1e1a01f171">   74</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch</a>(<a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>&amp;&amp; other) <span class="keyword">noexcept</span>:</div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>comparator_(other.comparator_),</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>allocator_(other.allocator_),</div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>is_base_buffer_sorted_(other.is_base_buffer_sorted_),</div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>k_(other.k_),</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>n_(other.n_),</div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>bit_pattern_(other.bit_pattern_),</div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>base_buffer_(std::move(other.base_buffer_)),</div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>levels_(std::move(other.levels_)),</div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>min_item_(std::move(other.min_item_)),</div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>max_item_(std::move(other.max_item_)),</div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>sorted_view_(<span class="keyword">nullptr</span>)</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>{}</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a29ce336cb446c2bbdc2f2c1e1a01f171">   75</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch</a>(<a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>&amp;&amp; other) <span class="keyword">noexcept</span>:</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>comparator_(other.comparator_),</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>allocator_(other.allocator_),</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>is_base_buffer_sorted_(other.is_base_buffer_sorted_),</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>k_(other.k_),</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>n_(other.n_),</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>bit_pattern_(other.bit_pattern_),</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>base_buffer_(std::move(other.base_buffer_)),</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>levels_(std::move(other.levels_)),</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>min_item_(std::move(other.min_item_)),</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>max_item_(std::move(other.max_item_)),</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>sorted_view_(<span class="keyword">nullptr</span>)</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>{}</div>
 </div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">   89</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">quantiles_sketch&lt;T, C, A&gt;::operator=</a>(<span class="keyword">cons [...]
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;</a> copy(other);</div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  std::swap(comparator_, copy.comparator_);</div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  std::swap(allocator_, copy.allocator_);</div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  std::swap(is_base_buffer_sorted_, copy.is_base_buffer_sorted_);</div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  std::swap(k_, copy.k_);</div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>  std::swap(n_, copy.n_);</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>  std::swap(bit_pattern_, copy.bit_pattern_);</div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  std::swap(base_buffer_, copy.base_buffer_);</div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  std::swap(levels_, copy.levels_);</div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  std::swap(min_item_, copy.min_item_);</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  std::swap(max_item_, copy.max_item_);</div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">   90</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">quantiles_sketch&lt;T, C, A&gt;::operator=</a>(<span class="keyword">cons [...]
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;</a> copy(other);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  std::swap(comparator_, copy.comparator_);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  std::swap(allocator_, copy.allocator_);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  std::swap(is_base_buffer_sorted_, copy.is_base_buffer_sorted_);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>  std::swap(k_, copy.k_);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>  std::swap(n_, copy.n_);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  std::swap(bit_pattern_, copy.bit_pattern_);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  std::swap(base_buffer_, copy.base_buffer_);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  std::swap(levels_, copy.levels_);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  std::swap(min_item_, copy.min_item_);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  std::swap(max_item_, copy.max_item_);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
 </div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae5f3c26a534b7396dd4444e2b2c5c7ec">  106</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">quantiles_sketch&lt;T, C, A&gt;::operator=</a>(<a class="code hl_class" h [...]
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  std::swap(comparator_, other.comparator_);</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  std::swap(allocator_, other.allocator_);</div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  std::swap(is_base_buffer_sorted_, other.is_base_buffer_sorted_);</div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  std::swap(k_, other.k_);</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  std::swap(n_, other.n_);</div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  std::swap(bit_pattern_, other.bit_pattern_);</div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  std::swap(base_buffer_, other.base_buffer_);</div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  std::swap(levels_, other.levels_);</div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>  std::swap(min_item_, other.min_item_);</div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>  std::swap(max_item_, other.max_item_);</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae5f3c26a534b7396dd4444e2b2c5c7ec">  107</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a1aeede739283c1ead07288c1022e5d1b">quantiles_sketch&lt;T, C, A&gt;::operator=</a>(<a class="code hl_class" h [...]
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  std::swap(comparator_, other.comparator_);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  std::swap(allocator_, other.allocator_);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  std::swap(is_base_buffer_sorted_, other.is_base_buffer_sorted_);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  std::swap(k_, other.k_);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  std::swap(n_, other.n_);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  std::swap(bit_pattern_, other.bit_pattern_);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  std::swap(base_buffer_, other.base_buffer_);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>  std::swap(levels_, other.levels_);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>  std::swap(min_item_, other.min_item_);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>  std::swap(max_item_, other.max_item_);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}</div>
 </div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch</a>(uint16_t k, uint64_t n, uint64_t bit_pattern,</div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>      Level&amp;&amp; base_buffer, VectorLevels&amp;&amp; levels,</div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>      optional&lt;T&gt;&amp;&amp; min_item, optional&lt;T&gt;&amp;&amp; max_item,</div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>      <span class="keywordtype">bool</span> is_sorted, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>comparator_(comparator),</div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>allocator_(allocator),</div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>is_base_buffer_sorted_(is_sorted),</div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>k_(k),</div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>n_(n),</div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>bit_pattern_(bit_pattern),</div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>base_buffer_(std::move(base_buffer)),</div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>levels_(std::move(levels)),</div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>min_item_(std::move(min_item)),</div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>max_item_(std::move(max_item)),</div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>{</div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>  uint32_t item_count = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(base_buffer_.size());</div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>  <span class="keywordflow">for</span> (Level&amp; lvl : levels_) {</div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    item_count += <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(lvl.size());</div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>  }</div>
-<div class="line"><a id="l00142" 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 id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Item count does not match value computed from k, n&quot;</span>);</div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}</div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
-<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> From, <span class="keyword">typename</span> FC, <span class="keyword">typename</span> FA&gt;</div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch(<span class="keyword">const</span> quantiles_sketch&lt;From, FC, FA&gt;&amp; other,</div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>comparator_(comparator),</div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>allocator_(allocator),</div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>is_base_buffer_sorted_(false),</div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>k_(other.get_k()),</div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>n_(other.get_n()),</div>
-<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>bit_pattern_(compute_bit_pattern(other.get_k(), other.get_n())),</div>
-<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>base_buffer_(allocator),</div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>levels_(allocator),</div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>min_item_(other.min_item_),</div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>max_item_(other.max_item_),</div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>{</div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>  <span class="keyword">static_assert</span>(std::is_constructible&lt;T, From&gt;::value,</div>
-<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>                <span class="stringliteral">&quot;Type converting constructor requires new type to be constructible from existing type&quot;</span>);</div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>  base_buffer_.reserve(2 * std::min(<a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">quantiles_constants::MIN_K</a>, k_));</div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>  <span class="keywordflow">if</span> (!other.is_empty()) {</div>
-<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="comment">// reserve space in levels</span></div>
-<div class="line"><a id="l00169" 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 id="l00170" name="l00170"></a><span class="lineno">  170</span>    levels_.reserve(num_levels);</div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_levels; ++i) {</div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>      Level level(allocator);</div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>      level.reserve(k_);</div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>      levels_.push_back(std::move(level));</div>
-<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    }</div>
-<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
-<div class="line"><a id="l00177" 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 id="l00178" 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 id="l00179" name="l00179"></a><span class="lineno">  179</span>      <span class="keyword">const</span> uint64_t wt = pair.second;</div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>      <span class="keywordflow">if</span> (wt == 1) {</div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        base_buffer_.push_back(T(pair.first));</div>
-<div class="line"><a id="l00182" 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 id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">if</span> (base_buffer_.size() + 1 &gt; base_buffer_.capacity()) {</div>
-<div class="line"><a id="l00184" 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&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(2 * k_), 2 * base_buffer_.size()), <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(1));</div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>          base_buffer_.reserve(new_size);</div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        }</div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>      }</div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>      <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00189" 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 id="l00190" name="l00190"></a><span class="lineno">  190</span>        levels_[idx].push_back(T(pair.first));</div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>      }</div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    }</div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
-<div class="line"><a id="l00194" 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 id="l00195" 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 id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_levels; ++i) {</div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>      <span class="keywordflow">if</span> (!std::is_sorted(levels_[i].<a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">begin</a>(), levels_[i].<a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">end</a>(), comparator_)) {</div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Copy construction across types produces invalid sorting&quot;</span>);</div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>      }</div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    }</div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>  }</div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch</a>(uint16_t k, uint64_t n, uint64_t bit_pattern,</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>      Level&amp;&amp; base_buffer, VectorLevels&amp;&amp; levels,</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>      optional&lt;T&gt;&amp;&amp; min_item, optional&lt;T&gt;&amp;&amp; max_item,</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>      <span class="keywordtype">bool</span> is_sorted, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>comparator_(comparator),</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>allocator_(allocator),</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>is_base_buffer_sorted_(is_sorted),</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>k_(k),</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>n_(n),</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>bit_pattern_(bit_pattern),</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>base_buffer_(std::move(base_buffer)),</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>levels_(std::move(levels)),</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>min_item_(std::move(min_item)),</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>max_item_(std::move(max_item)),</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>{</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>  uint32_t item_count = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(base_buffer_.size());</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>  <span class="keywordflow">for</span> (Level&amp; lvl : levels_) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    item_count += <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(lvl.size());</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>  }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>  <span class="keywordflow">if</span> (item_count != compute_retained_items(k_, n_))</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Item count does not match value computed from k, n&quot;</span>);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> From, <span class="keyword">typename</span> FC, <span class="keyword">typename</span> FA&gt;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>quantiles_sketch&lt;T, C, A&gt;::quantiles_sketch(<span class="keyword">const</span> quantiles_sketch&lt;From, FC, FA&gt;&amp; other,</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>comparator_(comparator),</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>allocator_(allocator),</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>is_base_buffer_sorted_(false),</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>k_(other.get_k()),</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>n_(other.get_n()),</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>bit_pattern_(compute_bit_pattern(other.get_k(), other.get_n())),</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>base_buffer_(allocator),</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>levels_(allocator),</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>min_item_(other.min_item_),</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>max_item_(other.max_item_),</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>{</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>  <span class="keyword">static_assert</span>(std::is_constructible&lt;T, From&gt;::value,</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>                <span class="stringliteral">&quot;Type converting constructor requires new type to be constructible from existing type&quot;</span>);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>  base_buffer_.reserve(2 * std::min(<a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">quantiles_constants::MIN_K</a>, k_));</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>  <span class="keywordflow">if</span> (!other.is_empty()) {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="comment">// reserve space in levels</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <span class="keyword">const</span> uint8_t num_levels = compute_levels_needed(k_, n_);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    levels_.reserve(num_levels);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_levels; ++i) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>      Level level(allocator);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>      level.reserve(k_);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>      levels_.push_back(std::move(level));</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="comment">// iterate through points, assigning to the correct level as needed</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> pair : other) {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>      <span class="keyword">const</span> uint64_t wt = pair.second;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>      <span class="keywordflow">if</span> (wt == 1) {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        base_buffer_.push_back(T(pair.first));</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="comment">// resize where needed as if adding points via update()</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">if</span> (base_buffer_.size() + 1 &gt; base_buffer_.capacity()) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>          <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_size = std::max(std::min(<span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(2 * k_), 2 * base_buffer_.size()), <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(1));</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>          base_buffer_.reserve(new_size);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        }</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>      }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>      <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="keyword">const</span> uint8_t idx = count_trailing_zeros_in_u64(pair.second) - 1;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        levels_[idx].push_back(T(pair.first));</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>      }</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    }</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="comment">// validate that ordering within each level is preserved</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="comment">// base_buffer_ can be considered unsorted for this purpose</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_levels; ++i) {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>      <span class="keywordflow">if</span> (!std::is_sorted(levels_[i].<a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">begin</a>(), levels_[i].<a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">end</a>(), comparator_)) {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Copy construction across types produces invalid sorting&quot;</span>);</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>      }</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>  }</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>}</div>
 <div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>quantiles_sketch&lt;T, C, A&gt;::~quantiles_sketch() {</div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>}</div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdT&gt;</div>
-<div class="foldopen" id="foldopen00212" data-start="{" data-end="}">
-<div class="line"><a id="l00212" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">quantiles_sketch&lt;T, C, A&gt;::update</a>(FwdT&amp;&amp; item) {</div>
-<div class="line"><a id="l00213" 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 id="l00214" name="l00214"></a><span class="lineno">  214</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    min_item_.emplace(item);</div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    max_item_.emplace(item);</div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00218" 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 id="l00219" 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 id="l00220" name="l00220"></a><span class="lineno">  220</span>  }</div>
-<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
-<div class="line"><a id="l00222" 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 id="l00223" name="l00223"></a><span class="lineno">  223</span>  <span class="keywordflow">if</span> (base_buffer_.size() + 1 &gt; base_buffer_.capacity()) grow_base_buffer();</div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>  base_buffer_.push_back(std::forward&lt;FwdT&gt;(item));</div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  ++n_;</div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>  <span class="keywordflow">if</span> (base_buffer_.size() &gt; 1) is_base_buffer_sorted_ = <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00229" 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 id="l00230" name="l00230"></a><span class="lineno">  230</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>}</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>quantiles_sketch&lt;T, C, A&gt;::~quantiles_sketch() {</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>}</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdT&gt;</div>
+<div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">  213</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">quantiles_sketch&lt;T, C, A&gt;::update</a>(FwdT&amp;&amp; item) {</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</span>; }</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    min_item_.emplace(item);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    max_item_.emplace(item);</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <span class="keywordflow">if</span> (comparator_(item, *min_item_)) *min_item_ = item;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = item;</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  }</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>  <span class="comment">// if exceed capacity, grow until size 2k -- assumes eager processing</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>  <span class="keywordflow">if</span> (base_buffer_.size() + 1 &gt; base_buffer_.capacity()) grow_base_buffer();</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  base_buffer_.push_back(std::forward&lt;FwdT&gt;(item));</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>  ++n_;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>  <span class="keywordflow">if</span> (base_buffer_.size() &gt; 1) is_base_buffer_sorted_ = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>  <span class="keywordflow">if</span> (base_buffer_.size() == 2 * k_) process_full_base_buffer();</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>}</div>
 </div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span> </div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
-<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
-<div class="line"><a id="l00235" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">quantiles_sketch&lt;T, C, A&gt;::merge</a>(FwdSk&amp;&amp; other) {</div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>  <span class="keywordflow">if</span> (other.is_empty()) {</div>
-<div class="line"><a id="l00237" 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 id="l00238" 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 id="l00239" 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 id="l00240" 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 id="l00241" name="l00241"></a><span class="lineno">  241</span>      update(conditional_forward&lt;FwdSk&gt;(item));</div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    }</div>
-<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    reset_sorted_view();</div>
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>  }</div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
-<div class="line"><a id="l00247" 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 id="l00248" name="l00248"></a><span class="lineno">  248</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
-<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    <span class="keywordflow">if</span> (k_ == other.get_k()) {</div>
-<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>      standard_merge(*<span class="keyword">this</span>, std::forward&lt;FwdSk&gt;(other));</div>
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k_ &gt; other.get_k()) {</div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>      <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a> sk_copy(std::forward&lt;FwdSk&gt;(other));</div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>      downsampling_merge(sk_copy, std::move(*<span class="keyword">this</span>));</div>
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>      *<span class="keyword">this</span> = std::move(sk_copy);</div>
-<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    } <span class="keywordflow">else</span> { <span class="comment">// k_ &lt; other.get_k()</span></div>
-<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>      downsampling_merge(*<span class="keyword">this</span>, std::forward&lt;FwdSk&gt;(other));</div>
-<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    }</div>
-<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <span class="comment">// exact or empty</span></div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a> sk_copy(std::forward&lt;FwdSk&gt;(other));</div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <span class="keywordflow">if</span> (k_ &lt;= other.get_k()) {</div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>      <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; base_buffer_.size(); ++i) {</div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>          sk_copy.<a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">update</a>(std::move(base_buffer_[i]));</div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        }</div>
-<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>      }</div>
-<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    } <span class="keywordflow">else</span> { <span class="comment">// k_ &gt; other.get_k()</span></div>
-<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>      downsampling_merge(sk_copy, std::move(*<span class="keyword">this</span>));</div>
-<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    }</div>
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    *<span class="keyword">this</span> = std::move(sk_copy);</div>
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>  }</div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>}</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
+<div class="foldopen" id="foldopen00236" data-start="{" data-end="}">
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">  236</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">quantiles_sketch&lt;T, C, A&gt;::merge</a>(FwdSk&amp;&amp; other) {</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>  <span class="keywordflow">if</span> (other.is_empty()) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="keywordflow">return</span>; <span class="comment">// nothing to do</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!other.is_estimation_mode()) {</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="comment">// other is exact, stream in regardless of k</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> item : other.base_buffer_) {</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>      update(conditional_forward&lt;FwdSk&gt;(item));</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    }</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    reset_sorted_view();</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>  }</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span> </div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>  <span class="comment">// other has data and is in estimation mode</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="keywordflow">if</span> (k_ == other.get_k()) {</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>      standard_merge(*<span class="keyword">this</span>, std::forward&lt;FwdSk&gt;(other));</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k_ &gt; other.get_k()) {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>      <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a> sk_copy(std::forward&lt;FwdSk&gt;(other));</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>      downsampling_merge(sk_copy, std::move(*<span class="keyword">this</span>));</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>      *<span class="keyword">this</span> = std::move(sk_copy);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    } <span class="keywordflow">else</span> { <span class="comment">// k_ &lt; other.get_k()</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>      downsampling_merge(*<span class="keyword">this</span>, std::forward&lt;FwdSk&gt;(other));</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    }</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    <span class="comment">// exact or empty</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a> sk_copy(std::forward&lt;FwdSk&gt;(other));</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="keywordflow">if</span> (k_ &lt;= other.get_k()) {</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>      <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; base_buffer_.size(); ++i) {</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>          sk_copy.<a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">update</a>(std::move(base_buffer_[i]));</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>        }</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>      }</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    } <span class="keywordflow">else</span> { <span class="comment">// k_ &gt; other.get_k()</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>      downsampling_merge(sk_copy, std::move(*<span class="keyword">this</span>));</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    }</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    *<span class="keyword">this</span> = std::move(sk_copy);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>  }</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>}</div>
 </div>
-<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
-<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="foldopen" id="foldopen00277" data-start="{" data-end="}">
-<div class="line"><a id="l00277" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">quantiles_sketch&lt;T, C, A&gt;::serialize</a>(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; <a class="code hl_struct" href="struc [...]
-<div class="line"><a id="l00278" 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 id="l00279" name="l00279"></a><span class="lineno">  279</span>  write(os, preamble_longs);</div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>  <span class="keyword">const</span> uint8_t ser_ver = SERIAL_VERSION;</div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>  write(os, ser_ver);</div>
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
-<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>  write(os, family);</div>
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
-<div class="line"><a id="l00285" 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 id="l00286" name="l00286"></a><span class="lineno">  286</span>  std::sort(<span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).begin(), <span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).end(), comparator_);</div>
-<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>  <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span> </div>
-<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>  <span class="comment">// empty, ordered, compact are valid flags</span></div>
-<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
-<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
-<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    | (1 &lt;&lt; flags::IS_SORTED) <span class="comment">// always sorted as side effect noted above</span></div>
-<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    | (1 &lt;&lt; flags::IS_COMPACT) <span class="comment">// always compact -- could be optional for numeric types?</span></div>
-<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>  );</div>
-<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>  write(os, flags_byte);</div>
-<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>  write(os, k_);</div>
-<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>  <span class="keyword">const</span> uint16_t unused = 0;</div>
-<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>  write(os, unused);</div>
-<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
-<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    write(os, n_);</div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span> </div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    <span class="comment">// min and max</span></div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, &amp;*min_item_, 1);</div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, &amp;*max_item_, 1);</div>
-<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
-<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    <span class="comment">// base buffer items</span></div>
-<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, base_buffer_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(base_buffer_.size()));</div>
-<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
-<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    <span class="comment">// levels, only when data is present</span></div>
-<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    <span class="keywordflow">for</span> (Level lvl : levels_) {</div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>      <span class="keywordflow">if</span> (lvl.size() &gt; 0)</div>
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>        <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, lvl.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(lvl.size()));</div>
-<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    }</div>
-<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>  }</div>
-<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>}</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span> </div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="foldopen" id="foldopen00278" data-start="{" data-end="}">
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">  278</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">quantiles_sketch&lt;T, C, A&gt;::serialize</a>(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; <a class="code hl_struct" href="struc [...]
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>  <span class="keyword">const</span> uint8_t preamble_longs = is_empty() ? PREAMBLE_LONGS_SHORT : PREAMBLE_LONGS_FULL;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>  write(os, preamble_longs);</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>  <span class="keyword">const</span> uint8_t ser_ver = SERIAL_VERSION;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>  write(os, ser_ver);</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>  write(os, family);</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span> </div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>  <span class="comment">// side-effect: sort base buffer since always compact</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>  std::sort(<span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).begin(), <span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).end(), comparator_);</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>  <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>  <span class="comment">// empty, ordered, compact are valid flags</span></div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    | (1 &lt;&lt; flags::IS_SORTED) <span class="comment">// always sorted as side effect noted above</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    | (1 &lt;&lt; flags::IS_COMPACT) <span class="comment">// always compact -- could be optional for numeric types?</span></div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>  );</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>  write(os, flags_byte);</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>  write(os, k_);</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>  <span class="keyword">const</span> uint16_t unused = 0;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>  write(os, unused);</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    write(os, n_);</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span> </div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <span class="comment">// min and max</span></div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, &amp;*min_item_, 1);</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, &amp;*max_item_, 1);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <span class="comment">// base buffer items</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, base_buffer_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(base_buffer_.size()));</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span> </div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    <span class="comment">// levels, only when data is present</span></div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    <span class="keywordflow">for</span> (Level lvl : levels_) {</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>      <span class="keywordflow">if</span> (lvl.size() &gt; 0)</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(os, lvl.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(lvl.size()));</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    }</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>  }</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>}</div>
 </div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">quantiles_sketch&lt;T, C, A&gt;::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe&amp; <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>) <span class="keyword">const</s [...]
-<div class="line"><a id="l00321" 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 hl_struct" href="structdatasketches_1_1serde.html">serde</a>) + header_size_bytes;</div>
-<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  vector_bytes bytes(size, 0, allocator_);</div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>  </div>
-<div class="line"><a id="l00326" 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 id="l00327" name="l00327"></a><span class="lineno">  327</span>  ptr += copy_to_mem(preamble_longs, ptr);</div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>  <span class="keyword">const</span> uint8_t ser_ver = SERIAL_VERSION;</div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>  ptr += copy_to_mem(ser_ver, ptr);</div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>  ptr += copy_to_mem(family, ptr);</div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
-<div class="line"><a id="l00333" 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 id="l00334" name="l00334"></a><span class="lineno">  334</span>  std::sort(<span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).begin(), <span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).end(), comparator_);</div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span> </div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  <span class="comment">// empty, ordered, compact are valid flags</span></div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    | (1 &lt;&lt; flags::IS_SORTED) <span class="comment">// always sorted as side effect noted above</span></div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    | (1 &lt;&lt; flags::IS_COMPACT) <span class="comment">// always compact</span></div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>  );</div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>  ptr += copy_to_mem(flags_byte, ptr);</div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  ptr += copy_to_mem(k_, ptr);</div>
-<div class="line"><a id="l00345" 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 id="l00346" name="l00346"></a><span class="lineno">  346</span>  </div>
-<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    ptr += copy_to_mem(n_, ptr);</div>
-<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    </div>
-<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="comment">// min and max</span></div>
-<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>    ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, &amp;*min_item_, 1);</div>
-<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, &amp;*max_item_, 1);</div>
-<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span> </div>
-<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>    <span class="comment">// base buffer items</span></div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    <span class="keywordflow">if</span> (base_buffer_.size() &gt; 0)</div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>      ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, base_buffer_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(base_buffer_.size()));</div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    </div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>    <span class="comment">// levels, only when data is present</span></div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="keywordflow">for</span> (Level lvl : levels_) {</div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>      <span class="keywordflow">if</span> (lvl.size() &gt; 0)</div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, lvl.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(lvl.size()));</div>
-<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    }</div>
-<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>  }</div>
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
-<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>  <span class="keywordflow">return</span> bytes;</div>
-<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>}</div>
-<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span> </div>
-<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">quantiles_sketch&lt;T, C, A&gt;::deserialize</a>(std::istream &amp;is, <span class="keyword">const</span> SerDe&amp; serde,</div>
-<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A &amp;allocator) -&gt; quantiles_sketch {</div>
-<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_longs = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read&lt;uint16_t&gt;(is);</div>
-<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>  read&lt;uint16_t&gt;(is); <span class="comment">// unused</span></div>
-<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span> </div>
-<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>  check_k(k);</div>
-<div class="line"><a id="l00381" 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 id="l00382" name="l00382"></a><span class="lineno">  382</span>  check_family_id(family_id);</div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  check_header_validity(preamble_longs, flags_byte, serial_version);</div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span> </div>
-<div class="line"><a id="l00385" 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">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = (flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY)) &gt; 0;</div>
-<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>  <span class="keywordflow">if</span> (is_empty) {</div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    <span class="keywordflow">return</span> quantiles_sketch(k, comparator, allocator);</div>
-<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>  }</div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span> </div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>  <span class="keyword">const</span> <span class="keyword">auto</span> items_seen = read&lt;uint64_t&gt;(is);</div>
-<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span> </div>
-<div class="line"><a id="l00393" 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 &amp; (1 &lt;&lt; flags::IS_COMPACT)) &gt; 0);</div>
-<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_SORTED)) &gt; 0;</div>
-<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span> </div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>  optional&lt;T&gt; tmp; <span class="comment">// space to deserialize min and max</span></div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a538940c100e4353b3671ad452d3d3056">quantiles_sketch&lt;T, C, A&gt;::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe&amp; <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>) <span class="keyword">const</s [...]
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = get_serialized_size_bytes(<a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>) + header_size_bytes;</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  vector_bytes bytes(size, 0, allocator_);</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>  </div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>  <span class="keyword">const</span> uint8_t preamble_longs = is_empty() ? PREAMBLE_LONGS_SHORT : PREAMBLE_LONGS_FULL;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>  ptr += copy_to_mem(preamble_longs, ptr);</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>  <span class="keyword">const</span> uint8_t ser_ver = SERIAL_VERSION;</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>  ptr += copy_to_mem(ser_ver, ptr);</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>  ptr += copy_to_mem(family, ptr);</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span> </div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>  <span class="comment">// side-effect: sort base buffer since always compact</span></div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  std::sort(<span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).begin(), <span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).end(), comparator_);</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>  <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="comment">// empty, ordered, compact are valid flags</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    | (1 &lt;&lt; flags::IS_SORTED) <span class="comment">// always sorted as side effect noted above</span></div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    | (1 &lt;&lt; flags::IS_COMPACT) <span class="comment">// always compact</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>  );</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  ptr += copy_to_mem(flags_byte, ptr);</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>  ptr += copy_to_mem(k_, ptr);</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>  ptr += <span class="keyword">sizeof</span>(uint16_t); <span class="comment">// 2 unused bytes</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>  </div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span> </div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    ptr += copy_to_mem(n_, ptr);</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    </div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>    <span class="comment">// min and max</span></div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, &amp;*min_item_, 1);</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>    ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, &amp;*max_item_, 1);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    <span class="comment">// base buffer items</span></div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    <span class="keywordflow">if</span> (base_buffer_.size() &gt; 0)</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>      ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, base_buffer_.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(base_buffer_.size()));</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>    </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="comment">// levels, only when data is present</span></div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="keywordflow">for</span> (Level lvl : levels_) {</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>      <span class="keywordflow">if</span> (lvl.size() &gt; 0)</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>        ptr += <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>.<a class="code hl_function" href="structdatasketches_1_1serde.html#a6c83e1b2b2ec0c10698a155e60ef2b4c">serialize</a>(ptr, end_ptr - ptr, lvl.data(), <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span><span class="keyword">&gt;</span>(lvl.size()));</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    }</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>  }</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>  <span class="keywordflow">return</span> bytes;</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>}</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span> </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">quantiles_sketch&lt;T, C, A&gt;::deserialize</a>(std::istream &amp;is, <span class="keyword">const</span> SerDe&amp; serde,</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A &amp;allocator) -&gt; quantiles_sketch {</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_longs = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read&lt;uint16_t&gt;(is);</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>  read&lt;uint16_t&gt;(is); <span class="comment">// unused</span></div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span> </div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>  check_k(k);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>  check_serial_version(serial_version); <span class="comment">// a little redundant with the header check</span></div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  check_family_id(family_id);</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  check_header_validity(preamble_longs, flags_byte, serial_version);</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span> </div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = (flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY)) &gt; 0;</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  <span class="keywordflow">if</span> (is_empty) {</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    <span class="keywordflow">return</span> quantiles_sketch(k, comparator, allocator);</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>  }</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span> </div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>  <span class="keyword">const</span> <span class="keyword">auto</span> items_seen = read&lt;uint64_t&gt;(is);</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span> </div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_compact = (serial_version == 2) | ((flags_byte &amp; (1 &lt;&lt; flags::IS_COMPACT)) &gt; 0);</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_SORTED)) &gt; 0;</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span> </div>
 <div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>  optional&lt;T&gt; min_item;</div>
 <div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>  optional&lt;T&gt; max_item;</div>
 <div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span> </div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>  serde.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00401" 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 id="l00402" name="l00402"></a><span class="lineno">  402</span>  min_item.emplace(*tmp);</div>
-<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>  (*tmp).~T();</div>
-<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>  serde.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00405" 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 id="l00406" name="l00406"></a><span class="lineno">  406</span>  max_item.emplace(*tmp);</div>
-<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  (*tmp).~T();</div>
-<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span> </div>
-<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>  <span class="keywordflow">if</span> (serial_version == 1) {</div>
-<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    read&lt;uint64_t&gt;(is); <span class="comment">// no longer used</span></div>
-<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  }</div>
-<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span> </div>
-<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>  <span class="comment">// allocate buffers as needed</span></div>
-<div class="line"><a id="l00414" 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 id="l00415" 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 id="l00416" name="l00416"></a><span class="lineno">  416</span> </div>
-<div class="line"><a id="l00417" 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 id="l00418" 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 id="l00419" 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 id="l00420" 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 id="l00400" name="l00400"></a><span class="lineno">  400</span>  <span class="comment">// Space to deserialize min and max.</span></div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>  <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>  <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>  T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span> </div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>  serde.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  min_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>  tmp-&gt;~T();</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>  serde.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  max_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  tmp-&gt;~T();</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span> </div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>  <span class="keywordflow">if</span> (serial_version == 1) {</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    read&lt;uint64_t&gt;(is); <span class="comment">// no longer used</span></div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>  }</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span> </div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>  <span class="comment">// allocate buffers as needed</span></div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(k, items_seen);</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>  <span class="keyword">const</span> uint64_t bit_pattern = compute_bit_pattern(k, items_seen);</div>
 <div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span> </div>
-<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>  <span class="comment">// load base buffer</span></div>
-<div class="line"><a id="l00423" 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 id="l00424" 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 id="l00425" 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 id="l00426" name="l00426"></a><span class="lineno">  426</span>  <span class="keywordflow">if</span> (items_to_read &gt; bb_items) { <span class="comment">// either equal or greater, never read fewer items</span></div>
-<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    <span class="comment">// read remaining items, but don&#39;t store them</span></div>
-<div class="line"><a id="l00428" 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 id="l00429" name="l00429"></a><span class="lineno">  429</span>  }</div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span> </div>
-<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>  <span class="comment">// populate vector of Levels directly</span></div>
-<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>  VectorLevels levels(allocator);</div>
-<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>  levels.reserve(levels_needed);</div>
-<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>  <span class="keywordflow">if</span> (levels_needed &gt; 0) {</div>
-<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    uint64_t working_pattern = bit_pattern;</div>
-<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; levels_needed; ++i, working_pattern &gt;&gt;= 1) {</div>
-<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>      <span class="keywordflow">if</span> ((working_pattern &amp; 0x01) == 1) {</div>
-<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>        Level level = deserialize_array(is, k, k, serde, allocator);</div>
-<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>        levels.push_back(std::move(level));</div>
-<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>      } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        Level level(allocator);</div>
-<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>        level.reserve(k);</div>
-<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        levels.push_back(std::move(level));</div>
-<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>      }</div>
-<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    }</div>
-<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>  }</div>
-<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span> </div>
-<div class="line"><a id="l00448" 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 id="l00449" 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 id="l00450" name="l00450"></a><span class="lineno">  450</span>    comparator, allocator);</div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>}</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</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 id="l00423" name="l00423"></a><span class="lineno">  423</span>  <span class="comment">// does not currently operate sketches in compact mode, but will only serialize as compact</span></div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</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 id="l00425" name="l00425"></a><span class="lineno">  425</span>  <span class="comment">// to be able to ingest either serialized format from Java.</span></div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span> </div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>  <span class="comment">// load base buffer</span></div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>  <span class="keyword">const</span> uint32_t bb_items = compute_base_buffer_items(k, items_seen);</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>  uint32_t items_to_read = (levels_needed == 0 || is_compact) ? bb_items : 2 * k;</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>  Level base_buffer = deserialize_array(is, bb_items, 2 * k, serde, allocator);</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>  <span class="keywordflow">if</span> (items_to_read &gt; bb_items) { <span class="comment">// either equal or greater, never read fewer items</span></div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="comment">// read remaining items, but don&#39;t store them</span></div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    deserialize_array(is, items_to_read - bb_items, items_to_read - bb_items, serde, allocator);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>  }</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span> </div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>  <span class="comment">// populate vector of Levels directly</span></div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>  VectorLevels levels(allocator);</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>  levels.reserve(levels_needed);</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>  <span class="keywordflow">if</span> (levels_needed &gt; 0) {</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    uint64_t working_pattern = bit_pattern;</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; levels_needed; ++i, working_pattern &gt;&gt;= 1) {</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>      <span class="keywordflow">if</span> ((working_pattern &amp; 0x01) == 1) {</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        Level level = deserialize_array(is, k, k, serde, allocator);</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>        levels.push_back(std::move(level));</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>      } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>        Level level(allocator);</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>        level.reserve(k);</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>        levels.push_back(std::move(level));</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>      }</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>    }</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>  }</div>
 <div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span> </div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::deserialize_array(std::istream&amp; is, uint32_t num_items, uint32_t capacity, <span class="keyword">const</span> SerDe&amp; serde, <span class="keyword">const</span> A&amp; allocator) -&gt; Level {</div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>  A alloc(allocator);</div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_items), items_deleter(allocator, <span class="keyword">false</span>, num_items));</div>
-<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>  serde.deserialize(is, items.get(), num_items);</div>
-<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
-<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
-<div class="line"><a id="l00461" 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">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span> </div>
-<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>  <span class="comment">// successfully read, now put into a Level</span></div>
-<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>  Level level(allocator);</div>
-<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>  level.reserve(capacity);</div>
-<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>  level.insert(level.begin(),</div>
-<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>               std::make_move_iterator(items.get()),</div>
-<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>               std::make_move_iterator(items.get() + num_items));</div>
-<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>  <span class="keywordflow">return</span> level;</div>
-<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>}</div>
-<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span> </div>
-<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">quantiles_sketch&lt;T, C, A&gt;::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&amp; serde,</div>
-<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A &amp;allocator) -&gt; quantiles_sketch {</div>
-<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>  ensure_minimum_memory(size, 8);</div>
-<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
-<div class="line"><a id="l00478" 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&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
-<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span> </div>
-<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>  uint8_t preamble_longs;</div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>  ptr += copy_from_mem(ptr, preamble_longs);</div>
-<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>  uint8_t serial_version;</div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  ptr += copy_from_mem(ptr, serial_version);</div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>  uint8_t family_id;</div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>  ptr += copy_from_mem(ptr, family_id);</div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>  uint8_t flags_byte;</div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>  ptr += copy_from_mem(ptr, flags_byte);</div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>  uint16_t k;</div>
-<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>  ptr += copy_from_mem(ptr, k);</div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>  uint16_t unused;</div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>  ptr += copy_from_mem(ptr, unused);</div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>  check_k(k);</div>
-<div class="line"><a id="l00494" 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 id="l00495" name="l00495"></a><span class="lineno">  495</span>  check_family_id(family_id);</div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  check_header_validity(preamble_longs, flags_byte, serial_version);</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  <span class="keywordflow">return</span> quantiles_sketch(k, items_seen, bit_pattern,</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    std::move(base_buffer), std::move(levels), std::move(min_item), std::move(max_item), is_sorted,</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>    comparator, allocator);</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>}</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span> </div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::deserialize_array(std::istream&amp; is, uint32_t num_items, uint32_t capacity, <span class="keyword">const</span> SerDe&amp; serde, <span class="keyword">const</span> A&amp; allocator) -&gt; Level {</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>  A alloc(allocator);</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_items), items_deleter(allocator, <span class="keyword">false</span>, num_items));</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>  serde.deserialize(is, items.get(), num_items);</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span> </div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>  <span class="comment">// successfully read, now put into a Level</span></div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>  Level level(allocator);</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>  level.reserve(capacity);</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>  level.insert(level.begin(),</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>               std::make_move_iterator(items.get()),</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>               std::make_move_iterator(items.get() + num_items));</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>  <span class="keywordflow">return</span> level;</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>}</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span> </div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a7350b4a67bcf6081017e1c42eef920d4">quantiles_sketch&lt;T, C, A&gt;::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&amp; serde,</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A &amp;allocator) -&gt; quantiles_sketch {</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>  ensure_minimum_memory(size, 8);</div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span> </div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>  uint8_t preamble_longs;</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>  ptr += copy_from_mem(ptr, preamble_longs);</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>  uint8_t serial_version;</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>  ptr += copy_from_mem(ptr, serial_version);</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>  uint8_t family_id;</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>  ptr += copy_from_mem(ptr, family_id);</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>  uint8_t flags_byte;</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>  ptr += copy_from_mem(ptr, flags_byte);</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>  uint16_t k;</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>  ptr += copy_from_mem(ptr, k);</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>  uint16_t unused;</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  ptr += copy_from_mem(ptr, unused);</div>
 <div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span> </div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = (flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY)) &gt; 0;</div>
-<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>  <span class="keywordflow">if</span> (is_empty) {</div>
-<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>    <span class="keywordflow">return</span> quantiles_sketch(k, comparator, allocator);</div>
-<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>  }</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>  check_k(k);</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>  check_serial_version(serial_version); <span class="comment">// a little redundant with the header check</span></div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>  check_family_id(family_id);</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>  check_header_validity(preamble_longs, flags_byte, serial_version);</div>
 <div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span> </div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>  ensure_minimum_memory(size, 16);</div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>  uint64_t items_seen;</div>
-<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>  ptr += copy_from_mem(ptr, items_seen);</div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span> </div>
-<div class="line"><a id="l00507" 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 &amp; (1 &lt;&lt; flags::IS_COMPACT)) &gt; 0);</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_SORTED)) &gt; 0;</div>
-<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span> </div>
-<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>  optional&lt;T&gt; tmp; <span class="comment">// space to deserialize min and max</span></div>
-<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>  optional&lt;T&gt; min_item;</div>
-<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  optional&lt;T&gt; max_item;</div>
-<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span> </div>
-<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00515" 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 id="l00516" name="l00516"></a><span class="lineno">  516</span>  min_item.emplace(*tmp);</div>
-<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>  (*tmp).~T();</div>
-<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00519" 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 id="l00520" name="l00520"></a><span class="lineno">  520</span>  max_item.emplace(*tmp);</div>
-<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>  (*tmp).~T();</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = (flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY)) &gt; 0;</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>  <span class="keywordflow">if</span> (is_empty) {</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>    <span class="keywordflow">return</span> quantiles_sketch(k, comparator, allocator);</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>  }</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span> </div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>  ensure_minimum_memory(size, 16);</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>  uint64_t items_seen;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>  ptr += copy_from_mem(ptr, items_seen);</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span> </div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_compact = (serial_version == 2) | ((flags_byte &amp; (1 &lt;&lt; flags::IS_COMPACT)) &gt; 0);</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_sorted = (flags_byte &amp; (1 &lt;&lt; flags::IS_SORTED)) &gt; 0;</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span> </div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>  optional&lt;T&gt; min_item;</div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>  optional&lt;T&gt; max_item;</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span> </div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>  <span class="comment">// Space to deserialize min and max.</span></div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>  <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>  <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>  T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
 <div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span> </div>
-<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>  <span class="keywordflow">if</span> (serial_version == 1) {</div>
-<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    uint64_t unused_long;</div>
-<div class="line"><a id="l00525" 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 id="l00526" name="l00526"></a><span class="lineno">  526</span>  }</div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span> </div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  <span class="comment">// allocate buffers as needed</span></div>
-<div class="line"><a id="l00529" 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 id="l00530" 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 id="l00523" name="l00523"></a><span class="lineno">  523</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  min_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  tmp-&gt;~T();</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  max_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>  tmp-&gt;~T();</div>
 <div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span> </div>
-<div class="line"><a id="l00532" 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 id="l00533" 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 id="l00534" 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 id="l00535" 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 id="l00532" name="l00532"></a><span class="lineno">  532</span>  <span class="keywordflow">if</span> (serial_version == 1) {</div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>    uint64_t unused_long;</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>    ptr += copy_from_mem(ptr, unused_long); <span class="comment">// no longer used</span></div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>  }</div>
 <div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span> </div>
-<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  <span class="comment">// load base buffer</span></div>
-<div class="line"><a id="l00538" 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 id="l00539" 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 id="l00540" 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 id="l00541" name="l00541"></a><span class="lineno">  541</span>  ptr += base_buffer_pair.second;</div>
-<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>  <span class="keywordflow">if</span> (items_to_read &gt; bb_items) { <span class="comment">// either equal or greater, never read fewer items</span></div>
-<div class="line"><a id="l00543" 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 id="l00544" 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 id="l00545" name="l00545"></a><span class="lineno">  545</span>    ptr += extras.second;</div>
-<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>  }</div>
-<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span> </div>
-<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>  <span class="comment">// populate vector of Levels directly</span></div>
-<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>  VectorLevels levels(allocator);</div>
-<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>  levels.reserve(levels_needed);</div>
-<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>  <span class="keywordflow">if</span> (levels_needed &gt; 0) {</div>
-<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>    uint64_t working_pattern = bit_pattern;</div>
-<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; levels_needed; ++i, working_pattern &gt;&gt;= 1) {</div>
-<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>     </div>
-<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>      <span class="keywordflow">if</span> ((working_pattern &amp; 0x01) == 1) {</div>
-<div class="line"><a id="l00556" 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 id="l00557" name="l00557"></a><span class="lineno">  557</span>        ptr += pair.second;</div>
-<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>        levels.push_back(std::move(pair.first));</div>
-<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>      } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>        Level level(allocator);</div>
-<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>        level.reserve(k);</div>
-<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>        levels.push_back(std::move(level));</div>
-<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>      }</div>
-<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    }</div>
-<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>  }</div>
-<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span> </div>
-<div class="line"><a id="l00567" 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 id="l00568" 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 id="l00569" name="l00569"></a><span class="lineno">  569</span>    comparator, allocator);</div>
-<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>}</div>
-<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span> </div>
-<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::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&amp; serde, <span class="keyword">const</span> A&amp; allocator)</div>
-<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>  -&gt; std::pair&lt;Level, size_t&gt; {</div>
-<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
-<div class="line"><a id="l00577" 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&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
-<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>  A alloc(allocator);</div>
-<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_items), items_deleter(allocator, <span class="keyword">false</span>, num_items));</div>
-<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, items.get(), num_items);</div>
-<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
-<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
-<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>  </div>
-<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>  <span class="comment">// successfully read, now put into a Level</span></div>
-<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>  Level level(allocator);</div>
-<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>  level.reserve(capacity);</div>
-<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>  level.insert(level.begin(),</div>
-<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>               std::make_move_iterator(items.get()),</div>
-<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>               std::make_move_iterator(items.get() + num_items));</div>
-<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>  </div>
-<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>  <span class="keywordflow">return</span> std::pair&lt;Level, size_t&gt;(std::move(level), ptr - <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes));</div>
-<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>}</div>
-<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span> </div>
-<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00595" data-start="{" data-end="}">
-<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda">  595</a></span>string&lt;A&gt; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda">quantiles_sketch&lt;T, C, A&gt;::to_string</a>(<span class="keywordtype">bool</span> print_levels, <span class="keywordtype">bool</span> print_items)<span class="keyword"> co [...]
-<div class="line"><a id="l00596" 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 id="l00597" 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 id="l00598" name="l00598"></a><span class="lineno">  598</span>  std::ostringstream os;</div>
-<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>  os &lt;&lt; <span class="stringliteral">&quot;### Quantiles Sketch summary:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>  os &lt;&lt; <span class="stringliteral">&quot;   K              : &quot;</span> &lt;&lt; k_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>  os &lt;&lt; <span class="stringliteral">&quot;   N              : &quot;</span> &lt;&lt; n_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon        : &quot;</span> &lt;&lt; std::setprecision(3) &lt;&lt; get_normalized_rank_error(<span class="keyword">false</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon PMF    : &quot;</span> &lt;&lt; get_normalized_rank_error(<span class="keyword">true</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>  os &lt;&lt; <span class="stringliteral">&quot;   Empty          : &quot;</span> &lt;&lt; (is_empty() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>  os &lt;&lt; <span class="stringliteral">&quot;   Estimation mode: &quot;</span> &lt;&lt; (is_estimation_mode() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>  os &lt;&lt; <span class="stringliteral">&quot;   Levels (w/o BB): &quot;</span> &lt;&lt; levels_.size() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>  os &lt;&lt; <span class="stringliteral">&quot;   Used Levels    : &quot;</span> &lt;&lt; count_valid_levels(bit_pattern_) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>  os &lt;&lt; <span class="stringliteral">&quot;   Retained items : &quot;</span> &lt;&lt; get_num_retained() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>    os &lt;&lt; <span class="stringliteral">&quot;   Min item      : &quot;</span> &lt;&lt; *min_item_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>    os &lt;&lt; <span class="stringliteral">&quot;   Max item      : &quot;</span> &lt;&lt; *max_item_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>  }</div>
-<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>  os &lt;&lt; <span class="stringliteral">&quot;### End sketch summary&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span> </div>
-<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>  <span class="keywordflow">if</span> (print_levels) {</div>
-<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>    os &lt;&lt; <span class="stringliteral">&quot;### Quantiles Sketch levels:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>    os &lt;&lt; <span class="stringliteral">&quot;   index: items in use&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    os &lt;&lt; <span class="stringliteral">&quot;   BB: &quot;</span> &lt;&lt; base_buffer_.size() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; levels_.size(); i++) {</div>
-<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>      os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(i) &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; levels_[i].size() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>    }</div>
-<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch levels&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>  }</div>
-<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span> </div>
-<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>  <span class="keywordflow">if</span> (print_items) {</div>
-<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    os &lt;&lt; <span class="stringliteral">&quot;### Quantiles Sketch data:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>    uint8_t level = 0;</div>
-<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>    os &lt;&lt; <span class="stringliteral">&quot; BB:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> T&amp; item : base_buffer_) {</div>
-<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>      os &lt;&lt; <span class="stringliteral">&quot;    &quot;</span> &lt;&lt; item &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>    }</div>
-<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; levels_.size(); ++i) {</div>
-<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>      os &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(level) &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>      <span class="keywordflow">for</span> (<span class="keyword">const</span> T&amp; item : levels_[i]) {</div>
-<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>        os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; item &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>      }</div>
-<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>    }</div>
-<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch data&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>  }</div>
-<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>  <span class="keywordflow">return</span> string&lt;A&gt;(os.str().c_str(), allocator_);</div>
-<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>}</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  <span class="comment">// allocate buffers as needed</span></div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(k, items_seen);</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>  <span class="keyword">const</span> uint64_t bit_pattern = compute_bit_pattern(k, items_seen);</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span> </div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</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 id="l00542" name="l00542"></a><span class="lineno">  542</span>  <span class="comment">// does not currently operate sketches in compact mode, but will only serialize as compact</span></div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</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 id="l00544" name="l00544"></a><span class="lineno">  544</span>  <span class="comment">// to be able to ingest either serialized format from Java.</span></div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span> </div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>  <span class="comment">// load base buffer</span></div>
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>  <span class="keyword">const</span> uint32_t bb_items = compute_base_buffer_items(k, items_seen);</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>  uint32_t items_to_read = (levels_needed == 0 || is_compact) ? bb_items : 2 * k;</div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</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 id="l00550" name="l00550"></a><span class="lineno">  550</span>  ptr += base_buffer_pair.second;</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>  <span class="keywordflow">if</span> (items_to_read &gt; bb_items) { <span class="comment">// either equal or greater, never read fewer items</span></div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>    <span class="comment">// read remaining items, only use to advance the pointer</span></div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</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 id="l00554" name="l00554"></a><span class="lineno">  554</span>    ptr += extras.second;</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>  }</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span> </div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>  <span class="comment">// populate vector of Levels directly</span></div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>  VectorLevels levels(allocator);</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>  levels.reserve(levels_needed);</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>  <span class="keywordflow">if</span> (levels_needed &gt; 0) {</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>    uint64_t working_pattern = bit_pattern;</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; levels_needed; ++i, working_pattern &gt;&gt;= 1) {</div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>     </div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>      <span class="keywordflow">if</span> ((working_pattern &amp; 0x01) == 1) {</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>        <span class="keyword">auto</span> pair = deserialize_array(ptr, end_ptr - ptr, k, k, serde, allocator);</div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>        ptr += pair.second;</div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>        levels.push_back(std::move(pair.first));</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>      } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>        Level level(allocator);</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>        level.reserve(k);</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>        levels.push_back(std::move(level));</div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>      }</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>    }</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>  }</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span> </div>
+<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>  <span class="keywordflow">return</span> quantiles_sketch(k, items_seen, bit_pattern,</div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</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 id="l00578" name="l00578"></a><span class="lineno">  578</span>    comparator, allocator);</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>}</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span> </div>
+<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::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&amp; serde, <span class="keyword">const</span> A&amp; allocator)</div>
+<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>  -&gt; std::pair&lt;Level, size_t&gt; {</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>  A alloc(allocator);</div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>  std::unique_ptr&lt;T, items_deleter&gt; items(alloc.allocate(num_items), items_deleter(allocator, <span class="keyword">false</span>, num_items));</div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, items.get(), num_items);</div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>  <span class="comment">// serde did not throw, enable destructors</span></div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>  </div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>  <span class="comment">// successfully read, now put into a Level</span></div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>  Level level(allocator);</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>  level.reserve(capacity);</div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>  level.insert(level.begin(),</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>               std::make_move_iterator(items.get()),</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>               std::make_move_iterator(items.get() + num_items));</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>  </div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>  <span class="keywordflow">return</span> std::pair&lt;Level, size_t&gt;(std::move(level), ptr - <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes));</div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>}</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span> </div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00604" data-start="{" data-end="}">
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda">  604</a></span>string&lt;A&gt; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a592a7af55659ff803b26a45552a68dda">quantiles_sketch&lt;T, C, A&gt;::to_string</a>(<span class="keywordtype">bool</span> print_levels, <span class="keywordtype">bool</span> print_items)<span class="keyword"> co [...]
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>  std::ostringstream os;</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>  os &lt;&lt; <span class="stringliteral">&quot;### Quantiles Sketch summary:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>  os &lt;&lt; <span class="stringliteral">&quot;   K              : &quot;</span> &lt;&lt; k_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>  os &lt;&lt; <span class="stringliteral">&quot;   N              : &quot;</span> &lt;&lt; n_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon        : &quot;</span> &lt;&lt; std::setprecision(3) &lt;&lt; get_normalized_rank_error(<span class="keyword">false</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>  os &lt;&lt; <span class="stringliteral">&quot;   Epsilon PMF    : &quot;</span> &lt;&lt; get_normalized_rank_error(<span class="keyword">true</span>) * 100 &lt;&lt; <span class="stringliteral">&quot;%&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>  os &lt;&lt; <span class="stringliteral">&quot;   Empty          : &quot;</span> &lt;&lt; (is_empty() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>  os &lt;&lt; <span class="stringliteral">&quot;   Estimation mode: &quot;</span> &lt;&lt; (is_estimation_mode() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>  os &lt;&lt; <span class="stringliteral">&quot;   Levels (w/o BB): &quot;</span> &lt;&lt; levels_.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>  os &lt;&lt; <span class="stringliteral">&quot;   Used Levels    : &quot;</span> &lt;&lt; count_valid_levels(bit_pattern_) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>  os &lt;&lt; <span class="stringliteral">&quot;   Retained items : &quot;</span> &lt;&lt; get_num_retained() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>    os &lt;&lt; <span class="stringliteral">&quot;   Min item      : &quot;</span> &lt;&lt; *min_item_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>    os &lt;&lt; <span class="stringliteral">&quot;   Max item      : &quot;</span> &lt;&lt; *max_item_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>  }</div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>  os &lt;&lt; <span class="stringliteral">&quot;### End sketch summary&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span> </div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>  <span class="keywordflow">if</span> (print_levels) {</div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>    os &lt;&lt; <span class="stringliteral">&quot;### Quantiles Sketch levels:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    os &lt;&lt; <span class="stringliteral">&quot;   index: items in use&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>    os &lt;&lt; <span class="stringliteral">&quot;   BB: &quot;</span> &lt;&lt; base_buffer_.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; levels_.size(); i++) {</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>      os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(i) &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; levels_[i].size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>    }</div>
+<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch levels&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>  }</div>
+<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span> </div>
+<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>  <span class="keywordflow">if</span> (print_items) {</div>
+<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>    os &lt;&lt; <span class="stringliteral">&quot;### Quantiles Sketch data:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>    uint8_t level = 0;</div>
+<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>    os &lt;&lt; <span class="stringliteral">&quot; BB:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> T&amp; item : base_buffer_) {</div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>      os &lt;&lt; <span class="stringliteral">&quot;    &quot;</span> &lt;&lt; item &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>    }</div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; levels_.size(); ++i) {</div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>      os &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(level) &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>      <span class="keywordflow">for</span> (<span class="keyword">const</span> T&amp; item : levels_[i]) {</div>
+<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>        os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; item &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>      }</div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    }</div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch data&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>  }</div>
+<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>  <span class="keywordflow">return</span> string&lt;A&gt;(os.str().c_str(), allocator_);</div>
+<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>}</div>
 </div>
-<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span> </div>
-<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00644" data-start="{" data-end="}">
-<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">  644</a></span>uint16_t <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">quantiles_sketch&lt;T, C, A&gt;::get_k</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>  <span class="keywordflow">return</span> k_;</div>
-<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>}</div>
+<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span> </div>
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00653" data-start="{" data-end="}">
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">  653</a></span>uint16_t <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">quantiles_sketch&lt;T, C, A&gt;::get_k</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>  <span class="keywordflow">return</span> k_;</div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>}</div>
 </div>
-<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span> </div>
-<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00649" data-start="{" data-end="}">
-<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d">  649</a></span>uint64_t <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d">quantiles_sketch&lt;T, C, A&gt;::get_n</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>  <span class="keywordflow">return</span> n_;</div>
-<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>}</div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span> </div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00658" data-start="{" data-end="}">
+<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d">  658</a></span>uint64_t <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af857be9469a7565252626f27e1f9d74d">quantiles_sketch&lt;T, C, A&gt;::get_n</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>  <span class="keywordflow">return</span> n_;</div>
+<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>}</div>
 </div>
-<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span> </div>
-<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00654" data-start="{" data-end="}">
-<div class="line"><a id="l00654" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a5a2b7a58dc85678d08752945ff655362">quantiles_sketch&lt;T, C, A&gt;::is_empty</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>  <span class="keywordflow">return</span> n_ == 0;</div>
-<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>}</div>
+<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span> </div>
+<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00663" data-start="{" data-end="}">
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a5a2b7a58dc85678d08752945ff655362">  663</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a5a2b7a58dc85678d08752945ff655362">quantiles_sketch&lt;T, C, A&gt;::is_empty</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>  <span class="keywordflow">return</span> n_ == 0;</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>}</div>
 </div>
-<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span> </div>
-<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00659" data-start="{" data-end="}">
-<div class="line"><a id="l00659" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">quantiles_sketch&lt;T, C, A&gt;::is_estimation_mode</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>  <span class="keywordflow">return</span> bit_pattern_ != 0;</div>
-<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>}</div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span> </div>
+<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00668" data-start="{" data-end="}">
+<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">  668</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">quantiles_sketch&lt;T, C, A&gt;::is_estimation_mode</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>  <span class="keywordflow">return</span> bit_pattern_ != 0;</div>
+<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span>}</div>
 </div>
-<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span> </div>
-<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00664" data-start="{" data-end="}">
-<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14">  664</a></span>uint32_t <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14">quantiles_sketch&lt;T, C, A&gt;::get_num_retained</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>  <span class="keywordflow">return</span> compute_retained_items(k_, n_);</div>
-<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>}</div>
+<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span> </div>
+<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00673" data-start="{" data-end="}">
+<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14">  673</a></span>uint32_t <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a31fa76458d81a17dbebfcb828e531f14">quantiles_sketch&lt;T, C, A&gt;::get_num_retained</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>  <span class="keywordflow">return</span> compute_retained_items(k_, n_);</div>
+<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>}</div>
 </div>
-<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span> </div>
-<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00669" data-start="{" data-end="}">
-<div class="line"><a id="l00669" 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&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af2fa890815acf3a1418ea8eee466075c">quantiles_sketch&lt;T, C, A&gt;::get_min_item</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00670" 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">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>  <span class="keywordflow">return</span> *min_item_;</div>
-<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>}</div>
+<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span> </div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00678" data-start="{" data-end="}">
+<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af2fa890815acf3a1418ea8eee466075c">  678</a></span><span class="keyword">const</span> T&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af2fa890815acf3a1418ea8eee466075c">quantiles_sketch&lt;T, C, A&gt;::get_min_item</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>  <span class="keywordflow">return</span> *min_item_;</div>
+<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>}</div>
 </div>
-<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span> </div>
-<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00675" data-start="{" data-end="}">
-<div class="line"><a id="l00675" 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&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">quantiles_sketch&lt;T, C, A&gt;::get_max_item</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00676" 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">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>  <span class="keywordflow">return</span> *max_item_;</div>
-<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>}</div>
+<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span> </div>
+<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00684" data-start="{" data-end="}">
+<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">  684</a></span><span class="keyword">const</span> T&amp; <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">quantiles_sketch&lt;T, C, A&gt;::get_max_item</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span>  <span class="keywordflow">return</span> *max_item_;</div>
+<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>}</div>
 </div>
-<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span> </div>
-<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00681" data-start="{" data-end="}">
-<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40">  681</a></span>C <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40">quantiles_sketch&lt;T, C, A&gt;::get_comparator</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>  <span class="keywordflow">return</span> comparator_;</div>
-<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>}</div>
+<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span> </div>
+<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00690" data-start="{" data-end="}">
+<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40">  690</a></span>C <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a076f89979daa6471a3868cb97ea99b40">quantiles_sketch&lt;T, C, A&gt;::get_comparator</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>  <span class="keywordflow">return</span> comparator_;</div>
+<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>}</div>
 </div>
-<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span> </div>
-<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00686" data-start="{" data-end="}">
-<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">  686</a></span>A <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">quantiles_sketch&lt;T, C, A&gt;::get_allocator</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>  <span class="keywordflow">return</span> allocator_;</div>
-<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>}</div>
+<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span> </div>
+<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00695" data-start="{" data-end="}">
+<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">  695</a></span>A <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">quantiles_sketch&lt;T, C, A&gt;::get_allocator</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>  <span class="keywordflow">return</span> allocator_;</div>
+<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>}</div>
 </div>
-<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span> </div>
-<div class="line"><a id="l00690" 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 id="l00691" name="l00691"></a><span class="lineno">  691</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>template&lt;typename SerDe, typename TT, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="foldopen" id="foldopen00693" data-start="{" data-end="}">
-<div class="line"><a id="l00693" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">quantiles_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp;)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00694" 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 id="l00695" 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 id="l00696" name="l00696"></a><span class="lineno">  696</span>}</div>
+<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span> </div>
+<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
+<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>template&lt;typename SerDe, typename TT, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00702" data-start="{" data-end="}">
+<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">  702</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">quantiles_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp;)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div>
+<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>  <span class="keywordflow">return</span> DATA_START + ((get_num_retained() + 2) * <span class="keyword">sizeof</span>(TT));</div>
+<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span>}</div>
 </div>
-<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span> </div>
-<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span><span class="comment">// implementation for all other types</span></div>
-<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>template&lt;typename SerDe, typename TT, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">quantiles_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00702" 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 id="l00703" name="l00703"></a><span class="lineno">  703</span>  <span class="keywordtype">size_t</span> size = DATA_START;</div>
-<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>  size += serde.size_of_item(*min_item_);</div>
-<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span>  size += serde.size_of_item(*max_item_);</div>
-<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it: *this) size += serde.size_of_item(it.first);</div>
-<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span>  <span class="keywordflow">return</span> size;</div>
-<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>}</div>
-<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span> </div>
-<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00711" data-start="{" data-end="}">
-<div class="line"><a id="l00711" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">quantiles_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(<span class="keywordtype">bool</span> is_pmf)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00712" 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 id="l00713" name="l00713"></a><span class="lineno">  713</span>}</div>
+<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span> </div>
+<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="comment">// implementation for all other types</span></div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>template&lt;typename SerDe, typename TT, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ad9a5259d93d148b5c2050d68e7788716">quantiles_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; <a class="code hl_struct" href="structdatasketches_1_1serde.html">serde</a>)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>  <span class="keywordflow">if</span> (is_empty()) { <span class="keywordflow">return</span> EMPTY_SIZE_BYTES; }</div>
+<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>  <span class="keywordtype">size_t</span> size = DATA_START;</div>
+<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>  size += serde.size_of_item(*min_item_);</div>
+<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>  size += serde.size_of_item(*max_item_);</div>
+<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it: *this) size += serde.size_of_item(it.first);</div>
+<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span>  <span class="keywordflow">return</span> size;</div>
+<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>}</div>
+<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span> </div>
+<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00720" data-start="{" data-end="}">
+<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">  720</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">quantiles_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(<span class="keywordtype">bool</span> is_pmf)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>  <span class="keywordflow">return</span> get_normalized_rank_error(k_, is_pmf);</div>
+<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span>}</div>
 </div>
-<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span> </div>
-<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00716" data-start="{" data-end="}">
-<div class="line"><a id="l00716" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">quantiles_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(uint16_t k, <span class="keywordtype">bool</span> is_pmf) {</div>
-<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>  <span class="keywordflow">return</span> is_pmf</div>
-<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>      ? 1.854 / std::pow(k, 0.9657)</div>
-<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>      : 1.576 / std::pow(k, 0.9726);</div>
-<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>}</div>
+<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span> </div>
+<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00725" data-start="{" data-end="}">
+<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ae957f61cebc92305fc758dcfad797a41">  725</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a3efad6c7f1aa59649203cc9f70cf36c9">quantiles_sketch&lt;T, C, A&gt;::get_normalized_rank_error</a>(uint16_t k, <span class="keywordtype">bool</span> is_pmf) {</div>
+<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>  <span class="keywordflow">return</span> is_pmf</div>
+<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span>      ? 1.854 / std::pow(k, 0.9657)</div>
+<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>      : 1.576 / std::pow(k, 0.9726);</div>
+<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span>}</div>
 </div>
-<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span> </div>
-<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00723" data-start="{" data-end="}">
-<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">  723</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">quantiles_sketch&lt;T, C, A&gt;::get_sorted_view</a>()<span class=" [...]
-<div class="line"><a id="l00724" 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 id="l00725" name="l00725"></a><span class="lineno">  725</span>  <span class="keywordflow">if</span> (!is_base_buffer_sorted_) {</div>
-<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>    std::sort(<span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).begin(), <span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).end(), comparator_);</div>
-<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span>    <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>  }</div>
-<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> view(get_num_retained(), comparator_, allocator_);</div>
 <div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span> </div>
-<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>  uint64_t weight = 1;</div>
-<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>  view.add(base_buffer_.begin(), base_buffer_.end(), weight);</div>
-<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; level: levels_) {</div>
-<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>    weight &lt;&lt;= 1;</div>
-<div class="line"><a id="l00735" 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 id="l00736" name="l00736"></a><span class="lineno">  736</span>    view.add(level.begin(), level.end(), weight);</div>
+<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00732" data-start="{" data-end="}">
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">  732</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">quantiles_sketch&lt;T, C, A&gt;::get_sorted_view</a>()<span class=" [...]
+<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>  <span class="comment">// allow side-effect of sorting the base buffer</span></div>
+<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>  <span class="keywordflow">if</span> (!is_base_buffer_sorted_) {</div>
+<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>    std::sort(<span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).begin(), <span class="keyword">const_cast&lt;</span>Level&amp;<span class="keyword">&gt;</span>(base_buffer_).end(), comparator_);</div>
+<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>    <span class="keyword">const_cast&lt;</span><a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch</a>*<span class="keyword">&gt;</span>(<span class="keyword">this</span>)-&gt;is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
 <div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>  }</div>
-<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span> </div>
-<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span>  view.convert_to_cummulative();</div>
-<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>  <span class="keywordflow">return</span> view;</div>
-<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span>}</div>
+<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> view(get_num_retained(), comparator_, allocator_);</div>
+<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span> </div>
+<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>  uint64_t weight = 1;</div>
+<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span>  view.add(base_buffer_.begin(), base_buffer_.end(), weight);</div>
+<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; level: levels_) {</div>
+<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span>    weight &lt;&lt;= 1;</div>
+<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>    <span class="keywordflow">if</span> (level.empty()) { <span class="keywordflow">continue</span>; }</div>
+<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>    view.add(level.begin(), level.end(), weight);</div>
+<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>  }</div>
+<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span> </div>
+<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>  view.convert_to_cummulative();</div>
+<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>  <span class="keywordflow">return</span> view;</div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>}</div>
 </div>
-<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span> </div>
-<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00744" data-start="{" data-end="}">
-<div class="line"><a id="l00744" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#ac02fcfb6e706148458a2ef89390223a9">quantiles_sketch&lt;T, C, A&gt;::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class [...]
-<div class="line"><a id="l00745" 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">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>  <span class="keywordflow">if</span> ((rank &lt; 0.0) || (rank &gt; 1.0)) {</div>
-<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Normalized rank cannot be less than 0 or greater than 1&quot;</span>);</div>
-<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>  }</div>
-<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>  <span class="comment">// possible side-effect: sorting base buffer</span></div>
-<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_quantile(rank, inclusive);</div>
-<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>}</div>
+<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span> </div>
+<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00753" data-start="{" data-end="}">
+<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ac02fcfb6e706148458a2ef89390223a9">  753</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ac02fcfb6e706148458a2ef89390223a9">quantiles_sketch&lt;T, C, A&gt;::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class [...]
+<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>  <span class="keywordflow">if</span> ((rank &lt; 0.0) || (rank &gt; 1.0)) {</div>
+<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Normalized rank cannot be less than 0 or greater than 1&quot;</span>);</div>
+<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>  }</div>
+<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>  <span class="comment">// possible side-effect: sorting base buffer</span></div>
+<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_quantile(rank, inclusive);</div>
+<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>}</div>
 </div>
-<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span> </div>
-<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00755" data-start="{" data-end="}">
-<div class="line"><a id="l00755" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">quantiles_sketch&lt;T, C, A&gt;::get_rank</a>(<span class="keyword">const</span> T&amp; item, <span class="keywordtype">bool</span> inclusive)<span cl [...]
-<div class="line"><a id="l00756" 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">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_rank(item, inclusive);</div>
-<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span>}</div>
+<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span> </div>
+<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00764" data-start="{" data-end="}">
+<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">  764</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">quantiles_sketch&lt;T, C, A&gt;::get_rank</a>(<span class="keyword">const</span> T&amp; item, <span class="keywordtype">bool</span> inclusive)<span cl [...]
+<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_rank(item, inclusive);</div>
+<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span>}</div>
 </div>
-<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span> </div>
-<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00762" data-start="{" data-end="}">
-<div class="line"><a id="l00762" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a44226b755e73883ea2c128876e35b1d1">quantiles_sketch&lt;T, C, A&gt;::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclus [...]
-<div class="line"><a id="l00763" 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">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_PMF(split_points, size, inclusive);</div>
-<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>}</div>
+<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span> </div>
+<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00771" data-start="{" data-end="}">
+<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a44226b755e73883ea2c128876e35b1d1">  771</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a44226b755e73883ea2c128876e35b1d1">quantiles_sketch&lt;T, C, A&gt;::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclus [...]
+<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_PMF(split_points, size, inclusive);</div>
+<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>}</div>
 </div>
-<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span> </div>
-<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00769" data-start="{" data-end="}">
-<div class="line"><a id="l00769" 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 hl_function" href="classdatasketches_1_1quantiles__sketch.html#a20a4d992209b2aa58614c998d143705c">quantiles_sketch&lt;T, C, A&gt;::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclus [...]
-<div class="line"><a id="l00770" 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">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_CDF(split_points, size, inclusive);</div>
-<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>}</div>
+<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span> </div>
+<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00778" data-start="{" data-end="}">
+<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#a20a4d992209b2aa58614c998d143705c">  778</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#a20a4d992209b2aa58614c998d143705c">quantiles_sketch&lt;T, C, A&gt;::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclus [...]
+<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_CDF(split_points, size, inclusive);</div>
+<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>}</div>
 </div>
-<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span> </div>
-<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span>uint32_t <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::compute_retained_items</a>(uint16_t k, uint64_t n) {</div>
-<div class="line"><a id="l00777" 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 id="l00778" 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 id="l00779" 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 id="l00780" name="l00780"></a><span class="lineno">  780</span>  <span class="keywordflow">return</span> bb_count + (k * valid_levels);</div>
-<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>}</div>
-<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span> </div>
-<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>uint32_t quantiles_sketch&lt;T, C, A&gt;::compute_base_buffer_items(uint16_t k, uint64_t n) {</div>
-<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span>  <span class="keywordflow">return</span> n % (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2) * k);</div>
-<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>}</div>
-<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span> </div>
-<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>uint64_t quantiles_sketch&lt;T, C, A&gt;::compute_bit_pattern(uint16_t k, uint64_t n) {</div>
-<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>  <span class="keywordflow">return</span> n / (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2) * k);</div>
-<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>}</div>
-<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span> </div>
-<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span>uint32_t quantiles_sketch&lt;T, C, A&gt;::count_valid_levels(uint64_t bit_pattern) {</div>
-<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>  uint32_t count = 0;</div>
-<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>  <span class="keywordflow">for</span> (; bit_pattern &gt; 0; ++count) bit_pattern &amp;= bit_pattern - 1;</div>
-<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>  <span class="keywordflow">return</span> count;</div>
-<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span>}</div>
-<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span> </div>
-<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>uint8_t quantiles_sketch&lt;T, C, A&gt;::compute_levels_needed(uint16_t k, uint64_t n) {</div>
-<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(64U) - count_leading_zeros_in_u64(n / (2 * k));</div>
-<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span>}</div>
-<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span> </div>
-<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_k(uint16_t k) {</div>
-<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>  <span class="keywordflow">if</span> (k &lt; quantiles_constants::MIN_K || k &gt; <a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">quantiles_constants::MAX_K</a> || (k &amp; (k - 1)) != 0) {</div>
-<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;k must be a power of 2 that is &gt;= &quot;</span></div>
-<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>      + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">quantiles_constants::MIN_K</a>) + <span class="stringliteral">&quot; and &lt;= &quot;</span></div>
-<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>      + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">quantiles_constants::MAX_K</a>) + <span class="stringliteral">&quot;. Found: &quot;</span> + std::to_string(k));</div>
-<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span>  }</div>
+<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span> </div>
+<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span>uint32_t <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::compute_retained_items</a>(uint16_t k, uint64_t n) {</div>
+<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>  <span class="keyword">const</span> uint32_t bb_count = compute_base_buffer_items(k, n);</div>
+<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span>  <span class="keyword">const</span> uint64_t bit_pattern = compute_bit_pattern(k, n);</div>
+<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>  <span class="keyword">const</span> uint32_t valid_levels = count_valid_levels(bit_pattern);</div>
+<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>  <span class="keywordflow">return</span> bb_count + (k * valid_levels);</div>
+<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>}</div>
+<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span> </div>
+<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span>uint32_t quantiles_sketch&lt;T, C, A&gt;::compute_base_buffer_items(uint16_t k, uint64_t n) {</div>
+<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span>  <span class="keywordflow">return</span> n % (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2) * k);</div>
+<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>}</div>
+<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span> </div>
+<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span>uint64_t quantiles_sketch&lt;T, C, A&gt;::compute_bit_pattern(uint16_t k, uint64_t n) {</div>
+<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span>  <span class="keywordflow">return</span> n / (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2) * k);</div>
+<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>}</div>
+<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span> </div>
+<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span>uint32_t quantiles_sketch&lt;T, C, A&gt;::count_valid_levels(uint64_t bit_pattern) {</div>
+<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span>  uint32_t count = 0;</div>
+<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>  <span class="keywordflow">for</span> (; bit_pattern &gt; 0; ++count) bit_pattern &amp;= bit_pattern - 1;</div>
+<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span>  <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>}</div>
+<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span> </div>
+<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>uint8_t quantiles_sketch&lt;T, C, A&gt;::compute_levels_needed(uint16_t k, uint64_t n) {</div>
+<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(64U) - count_leading_zeros_in_u64(n / (2 * k));</div>
 <div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>}</div>
 <div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span> </div>
 <div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_serial_version(uint8_t serial_version) {</div>
-<div class="line"><a id="l00816" 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 id="l00817" name="l00817"></a><span class="lineno">  817</span>    <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>  <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption. Unrecognized serialization version: &quot;</span> + std::to_string(serial_version));</div>
-<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>}</div>
-<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span> </div>
-<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_family_id(uint8_t family_id) {</div>
-<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>  <span class="keywordflow">if</span> (family_id == FAMILY)</div>
-<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>    <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span>  <span class="keywordflow">else</span></div>
-<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption. Family id does not indicate quantiles sketch: &quot;</span> + std::to_string(family_id));</div>
-<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span>}</div>
-<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span> </div>
-<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_header_validity(uint8_t preamble_longs, uint8_t flags_byte, uint8_t serial_version) {</div>
-<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> empty = (flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY)) &gt; 0;</div>
-<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> compact = (flags_byte &amp; (1 &lt;&lt; flags::IS_COMPACT)) &gt; 0;</div>
-<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span> </div>
-<div class="line"><a id="l00835" 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 id="l00836" name="l00836"></a><span class="lineno">  836</span>                     + (4 * (serial_version &amp; 0xF)) + (32 * (preamble_longs &amp; 0x3F));</div>
-<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>  <span class="keywordtype">bool</span> valid = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span>  </div>
-<div class="line"><a id="l00839" 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 id="l00840" name="l00840"></a><span class="lineno">  840</span>      <span class="keywordflow">case</span> 38  : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span>      <span class="keywordflow">case</span> 164 : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span>      <span class="keywordflow">case</span> 42  : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span>      <span class="keywordflow">case</span> 72  : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00844" 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 id="l00845" name="l00845"></a><span class="lineno">  845</span>      <span class="keywordflow">case</span> 46  : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00846" 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 id="l00847" name="l00847"></a><span class="lineno">  847</span>      <span class="keywordflow">case</span> 78  : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00848" 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 id="l00849" name="l00849"></a><span class="lineno">  849</span>      <span class="keywordflow">case</span> 76  : <span class="keywordflow">break</span>; </div>
-<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span>      default : <span class="comment">//all other case values are invalid</span></div>
-<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span>        valid = <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span>  }</div>
-<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span> </div>
-<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>  <span class="keywordflow">if</span> (!valid) {</div>
-<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>    std::ostringstream os;</div>
-<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span>    os &lt;&lt; <span class="stringliteral">&quot;Possible sketch corruption. Inconsistent state: &quot;</span></div>
-<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span>       &lt;&lt; <span class="stringliteral">&quot;preamble_longs = &quot;</span> &lt;&lt; preamble_longs</div>
-<div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span>       &lt;&lt; <span class="stringliteral">&quot;, empty = &quot;</span> &lt;&lt; (empty ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>)</div>
-<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>       &lt;&lt; <span class="stringliteral">&quot;, serialization_version = &quot;</span> &lt;&lt; serial_version</div>
-<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span>       &lt;&lt; <span class="stringliteral">&quot;, compact = &quot;</span> &lt;&lt; (compact ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>);</div>
-<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span>    <span class="keywordflow">throw</span> std::invalid_argument(os.str());</div>
-<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span>  }</div>
-<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span>}</div>
-<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span> </div>
-<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00866" data-start="{" data-end="}">
-<div class="line"><a id="l00866" 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 hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">quantiles_sketch&lt;T, C [...]
-<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a>(base_buffer_, levels_, k_, n_, <span class="keyword">false</span>);</div>
-<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span>}</div>
+<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_k(uint16_t k) {</div>
+<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>  <span class="keywordflow">if</span> (k &lt; quantiles_constants::MIN_K || k &gt; <a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">quantiles_constants::MAX_K</a> || (k &amp; (k - 1)) != 0) {</div>
+<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;k must be a power of 2 that is &gt;= &quot;</span></div>
+<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>      + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#ab9f2b631adf46fe04a11814cd1018926">quantiles_constants::MIN_K</a>) + <span class="stringliteral">&quot; and &lt;= &quot;</span></div>
+<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span>      + std::to_string(<a class="code hl_variable" href="namespacedatasketches_1_1quantiles__constants.html#a3bd28528c16e8911658faff9c98b305f">quantiles_constants::MAX_K</a>) + <span class="stringliteral">&quot;. Found: &quot;</span> + std::to_string(k));</div>
+<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>  }</div>
+<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>}</div>
+<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span> </div>
+<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_serial_version(uint8_t serial_version) {</div>
+<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</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 id="l00826" name="l00826"></a><span class="lineno">  826</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption. Unrecognized serialization version: &quot;</span> + std::to_string(serial_version));</div>
+<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span>}</div>
+<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span> </div>
+<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_family_id(uint8_t family_id) {</div>
+<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span>  <span class="keywordflow">if</span> (family_id == FAMILY)</div>
+<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption. Family id does not indicate quantiles sketch: &quot;</span> + std::to_string(family_id));</div>
+<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>}</div>
+<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span> </div>
+<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::check_header_validity(uint8_t preamble_longs, uint8_t flags_byte, uint8_t serial_version) {</div>
+<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> empty = (flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY)) &gt; 0;</div>
+<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> compact = (flags_byte &amp; (1 &lt;&lt; flags::IS_COMPACT)) &gt; 0;</div>
+<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span> </div>
+<div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span>  <span class="keyword">const</span> uint8_t sw = (compact ? 1 : 0) + (2 * (empty ? 1 : 0))</div>
+<div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>                     + (4 * (serial_version &amp; 0xF)) + (32 * (preamble_longs &amp; 0x3F));</div>
+<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>  <span class="keywordtype">bool</span> valid = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span>  </div>
+<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span>  <span class="keywordflow">switch</span> (sw) { <span class="comment">// exhaustive list and description of all valid cases</span></div>
+<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span>      <span class="keywordflow">case</span> 38  : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span>      <span class="keywordflow">case</span> 164 : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span>      <span class="keywordflow">case</span> 42  : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span>      <span class="keywordflow">case</span> 72  : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</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 id="l00854" name="l00854"></a><span class="lineno">  854</span>      <span class="keywordflow">case</span> 46  : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</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 id="l00856" name="l00856"></a><span class="lineno">  856</span>      <span class="keywordflow">case</span> 78  : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</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 id="l00858" name="l00858"></a><span class="lineno">  858</span>      <span class="keywordflow">case</span> 76  : <span class="keywordflow">break</span>; </div>
+<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>      default : <span class="comment">//all other case values are invalid</span></div>
+<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span>        valid = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span>  }</div>
+<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span> </div>
+<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span>  <span class="keywordflow">if</span> (!valid) {</div>
+<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span>    std::ostringstream os;</div>
+<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span>    os &lt;&lt; <span class="stringliteral">&quot;Possible sketch corruption. Inconsistent state: &quot;</span></div>
+<div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span>       &lt;&lt; <span class="stringliteral">&quot;preamble_longs = &quot;</span> &lt;&lt; preamble_longs</div>
+<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>       &lt;&lt; <span class="stringliteral">&quot;, empty = &quot;</span> &lt;&lt; (empty ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>)</div>
+<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span>       &lt;&lt; <span class="stringliteral">&quot;, serialization_version = &quot;</span> &lt;&lt; serial_version</div>
+<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span>       &lt;&lt; <span class="stringliteral">&quot;, compact = &quot;</span> &lt;&lt; (compact ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>);</div>
+<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span>    <span class="keywordflow">throw</span> std::invalid_argument(os.str());</div>
+<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span>  }</div>
+<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span>}</div>
+<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span> </div>
+<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00875" data-start="{" data-end="}">
+<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">  875</a></span><span class="keyword">typename</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#ac5337e7ce1f6a4ebcef233caf3e24c01">quantiles_sketch&lt;T, C [...]
+<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a>(base_buffer_, levels_, k_, n_, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00877" name="l00877"></a><span class="lineno">  877</span>}</div>
 </div>
-<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span> </div>
-<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00871" data-start="{" data-end="}">
-<div class="line"><a id="l00871" 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 hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">quantiles_sketch&lt;T, C [...]
-<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a>(base_buffer_, levels_, k_, n_, <span class="keyword">true</span>);</div>
-<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span>}</div>
+<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span> </div>
+<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00880" data-start="{" data-end="}">
+<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"><a class="line" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">  880</a></span><span class="keyword">typename</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a> <a class="code hl_function" href="classdatasketches_1_1quantiles__sketch.html#af3d8f736304ab5d51319c00febfc0ad1">quantiles_sketch&lt;T, C [...]
+<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::const_iterator</a>(base_buffer_, levels_, k_, n_, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span>}</div>
 </div>
-<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span> </div>
-<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::grow_base_buffer</a>() {</div>
-<div class="line"><a id="l00877" 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&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(2 * k_), 2 * base_buffer_.size()), <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(1));</div>
-<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>  base_buffer_.reserve(new_size);</div>
-<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>}</div>
-<div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span> </div>
-<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::process_full_base_buffer() {</div>
-<div class="line"><a id="l00883" 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 id="l00884" 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 id="l00885" name="l00885"></a><span class="lineno">  885</span> </div>
-<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span>  std::sort(base_buffer_.begin(), base_buffer_.end(), comparator_);</div>
-<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span>  in_place_propagate_carry(0,</div>
-<div class="line"><a id="l00888" 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 id="l00889" name="l00889"></a><span class="lineno">  889</span>                           base_buffer_,</div>
-<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span>                           <span class="keyword">true</span>, *<span class="keyword">this</span>);</div>
-<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>  base_buffer_.clear();</div>
-<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span>  is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00893" name="l00893"></a><span class="lineno">  893</span>  <span class="keywordflow">if</span> (n_ / (2 * k_) != bit_pattern_) {</div>
-<div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Internal error: n / 2k (&quot;</span> + std::to_string(n_ / 2 * k_)</div>
-<div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span>      + <span class="stringliteral">&quot; != bit_pattern &quot;</span> + std::to_string(bit_pattern_));</div>
-<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span>  }</div>
-<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span>}</div>
-<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span> </div>
-<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span><span class="keywordtype">bool</span> quantiles_sketch&lt;T, C, A&gt;::grow_levels_if_needed() {</div>
-<div class="line"><a id="l00901" 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 id="l00902" name="l00902"></a><span class="lineno">  902</span>  <span class="keywordflow">if</span> (levels_needed == 0)</div>
-<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// don&#39;t need levels and might have small base buffer. Possible during merges.</span></div>
-<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span> </div>
-<div class="line"><a id="l00905" 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 id="l00906" name="l00906"></a><span class="lineno">  906</span>  <span class="keywordflow">if</span> (levels_needed &lt;= levels_.size())</div>
-<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span> </div>
-<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span>  Level empty_level(allocator_);</div>
-<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span>  empty_level.reserve(k_);</div>
-<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span>  levels_.push_back(std::move(empty_level));</div>
-<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span>}</div>
-<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span> </div>
-<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdV&gt;</div>
-<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::in_place_propagate_carry(uint8_t starting_level,</div>
-<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span>                                                         FwdV&amp;&amp; buf_size_k, Level&amp; buf_size_2k, </div>
-<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span>                                                         <span class="keywordtype">bool</span> apply_as_update,</div>
-<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span>                                                         quantiles_sketch&amp; sketch) {</div>
-<div class="line"><a id="l00921" 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 id="l00922" 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 id="l00883" name="l00883"></a><span class="lineno">  883</span> </div>
+<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1quantiles__sketch.html">quantiles_sketch&lt;T, C, A&gt;::grow_base_buffer</a>() {</div>
+<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_size = std::max(std::min(<span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(2 * k_), 2 * base_buffer_.size()), <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(1));</div>
+<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span>  base_buffer_.reserve(new_size);</div>
+<div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span>}</div>
+<div class="line"><a id="l00889" name="l00889"></a><span class="lineno">  889</span> </div>
+<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::process_full_base_buffer() {</div>
+<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span>  <span class="comment">// make sure there will be enough levels for the propagation</span></div>
+<div class="line"><a id="l00893" name="l00893"></a><span class="lineno">  893</span>  grow_levels_if_needed(); <span class="comment">// note: n_ was already incremented by update() before this</span></div>
+<div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span> </div>
+<div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span>  std::sort(base_buffer_.begin(), base_buffer_.end(), comparator_);</div>
+<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span>  in_place_propagate_carry(0,</div>
+<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span>                           levels_[0], <span class="comment">// unused here, but 0 is guaranteed to exist</span></div>
+<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span>                           base_buffer_,</div>
+<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span>                           <span class="keyword">true</span>, *<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>  base_buffer_.clear();</div>
+<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span>  is_base_buffer_sorted_ = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span>  <span class="keywordflow">if</span> (n_ / (2 * k_) != bit_pattern_) {</div>
+<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Internal error: n / 2k (&quot;</span> + std::to_string(n_ / 2 * k_)</div>
+<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span>      + <span class="stringliteral">&quot; != bit_pattern &quot;</span> + std::to_string(bit_pattern_));</div>
+<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span>  }</div>
+<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span>}</div>
+<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span> </div>
+<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span><span class="keywordtype">bool</span> quantiles_sketch&lt;T, C, A&gt;::grow_levels_if_needed() {</div>
+<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(k_, n_);</div>
+<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span>  <span class="keywordflow">if</span> (levels_needed == 0)</div>
+<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// don&#39;t need levels and might have small base buffer. Possible during merges.</span></div>
+<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span> </div>
+<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</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 id="l00915" name="l00915"></a><span class="lineno">  915</span>  <span class="keywordflow">if</span> (levels_needed &lt;= levels_.size())</div>
+<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span> </div>
+<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span>  Level empty_level(allocator_);</div>
+<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span>  empty_level.reserve(k_);</div>
+<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span>  levels_.push_back(std::move(empty_level));</div>
+<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span>}</div>
 <div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span> </div>
-<div class="line"><a id="l00924" 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 id="l00925" name="l00925"></a><span class="lineno">  925</span> </div>
-<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span>  <span class="keywordflow">if</span> (apply_as_update) {</div>
-<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span>    <span class="comment">// update version of computation</span></div>
-<div class="line"><a id="l00928" 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 id="l00929" name="l00929"></a><span class="lineno">  929</span>    zip_buffer(buf_size_2k, sketch.levels_[ending_level]);</div>
-<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>    <span class="comment">// merge_into version of computation</span></div>
-<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span>    <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; k; ++i) {</div>
-<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span>      sketch.levels_[ending_level].push_back(conditional_forward&lt;FwdV&gt;(buf_size_k[i]));</div>
-<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span>    }</div>
-<div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span>  }</div>
-<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span> </div>
-<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>  <span class="keywordflow">for</span> (uint64_t lvl = starting_level; lvl &lt; ending_level; lvl++) {</div>
-<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span>    <span class="keywordflow">if</span> ((bit_pattern &amp; (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1) &lt;&lt; lvl)) == 0) {</div>
-<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;unexpected empty level in bit_pattern&quot;</span>);</div>
-<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>    }</div>
-<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span>    merge_two_size_k_buffers(</div>
-<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span>        sketch.levels_[lvl],</div>
-<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span>        sketch.levels_[ending_level],</div>
-<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span>        buf_size_2k, sketch.get_comparator());</div>
-<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span>    sketch.levels_[lvl].clear();</div>
-<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span>    sketch.levels_[ending_level].clear();</div>
-<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span>    zip_buffer(buf_size_2k, sketch.levels_[ending_level]);</div>
-<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>  } <span class="comment">// end of loop over lower levels</span></div>
-<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span> </div>
-<div class="line"><a id="l00950" 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 id="l00951" name="l00951"></a><span class="lineno">  951</span>  sketch.bit_pattern_ = bit_pattern + (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1) &lt;&lt; starting_level);</div>
-<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span>}</div>
-<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span> </div>
-<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::zip_buffer(Level&amp; buf_in, Level&amp; buf_out) {</div>
-<div class="line"><a id="l00956" name="l00956"></a><span class="lineno">  956</span><span class="preprocessor">#ifdef QUANTILES_VALIDATION</span></div>
-<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>  <span class="keyword">static</span> uint32_t next_offset = 0;</div>
-<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span>  uint32_t rand_offset = next_offset;</div>
-<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span>  next_offset = 1 - next_offset;</div>
-<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span><span class="preprocessor">#else</span></div>
-<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span>  uint32_t rand_offset = random_utils::random_bit();</div>
-<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00963" 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 id="l00964" name="l00964"></a><span class="lineno">  964</span>    || (buf_out.size() &gt; 0)) {</div>
-<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;zip_buffer requires buf_in.size() == &quot;</span></div>
-<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span>        <span class="stringliteral">&quot;2*buf_out.capacity() and empty buf_out&quot;</span>);</div>
-<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span>  }</div>
-<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span> </div>
-<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span>  <span class="keywordtype">size_t</span> k = buf_out.capacity();</div>
-<div class="line"><a id="l00970" name="l00970"></a><span class="lineno">  970</span>  <span class="keywordflow">for</span> (uint32_t i = rand_offset, o = 0; o &lt; k; i += 2, ++o) {</div>
-<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span>    buf_out.push_back(std::move(buf_in[i]));</div>
-<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>  }</div>
-<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span>  buf_in.clear();</div>
-<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span>}</div>
-<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span> </div>
-<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdV&gt;</div>
-<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::zip_buffer_with_stride(FwdV&amp;&amp; buf_in, Level&amp; buf_out, uint16_t stride) {</div>
-<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span>  <span class="comment">// Random offset in range [0, stride)</span></div>
-<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span>  std::uniform_int_distribution&lt;uint16_t&gt; dist(0, stride - 1);</div>
-<div class="line"><a id="l00981" 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 id="l00982" name="l00982"></a><span class="lineno">  982</span>  </div>
-<div class="line"><a id="l00983" 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 id="l00984" name="l00984"></a><span class="lineno">  984</span>    || (buf_out.size() &gt; 0)) {</div>
-<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;zip_buffer_with_stride requires buf_in.size() == &quot;</span></div>
-<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span>        <span class="stringliteral">&quot;stride*buf_out.capacity() and empty buf_out&quot;</span>);</div>
-<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span>  }</div>
-<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>  </div>
-<div class="line"><a id="l00989" 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 id="l00990" name="l00990"></a><span class="lineno">  990</span>  <span class="keywordflow">for</span> (uint16_t i = rand_offset, o = 0; o &lt; k; i += stride, ++o) {</div>
-<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span>    buf_out.push_back(conditional_forward&lt;FwdV&gt;(buf_in[i]));</div>
-<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span>  }</div>
-<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span>  <span class="comment">// do not clear input buffer</span></div>
-<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>}</div>
-<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span> </div>
-<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::merge_two_size_k_buffers(Level&amp; src_1, Level&amp; src_2,</div>
-<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span>    Level&amp; dst, <span class="keyword">const</span> C&amp; comparator) {</div>
-<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span>  <span class="keywordflow">if</span> (src_1.size() != src_2.size()</div>
-<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span>    || src_1.size() * 2 != dst.capacity()</div>
-<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span>    || dst.size() != 0) {</div>
-<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Input invariants violated in merge_two_size_k_buffers()&quot;</span>);</div>
-<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>  }</div>
+<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00925" name="l00925"></a><span class="lineno">  925</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdV&gt;</div>
+<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::in_place_propagate_carry(uint8_t starting_level,</div>
+<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span>                                                         FwdV&amp;&amp; buf_size_k, Level&amp; buf_size_2k, </div>
+<div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span>                                                         <span class="keywordtype">bool</span> apply_as_update,</div>
+<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span>                                                         quantiles_sketch&amp; sketch) {</div>
+<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span>  <span class="keyword">const</span> uint64_t bit_pattern = sketch.bit_pattern_;</div>
+<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> k = sketch.k_;</div>
+<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span> </div>
+<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span>  uint8_t ending_level = lowest_zero_bit_starting_at(bit_pattern, starting_level);</div>
+<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span> </div>
+<div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span>  <span class="keywordflow">if</span> (apply_as_update) {</div>
+<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>    <span class="comment">// update version of computation</span></div>
+<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>    <span class="comment">// its is okay for buf_size_k to be null in this case</span></div>
+<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span>    zip_buffer(buf_size_2k, sketch.levels_[ending_level]);</div>
+<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>    <span class="comment">// merge_into version of computation</span></div>
+<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span>    <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; k; ++i) {</div>
+<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span>      sketch.levels_[ending_level].push_back(conditional_forward&lt;FwdV&gt;(buf_size_k[i]));</div>
+<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span>    }</div>
+<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span>  }</div>
+<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span> </div>
+<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span>  <span class="keywordflow">for</span> (uint64_t lvl = starting_level; lvl &lt; ending_level; lvl++) {</div>
+<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span>    <span class="keywordflow">if</span> ((bit_pattern &amp; (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1) &lt;&lt; lvl)) == 0) {</div>
+<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;unexpected empty level in bit_pattern&quot;</span>);</div>
+<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>    }</div>
+<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span>    merge_two_size_k_buffers(</div>
+<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span>        sketch.levels_[lvl],</div>
+<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span>        sketch.levels_[ending_level],</div>
+<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span>        buf_size_2k, sketch.get_comparator());</div>
+<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span>    sketch.levels_[lvl].clear();</div>
+<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span>    sketch.levels_[ending_level].clear();</div>
+<div class="line"><a id="l00956" name="l00956"></a><span class="lineno">  956</span>    zip_buffer(buf_size_2k, sketch.levels_[ending_level]);</div>
+<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>  } <span class="comment">// end of loop over lower levels</span></div>
+<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span> </div>
+<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span>  <span class="comment">// update bit pattern with binary-arithmetic ripple carry</span></div>
+<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span>  sketch.bit_pattern_ = bit_pattern + (<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1) &lt;&lt; starting_level);</div>
+<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span>}</div>
+<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span> </div>
+<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::zip_buffer(Level&amp; buf_in, Level&amp; buf_out) {</div>
+<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span><span class="preprocessor">#ifdef QUANTILES_VALIDATION</span></div>
+<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span>  <span class="keyword">static</span> uint32_t next_offset = 0;</div>
+<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span>  uint32_t rand_offset = next_offset;</div>
+<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span>  next_offset = 1 - next_offset;</div>
+<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00970" name="l00970"></a><span class="lineno">  970</span>  uint32_t rand_offset = random_utils::random_bit();</div>
+<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>  <span class="keywordflow">if</span> ((buf_in.size() != 2 * buf_out.capacity())</div>
+<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span>    || (buf_out.size() &gt; 0)) {</div>
+<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;zip_buffer requires buf_in.size() == &quot;</span></div>
+<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span>        <span class="stringliteral">&quot;2*buf_out.capacity() and empty buf_out&quot;</span>);</div>
+<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>  }</div>
+<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span> </div>
+<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span>  <span class="keywordtype">size_t</span> k = buf_out.capacity();</div>
+<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span>  <span class="keywordflow">for</span> (uint32_t i = rand_offset, o = 0; o &lt; k; i += 2, ++o) {</div>
+<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span>    buf_out.push_back(std::move(buf_in[i]));</div>
+<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span>  }</div>
+<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span>  buf_in.clear();</div>
+<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span>}</div>
+<div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span> </div>
+<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdV&gt;</div>
+<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::zip_buffer_with_stride(FwdV&amp;&amp; buf_in, Level&amp; buf_out, uint16_t stride) {</div>
+<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>  <span class="comment">// Random offset in range [0, stride)</span></div>
+<div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span>  std::uniform_int_distribution&lt;uint16_t&gt; dist(0, stride - 1);</div>
+<div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span>  <span class="keyword">const</span> uint16_t rand_offset = dist(random_utils::rand);</div>
+<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span>  </div>
+<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span>  <span class="keywordflow">if</span> ((buf_in.size() != stride * buf_out.capacity())</div>
+<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span>    || (buf_out.size() &gt; 0)) {</div>
+<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;zip_buffer_with_stride requires buf_in.size() == &quot;</span></div>
+<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span>        <span class="stringliteral">&quot;stride*buf_out.capacity() and empty buf_out&quot;</span>);</div>
+<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span>  }</div>
+<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span>  </div>
+<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> k = buf_out.capacity();</div>
+<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span>  <span class="keywordflow">for</span> (uint16_t i = rand_offset, o = 0; o &lt; k; i += stride, ++o) {</div>
+<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span>    buf_out.push_back(conditional_forward&lt;FwdV&gt;(buf_in[i]));</div>
+<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span>  }</div>
+<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// do not clear input buffer</span></div>
+<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>}</div>
 <div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> </div>
-<div class="line"><a id="l01005" 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 id="l01006" 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 id="l01007" name="l01007"></a><span class="lineno"> 1007</span>  </div>
-<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span>  <span class="comment">// TODO: probably actually doing copies given Level&amp;?</span></div>
-<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">while</span> (it1 != end1 &amp;&amp; it2 != end2) {</div>
-<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span>    <span class="keywordflow">if</span> (comparator(*it1, *it2)) {</div>
-<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>      dst.push_back(std::move(*it1++));</div>
-<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>      dst.push_back(std::move(*it2++));</div>
-<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>    }</div>
-<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>  }</div>
-<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> </div>
-<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">if</span> (it1 != end1) {</div>
-<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>    dst.insert(dst.end(), it1, end1);</div>
-<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l01020" 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">&quot;it2 unexpectedly already at end of range&quot;</span>); }</div>
-<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>    dst.insert(dst.end(), it2, end2);</div>
-<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>  }</div>
-<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span>}</div>
-<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> </div>
-<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
-<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::standard_merge(quantiles_sketch&amp; tgt, FwdSk&amp;&amp; src) {</div>
-<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">if</span> (src.get_k() != tgt.get_k()) {</div>
-<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;src.get_k() != tgt.get_k()&quot;</span>);</div>
-<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span>  }</div>
-<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span>  <span class="keywordflow">if</span> (src.is_empty()) {</div>
-<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span>    <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span>  }</div>
-<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> </div>
-<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span>  uint64_t new_n = src.get_n() + tgt.get_n();</div>
-<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> </div>
-<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span>  <span class="comment">// move items from src&#39;s base buffer</span></div>
-<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; src.base_buffer_.size(); ++i) {</div>
-<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span>    tgt.update(conditional_forward&lt;FwdSk&gt;(src.base_buffer_[i]));</div>
-<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span>  }</div>
-<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> </div>
-<div class="line"><a id="l01042" 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 id="l01043" 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 id="l01044" name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span> (levels_needed &gt; tgt.levels_.size()) {</div>
-<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span>    tgt.levels_.reserve(levels_needed);</div>
-<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>    <span class="keywordflow">while</span> (tgt.levels_.size() &lt; levels_needed) {</div>
-<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span>      Level empty_level(tgt.allocator_);</div>
-<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>      empty_level.reserve(tgt.get_k());</div>
-<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span>      tgt.levels_.push_back(std::move(empty_level));</div>
-<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span>    }</div>
-<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span>  }</div>
-<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> </div>
-<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span>  Level scratch_buf(tgt.allocator_);</div>
-<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span>  scratch_buf.reserve(2 * tgt.get_k());</div>
-<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> </div>
-<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span>  uint64_t src_pattern = src.bit_pattern_;</div>
-<div class="line"><a id="l01057" 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 &gt;&gt;= 1) {</div>
-<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span>    <span class="keywordflow">if</span> ((src_pattern &amp; 1) &gt; 0) {</div>
-<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>      scratch_buf.clear();</div>
-<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span> </div>
-<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span>      <span class="comment">// propagate-carry</span></div>
-<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span>      in_place_propagate_carry(src_lvl,</div>
-<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span>                               src.levels_[src_lvl], scratch_buf,</div>
-<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span>                               <span class="keyword">false</span>, tgt);</div>
-<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>      <span class="comment">// update n_ at the end</span></div>
-<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span>    }</div>
-<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span>  }</div>
-<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span>  tgt.n_ = new_n;</div>
-<div class="line"><a id="l01069" 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 id="l01070" name="l01070"></a><span class="lineno"> 1070</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Failed internal consistency check after standard_merge()&quot;</span>);</div>
-<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span>  }</div>
-<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> </div>
-<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span>  <span class="comment">// update min and max items</span></div>
-<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span>  <span class="comment">// can&#39;t just check is_empty() since min and max might not have been set if</span></div>
-<div class="line"><a id="l01075" 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 id="l01076" name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">if</span> (!tgt.min_item_) {</div>
-<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span>    tgt.min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.min_item_));</div>
-<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l01079" 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 id="l01080" name="l01080"></a><span class="lineno"> 1080</span>      *tgt.min_item_ = conditional_forward&lt;FwdSk&gt;(*src.min_item_);</div>
-<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span>  }</div>
-<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">if</span> (!tgt.max_item_) {</div>
-<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span>    tgt.max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.max_item_));</div>
-<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l01085" 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 id="l01086" name="l01086"></a><span class="lineno"> 1086</span>      *tgt.max_item_ = conditional_forward&lt;FwdSk&gt;(*src.max_item_);</div>
-<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span>  }</div>
-<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span>}</div>
-<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> </div>
-<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
-<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::downsampling_merge(quantiles_sketch&amp; tgt, FwdSk&amp;&amp; src) {</div>
-<div class="line"><a id="l01093" 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 id="l01094" name="l01094"></a><span class="lineno"> 1094</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;src.get_k() is not a multiple of tgt.get_k()&quot;</span>);</div>
-<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span>  }</div>
-<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">if</span> (src.is_empty()) {</div>
-<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span>    <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span>  }</div>
-<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span> </div>
-<div class="line"><a id="l01100" 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 id="l01101" 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 id="l01102" name="l01102"></a><span class="lineno"> 1102</span> </div>
-<div class="line"><a id="l01103" 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 id="l01104" name="l01104"></a><span class="lineno"> 1104</span> </div>
-<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span>  <span class="comment">// move items from src&#39;s base buffer</span></div>
-<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; src.base_buffer_.size(); ++i) {</div>
-<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span>    tgt.update(conditional_forward&lt;FwdSk&gt;(src.base_buffer_[i]));</div>
-<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span>  }</div>
-<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> </div>
-<div class="line"><a id="l01110" 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 id="l01111" 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 id="l01112" name="l01112"></a><span class="lineno"> 1112</span>  <span class="keywordflow">if</span> (levels_needed &gt; tgt.levels_.size()) {</div>
-<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span>    tgt.levels_.reserve(levels_needed);</div>
-<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span>    <span class="keywordflow">while</span> (tgt.levels_.size() &lt; levels_needed) {</div>
-<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span>      Level empty_level(tgt.allocator_);</div>
-<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span>      empty_level.reserve(tgt.get_k());</div>
-<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span>      tgt.levels_.push_back(std::move(empty_level));</div>
-<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span>    }</div>
-<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span>  }</div>
-<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span> </div>
-<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span>  Level down_buf(tgt.allocator_);</div>
-<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span>  down_buf.reserve(tgt.get_k());</div>
-<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> </div>
-<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span>  Level scratch_buf(tgt.allocator_);</div>
-<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span>  scratch_buf.reserve(2 * tgt.get_k());</div>
-<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> </div>
-<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span>  uint64_t src_pattern = src.bit_pattern_;</div>
-<div class="line"><a id="l01128" 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 &gt;&gt;= 1) {</div>
-<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span>    <span class="keywordflow">if</span> ((src_pattern &amp; 1) &gt; 0) {</div>
-<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span>      down_buf.clear();</div>
-<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span>      scratch_buf.clear();</div>
+<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::merge_two_size_k_buffers(Level&amp; src_1, Level&amp; src_2,</div>
+<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span>    Level&amp; dst, <span class="keyword">const</span> C&amp; comparator) {</div>
+<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">if</span> (src_1.size() != src_2.size()</div>
+<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>    || src_1.size() * 2 != dst.capacity()</div>
+<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span>    || dst.size() != 0) {</div>
+<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>      <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Input invariants violated in merge_two_size_k_buffers()&quot;</span>);</div>
+<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>  }</div>
+<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> </div>
+<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>  <span class="keyword">auto</span> end1 = src_1.end(), end2 = src_2.end();</div>
+<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>  <span class="keyword">auto</span> it1 = src_1.begin(), it2 = src_2.begin();</div>
+<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span>  </div>
+<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span>  <span class="comment">// TODO: probably actually doing copies given Level&amp;?</span></div>
+<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>  <span class="keywordflow">while</span> (it1 != end1 &amp;&amp; it2 != end2) {</div>
+<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>    <span class="keywordflow">if</span> (comparator(*it1, *it2)) {</div>
+<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span>      dst.push_back(std::move(*it1++));</div>
+<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>      dst.push_back(std::move(*it2++));</div>
+<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span>    }</div>
+<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span>  }</div>
+<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> </div>
+<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordflow">if</span> (it1 != end1) {</div>
+<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span>    dst.insert(dst.end(), it1, end1);</div>
+<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>    <span class="keywordflow">if</span> (it2 == end2) { <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;it2 unexpectedly already at end of range&quot;</span>); }</div>
+<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span>    dst.insert(dst.end(), it2, end2);</div>
+<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span>  }</div>
+<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span>}</div>
+<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> </div>
+<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
+<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::standard_merge(quantiles_sketch&amp; tgt, FwdSk&amp;&amp; src) {</div>
+<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span>  <span class="keywordflow">if</span> (src.get_k() != tgt.get_k()) {</div>
+<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;src.get_k() != tgt.get_k()&quot;</span>);</div>
+<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span>  }</div>
+<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">if</span> (src.is_empty()) {</div>
+<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span>  }</div>
+<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> </div>
+<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span>  uint64_t new_n = src.get_n() + tgt.get_n();</div>
+<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> </div>
+<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// move items from src&#39;s base buffer</span></div>
+<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; src.base_buffer_.size(); ++i) {</div>
+<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>    tgt.update(conditional_forward&lt;FwdSk&gt;(src.base_buffer_[i]));</div>
+<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span>  }</div>
+<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> </div>
+<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span>  <span class="comment">// check (after moving raw items) if we need to extend levels array</span></div>
+<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span>  uint8_t levels_needed = compute_levels_needed(tgt.get_k(), new_n);</div>
+<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span>  <span class="keywordflow">if</span> (levels_needed &gt; tgt.levels_.size()) {</div>
+<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span>    tgt.levels_.reserve(levels_needed);</div>
+<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span>    <span class="keywordflow">while</span> (tgt.levels_.size() &lt; levels_needed) {</div>
+<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span>      Level empty_level(tgt.allocator_);</div>
+<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span>      empty_level.reserve(tgt.get_k());</div>
+<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span>      tgt.levels_.push_back(std::move(empty_level));</div>
+<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>    }</div>
+<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span>  }</div>
+<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> </div>
+<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span>  Level scratch_buf(tgt.allocator_);</div>
+<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span>  scratch_buf.reserve(2 * tgt.get_k());</div>
+<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> </div>
+<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>  uint64_t src_pattern = src.bit_pattern_;</div>
+<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span>  <span class="keywordflow">for</span> (uint8_t src_lvl = 0; src_pattern != 0; ++src_lvl, src_pattern &gt;&gt;= 1) {</div>
+<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span>    <span class="keywordflow">if</span> ((src_pattern &amp; 1) &gt; 0) {</div>
+<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span>      scratch_buf.clear();</div>
+<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> </div>
+<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span>      <span class="comment">// propagate-carry</span></div>
+<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span>      in_place_propagate_carry(src_lvl,</div>
+<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span>                               src.levels_[src_lvl], scratch_buf,</div>
+<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span>                               <span class="keyword">false</span>, tgt);</div>
+<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span>      <span class="comment">// update n_ at the end</span></div>
+<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span>    }</div>
+<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span>  }</div>
+<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span>  tgt.n_ = new_n;</div>
+<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span>  <span class="keywordflow">if</span> ((tgt.get_n() / (2 * tgt.get_k())) != tgt.bit_pattern_) {</div>
+<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Failed internal consistency check after standard_merge()&quot;</span>);</div>
+<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span>  }</div>
+<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> </div>
+<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span>  <span class="comment">// update min and max items</span></div>
+<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span>  <span class="comment">// can&#39;t just check is_empty() since min and max might not have been set if</span></div>
+<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>  <span class="comment">// there were no base buffer items added via update()</span></div>
+<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span>  <span class="keywordflow">if</span> (!tgt.min_item_) {</div>
+<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span>    tgt.min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.min_item_));</div>
+<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span>    <span class="keywordflow">if</span> (tgt.comparator_(*src.min_item_, *tgt.min_item_))</div>
+<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span>      *tgt.min_item_ = conditional_forward&lt;FwdSk&gt;(*src.min_item_);</div>
+<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span>  }</div>
+<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">if</span> (!tgt.max_item_) {</div>
+<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span>    tgt.max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.max_item_));</div>
+<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span>    <span class="keywordflow">if</span> (tgt.comparator_(*tgt.max_item_, *src.max_item_))</div>
+<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span>      *tgt.max_item_ = conditional_forward&lt;FwdSk&gt;(*src.max_item_);</div>
+<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span>  }</div>
+<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span>}</div>
+<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> </div>
+<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
+<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::downsampling_merge(quantiles_sketch&amp; tgt, FwdSk&amp;&amp; src) {</div>
+<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">if</span> (src.get_k() % tgt.get_k() != 0) {</div>
+<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;src.get_k() is not a multiple of tgt.get_k()&quot;</span>);</div>
+<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span>  }</div>
+<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">if</span> (src.is_empty()) {</div>
+<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span>  }</div>
+<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> </div>
+<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span>  <span class="keyword">const</span> uint16_t downsample_factor = src.get_k() / tgt.get_k();</div>
+<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span>  <span class="keyword">const</span> uint8_t lg_sample_factor = count_trailing_zeros_in_u32(downsample_factor);</div>
+<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span> </div>
+<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span>  <span class="keyword">const</span> uint64_t new_n = src.get_n() + tgt.get_n();</div>
+<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span> </div>
+<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span>  <span class="comment">// move items from src&#39;s base buffer</span></div>
+<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">for</span> (uint16_t i = 0; i &lt; src.base_buffer_.size(); ++i) {</div>
+<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span>    tgt.update(conditional_forward&lt;FwdSk&gt;(src.base_buffer_[i]));</div>
+<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span>  }</div>
+<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span> </div>
+<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span>  <span class="comment">// check (after moving raw items) if we need to extend levels array</span></div>
+<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span>  <span class="keyword">const</span> uint8_t levels_needed = compute_levels_needed(tgt.get_k(), new_n);</div>
+<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (levels_needed &gt; tgt.levels_.size()) {</div>
+<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span>    tgt.levels_.reserve(levels_needed);</div>
+<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span>    <span class="keywordflow">while</span> (tgt.levels_.size() &lt; levels_needed) {</div>
+<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span>      Level empty_level(tgt.allocator_);</div>
+<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span>      empty_level.reserve(tgt.get_k());</div>
+<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span>      tgt.levels_.push_back(std::move(empty_level));</div>
+<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span>    }</div>
+<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span>  }</div>
+<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span> </div>
+<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span>  Level down_buf(tgt.allocator_);</div>
+<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span>  down_buf.reserve(tgt.get_k());</div>
 <div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span> </div>
-<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span>      <span class="comment">// zip with stride, leaving input buffer intact</span></div>
-<div class="line"><a id="l01134" 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 id="l01133" name="l01133"></a><span class="lineno"> 1133</span>  Level scratch_buf(tgt.allocator_);</div>
+<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span>  scratch_buf.reserve(2 * tgt.get_k());</div>
 <div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> </div>
-<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span>      <span class="comment">// propagate-carry</span></div>
-<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span>      in_place_propagate_carry(src_lvl + lg_sample_factor,</div>
-<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span>                               down_buf, scratch_buf,</div>
-<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span>                               <span class="keyword">false</span>, tgt);</div>
-<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span>      <span class="comment">// update n_ at the end</span></div>
-<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span>    }</div>
-<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span>  }</div>
-<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span>  tgt.n_ = new_n;</div>
-<div class="line"><a id="l01144" 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 id="l01145" name="l01145"></a><span class="lineno"> 1145</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Failed internal consistency check after downsampling_merge()&quot;</span>);</div>
-<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span>  }</div>
-<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span> </div>
-<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span>  <span class="comment">// update min and max items</span></div>
-<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span>  <span class="comment">// can&#39;t just check is_empty() since min and max might not have been set if</span></div>
-<div class="line"><a id="l01150" 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 id="l01151" name="l01151"></a><span class="lineno"> 1151</span>  <span class="keywordflow">if</span> (!tgt.min_item_) {</div>
-<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span>    tgt.min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.min_item_));</div>
-<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l01154" 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 id="l01155" name="l01155"></a><span class="lineno"> 1155</span>      *tgt.min_item_ = conditional_forward&lt;FwdSk&gt;(*src.min_item_);</div>
-<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span>  }</div>
-<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">if</span> (!tgt.max_item_) {</div>
-<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span>    tgt.max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.max_item_));</div>
-<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l01160" 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 id="l01161" name="l01161"></a><span class="lineno"> 1161</span>      *tgt.max_item_ = conditional_forward&lt;FwdSk&gt;(*src.max_item_);</div>
-<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span>  }</div>
-<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span>}</div>
-<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> </div>
-<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span>uint8_t quantiles_sketch&lt;T, C, A&gt;::lowest_zero_bit_starting_at(uint64_t bits, uint8_t starting_bit) {</div>
-<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span>  uint8_t pos = starting_bit &amp; 0X3F;</div>
-<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span>  uint64_t my_bits = bits &gt;&gt; pos;</div>
-<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span> </div>
-<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span>  <span class="keywordflow">while</span> ((my_bits &amp; <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1)) != 0) {</div>
-<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span>    my_bits &gt;&gt;= 1;</div>
-<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span>    pos++;</div>
-<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span>  }</div>
-<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span>  <span class="keywordflow">return</span> pos;</div>
-<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span>}</div>
-<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span> </div>
-<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span><span class="keyword">class </span>quantiles_sketch&lt;T, C, A&gt;::items_deleter {</div>
-<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span>  <span class="keyword">public</span>:</div>
-<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span>  items_deleter(<span class="keyword">const</span> A&amp; 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 id="l01181" name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div>
-<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span>    <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span>      <span class="keywordflow">if</span> (destroy_) {</div>
-<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_; ++i) {</div>
-<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span>          ptr[i].~T();</div>
-<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span>        }</div>
-<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span>      }</div>
-<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span>      allocator_.deallocate(ptr, num_);</div>
-<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span>    }</div>
-<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span>  }</div>
-<div class="line"><a id="l01191" 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 id="l01192" name="l01192"></a><span class="lineno"> 1192</span>  <span class="keyword">private</span>:</div>
-<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span>  A allocator_;</div>
-<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordtype">bool</span> destroy_;</div>
-<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span>  <span class="keywordtype">size_t</span> num_;</div>
-<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span>};</div>
-<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span> </div>
-<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::setup_sorted_view()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l01200" 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 id="l01201" name="l01201"></a><span class="lineno"> 1201</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
-<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span>    sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) quantiles_sorted_view&lt;T, C, A&gt;(get_sorted_view());</div>
-<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span>  }</div>
-<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span>}</div>
-<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span> </div>
-<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::reset_sorted_view() {</div>
-<div class="line"><a id="l01208" 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 id="l01209" name="l01209"></a><span class="lineno"> 1209</span>    sorted_view_-&gt;~quantiles_sorted_view();</div>
+<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span>  uint64_t src_pattern = src.bit_pattern_;</div>
+<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">for</span> (uint8_t src_lvl = 0; src_pattern != 0; ++src_lvl, src_pattern &gt;&gt;= 1) {</div>
+<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span>    <span class="keywordflow">if</span> ((src_pattern &amp; 1) &gt; 0) {</div>
+<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span>      down_buf.clear();</div>
+<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span>      scratch_buf.clear();</div>
+<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span> </div>
+<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span>      <span class="comment">// zip with stride, leaving input buffer intact</span></div>
+<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span>      zip_buffer_with_stride(src.levels_[src_lvl], down_buf, downsample_factor);</div>
+<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span> </div>
+<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span>      <span class="comment">// propagate-carry</span></div>
+<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span>      in_place_propagate_carry(src_lvl + lg_sample_factor,</div>
+<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span>                               down_buf, scratch_buf,</div>
+<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span>                               <span class="keyword">false</span>, tgt);</div>
+<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span>      <span class="comment">// update n_ at the end</span></div>
+<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span>    }</div>
+<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span>  }</div>
+<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span>  tgt.n_ = new_n;</div>
+<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordflow">if</span> ((tgt.get_n() / (2 * tgt.get_k())) != tgt.bit_pattern_) {</div>
+<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span>    <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Failed internal consistency check after downsampling_merge()&quot;</span>);</div>
+<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span>  }</div>
+<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> </div>
+<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span>  <span class="comment">// update min and max items</span></div>
+<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span>  <span class="comment">// can&#39;t just check is_empty() since min and max might not have been set if</span></div>
+<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span>  <span class="comment">// there were no base buffer items added via update()</span></div>
+<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordflow">if</span> (!tgt.min_item_) {</div>
+<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span>    tgt.min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.min_item_));</div>
+<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span>    <span class="keywordflow">if</span> (tgt.comparator_(*src.min_item_, *tgt.min_item_))</div>
+<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span>      *tgt.min_item_ = conditional_forward&lt;FwdSk&gt;(*src.min_item_);</div>
+<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span>  }</div>
+<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span>  <span class="keywordflow">if</span> (!tgt.max_item_) {</div>
+<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span>    tgt.max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*src.max_item_));</div>
+<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span>    <span class="keywordflow">if</span> (tgt.comparator_(*tgt.max_item_, *src.max_item_))</div>
+<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span>      *tgt.max_item_ = conditional_forward&lt;FwdSk&gt;(*src.max_item_);</div>
+<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span>  }</div>
+<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span>}</div>
+<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span> </div>
+<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span>uint8_t quantiles_sketch&lt;T, C, A&gt;::lowest_zero_bit_starting_at(uint64_t bits, uint8_t starting_bit) {</div>
+<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span>  uint8_t pos = starting_bit &amp; 0X3F;</div>
+<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span>  uint64_t my_bits = bits &gt;&gt; pos;</div>
+<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span> </div>
+<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">while</span> ((my_bits &amp; <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1)) != 0) {</div>
+<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span>    my_bits &gt;&gt;= 1;</div>
+<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span>    pos++;</div>
+<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span>  }</div>
+<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span>  <span class="keywordflow">return</span> pos;</div>
+<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span>}</div>
+<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span> </div>
+<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span><span class="keyword">class </span>quantiles_sketch&lt;T, C, A&gt;::items_deleter {</div>
+<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span>  <span class="keyword">public</span>:</div>
+<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span>  items_deleter(<span class="keyword">const</span> A&amp; 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 id="l01190" name="l01190"></a><span class="lineno"> 1190</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div>
+<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span>    <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span>      <span class="keywordflow">if</span> (destroy_) {</div>
+<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_; ++i) {</div>
+<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span>          ptr[i].~T();</div>
+<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span>        }</div>
+<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span>      }</div>
+<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span>      allocator_.deallocate(ptr, num_);</div>
+<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span>    }</div>
+<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span>  }</div>
+<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span>  <span class="keywordtype">void</span> set_destroy(<span class="keywordtype">bool</span> destroy) { destroy_ = destroy; }</div>
+<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span>  <span class="keyword">private</span>:</div>
+<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span>  A allocator_;</div>
+<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordtype">bool</span> destroy_;</div>
+<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordtype">size_t</span> num_;</div>
+<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span>};</div>
+<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span> </div>
+<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::setup_sorted_view()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
-<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span>    AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div>
-<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span>    sorted_view_ = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span>  }</div>
-<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span>}</div>
-<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span> </div>
-<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span><span class="comment">// quantiles_sketch::const_iterator implementation</span></div>
-<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</span> </div>
-<div class="line"><a id="l01218" name="l01218"></a><span class="lineno"> 1218</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01219" name="l01219"></a><span class="lineno"> 1219</span>quantiles_sketch&lt;T, C, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> Level&amp; base_buffer,</div>
-<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span>                                                             <span class="keyword">const</span> std::vector&lt;Level, AllocLevel&gt;&amp; levels,</div>
-<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</span>                                                             uint16_t k,</div>
-<div class="line"><a id="l01222" name="l01222"></a><span class="lineno"> 1222</span>                                                             uint64_t n,</div>
-<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span>                                                             <span class="keywordtype">bool</span> is_end):</div>
-<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span>base_buffer_(base_buffer),</div>
-<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span>levels_(levels),</div>
-<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span>level_(-1),</div>
-<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span>index_(0),</div>
-<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span>bb_count_(compute_base_buffer_items(k, n)),</div>
-<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span>bit_pattern_(compute_bit_pattern(k, n)),</div>
-<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span>weight_(1),</div>
-<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span>k_(k)</div>
-<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span>{</div>
-<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">if</span> (is_end) {</div>
-<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span>    <span class="comment">// if exact mode: index_ = n is end</span></div>
-<div class="line"><a id="l01235" 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 id="l01236" 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 id="l01237" name="l01237"></a><span class="lineno"> 1237</span>      index_ = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(n);</div>
-<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span>    <span class="keywordflow">else</span></div>
-<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span>      level_ = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(levels_.size());</div>
-<div class="line"><a id="l01240" 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 id="l01241" name="l01241"></a><span class="lineno"> 1241</span>    <span class="keywordflow">if</span> (bb_count_ == 0 &amp;&amp; bit_pattern_ &gt; 0) {</div>
-<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span>      level_ = 0;</div>
-<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span>      weight_ = 2;</div>
-<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span>      <span class="keywordflow">while</span> ((bit_pattern_ &amp; 0x01) == 0) {</div>
-<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span>        weight_ *= 2;</div>
-<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span>        ++level_;</div>
-<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span>        bit_pattern_ &gt;&gt;= 1;</div>
-<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span>      }</div>
-<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span>    }</div>
-<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span>  }</div>
-<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span>}</div>
-<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span> </div>
-<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span><span class="keyword">typename</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator&amp; quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator++() {</div>
-<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span>  ++index_;</div>
-<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span> </div>
-<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordflow">if</span> ((level_ == -1 &amp;&amp; index_ == base_buffer_.size() &amp;&amp; levels_.size() &gt; 0) || (level_ &gt;= 0 &amp;&amp; index_ == k_)) { <span class="comment">// go to the next non-empty level</span></div>
-<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span>    index_ = 0;</div>
-<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span>      ++level_;</div>
-<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span>      <span class="keywordflow">if</span> (level_ &gt; 0) bit_pattern_ = bit_pattern_ &gt;&gt; 1;</div>
-<div class="line"><a id="l01262" 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 id="l01263" name="l01263"></a><span class="lineno"> 1263</span>      weight_ *= 2;</div>
-<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span>    } <span class="keywordflow">while</span> ((bit_pattern_ &amp; <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1)) == 0);</div>
-<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span>  }</div>
-<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span>}</div>
-<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span> </div>
-<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span><span class="keyword">typename</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator&amp; quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) {</div>
-<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
-<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span>  operator++();</div>
-<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">return</span> tmp;</div>
-<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span>}</div>
-<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> </div>
-<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span><span class="keywordtype">bool</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">return</span> level_ == other.level_ &amp;&amp; index_ == other.index_;</div>
-<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span>}</div>
-<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span> </div>
-<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span><span class="keywordtype">bool</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">return</span> !operator==(other);</div>
-<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span>}</div>
-<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span> </div>
-<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
-<div class="line"><a id="l01288" 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 id="l01289" name="l01289"></a><span class="lineno"> 1289</span>}</div>
-<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span> </div>
-<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
-<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
-<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span>}</div>
-<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span> </div>
-<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span>} <span class="comment">/* namespace datasketches */</span></div>
-<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span> </div>
-<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span><span class="preprocessor">#endif </span><span class="comment">// _QUANTILES_SKETCH_IMPL_HPP_</span></div>
+<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span>    sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) quantiles_sorted_view&lt;T, C, A&gt;(get_sorted_view());</div>
+<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span>  }</div>
+<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span>}</div>
+<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span> </div>
+<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span><span class="keywordtype">void</span> quantiles_sketch&lt;T, C, A&gt;::reset_sorted_view() {</div>
+<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l01218" name="l01218"></a><span class="lineno"> 1218</span>    sorted_view_-&gt;~quantiles_sorted_view();</div>
+<div class="line"><a id="l01219" name="l01219"></a><span class="lineno"> 1219</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
+<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span>    AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div>
+<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</span>    sorted_view_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l01222" name="l01222"></a><span class="lineno"> 1222</span>  }</div>
+<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span>}</div>
+<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span> </div>
+<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span><span class="comment">// quantiles_sketch::const_iterator implementation</span></div>
+<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span> </div>
+<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span>quantiles_sketch&lt;T, C, A&gt;::const_iterator::const_iterator(<span class="keyword">const</span> Level&amp; base_buffer,</div>
+<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span>                                                             <span class="keyword">const</span> std::vector&lt;Level, AllocLevel&gt;&amp; levels,</div>
+<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span>                                                             uint16_t k,</div>
+<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span>                                                             uint64_t n,</div>
+<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span>                                                             <span class="keywordtype">bool</span> is_end):</div>
+<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span>base_buffer_(base_buffer),</div>
+<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span>levels_(levels),</div>
+<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span>level_(-1),</div>
+<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span>index_(0),</div>
+<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span>bb_count_(compute_base_buffer_items(k, n)),</div>
+<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span>bit_pattern_(compute_bit_pattern(k, n)),</div>
+<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span>weight_(1),</div>
+<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span>k_(k)</div>
+<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span>{</div>
+<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordflow">if</span> (is_end) {</div>
+<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span>    <span class="comment">// if exact mode: index_ = n is end</span></div>
+<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span>    <span class="comment">// if sampling, level_ = max_level + 1 and index_ = 0 is end</span></div>
+<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</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 id="l01246" name="l01246"></a><span class="lineno"> 1246</span>      index_ = <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(n);</div>
+<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span>      level_ = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(levels_.size());</div>
+<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span>  } <span class="keywordflow">else</span> { <span class="comment">// find first non-empty item</span></div>
+<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span>    <span class="keywordflow">if</span> (bb_count_ == 0 &amp;&amp; bit_pattern_ &gt; 0) {</div>
+<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span>      level_ = 0;</div>
+<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span>      weight_ = 2;</div>
+<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span>      <span class="keywordflow">while</span> ((bit_pattern_ &amp; 0x01) == 0) {</div>
+<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span>        weight_ *= 2;</div>
+<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span>        ++level_;</div>
+<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span>        bit_pattern_ &gt;&gt;= 1;</div>
+<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span>      }</div>
+<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span>    }</div>
+<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span>  }</div>
+<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span>}</div>
+<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span> </div>
+<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span><span class="keyword">typename</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator&amp; quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator++() {</div>
+<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span>  ++index_;</div>
+<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> </div>
+<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">if</span> ((level_ == -1 &amp;&amp; index_ == base_buffer_.size() &amp;&amp; levels_.size() &gt; 0) || (level_ &gt;= 0 &amp;&amp; index_ == k_)) { <span class="comment">// go to the next non-empty level</span></div>
+<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span>    index_ = 0;</div>
+<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span>      ++level_;</div>
+<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span>      <span class="keywordflow">if</span> (level_ &gt; 0) bit_pattern_ = bit_pattern_ &gt;&gt; 1;</div>
+<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span>      <span class="keywordflow">if</span> (bit_pattern_ == 0) <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span>      weight_ *= 2;</div>
+<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span>    } <span class="keywordflow">while</span> ((bit_pattern_ &amp; <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(1)) == 0);</div>
+<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span>  }</div>
+<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span>}</div>
+<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span> </div>
+<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span><span class="keyword">typename</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator&amp; quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) {</div>
+<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
+<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span>  operator++();</div>
+<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordflow">return</span> tmp;</div>
+<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span>}</div>
+<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span> </div>
+<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span><span class="keywordtype">bool</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span>  <span class="keywordflow">return</span> level_ == other.level_ &amp;&amp; index_ == other.index_;</div>
+<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span>}</div>
+<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span> </div>
+<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span><span class="keywordtype">bool</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordflow">return</span> !operator==(other);</div>
+<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span>}</div>
+<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span> </div>
+<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
+<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span>  <span class="keywordflow">return</span> value_type(level_ == -1 ? base_buffer_[index_] : levels_[level_][index_], weight_);</div>
+<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span>}</div>
+<div class="line"><a id="l01299" name="l01299"></a><span class="lineno"> 1299</span> </div>
+<div class="line"><a id="l01300" name="l01300"></a><span class="lineno"> 1300</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span><span class="keyword">auto</span> quantiles_sketch&lt;T, C, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
+<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
+<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span>}</div>
+<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> </div>
+<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span>} <span class="comment">/* namespace datasketches */</span></div>
+<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span> </div>
+<div class="line"><a id="l01307" name="l01307"></a><span class="lineno"> 1307</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&lt; T, Comparator, Allocator &gt; 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.h [...]
-<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 &amp; operator=(const quantiles_sketch &amp;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 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 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 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 &amp;&amp;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 &amp;&amp;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 &amp;os, const SerDe &amp;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> qu [...]
-<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&lt; Allocator &gt; 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.h [...]
-<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 &amp; 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_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:690</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&lt; T, Comparator, Allocator &gt; 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.h [...]
+<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 &amp; operator=(const quantiles_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> quantiles_sketch_impl.hpp:90</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 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:673</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:720< [...]
+<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 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 &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> quantiles_sketch_impl.hpp:236</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 &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> quantiles_sketch_impl.hpp:213</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 &amp;os, const SerDe &amp;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> qu [...]
+<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&lt; Allocator &gt; 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.h [...]
+<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:653</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:663</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 &amp; 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:684</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 &amp;is, const SerDe &amp;sd=SerDe(), const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">This met [...]
-<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 &amp;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 [...]
-<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="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 &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition [...]
-<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 &amp; 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__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 &amp;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 [...]
+<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:695</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="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:875</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 &amp;sd=SerDe()) const</div><div class="ttdoc">Computes size needed to serialize the current state of the sketch.</div><div class="ttdef"><b>Definition [...]
+<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:668</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 &amp; 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:678</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:880</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:658</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</a></div><div class="ttdoc">Sorted view for quantiles sketches (REQ, KLL and Quantiles)</div><div class="ttdef"><b>Definition</b> quantiles_sorted_view.hpp:38</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>
diff --git a/docs/master/req__sketch_8hpp_source.html b/docs/master/req__sketch_8hpp_source.html
index ddba018..83b2c6c 100644
--- a/docs/master/req__sketch_8hpp_source.html
+++ b/docs/master/req__sketch_8hpp_source.html
@@ -312,38 +312,38 @@ $(document).ready(function() { init_codefold(0); });
 <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</a></div><div class="ttdoc">Sorted view for quantiles sketches (REQ, KLL and Quantiles)</div><div class="ttdef"><b>Definition</b> quantiles_sorted_view.hpp:38</div></div>
 <div class="ttc" id="aclassdatasketches_1_1quantiles__sorted__view_html_a5ab4905c4f3ebeb14de4e7a2f5d92832"><div class="ttname"><a href="classdatasketches_1_1quantiles__sorted__view.html#a5ab4905c4f3ebeb14de4e7a2f5d92832">datasketches::quantiles_sorted_view::quantile_return_type</a></div><div class="ttdeci">typename std::conditional&lt; std::is_arithmetic&lt; T &gt;::value, T, const T &amp; &gt;::type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttde [...]
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html">datasketches::req_sketch</a></div><div class="ttdoc">Relative Error Quantiles Sketch.</div><div class="ttdef"><b>Definition</b> req_sketch.hpp:79</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::req_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> req_sketch_impl.hpp:224</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::req_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, Comparator, Allocator &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:269</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::req_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> req_sketch_impl.hpp:225</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::req_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, Comparator, Allocator &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:270</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a1936c2c39faaf2c19243949a57cec8e0"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a1936c2c39faaf2c19243949a57cec8e0">datasketches::req_sketch::deserialize</a></div><div class="ttdeci">static req_sketch deserialize(std::istream &amp;is, const SerDe &amp;sd=SerDe(), const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">This method deserializes a sketc [...]
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a1943668612ea073d2f6381ee8c2ddfbd"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a1943668612ea073d2f6381ee8c2ddfbd">datasketches::req_sketch::req_sketch</a></div><div class="ttdeci">req_sketch(const req_sketch&lt; TT, CC, AA &gt; &amp;other, const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">Type converting constructor.</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a1d0c269c23926e93b1c7a9c00e86af97"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a1d0c269c23926e93b1c7a9c00e86af97">datasketches::req_sketch::serialize</a></div><div class="ttdeci">vector_bytes serialize(unsigned header_size_bytes=0, const SerDe &amp;sd=SerDe()) const</div><div class="ttdoc">This method serializes the sketch as a vector of bytes.</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::req_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= [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::req_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 in the sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:159</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::req_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= [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::req_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:188</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::req_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= [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::req_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 in the sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:160</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::req_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= [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::req_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:189</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a4c80d2361c940f99df9f850615c2dcbe"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a4c80d2361c940f99df9f850615c2dcbe">datasketches::req_sketch::quantile_return_type</a></div><div class="ttdeci">typename quantiles_sorted_view&lt; T, Comparator, Allocator &gt;::quantile_return_type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttdef"><b>Definition</b> req_sketch.hpp:92</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::req_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:170</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::req_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;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> req_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::req_sketch::to_string</a></div><div class="ttdeci">string&lt; Allocator &gt; 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> req_sketch_impl.hpp:631</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::req_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> req_sketch_impl.hpp:139</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::req_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> req_sketch_impl.hpp:149</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a687ed2123bdc7e67fbda0c081e3acf21"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">datasketches::req_sketch::get_max_item</a></div><div class="ttdeci">const T &amp; get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:218</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::req_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:171</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::req_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;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> req_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::req_sketch::to_string</a></div><div class="ttdeci">string&lt; Allocator &gt; 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> req_sketch_impl.hpp:640</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::req_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> req_sketch_impl.hpp:140</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::req_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> req_sketch_impl.hpp:150</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a687ed2123bdc7e67fbda0c081e3acf21"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">datasketches::req_sketch::get_max_item</a></div><div class="ttdeci">const T &amp; get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:219</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a732d80ecaa19aab05f65ca62bdf0452c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a732d80ecaa19aab05f65ca62bdf0452c">datasketches::req_sketch::req_sketch</a></div><div class="ttdeci">req_sketch(uint16_t k, bool hra=true, const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">Constructor.</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a750349aa79dff6db2d13857ab50248bb"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">datasketches::req_sketch::get_rank_upper_bound</a></div><div class="ttdeci">double get_rank_upper_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate upper bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::req_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;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> req_sketch_imp [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a899bef2c5e0ea489ed4b023d2b9900ee"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">datasketches::req_sketch::get_RSE</a></div><div class="ttdeci">static double get_RSE(uint16_t k, double rank, bool hra, uint64_t n)</div><div class="ttdoc">Returns an a priori estimate of relative standard error (RSE, expressed as a number in [0,...</div><div class="ttdef"><b>Definition</b> req [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a978630658d411c9c79fffa5909f5c8d0"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">datasketches::req_sketch::get_rank_lower_bound</a></div><div class="ttdeci">double get_rank_lower_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate lower bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::req_sketch::get_allocator</a></div><div class="ttdeci">Allocator get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:229</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ab6e85db46b1d76086d5e9b5065b74a46"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">datasketches::req_sketch::operator=</a></div><div class="ttdeci">req_sketch &amp; operator=(const req_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:81</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::req_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 approximate quantile of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:258</ [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad5c959a538216a09ab28c5283585956c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">datasketches::req_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> req_sketch_impl.hpp:724</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::req_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;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> req_sketch_im [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae11e60e117300685401961e36f196f7a"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">datasketches::req_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> req_sketch_impl.hpp:729</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a750349aa79dff6db2d13857ab50248bb"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">datasketches::req_sketch::get_rank_upper_bound</a></div><div class="ttdeci">double get_rank_upper_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate upper bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::req_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;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> req_sketch_imp [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a899bef2c5e0ea489ed4b023d2b9900ee"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">datasketches::req_sketch::get_RSE</a></div><div class="ttdeci">static double get_RSE(uint16_t k, double rank, bool hra, uint64_t n)</div><div class="ttdoc">Returns an a priori estimate of relative standard error (RSE, expressed as a number in [0,...</div><div class="ttdef"><b>Definition</b> req [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a978630658d411c9c79fffa5909f5c8d0"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">datasketches::req_sketch::get_rank_lower_bound</a></div><div class="ttdeci">double get_rank_lower_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate lower bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::req_sketch::get_allocator</a></div><div class="ttdeci">Allocator get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:230</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ab6e85db46b1d76086d5e9b5065b74a46"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">datasketches::req_sketch::operator=</a></div><div class="ttdeci">req_sketch &amp; operator=(const req_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:82</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::req_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 approximate quantile of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:259</ [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad5c959a538216a09ab28c5283585956c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">datasketches::req_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> req_sketch_impl.hpp:733</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::req_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;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> req_sketch_im [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae11e60e117300685401961e36f196f7a"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">datasketches::req_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> req_sketch_impl.hpp:738</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae7e9fdcb69c547de681bb6f10ae5ef3e"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae7e9fdcb69c547de681bb6f10ae5ef3e">datasketches::req_sketch::deserialize</a></div><div class="ttdeci">static req_sketch deserialize(const void *bytes, size_t size, const SerDe &amp;sd=SerDe(), const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">This method deserializ [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::req_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> req_sketch_impl.hpp:164</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af2fa890815acf3a1418ea8eee466075c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">datasketches::req_sketch::get_min_item</a></div><div class="ttdeci">const T &amp; get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:212</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af6177b85206272c56ee75747bb885735"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">datasketches::req_sketch::is_HRA</a></div><div class="ttdeci">bool is_HRA() const</div><div class="ttdoc">Returns configured parameter High Rank Accuracy.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:144</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::req_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> req_sketch_impl.hpp:154</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::req_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> req_sketch_impl.hpp:165</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af2fa890815acf3a1418ea8eee466075c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">datasketches::req_sketch::get_min_item</a></div><div class="ttdeci">const T &amp; get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:213</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af6177b85206272c56ee75747bb885735"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">datasketches::req_sketch::is_HRA</a></div><div class="ttdeci">bool is_HRA() const</div><div class="ttdoc">Returns configured parameter High Rank Accuracy.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:145</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::req_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> req_sketch_impl.hpp:155</div></div>
 <div class="ttc" id="anamespacedatasketches_html"><div class="ttname"><a href="namespacedatasketches.html">datasketches</a></div><div class="ttdoc">DataSketches namespace.</div><div class="ttdef"><b>Definition</b> binomial_bounds.hpp:38</div></div>
 </div><!-- fragment --></div><!-- contents -->
 <!-- start footer part -->
diff --git a/docs/master/req__sketch__impl_8hpp_source.html b/docs/master/req__sketch__impl_8hpp_source.html
index 68a358e..a2cc8e8 100644
--- a/docs/master/req__sketch__impl_8hpp_source.html
+++ b/docs/master/req__sketch__impl_8hpp_source.html
@@ -105,498 +105,498 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
 <div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;sstream&gt;</span></div>
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;stdexcept&gt;</span></div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>req_sketch&lt;T, C, A&gt;::req_sketch(uint16_t k, <span class="keywordtype">bool</span> hra, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>comparator_(comparator),</div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>allocator_(allocator),</div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>k_(std::max&lt;uint8_t&gt;(static_cast&lt;int&gt;(k) &amp; -2, static_cast&lt;int&gt;(req_constants::<a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">MIN_K</a>))), <span class="comment">//rounds down one if odd</span></div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>hra_(hra),</div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>max_nom_size_(0),</div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>num_retained_(0),</div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>n_(0),</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>compactors_(allocator),</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>min_item_(),</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>max_item_(),</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>{</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>  grow();</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>req_sketch&lt;T, C, A&gt;::~req_sketch() {</div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a4ec3122d5c0994c725123257065de56b">   51</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch</a>&amp; other):</div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>comparator_(other.comparator_),</div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>allocator_(other.allocator_),</div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>k_(other.k_),</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>hra_(other.hra_),</div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>max_nom_size_(other.max_nom_size_),</div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>num_retained_(other.num_retained_),</div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>n_(other.n_),</div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>compactors_(other.compactors_),</div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>min_item_(other.min_item_),</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>max_item_(other.max_item_),</div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>{}</div>
-</div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a25d0fc41e0544761ffc626aa70415319">   66</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(<a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch</a>&amp;&amp; other) noexcept :</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>comparator_(std::move(other.comparator_)),</div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>allocator_(std::move(other.allocator_)),</div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>k_(other.k_),</div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>hra_(other.hra_),</div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>max_nom_size_(other.max_nom_size_),</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>num_retained_(other.num_retained_),</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>n_(other.n_),</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>compactors_(std::move(other.compactors_)),</div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>min_item_(std::move(other.min_item_)),</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>max_item_(std::move(other.max_item_)),</div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>sorted_view_(<span class="keyword">nullptr</span>)</div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>{}</div>
-</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">   81</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">req_sketch&lt;T, C, A&gt;::operator=</a>(<span class="keyword">const</span> <a class="code hl_cla [...]
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>  <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch</a> copy(other);</div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>  std::swap(comparator_, copy.comparator_);</div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>  std::swap(allocator_, copy.allocator_);</div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>  std::swap(k_, copy.k_);</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  std::swap(hra_, copy.hra_);</div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  std::swap(max_nom_size_, copy.max_nom_size_);</div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  std::swap(num_retained_, copy.num_retained_);</div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  std::swap(n_, copy.n_);</div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>  std::swap(compactors_, copy.compactors_);</div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  std::swap(min_item_, copy.min_item_);</div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  std::swap(max_item_, copy.max_item_);</div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}</div>
-</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00098" data-start="{" data-end="}">
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ac36e220c05c86824c475a779e2c39232">   98</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">req_sketch&lt;T, C, A&gt;::operator=</a>(<a class="code hl_class" href="classdatasketches_1_1req_ [...]
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  std::swap(comparator_, other.comparator_);</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  std::swap(allocator_, other.allocator_);</div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  std::swap(k_, other.k_);</div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  std::swap(hra_, other.hra_);</div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  std::swap(max_nom_size_, other.max_nom_size_);</div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  std::swap(num_retained_, other.num_retained_);</div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  std::swap(n_, other.n_);</div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  std::swap(compactors_, other.compactors_);</div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  std::swap(min_item_, other.min_item_);</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  std::swap(max_item_, other.max_item_);</div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
-</div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT, <span class="keyword">typename</span> CC, <span class="keyword">typename</span> AA&gt;</div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;TT, CC, AA&gt;</a>&amp; other, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>comparator_(comparator),</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>allocator_(allocator),</div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>k_(other.k_),</div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>hra_(other.hra_),</div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>max_nom_size_(other.max_nom_size_),</div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>num_retained_(other.num_retained_),</div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>n_(other.n_),</div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>compactors_(allocator),</div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>min_item_(other.min_item_),</div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>max_item_(other.max_item_),</div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>{</div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  <span class="keyword">static_assert</span>(</div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::is_constructible&lt;T, TT&gt;::value,</div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="stringliteral">&quot;Type converting constructor requires new type to be constructible from existing type&quot;</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>  );</div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  compactors_.reserve(other.compactors_.size());</div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: other.compactors_) {</div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    compactors_.push_back(req_compactor&lt;T, C, A&gt;(compactor, comparator_, allocator_));</div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>  }</div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">  139</a></span>uint16_t <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">req_sketch&lt;T, C, A&gt;::get_k</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>  <span class="keywordflow">return</span> k_;</div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>}</div>
-</div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00144" data-start="{" data-end="}">
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">  144</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">req_sketch&lt;T, C, A&gt;::is_HRA</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>  <span class="keywordflow">return</span> hra_;</div>
-<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>}</div>
-</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00149" data-start="{" data-end="}">
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">  149</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">req_sketch&lt;T, C, A&gt;::is_empty</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>  <span class="keywordflow">return</span> n_ == 0;</div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>}</div>
-</div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00154" data-start="{" data-end="}">
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">  154</a></span>uint64_t <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">req_sketch&lt;T, C, A&gt;::get_n</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>  <span class="keywordflow">return</span> n_;</div>
-<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>}</div>
-</div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00159" data-start="{" data-end="}">
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">  159</a></span>uint32_t <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">req_sketch&lt;T, C, A&gt;::get_num_retained</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>  <span class="keywordflow">return</span> num_retained_;</div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>}</div>
-</div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
-<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">  164</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">req_sketch&lt;T, C, A&gt;::is_estimation_mode</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>  <span class="keywordflow">return</span> compactors_.size() &gt; 1;</div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>}</div>
-</div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
-<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdT&gt;</div>
-<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
-<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">  170</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">req_sketch&lt;T, C, A&gt;::update</a>(FwdT&amp;&amp; item) {</div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</span>; }</div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    min_item_.emplace(item);</div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    max_item_.emplace(item);</div>
-<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keywordflow">if</span> (comparator_(item, *min_item_)) *min_item_ = item;</div>
-<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = item;</div>
-<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>  }</div>
-<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>  compactors_[0].append(std::forward&lt;FwdT&gt;(item));</div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>  ++num_retained_;</div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>  ++n_;</div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>  <span class="keywordflow">if</span> (num_retained_ == max_nom_size_) compress();</div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>}</div>
-</div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
-<div class="foldopen" id="foldopen00188" data-start="{" data-end="}">
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">  188</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">req_sketch&lt;T, C, A&gt;::merge</a>(FwdSk&amp;&amp; other) {</div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>  <span class="keywordflow">if</span> (is_HRA() != other.<a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">is_HRA</a>()) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;merging HRA and LRA is not valid&quot;</span>);</div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>  <span class="keywordflow">if</span> (other.<a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">is_empty</a>()) <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.min_item_));</div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.max_item_));</div>
-<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">if</span> (comparator_(*other.min_item_, *min_item_)) *min_item_ = conditional_forward&lt;FwdSk&gt;(*other.min_item_);</div>
-<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, *other.max_item_)) *max_item_ = conditional_forward&lt;FwdSk&gt;(*other.max_item_);</div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>  }</div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>  <span class="comment">// grow until this has at least as many compactors as other</span></div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>  <span class="keywordflow">while</span> (get_num_levels() &lt; other.get_num_levels()) grow();</div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>  <span class="comment">// merge the items in all height compactors</span></div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; other.get_num_levels(); ++i) {</div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    compactors_[i].merge(conditional_forward&lt;FwdSk&gt;(other.compactors_[i]));</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>  }</div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>  n_ += other.n_;</div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>  update_max_nom_size();</div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>  update_num_retained();</div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>  <span class="keywordflow">if</span> (num_retained_ &gt;= max_nom_size_) compress();</div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>  reset_sorted_view();</div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>}</div>
-</div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00212" data-start="{" data-end="}">
-<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">  212</a></span><span class="keyword">const</span> T&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">req_sketch&lt;T, C, A&gt;::get_min_item</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>  <span class="keywordflow">return</span> *min_item_;</div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>}</div>
-</div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00218" data-start="{" data-end="}">
-<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">  218</a></span><span class="keyword">const</span> T&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">req_sketch&lt;T, C, A&gt;::get_max_item</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>  <span class="keywordflow">return</span> *max_item_;</div>
-<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>}</div>
-</div>
-<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
-<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00224" data-start="{" data-end="}">
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">  224</a></span>C <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">req_sketch&lt;T, C, A&gt;::get_comparator</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>  <span class="keywordflow">return</span> comparator_;</div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>}</div>
-</div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00229" data-start="{" data-end="}">
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">  229</a></span>A <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">req_sketch&lt;T, C, A&gt;::get_allocator</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>  <span class="keywordflow">return</span> allocator_;</div>
-<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>}</div>
-</div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span> </div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00234" data-start="{" data-end="}">
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">  234</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">req_sketch&lt;T, C, A&gt;::get_rank</a>(<span class="keyword">const</span> T&amp; item, <span class="keywordtype">bool</span> inclusive)<span class="keyword"> con [...]
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>  uint64_t weight = 0;</div>
-<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) {</div>
-<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    weight += compactor.compute_weight(item, inclusive);</div>
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>  }</div>
-<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(weight) / n_;</div>
-<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>}</div>
-</div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
-<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00244" data-start="{" data-end="}">
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">  244</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">req_sketch&lt;T, C, A&gt;::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_PMF(split_points, size, inclusive);</div>
-<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>}</div>
-</div>
-<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
-<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00251" data-start="{" data-end="}">
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">  251</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">req_sketch&lt;T, C, A&gt;::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_CDF(split_points, size, inclusive);</div>
-<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>}</div>
-</div>
-<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
-<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00258" data-start="{" data-end="}">
-<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">  258</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">req_sketch&lt;T, C, A&gt;::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</ [...]
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>  <span class="keywordflow">if</span> ((rank &lt; 0.0) || (rank &gt; 1.0)) {</div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Normalized rank cannot be less than 0 or greater than 1&quot;</span>);</div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>  }</div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>  <span class="comment">// possible side-effect of sorting level zero</span></div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>  setup_sorted_view();</div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_quantile(rank, inclusive);</div>
-<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>}</div>
-</div>
-<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span> </div>
-<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00269" data-start="{" data-end="}">
-<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">  269</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">req_sketch&lt;T, C, A&gt;::get_sorted_view</a>()<span class="keyword"> const </ [...]
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>  <span class="keywordflow">if</span> (!compactors_[0].is_sorted()) {</div>
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="keyword">const_cast&lt;</span>Compactor&amp;<span class="keyword">&gt;</span>(compactors_[0]).sort(); <span class="comment">// allow this side effect</span></div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>  }</div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> view(get_num_retained(), comparator_, allocator_);</div>
-<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
-<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; compactor: compactors_) {</div>
-<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    view.add(compactor.begin(), compactor.end(), 1ULL &lt;&lt; compactor.get_lg_weight());</div>
-<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>  }</div>
-<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span> </div>
-<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>  view.convert_to_cummulative();</div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>  <span class="keywordflow">return</span> view;</div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>}</div>
-</div>
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
-<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00284" data-start="{" data-end="}">
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">  284</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">req_sketch&lt;T, C, A&gt;::get_rank_lower_bound</a>(<span class="keywordtype">double</span> rank, uint8_t num_std_dev)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>  <span class="keywordflow">return</span> get_rank_lb(get_k(), get_num_levels(), rank, num_std_dev, get_n(), hra_);</div>
-<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>}</div>
-</div>
-<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
-<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00289" data-start="{" data-end="}">
-<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">  289</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">req_sketch&lt;T, C, A&gt;::get_rank_upper_bound</a>(<span class="keywordtype">double</span> rank, uint8_t num_std_dev)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>  <span class="keywordflow">return</span> get_rank_ub(get_k(), get_num_levels(), rank, num_std_dev, get_n(), hra_);</div>
-<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>}</div>
-</div>
-<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
-<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00294" data-start="{" data-end="}">
-<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">  294</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">req_sketch&lt;T, C, A&gt;::get_RSE</a>(uint16_t k, <span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> hra, uint64_t n) {</div>
-<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>  <span class="keywordflow">return</span> get_rank_lb(k, 2, rank, 1, n, hra);</div>
-<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>}</div>
-</div>
-<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span> </div>
-<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="keywordtype">double</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::get_rank_lb</a>(uint16_t k, uint8_t num_levels, <span class="keywordtype">double</span> rank, uint8_t num_std_dev, uint64_t n, <span class="keywordtype">bool</span> hra) {</div>
-<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>  <span class="keywordflow">if</span> (is_exact_rank(k, num_levels, rank, n, hra)) <span class="keywordflow">return</span> rank;</div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> relative = relative_rse_factor() / k * (hra ? 1.0 - rank : rank);</div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> fixed = FIXED_RSE_FACTOR / k;</div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb_rel = rank - num_std_dev * relative;</div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb_fix = rank - num_std_dev * fixed;</div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>  <span class="keywordflow">return</span> std::max(lb_rel, lb_fix);</div>
-<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>}</div>
-<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
-<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span><span class="keywordtype">double</span> req_sketch&lt;T, C, A&gt;::get_rank_ub(uint16_t k, uint8_t num_levels, <span class="keywordtype">double</span> rank, uint8_t num_std_dev, uint64_t n, <span class="keywordtype">bool</span> hra) {</div>
-<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>  <span class="keywordflow">if</span> (is_exact_rank(k, num_levels, rank, n, hra)) <span class="keywordflow">return</span> rank;</div>
-<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> relative = relative_rse_factor() / k * (hra ? 1.0 - rank : rank);</div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> fixed = FIXED_RSE_FACTOR / k;</div>
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub_rel = rank + num_std_dev * relative;</div>
-<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub_fix = rank + num_std_dev * fixed;</div>
-<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>  <span class="keywordflow">return</span> std::min(ub_rel, ub_fix);</div>
-<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>}</div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="keywordtype">bool</span> req_sketch&lt;T, C, A&gt;::is_exact_rank(uint16_t k, uint8_t num_levels, <span class="keywordtype">double</span> rank, uint64_t n, <span class="keywordtype">bool</span> hra) {</div>
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> base_cap = k * <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#a141418d3d37a4b49c0c5bb41b507f2b5">req_constants::INIT_NUM_SECTIONS</a>;</div>
-<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>  <span class="keywordflow">if</span> (num_levels == 1 || n &lt;= base_cap) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> exact_rank_thresh = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(base_cap) / n;</div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  <span class="keywordflow">return</span> (hra &amp;&amp; rank &gt;= 1.0 - exact_rank_thresh) || (!hra &amp;&amp; rank &lt;= exact_rank_thresh);</div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>}</div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span> </div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="keywordtype">double</span> req_sketch&lt;T, C, A&gt;::relative_rse_factor() {</div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>  <span class="keywordflow">return</span> sqrt(0.0512 / <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#a141418d3d37a4b49c0c5bb41b507f2b5">req_constants::INIT_NUM_SECTIONS</a>);</div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>}</div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span> </div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="foldopen" id="foldopen00334" data-start="{" data-end="}">
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">  334</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">req_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>  <span class="keywordtype">size_t</span> size = PREAMBLE_SIZE_BYTES;</div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span> size;</div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    size += <span class="keyword">sizeof</span>(n_) + <span class="keyword">sizeof</span>(TT) * 2; <span class="comment">// min and max</span></div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>  }</div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>  <span class="keywordflow">if</span> (n_ == 1) {</div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    size += <span class="keyword">sizeof</span>(TT);</div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) size += compactor.get_serialized_size_bytes(sd);</div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>  }</div>
-<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>  <span class="keywordflow">return</span> size;</div>
-<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>}</div>
-</div>
-<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
-<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span><span class="comment">// implementation for all other types</span></div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
-<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">req_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>  <span class="keywordtype">size_t</span> size = PREAMBLE_SIZE_BYTES;</div>
-<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span> size;</div>
-<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
-<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>    size += <span class="keyword">sizeof</span>(n_);</div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    size += sd.size_of_item(*min_item_);</div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    size += sd.size_of_item(*max_item_);</div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>  }</div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>  <span class="keywordflow">if</span> (n_ == 1) {</div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    size += sd.size_of_item(*compactors_[0].begin());</div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) size += compactor.get_serialized_size_bytes(sd);</div>
-<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>  }</div>
-<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>  <span class="keywordflow">return</span> size;</div>
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>}</div>
-<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
-<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="foldopen" id="foldopen00369" data-start="{" data-end="}">
-<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">  369</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">req_sketch&lt;T, C, A&gt;::serialize</a>(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>  <span class="keyword">const</span> uint8_t preamble_ints = is_estimation_mode() ? 4 : 2;</div>
-<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>  write(os, preamble_ints);</div>
-<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>  <span class="keyword">const</span> uint8_t serial_version = SERIAL_VERSION;</div>
-<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>  write(os, serial_version);</div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  write(os, family);</div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> raw_items = n_ &lt;= <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#ab9f2b631adf46fe04a11814cd1018926">req_constants::MIN_K</a>;</div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
-<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
-<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    | (hra_ ? 1 &lt;&lt; flags::IS_HIGH_RANK : 0)</div>
-<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    | (raw_items ? 1 &lt;&lt; flags::RAW_ITEMS : 0)</div>
-<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    | (compactors_[0].is_sorted() ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
-<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>  );</div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  write(os, flags_byte);</div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  write(os, k_);</div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>  <span class="keyword">const</span> uint8_t num_levels = is_empty() ? 0 : get_num_levels();</div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  write(os, num_levels);</div>
-<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>  <span class="keyword">const</span> uint8_t num_raw_items = raw_items ? <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(n_) : 0;</div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  write(os, num_raw_items);</div>
-<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span>;</div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    write(os, n_);</div>
-<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    sd.serialize(os, &amp;*min_item_, 1);</div>
-<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    sd.serialize(os, &amp;*max_item_, 1);</div>
-<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>  }</div>
-<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>  <span class="keywordflow">if</span> (raw_items) {</div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    sd.serialize(os, compactors_[0].begin(), num_raw_items);</div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) compactor.serialize(os, sd);</div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>  }</div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>}</div>
-</div>
-<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span> </div>
-<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">req_sketch&lt;T, C, A&gt;::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe&amp; sd) <span class="keyword">const</span> -&gt; vector_bytes {</div>
-<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = header_size_bytes + get_serialized_size_bytes(sd);</div>
-<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  vector_bytes bytes(size, 0, allocator_);</div>
-<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div>
-<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
-<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span> </div>
-<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>  <span class="keyword">const</span> uint8_t preamble_ints = is_estimation_mode() ? 4 : 2;</div>
-<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  ptr += copy_to_mem(preamble_ints, ptr);</div>
-<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  <span class="keyword">const</span> uint8_t serial_version = SERIAL_VERSION;</div>
-<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>  ptr += copy_to_mem(serial_version, ptr);</div>
-<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>  ptr += copy_to_mem(family, ptr);</div>
-<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> raw_items = n_ &lt;= <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#ab9f2b631adf46fe04a11814cd1018926">req_constants::MIN_K</a>;</div>
-<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
-<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
-<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>    | (hra_ ? 1 &lt;&lt; flags::IS_HIGH_RANK : 0)</div>
-<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    | (raw_items ? 1 &lt;&lt; flags::RAW_ITEMS : 0)</div>
-<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    | (compactors_[0].is_sorted() ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
-<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>  );</div>
-<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>  ptr += copy_to_mem(flags_byte, ptr);</div>
-<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>  ptr += copy_to_mem(k_, ptr);</div>
-<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>  <span class="keyword">const</span> uint8_t num_levels = is_empty() ? 0 : get_num_levels();</div>
-<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>  ptr += copy_to_mem(num_levels, ptr);</div>
-<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>  <span class="keyword">const</span> uint8_t num_raw_items = raw_items ? <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(n_) : 0;</div>
-<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>  ptr += copy_to_mem(num_raw_items, ptr);</div>
-<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
-<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>      ptr += copy_to_mem(n_, ptr);</div>
-<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*min_item_, 1);</div>
-<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*max_item_, 1);</div>
-<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    }</div>
-<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    <span class="keywordflow">if</span> (raw_items) {</div>
-<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>      ptr += sd.serialize(ptr, end_ptr - ptr, compactors_[0].begin(), num_raw_items);</div>
-<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>      <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) ptr += compactor.serialize(ptr, end_ptr - ptr, sd);</div>
-<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    }</div>
-<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>  }</div>
-<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>  <span class="keywordflow">return</span> bytes;</div>
-<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>}</div>
-<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
-<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>req_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a1936c2c39faaf2c19243949a57cec8e0">req_sketch&lt;T, C, A&gt;::deserialize</a>(std::istream&amp; is, <span class="keyword">const</span> SerDe&amp; sd, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator) {</div>
-<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_ints = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read&lt;uint16_t&gt;(is);</div>
-<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_levels = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_raw_items = read&lt;uint8_t&gt;(is);</div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span> </div>
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>  check_preamble_ints(preamble_ints, num_levels);</div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>  check_serial_version(serial_version);</div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>  check_family_id(family_id);</div>
-<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span> </div>
-<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY);</div>
-<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> hra = flags_byte &amp; (1 &lt;&lt; flags::IS_HIGH_RANK);</div>
-<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> req_sketch(k, hra, comparator, allocator);</div>
-<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
-<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>  optional&lt;T&gt; tmp; <span class="comment">// space to deserialize min and max</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedatasketches.html">datasketches</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>req_sketch&lt;T, C, A&gt;::req_sketch(uint16_t k, <span class="keywordtype">bool</span> hra, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>comparator_(comparator),</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>allocator_(allocator),</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>k_(std::max&lt;uint8_t&gt;(static_cast&lt;int&gt;(k) &amp; -2, static_cast&lt;int&gt;(req_constants::<a class="code hl_variable" href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">MIN_K</a>))), <span class="comment">//rounds down one if odd</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>hra_(hra),</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>max_nom_size_(0),</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>num_retained_(0),</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>n_(0),</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>compactors_(allocator),</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>min_item_(),</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>max_item_(),</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>{</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  grow();</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>req_sketch&lt;T, C, A&gt;::~req_sketch() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a4ec3122d5c0994c725123257065de56b">   52</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch</a>&amp; other):</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>comparator_(other.comparator_),</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>allocator_(other.allocator_),</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>k_(other.k_),</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>hra_(other.hra_),</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>max_nom_size_(other.max_nom_size_),</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>num_retained_(other.num_retained_),</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>n_(other.n_),</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>compactors_(other.compactors_),</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>min_item_(other.min_item_),</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>max_item_(other.max_item_),</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>{}</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a25d0fc41e0544761ffc626aa70415319">   67</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(<a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch</a>&amp;&amp; other) noexcept :</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>comparator_(std::move(other.comparator_)),</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>allocator_(std::move(other.allocator_)),</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>k_(other.k_),</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>hra_(other.hra_),</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>max_nom_size_(other.max_nom_size_),</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>num_retained_(other.num_retained_),</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>n_(other.n_),</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>compactors_(std::move(other.compactors_)),</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>min_item_(std::move(other.min_item_)),</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>max_item_(std::move(other.max_item_)),</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>sorted_view_(<span class="keyword">nullptr</span>)</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>{}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">   82</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">req_sketch&lt;T, C, A&gt;::operator=</a>(<span class="keyword">const</span> <a class="code hl_cla [...]
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>  <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch</a> copy(other);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>  std::swap(comparator_, copy.comparator_);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>  std::swap(allocator_, copy.allocator_);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  std::swap(k_, copy.k_);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  std::swap(hra_, copy.hra_);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  std::swap(max_nom_size_, copy.max_nom_size_);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  std::swap(num_retained_, copy.num_retained_);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>  std::swap(n_, copy.n_);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  std::swap(compactors_, copy.compactors_);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  std::swap(min_item_, copy.min_item_);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  std::swap(max_item_, copy.max_item_);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ac36e220c05c86824c475a779e2c39232">   99</a></span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;</a>&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">req_sketch&lt;T, C, A&gt;::operator=</a>(<a class="code hl_class" href="classdatasketches_1_1req_ [...]
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  std::swap(comparator_, other.comparator_);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  std::swap(allocator_, other.allocator_);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  std::swap(k_, other.k_);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  std::swap(hra_, other.hra_);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  std::swap(max_nom_size_, other.max_nom_size_);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  std::swap(num_retained_, other.num_retained_);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  std::swap(n_, other.n_);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  std::swap(compactors_, other.compactors_);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  std::swap(min_item_, other.min_item_);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  std::swap(max_item_, other.max_item_);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT, <span class="keyword">typename</span> CC, <span class="keyword">typename</span> AA&gt;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;TT, CC, AA&gt;</a>&amp; other, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator):</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>comparator_(comparator),</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>allocator_(allocator),</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>k_(other.k_),</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>hra_(other.hra_),</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>max_nom_size_(other.max_nom_size_),</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>num_retained_(other.num_retained_),</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>n_(other.n_),</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>compactors_(allocator),</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>min_item_(other.min_item_),</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>max_item_(other.max_item_),</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>{</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>  <span class="keyword">static_assert</span>(</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::is_constructible&lt;T, TT&gt;::value,</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="stringliteral">&quot;Type converting constructor requires new type to be constructible from existing type&quot;</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  );</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>  compactors_.reserve(other.compactors_.size());</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: other.compactors_) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    compactors_.push_back(req_compactor&lt;T, C, A&gt;(compactor, comparator_, allocator_));</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>  }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">  140</a></span>uint16_t <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">req_sketch&lt;T, C, A&gt;::get_k</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>  <span class="keywordflow">return</span> k_;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="}">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">  145</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">req_sketch&lt;T, C, A&gt;::is_HRA</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>  <span class="keywordflow">return</span> hra_;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00150" data-start="{" data-end="}">
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">  150</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">req_sketch&lt;T, C, A&gt;::is_empty</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>  <span class="keywordflow">return</span> n_ == 0;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">  155</a></span>uint64_t <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">req_sketch&lt;T, C, A&gt;::get_n</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>  <span class="keywordflow">return</span> n_;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>}</div>
+</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">  160</a></span>uint32_t <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">req_sketch&lt;T, C, A&gt;::get_num_retained</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>  <span class="keywordflow">return</span> num_retained_;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>}</div>
+</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00165" data-start="{" data-end="}">
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">  165</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">req_sketch&lt;T, C, A&gt;::is_estimation_mode</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>  <span class="keywordflow">return</span> compactors_.size() &gt; 1;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>}</div>
+</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdT&gt;</div>
+<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">  171</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">req_sketch&lt;T, C, A&gt;::update</a>(FwdT&amp;&amp; item) {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>  <span class="keywordflow">if</span> (!check_update_item(item)) { <span class="keywordflow">return</span>; }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    min_item_.emplace(item);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    max_item_.emplace(item);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keywordflow">if</span> (comparator_(item, *min_item_)) *min_item_ = item;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, item)) *max_item_ = item;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>  }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>  compactors_[0].append(std::forward&lt;FwdT&gt;(item));</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>  ++num_retained_;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>  ++n_;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>  <span class="keywordflow">if</span> (num_retained_ == max_nom_size_) compress();</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>}</div>
+</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> FwdSk&gt;</div>
+<div class="foldopen" id="foldopen00189" data-start="{" data-end="}">
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">  189</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">req_sketch&lt;T, C, A&gt;::merge</a>(FwdSk&amp;&amp; other) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>  <span class="keywordflow">if</span> (is_HRA() != other.<a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">is_HRA</a>()) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;merging HRA and LRA is not valid&quot;</span>);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>  <span class="keywordflow">if</span> (other.<a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">is_empty</a>()) <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>  <span class="keywordflow">if</span> (is_empty()) {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    min_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.min_item_));</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    max_item_.emplace(conditional_forward&lt;FwdSk&gt;(*other.max_item_));</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">if</span> (comparator_(*other.min_item_, *min_item_)) *min_item_ = conditional_forward&lt;FwdSk&gt;(*other.min_item_);</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="keywordflow">if</span> (comparator_(*max_item_, *other.max_item_)) *max_item_ = conditional_forward&lt;FwdSk&gt;(*other.max_item_);</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>  }</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>  <span class="comment">// grow until this has at least as many compactors as other</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>  <span class="keywordflow">while</span> (get_num_levels() &lt; other.get_num_levels()) grow();</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>  <span class="comment">// merge the items in all height compactors</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; other.get_num_levels(); ++i) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    compactors_[i].merge(conditional_forward&lt;FwdSk&gt;(other.compactors_[i]));</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>  }</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>  n_ += other.n_;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>  update_max_nom_size();</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>  update_num_retained();</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>  <span class="keywordflow">if</span> (num_retained_ &gt;= max_nom_size_) compress();</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>  reset_sorted_view();</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>}</div>
+</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span> </div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">  213</a></span><span class="keyword">const</span> T&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">req_sketch&lt;T, C, A&gt;::get_min_item</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>  <span class="keywordflow">return</span> *min_item_;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>}</div>
+</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00219" data-start="{" data-end="}">
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">  219</a></span><span class="keyword">const</span> T&amp; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">req_sketch&lt;T, C, A&gt;::get_max_item</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  <span class="keywordflow">return</span> *max_item_;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>}</div>
+</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00225" data-start="{" data-end="}">
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">  225</a></span>C <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">req_sketch&lt;T, C, A&gt;::get_comparator</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>  <span class="keywordflow">return</span> comparator_;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>}</div>
+</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00230" data-start="{" data-end="}">
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">  230</a></span>A <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">req_sketch&lt;T, C, A&gt;::get_allocator</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>  <span class="keywordflow">return</span> allocator_;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>}</div>
+</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">  235</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">req_sketch&lt;T, C, A&gt;::get_rank</a>(<span class="keyword">const</span> T&amp; item, <span class="keywordtype">bool</span> inclusive)<span class="keyword"> con [...]
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>  uint64_t weight = 0;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    weight += compactor.compute_weight(item, inclusive);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>  }</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(weight) / n_;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>}</div>
+</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00245" data-start="{" data-end="}">
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">  245</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">req_sketch&lt;T, C, A&gt;::get_PMF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_PMF(split_points, size, inclusive);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>}</div>
+</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span> </div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00252" data-start="{" data-end="}">
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">  252</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">req_sketch&lt;T, C, A&gt;::get_CDF</a>(<span class="keyword">const</span> T* split_points, uint32_t size, <span class="keywordtype">bool</span> inclusive) <span class=" [...]
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_CDF(split_points, size, inclusive);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>}</div>
+</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00259" data-start="{" data-end="}">
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">  259</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">req_sketch&lt;T, C, A&gt;::get_quantile</a>(<span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> inclusive) <span class="keyword">const</ [...]
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;operation is undefined for an empty sketch&quot;</span>);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>  <span class="keywordflow">if</span> ((rank &lt; 0.0) || (rank &gt; 1.0)) {</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Normalized rank cannot be less than 0 or greater than 1&quot;</span>);</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>  }</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>  <span class="comment">// possible side-effect of sorting level zero</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>  setup_sorted_view();</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>  <span class="keywordflow">return</span> sorted_view_-&gt;get_quantile(rank, inclusive);</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>}</div>
+</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span> </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00270" data-start="{" data-end="}">
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">  270</a></span><a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">req_sketch&lt;T, C, A&gt;::get_sorted_view</a>()<span class="keyword"> const </ [...]
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>  <span class="keywordflow">if</span> (!compactors_[0].is_sorted()) {</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keyword">const_cast&lt;</span>Compactor&amp;<span class="keyword">&gt;</span>(compactors_[0]).sort(); <span class="comment">// allow this side effect</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>  }</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>  <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a> view(get_num_retained(), comparator_, allocator_);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span> </div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; compactor: compactors_) {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    view.add(compactor.begin(), compactor.end(), 1ULL &lt;&lt; compactor.get_lg_weight());</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>  }</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>  view.convert_to_cummulative();</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>  <span class="keywordflow">return</span> view;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>}</div>
+</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00285" data-start="{" data-end="}">
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">  285</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">req_sketch&lt;T, C, A&gt;::get_rank_lower_bound</a>(<span class="keywordtype">double</span> rank, uint8_t num_std_dev)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>  <span class="keywordflow">return</span> get_rank_lb(get_k(), get_num_levels(), rank, num_std_dev, get_n(), hra_);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>}</div>
+</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span> </div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00290" data-start="{" data-end="}">
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">  290</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">req_sketch&lt;T, C, A&gt;::get_rank_upper_bound</a>(<span class="keywordtype">double</span> rank, uint8_t num_std_dev)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>  <span class="keywordflow">return</span> get_rank_ub(get_k(), get_num_levels(), rank, num_std_dev, get_n(), hra_);</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>}</div>
+</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00295" data-start="{" data-end="}">
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">  295</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">req_sketch&lt;T, C, A&gt;::get_RSE</a>(uint16_t k, <span class="keywordtype">double</span> rank, <span class="keywordtype">bool</span> hra, uint64_t n) {</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>  <span class="keywordflow">return</span> get_rank_lb(k, 2, rank, 1, n, hra);</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>}</div>
+</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span> </div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span><span class="keywordtype">double</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::get_rank_lb</a>(uint16_t k, uint8_t num_levels, <span class="keywordtype">double</span> rank, uint8_t num_std_dev, uint64_t n, <span class="keywordtype">bool</span> hra) {</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>  <span class="keywordflow">if</span> (is_exact_rank(k, num_levels, rank, n, hra)) <span class="keywordflow">return</span> rank;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> relative = relative_rse_factor() / k * (hra ? 1.0 - rank : rank);</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> fixed = FIXED_RSE_FACTOR / k;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb_rel = rank - num_std_dev * relative;</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb_fix = rank - num_std_dev * fixed;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>  <span class="keywordflow">return</span> std::max(lb_rel, lb_fix);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>}</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="keywordtype">double</span> req_sketch&lt;T, C, A&gt;::get_rank_ub(uint16_t k, uint8_t num_levels, <span class="keywordtype">double</span> rank, uint8_t num_std_dev, uint64_t n, <span class="keywordtype">bool</span> hra) {</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>  <span class="keywordflow">if</span> (is_exact_rank(k, num_levels, rank, n, hra)) <span class="keywordflow">return</span> rank;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> relative = relative_rse_factor() / k * (hra ? 1.0 - rank : rank);</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> fixed = FIXED_RSE_FACTOR / k;</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub_rel = rank + num_std_dev * relative;</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub_fix = rank + num_std_dev * fixed;</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>  <span class="keywordflow">return</span> std::min(ub_rel, ub_fix);</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>}</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="keywordtype">bool</span> req_sketch&lt;T, C, A&gt;::is_exact_rank(uint16_t k, uint8_t num_levels, <span class="keywordtype">double</span> rank, uint64_t n, <span class="keywordtype">bool</span> hra) {</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> base_cap = k * <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#a141418d3d37a4b49c0c5bb41b507f2b5">req_constants::INIT_NUM_SECTIONS</a>;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  <span class="keywordflow">if</span> (num_levels == 1 || n &lt;= base_cap) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> exact_rank_thresh = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(base_cap) / n;</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>  <span class="keywordflow">return</span> (hra &amp;&amp; rank &gt;= 1.0 - exact_rank_thresh) || (!hra &amp;&amp; rank &lt;= exact_rank_thresh);</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>}</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span> </div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="keywordtype">double</span> req_sketch&lt;T, C, A&gt;::relative_rse_factor() {</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>  <span class="keywordflow">return</span> sqrt(0.0512 / <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#a141418d3d37a4b49c0c5bb41b507f2b5">req_constants::INIT_NUM_SECTIONS</a>);</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>}</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00335" data-start="{" data-end="}">
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">  335</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">req_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>  <span class="keywordtype">size_t</span> size = PREAMBLE_SIZE_BYTES;</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span> size;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    size += <span class="keyword">sizeof</span>(n_) + <span class="keyword">sizeof</span>(TT) * 2; <span class="comment">// min and max</span></div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>  }</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>  <span class="keywordflow">if</span> (n_ == 1) {</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    size += <span class="keyword">sizeof</span>(TT);</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) size += compactor.get_serialized_size_bytes(sd);</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>  }</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>  <span class="keywordflow">return</span> size;</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>}</div>
+</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span><span class="comment">// implementation for all other types</span></div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>template&lt;typename TT, typename SerDe, typename std::enable_if&lt;!std::is_arithmetic&lt;TT&gt;::value, <span class="keywordtype">int</span>&gt;::type&gt;</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span><span class="keywordtype">size_t</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">req_sketch&lt;T, C, A&gt;::get_serialized_size_bytes</a>(<span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>  <span class="keywordtype">size_t</span> size = PREAMBLE_SIZE_BYTES;</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span> size;</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    size += <span class="keyword">sizeof</span>(n_);</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    size += sd.size_of_item(*min_item_);</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    size += sd.size_of_item(*max_item_);</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>  }</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>  <span class="keywordflow">if</span> (n_ == 1) {</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    size += sd.size_of_item(*compactors_[0].begin());</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) size += compactor.get_serialized_size_bytes(sd);</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>  }</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>  <span class="keywordflow">return</span> size;</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>}</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span> </div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="foldopen" id="foldopen00370" data-start="{" data-end="}">
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">  370</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">req_sketch&lt;T, C, A&gt;::serialize</a>(std::ostream&amp; os, <span class="keyword">const</span> SerDe&amp; sd)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>  <span class="keyword">const</span> uint8_t preamble_ints = is_estimation_mode() ? 4 : 2;</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>  write(os, preamble_ints);</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>  <span class="keyword">const</span> uint8_t serial_version = SERIAL_VERSION;</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>  write(os, serial_version);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>  write(os, family);</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> raw_items = n_ &lt;= <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#ab9f2b631adf46fe04a11814cd1018926">req_constants::MIN_K</a>;</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    | (hra_ ? 1 &lt;&lt; flags::IS_HIGH_RANK : 0)</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    | (raw_items ? 1 &lt;&lt; flags::RAW_ITEMS : 0)</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    | (compactors_[0].is_sorted() ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>  );</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>  write(os, flags_byte);</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>  write(os, k_);</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>  <span class="keyword">const</span> uint8_t num_levels = is_empty() ? 0 : get_num_levels();</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>  write(os, num_levels);</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>  <span class="keyword">const</span> uint8_t num_raw_items = raw_items ? <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(n_) : 0;</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>  write(os, num_raw_items);</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>  <span class="keywordflow">if</span> (is_empty()) <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>  <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    write(os, n_);</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    sd.serialize(os, &amp;*min_item_, 1);</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    sd.serialize(os, &amp;*max_item_, 1);</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>  }</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>  <span class="keywordflow">if</span> (raw_items) {</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>    sd.serialize(os, compactors_[0].begin(), num_raw_items);</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) compactor.serialize(os, sd);</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>  }</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>}</div>
+</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span> </div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">req_sketch&lt;T, C, A&gt;::serialize</a>(<span class="keywordtype">unsigned</span> header_size_bytes, <span class="keyword">const</span> SerDe&amp; sd) <span class="keyword">const</span> -&gt; vector_bytes {</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> size = header_size_bytes + get_serialized_size_bytes(sd);</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>  vector_bytes bytes(size, 0, allocator_);</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>  uint8_t* ptr = bytes.data() + header_size_bytes;</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + size;</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span> </div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>  <span class="keyword">const</span> uint8_t preamble_ints = is_estimation_mode() ? 4 : 2;</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>  ptr += copy_to_mem(preamble_ints, ptr);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>  <span class="keyword">const</span> uint8_t serial_version = SERIAL_VERSION;</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>  ptr += copy_to_mem(serial_version, ptr);</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>  <span class="keyword">const</span> uint8_t family = FAMILY;</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>  ptr += copy_to_mem(family, ptr);</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> raw_items = n_ &lt;= <a class="code hl_variable" href="namespacedatasketches_1_1req__constants.html#ab9f2b631adf46fe04a11814cd1018926">req_constants::MIN_K</a>;</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>  <span class="keyword">const</span> uint8_t flags_byte(</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>      (is_empty() ? 1 &lt;&lt; flags::IS_EMPTY : 0)</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    | (hra_ ? 1 &lt;&lt; flags::IS_HIGH_RANK : 0)</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    | (raw_items ? 1 &lt;&lt; flags::RAW_ITEMS : 0)</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    | (compactors_[0].is_sorted() ? 1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED : 0)</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>  );</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>  ptr += copy_to_mem(flags_byte, ptr);</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>  ptr += copy_to_mem(k_, ptr);</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>  <span class="keyword">const</span> uint8_t num_levels = is_empty() ? 0 : get_num_levels();</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>  ptr += copy_to_mem(num_levels, ptr);</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>  <span class="keyword">const</span> uint8_t num_raw_items = raw_items ? <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(n_) : 0;</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>  ptr += copy_to_mem(num_raw_items, ptr);</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    <span class="keywordflow">if</span> (is_estimation_mode()) {</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>      ptr += copy_to_mem(n_, ptr);</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*min_item_, 1);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>      ptr += sd.serialize(ptr, end_ptr - ptr, &amp;*max_item_, 1);</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    }</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    <span class="keywordflow">if</span> (raw_items) {</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>      ptr += sd.serialize(ptr, end_ptr - ptr, compactors_[0].begin(), num_raw_items);</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>      <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) ptr += compactor.serialize(ptr, end_ptr - ptr, sd);</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    }</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>  }</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>  <span class="keywordflow">return</span> bytes;</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>}</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span> </div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>req_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a1936c2c39faaf2c19243949a57cec8e0">req_sketch&lt;T, C, A&gt;::deserialize</a>(std::istream&amp; is, <span class="keyword">const</span> SerDe&amp; sd, <span class="keyword">const</span> C&amp; comparator, <span class="keyword">const</span> A&amp; allocator) {</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>  <span class="keyword">const</span> <span class="keyword">auto</span> preamble_ints = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>  <span class="keyword">const</span> <span class="keyword">auto</span> serial_version = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>  <span class="keyword">const</span> <span class="keyword">auto</span> family_id = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>  <span class="keyword">const</span> <span class="keyword">auto</span> flags_byte = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>  <span class="keyword">const</span> <span class="keyword">auto</span> k = read&lt;uint16_t&gt;(is);</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_levels = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_raw_items = read&lt;uint8_t&gt;(is);</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span> </div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>  check_preamble_ints(preamble_ints, num_levels);</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>  check_serial_version(serial_version);</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>  check_family_id(family_id);</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY);</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> hra = flags_byte &amp; (1 &lt;&lt; flags::IS_HIGH_RANK);</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> req_sketch(k, hra, comparator, allocator);</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span> </div>
 <div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>  optional&lt;T&gt; min_item;</div>
 <div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>  optional&lt;T&gt; max_item;</div>
 <div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span> </div>
@@ -607,369 +607,378 @@ $(document).ready(function() { init_codefold(0); });
 <div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>  uint64_t n = 1;</div>
 <div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>  <span class="keywordflow">if</span> (num_levels &gt; 1) {</div>
 <div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    n = read&lt;uint64_t&gt;(is);</div>
-<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    sd.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>    min_item.emplace(*tmp);</div>
-<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    sd.deserialize(is, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    max_item.emplace(*tmp);</div>
-<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>  }</div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span> </div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>  <span class="keywordflow">if</span> (raw_items) {</div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>    compactors.push_back(Compactor::deserialize(is, sd, comparator, allocator, is_level_0_sorted, k, num_raw_items, hra));</div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_levels; ++i) {</div>
-<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>      compactors.push_back(Compactor::deserialize(is, sd, comparator, allocator, i == 0 ? is_level_0_sorted : true, hra));</div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    }</div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>  }</div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>  <span class="keywordflow">if</span> (num_levels == 1) {</div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    <span class="keyword">const</span> <span class="keyword">auto</span> begin = compactors[0].begin();</div>
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    <span class="keyword">const</span> <span class="keyword">auto</span> end = compactors[0].end();</div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    n = compactors[0].get_num_items();</div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    <span class="keyword">auto</span> min_it = begin;</div>
-<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    <span class="keyword">auto</span> max_it = begin;</div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin; it != end; ++it) {</div>
-<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>      <span class="keywordflow">if</span> (comparator(*it, *min_it)) min_it = it;</div>
-<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>      <span class="keywordflow">if</span> (comparator(*max_it, *it)) max_it = it;</div>
-<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>    }</div>
-<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>    min_item.emplace(*min_it);</div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>    max_item.emplace(*max_it);</div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>  }</div>
-<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span> </div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
-<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>  <span class="keywordflow">return</span> req_sketch(k, hra, n, std::move(min_item), std::move(max_item), std::move(compactors), comparator);</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>}</div>
-<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span> </div>
-<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
-<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>req_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a1936c2c39faaf2c19243949a57cec8e0">req_sketch&lt;T, C, A&gt;::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&amp; sd, <span class="keyword">const</span> C&amp; comparator, < [...]
-<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>  ensure_minimum_memory(size, 8);</div>
-<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
-<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
-<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span> </div>
-<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>  uint8_t preamble_ints;</div>
-<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>  ptr += copy_from_mem(ptr, preamble_ints);</div>
-<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>  uint8_t serial_version;</div>
-<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>  ptr += copy_from_mem(ptr, serial_version);</div>
-<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>  uint8_t family_id;</div>
-<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>  ptr += copy_from_mem(ptr, family_id);</div>
-<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>  uint8_t flags_byte;</div>
-<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>  ptr += copy_from_mem(ptr, flags_byte);</div>
-<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  uint16_t k;</div>
-<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  ptr += copy_from_mem(ptr, k);</div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  uint8_t num_levels;</div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  ptr += copy_from_mem(ptr, num_levels);</div>
-<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  uint8_t num_raw_items;</div>
-<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>  ptr += copy_from_mem(ptr, num_raw_items);</div>
-<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span> </div>
-<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>  check_preamble_ints(preamble_ints, num_levels);</div>
-<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>  check_serial_version(serial_version);</div>
-<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>  check_family_id(family_id);</div>
-<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span> </div>
-<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY);</div>
-<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> hra = flags_byte &amp; (1 &lt;&lt; flags::IS_HIGH_RANK);</div>
-<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> req_sketch(k, hra, comparator, allocator);</div>
-<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span> </div>
-<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>  optional&lt;T&gt; tmp; <span class="comment">// space to deserialize min and max</span></div>
-<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>  optional&lt;T&gt; min_item;</div>
-<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>  optional&lt;T&gt; max_item;</div>
-<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span> </div>
-<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> raw_items = flags_byte &amp; (1 &lt;&lt; flags::RAW_ITEMS);</div>
-<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_0_sorted = flags_byte &amp; (1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED);</div>
-<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>  std::vector&lt;Compactor, AllocCompactor&gt; compactors(allocator);</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    <span class="comment">// Space to deserialize min and max.</span></div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>    <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>    <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span> </div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    sd.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    min_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>    sd.deserialize(is, tmp, 1);</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>    max_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>  }</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span> </div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>  <span class="keywordflow">if</span> (raw_items) {</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>    compactors.push_back(Compactor::deserialize(is, sd, comparator, allocator, is_level_0_sorted, k, num_raw_items, hra));</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_levels; ++i) {</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>      compactors.push_back(Compactor::deserialize(is, sd, comparator, allocator, i == 0 ? is_level_0_sorted : true, hra));</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    }</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  }</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>  <span class="keywordflow">if</span> (num_levels == 1) {</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>    <span class="keyword">const</span> <span class="keyword">auto</span> begin = compactors[0].begin();</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>    <span class="keyword">const</span> <span class="keyword">auto</span> end = compactors[0].end();</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>    n = compactors[0].get_num_items();</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>    <span class="keyword">auto</span> min_it = begin;</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>    <span class="keyword">auto</span> max_it = begin;</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin; it != end; ++it) {</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>      <span class="keywordflow">if</span> (comparator(*it, *min_it)) min_it = it;</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>      <span class="keywordflow">if</span> (comparator(*max_it, *it)) max_it = it;</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>    }</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    min_item.emplace(*min_it);</div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>    max_item.emplace(*max_it);</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>  }</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span> </div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;error reading from std::istream&quot;</span>);</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  <span class="keywordflow">return</span> req_sketch(k, hra, n, std::move(min_item), std::move(max_item), std::move(compactors), comparator);</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>}</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span> </div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> SerDe&gt;</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>req_sketch&lt;T, C, A&gt; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a1936c2c39faaf2c19243949a57cec8e0">req_sketch&lt;T, C, A&gt;::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&amp; sd, <span class="keyword">const</span> C&amp; comparator, < [...]
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>  ensure_minimum_memory(size, 8);</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes);</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">&gt;</span>(bytes) + size;</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span> </div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>  uint8_t preamble_ints;</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>  ptr += copy_from_mem(ptr, preamble_ints);</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>  uint8_t serial_version;</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  ptr += copy_from_mem(ptr, serial_version);</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  uint8_t family_id;</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  ptr += copy_from_mem(ptr, family_id);</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>  uint8_t flags_byte;</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>  ptr += copy_from_mem(ptr, flags_byte);</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>  uint16_t k;</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>  ptr += copy_from_mem(ptr, k);</div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>  uint8_t num_levels;</div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>  ptr += copy_from_mem(ptr, num_levels);</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>  uint8_t num_raw_items;</div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>  ptr += copy_from_mem(ptr, num_raw_items);</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span> </div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>  check_preamble_ints(preamble_ints, num_levels);</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  check_serial_version(serial_version);</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>  check_family_id(family_id);</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span> </div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_empty = flags_byte &amp; (1 &lt;&lt; flags::IS_EMPTY);</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> hra = flags_byte &amp; (1 &lt;&lt; flags::IS_HIGH_RANK);</div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>  <span class="keywordflow">if</span> (is_empty) <span class="keywordflow">return</span> req_sketch(k, hra, comparator, allocator);</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span> </div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>  optional&lt;T&gt; min_item;</div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>  optional&lt;T&gt; max_item;</div>
 <div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span> </div>
-<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>  uint64_t n = 1;</div>
-<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>  <span class="keywordflow">if</span> (num_levels &gt; 1) {</div>
-<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>    ensure_minimum_memory(end_ptr - ptr, <span class="keyword">sizeof</span>(n));</div>
-<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>    ptr += copy_from_mem(ptr, n);</div>
-<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>    min_item.emplace(*tmp);</div>
-<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, &amp;*tmp, 1);</div>
-<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
-<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>    max_item.emplace(*tmp);</div>
-<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>    (*tmp).~T();</div>
-<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>  }</div>
-<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span> </div>
-<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>  <span class="keywordflow">if</span> (raw_items) {</div>
-<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <span class="keyword">auto</span> pair = Compactor::deserialize(ptr, end_ptr - ptr, sd, comparator, allocator, is_level_0_sorted, k, num_raw_items, hra);</div>
-<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    compactors.push_back(std::move(pair.first));</div>
-<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>    ptr += pair.second;</div>
-<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>  } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_levels; ++i) {</div>
-<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>      <span class="keyword">auto</span> pair = Compactor::deserialize(ptr, end_ptr - ptr, sd, comparator, allocator, i == 0 ? is_level_0_sorted : true, hra);</div>
-<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>      compactors.push_back(std::move(pair.first));</div>
-<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>      ptr += pair.second;</div>
-<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>    }</div>
-<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>  }</div>
-<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>  <span class="keywordflow">if</span> (num_levels == 1) {</div>
-<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>    <span class="keyword">const</span> <span class="keyword">auto</span> begin = compactors[0].begin();</div>
-<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>    <span class="keyword">const</span> <span class="keyword">auto</span> end = compactors[0].end();</div>
-<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>    n = compactors[0].get_num_items();</div>
-<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>    <span class="keyword">auto</span> min_it = begin;</div>
-<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    <span class="keyword">auto</span> max_it = begin;</div>
-<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin; it != end; ++it) {</div>
-<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>      <span class="keywordflow">if</span> (comparator(*it, *min_it)) min_it = it;</div>
-<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>      <span class="keywordflow">if</span> (comparator(*max_it, *it)) max_it = it;</div>
-<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>    }</div>
-<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>    min_item.emplace(*min_it);</div>
-<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>    max_item.emplace(*max_it);</div>
-<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>  }</div>
-<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span> </div>
-<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>  <span class="keywordflow">return</span> req_sketch(k, hra, n, std::move(min_item), std::move(max_item), std::move(compactors), comparator);</div>
-<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>}</div>
-<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span> </div>
-<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::grow() {</div>
-<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>  <span class="keyword">const</span> uint8_t lg_weight = get_num_levels();</div>
-<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>  compactors_.push_back(Compactor(hra_, lg_weight, k_, comparator_, allocator_));</div>
-<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>  update_max_nom_size();</div>
-<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>}</div>
-<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span> </div>
-<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>uint8_t req_sketch&lt;T, C, A&gt;::get_num_levels()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(compactors_.size());</div>
-<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>}</div>
-<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span> </div>
-<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::update_max_nom_size() {</div>
-<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>  max_nom_size_ = 0;</div>
-<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) max_nom_size_ += compactor.get_nom_capacity();</div>
-<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>}</div>
-<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span> </div>
-<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::update_num_retained() {</div>
-<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>  num_retained_ = 0;</div>
-<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) num_retained_ += compactor.get_num_items();</div>
-<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>}</div>
-<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span> </div>
-<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::compress() {</div>
-<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> h = 0; h &lt; compactors_.size(); ++h) {</div>
-<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>    <span class="keywordflow">if</span> (compactors_[h].get_num_items() &gt;= compactors_[h].get_nom_capacity()) {</div>
-<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>      <span class="keywordflow">if</span> (h == 0) compactors_[0].sort();</div>
-<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>      <span class="keywordflow">if</span> (h + 1 &gt;= get_num_levels()) { <span class="comment">// at the top?</span></div>
-<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>        grow(); <span class="comment">// add a level, increases max_nom_size</span></div>
-<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>      }</div>
-<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>      <span class="keyword">auto</span> pair = compactors_[h].compact(compactors_[h + 1]);</div>
-<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>      num_retained_ -= pair.first;</div>
-<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>      max_nom_size_ += pair.second;</div>
-<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>      <span class="keywordflow">if</span> (LAZY_COMPRESSION &amp;&amp; num_retained_ &lt; max_nom_size_) <span class="keywordflow">break</span>;</div>
-<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    }</div>
-<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>  }</div>
-<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>}</div>
-<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span> </div>
-<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00631" data-start="{" data-end="}">
-<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">  631</a></span>string&lt;A&gt; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">req_sketch&lt;T, C, A&gt;::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 id="l00632" name="l00632"></a><span class="lineno">  632</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div>
-<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div>
-<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>  std::ostringstream os;</div>
-<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>  os &lt;&lt; <span class="stringliteral">&quot;### REQ sketch summary:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>  os &lt;&lt; <span class="stringliteral">&quot;   K              : &quot;</span> &lt;&lt; k_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>  os &lt;&lt; <span class="stringliteral">&quot;   High Rank Acc  : &quot;</span> &lt;&lt; (hra_ ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>  os &lt;&lt; <span class="stringliteral">&quot;   Empty          : &quot;</span> &lt;&lt; (is_empty() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>  os &lt;&lt; <span class="stringliteral">&quot;   Estimation mode: &quot;</span> &lt;&lt; (is_estimation_mode() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>  os &lt;&lt; <span class="stringliteral">&quot;   Sorted         : &quot;</span> &lt;&lt; (compactors_[0].is_sorted() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>  os &lt;&lt; <span class="stringliteral">&quot;   N              : &quot;</span> &lt;&lt; n_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>  os &lt;&lt; <span class="stringliteral">&quot;   Levels         : &quot;</span> &lt;&lt; compactors_.size() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>  os &lt;&lt; <span class="stringliteral">&quot;   Retained items : &quot;</span> &lt;&lt; num_retained_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>  os &lt;&lt; <span class="stringliteral">&quot;   Capacity items : &quot;</span> &lt;&lt; max_nom_size_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
-<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    os &lt;&lt; <span class="stringliteral">&quot;   Min item      : &quot;</span> &lt;&lt; *min_item_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>    os &lt;&lt; <span class="stringliteral">&quot;   Max item      : &quot;</span> &lt;&lt; *max_item_ &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>  }</div>
-<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>  os &lt;&lt; <span class="stringliteral">&quot;### End sketch summary&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span> </div>
-<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>  <span class="keywordflow">if</span> (print_levels) {</div>
-<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>    os &lt;&lt; <span class="stringliteral">&quot;### REQ sketch levels:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>    os &lt;&lt; <span class="stringliteral">&quot;   index: nominal capacity, actual size&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; compactors_.size(); i++) {</div>
-<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>      os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
-<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>        &lt;&lt; compactors_[i].get_nom_capacity() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span></div>
-<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span>        &lt;&lt; compactors_[i].get_num_items() &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>    }</div>
-<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch levels&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>  }</div>
-<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span> </div>
-<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>  <span class="keywordflow">if</span> (print_items) {</div>
-<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>    os &lt;&lt; <span class="stringliteral">&quot;### REQ sketch data:&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    <span class="keywordtype">unsigned</span> level = 0;</div>
-<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) {</div>
-<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>      os &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; level &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>      <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = compactor.begin(); it != compactor.end(); ++it) {</div>
-<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>        os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; *it &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>      }</div>
-<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span>      ++level;</div>
-<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>    }</div>
-<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch data&quot;</span> &lt;&lt; std::endl;</div>
-<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>  }</div>
-<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>  <span class="keywordflow">return</span> string&lt;A&gt;(os.str().c_str(), allocator_);</div>
-<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>}</div>
-</div>
-<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span> </div>
-<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(uint16_t k, <span class="keywordtype">bool</span> hra, uint64_t n,</div>
-<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>    optional&lt;T&gt;&amp;&amp; min_item, optional&lt;T&gt;&amp;&amp; max_item,</div>
-<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    std::vector&lt;Compactor, AllocCompactor&gt;&amp;&amp; compactors, <span class="keyword">const</span> C&amp; comparator):</div>
-<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>comparator_(comparator),</div>
-<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>allocator_(compactors.get_allocator()),</div>
-<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>k_(k),</div>
-<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>hra_(hra),</div>
-<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>max_nom_size_(0),</div>
-<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span>num_retained_(0),</div>
-<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>n_(n),</div>
-<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>compactors_(std::move(compactors)),</div>
-<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span>min_item_(std::move(min_item)),</div>
-<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span>max_item_(std::move(max_item)),</div>
-<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>sorted_view_(nullptr)</div>
-<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>{</div>
-<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span>  update_max_nom_size();</div>
-<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span>  update_num_retained();</div>
-<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span>}</div>
-<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span> </div>
-<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::check_preamble_ints(uint8_t preamble_ints, uint8_t num_levels) {</div>
-<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span>  <span class="keyword">const</span> uint8_t expected_preamble_ints = num_levels &gt; 1 ? 4 : 2;</div>
-<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>  <span class="keywordflow">if</span> (preamble_ints != expected_preamble_ints) {</div>
-<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: preamble ints must be &quot;</span></div>
-<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>        + std::to_string(expected_preamble_ints) + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(preamble_ints));</div>
-<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>  }</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> raw_items = flags_byte &amp; (1 &lt;&lt; flags::RAW_ITEMS);</div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_level_0_sorted = flags_byte &amp; (1 &lt;&lt; flags::IS_LEVEL_ZERO_SORTED);</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>  std::vector&lt;Compactor, AllocCompactor&gt; compactors(allocator);</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span> </div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>  uint64_t n = 1;</div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>  <span class="keywordflow">if</span> (num_levels &gt; 1) {</div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>    ensure_minimum_memory(end_ptr - ptr, <span class="keyword">sizeof</span>(n));</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>    ptr += copy_from_mem(ptr, n);</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>    <span class="comment">// Space to deserialize min and max.</span></div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>    <span class="comment">// serde::deserialize expects allocated but not initialized storage.</span></div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>    <span class="keyword">typename</span> std::aligned_storage&lt;<span class="keyword">sizeof</span>(T), <span class="keyword">alignof</span>(T)&gt;::type tmp_storage;</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>    T* tmp = <span class="keyword">reinterpret_cast&lt;</span>T*<span class="keyword">&gt;</span>(&amp;tmp_storage);</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span> </div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    min_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>    ptr += sd.deserialize(ptr, end_ptr - ptr, tmp, 1);</div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>    <span class="comment">// serde call did not throw, repackage and cleanup</span></div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>    max_item.emplace(std::move(*tmp));</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>    tmp-&gt;~T();</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>  }</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span> </div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>  <span class="keywordflow">if</span> (raw_items) {</div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>    <span class="keyword">auto</span> pair = Compactor::deserialize(ptr, end_ptr - ptr, sd, comparator, allocator, is_level_0_sorted, k, num_raw_items, hra);</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>    compactors.push_back(std::move(pair.first));</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>    ptr += pair.second;</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>  } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_levels; ++i) {</div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>      <span class="keyword">auto</span> pair = Compactor::deserialize(ptr, end_ptr - ptr, sd, comparator, allocator, i == 0 ? is_level_0_sorted : true, hra);</div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>      compactors.push_back(std::move(pair.first));</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>      ptr += pair.second;</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>    }</div>
+<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>  }</div>
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>  <span class="keywordflow">if</span> (num_levels == 1) {</div>
+<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>    <span class="keyword">const</span> <span class="keyword">auto</span> begin = compactors[0].begin();</div>
+<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>    <span class="keyword">const</span> <span class="keyword">auto</span> end = compactors[0].end();</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>    n = compactors[0].get_num_items();</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    <span class="keyword">auto</span> min_it = begin;</div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>    <span class="keyword">auto</span> max_it = begin;</div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin; it != end; ++it) {</div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>      <span class="keywordflow">if</span> (comparator(*it, *min_it)) min_it = it;</div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>      <span class="keywordflow">if</span> (comparator(*max_it, *it)) max_it = it;</div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>    }</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>    min_item.emplace(*min_it);</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>    max_item.emplace(*max_it);</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>  }</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span> </div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>  <span class="keywordflow">return</span> req_sketch(k, hra, n, std::move(min_item), std::move(max_item), std::move(compactors), comparator);</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>}</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span> </div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::grow() {</div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>  <span class="keyword">const</span> uint8_t lg_weight = get_num_levels();</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>  compactors_.push_back(Compactor(hra_, lg_weight, k_, comparator_, allocator_));</div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>  update_max_nom_size();</div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>}</div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span> </div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>uint8_t req_sketch&lt;T, C, A&gt;::get_num_levels()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(compactors_.size());</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>}</div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span> </div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::update_max_nom_size() {</div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>  max_nom_size_ = 0;</div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) max_nom_size_ += compactor.get_nom_capacity();</div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>}</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span> </div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::update_num_retained() {</div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>  num_retained_ = 0;</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) num_retained_ += compactor.get_num_items();</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>}</div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span> </div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::compress() {</div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> h = 0; h &lt; compactors_.size(); ++h) {</div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    <span class="keywordflow">if</span> (compactors_[h].get_num_items() &gt;= compactors_[h].get_nom_capacity()) {</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>      <span class="keywordflow">if</span> (h == 0) compactors_[0].sort();</div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>      <span class="keywordflow">if</span> (h + 1 &gt;= get_num_levels()) { <span class="comment">// at the top?</span></div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>        grow(); <span class="comment">// add a level, increases max_nom_size</span></div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>      }</div>
+<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>      <span class="keyword">auto</span> pair = compactors_[h].compact(compactors_[h + 1]);</div>
+<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>      num_retained_ -= pair.first;</div>
+<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>      max_nom_size_ += pair.second;</div>
+<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>      <span class="keywordflow">if</span> (LAZY_COMPRESSION &amp;&amp; num_retained_ &lt; max_nom_size_) <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>    }</div>
+<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>  }</div>
+<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>}</div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span> </div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00640" data-start="{" data-end="}">
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">  640</a></span>string&lt;A&gt; <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">req_sketch&lt;T, C, A&gt;::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 id="l00641" name="l00641"></a><span class="lineno">  641</span>  <span class="comment">// Using a temporary stream for implementation here does not comply with AllocatorAwareContainer requirements.</span></div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>  <span class="comment">// The stream does not support passing an allocator instance, and alternatives are complicated.</span></div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>  std::ostringstream os;</div>
+<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>  os &lt;&lt; <span class="stringliteral">&quot;### REQ sketch summary:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>  os &lt;&lt; <span class="stringliteral">&quot;   K              : &quot;</span> &lt;&lt; k_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>  os &lt;&lt; <span class="stringliteral">&quot;   High Rank Acc  : &quot;</span> &lt;&lt; (hra_ ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>  os &lt;&lt; <span class="stringliteral">&quot;   Empty          : &quot;</span> &lt;&lt; (is_empty() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>  os &lt;&lt; <span class="stringliteral">&quot;   Estimation mode: &quot;</span> &lt;&lt; (is_estimation_mode() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>  os &lt;&lt; <span class="stringliteral">&quot;   Sorted         : &quot;</span> &lt;&lt; (compactors_[0].is_sorted() ? <span class="stringliteral">&quot;true&quot;</span> : <span class="stringliteral">&quot;false&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>  os &lt;&lt; <span class="stringliteral">&quot;   N              : &quot;</span> &lt;&lt; n_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>  os &lt;&lt; <span class="stringliteral">&quot;   Levels         : &quot;</span> &lt;&lt; compactors_.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>  os &lt;&lt; <span class="stringliteral">&quot;   Retained items : &quot;</span> &lt;&lt; num_retained_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>  os &lt;&lt; <span class="stringliteral">&quot;   Capacity items : &quot;</span> &lt;&lt; max_nom_size_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>  <span class="keywordflow">if</span> (!is_empty()) {</div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>    os &lt;&lt; <span class="stringliteral">&quot;   Min item      : &quot;</span> &lt;&lt; *min_item_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>    os &lt;&lt; <span class="stringliteral">&quot;   Max item      : &quot;</span> &lt;&lt; *max_item_ &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span>  }</div>
+<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>  os &lt;&lt; <span class="stringliteral">&quot;### End sketch summary&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span> </div>
+<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>  <span class="keywordflow">if</span> (print_levels) {</div>
+<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>    os &lt;&lt; <span class="stringliteral">&quot;### REQ sketch levels:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>    os &lt;&lt; <span class="stringliteral">&quot;   index: nominal capacity, actual size&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; compactors_.size(); i++) {</div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>      os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; (<span class="keywordtype">unsigned</span> int) i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>        &lt;&lt; compactors_[i].get_nom_capacity() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span></div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>        &lt;&lt; compactors_[i].get_num_items() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>    }</div>
+<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch levels&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>  }</div>
+<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span> </div>
+<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>  <span class="keywordflow">if</span> (print_items) {</div>
+<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>    os &lt;&lt; <span class="stringliteral">&quot;### REQ sketch data:&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>    <span class="keywordtype">unsigned</span> level = 0;</div>
+<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; compactor: compactors_) {</div>
+<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>      os &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; level &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>      <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = compactor.begin(); it != compactor.end(); ++it) {</div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>        os &lt;&lt; <span class="stringliteral">&quot;   &quot;</span> &lt;&lt; *it &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>      }</div>
+<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>      ++level;</div>
+<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    }</div>
+<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>    os &lt;&lt; <span class="stringliteral">&quot;### End sketch data&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>  }</div>
+<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>  <span class="keywordflow">return</span> string&lt;A&gt;(os.str().c_str(), allocator_);</div>
+<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>}</div>
+</div>
+<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span> </div>
+<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span><a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::req_sketch</a>(uint16_t k, <span class="keywordtype">bool</span> hra, uint64_t n,</div>
+<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>    optional&lt;T&gt;&amp;&amp; min_item, optional&lt;T&gt;&amp;&amp; max_item,</div>
+<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span>    std::vector&lt;Compactor, AllocCompactor&gt;&amp;&amp; compactors, <span class="keyword">const</span> C&amp; comparator):</div>
+<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span>comparator_(comparator),</div>
+<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>allocator_(compactors.get_allocator()),</div>
+<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>k_(k),</div>
+<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span>hra_(hra),</div>
+<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span>max_nom_size_(0),</div>
+<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span>num_retained_(0),</div>
+<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>n_(n),</div>
+<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>compactors_(std::move(compactors)),</div>
+<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span>min_item_(std::move(min_item)),</div>
+<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span>max_item_(std::move(max_item)),</div>
+<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>sorted_view_(nullptr)</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>{</div>
+<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>  update_max_nom_size();</div>
+<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>  update_num_retained();</div>
 <div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>}</div>
 <div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span> </div>
 <div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::check_serial_version(uint8_t serial_version) {</div>
-<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>  <span class="keywordflow">if</span> (serial_version != SERIAL_VERSION) {</div>
-<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: serial version mismatch: expected &quot;</span></div>
-<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>        + std::to_string(SERIAL_VERSION)</div>
-<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>        + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(serial_version));</div>
+<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::check_preamble_ints(uint8_t preamble_ints, uint8_t num_levels) {</div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>  <span class="keyword">const</span> uint8_t expected_preamble_ints = num_levels &gt; 1 ? 4 : 2;</div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>  <span class="keywordflow">if</span> (preamble_ints != expected_preamble_ints) {</div>
+<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: preamble ints must be &quot;</span></div>
+<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>        + std::to_string(expected_preamble_ints) + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(preamble_ints));</div>
 <div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>  }</div>
 <div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>}</div>
 <div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span> </div>
 <div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::check_family_id(uint8_t family_id) {</div>
-<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>  <span class="keywordflow">if</span> (family_id != FAMILY) {</div>
-<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: family mismatch: expected &quot;</span></div>
-<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>        + std::to_string(FAMILY) + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(family_id));</div>
-<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>  }</div>
-<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>}</div>
-<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span> </div>
-<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00724" data-start="{" data-end="}">
-<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">  724</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">req_sketch&lt;T, C, A&gt;::begin</a>() const -&gt; const_iterator {</div>
-<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span>  <span class="keywordflow">return</span> const_iterator(compactors_.begin(), compactors_.end());</div>
-<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>}</div>
-</div>
-<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span> </div>
-<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="foldopen" id="foldopen00729" data-start="{" data-end="}">
-<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">  729</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">req_sketch&lt;T, C, A&gt;::end</a>() const -&gt; const_iterator {</div>
-<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span>  <span class="keywordflow">return</span> const_iterator(compactors_.end(), compactors_.end());</div>
-<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>}</div>
-</div>
-<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span> </div>
-<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::setup_sorted_view</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
-<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>    sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a>(get_sorted_view());</div>
-<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span>  }</div>
-<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span>}</div>
-<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span> </div>
-<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::reset_sorted_view() {</div>
-<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>    sorted_view_-&gt;~quantiles_sorted_view();</div>
+<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::check_serial_version(uint8_t serial_version) {</div>
+<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>  <span class="keywordflow">if</span> (serial_version != SERIAL_VERSION) {</div>
+<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: serial version mismatch: expected &quot;</span></div>
+<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>        + std::to_string(SERIAL_VERSION)</div>
+<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>        + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(serial_version));</div>
+<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>  }</div>
+<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span>}</div>
+<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span> </div>
+<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::check_family_id(uint8_t family_id) {</div>
+<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span>  <span class="keywordflow">if</span> (family_id != FAMILY) {</div>
+<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span>    <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Possible corruption: family mismatch: expected &quot;</span></div>
+<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span>        + std::to_string(FAMILY) + <span class="stringliteral">&quot;, got &quot;</span> + std::to_string(family_id));</div>
+<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span>  }</div>
+<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span>}</div>
+<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span> </div>
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00733" data-start="{" data-end="}">
+<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">  733</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">req_sketch&lt;T, C, A&gt;::begin</a>() const -&gt; const_iterator {</div>
+<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>  <span class="keywordflow">return</span> const_iterator(compactors_.begin(), compactors_.end());</div>
+<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>}</div>
+</div>
+<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span> </div>
+<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="foldopen" id="foldopen00738" data-start="{" data-end="}">
+<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"><a class="line" href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">  738</a></span><span class="keyword">auto</span> <a class="code hl_function" href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">req_sketch&lt;T, C, A&gt;::end</a>() const -&gt; const_iterator {</div>
+<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span>  <span class="keywordflow">return</span> const_iterator(compactors_.end(), compactors_.end());</div>
+<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>}</div>
+</div>
+<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span> </div>
+<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span><span class="keywordtype">void</span> <a class="code hl_class" href="classdatasketches_1_1req__sketch.html">req_sketch&lt;T, C, A&gt;::setup_sorted_view</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>  <span class="keywordflow">if</span> (sorted_view_ == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
-<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>    AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div>
-<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span>    sorted_view_ = <span class="keyword">nullptr</span>;</div>
-<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>  }</div>
-<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>}</div>
-<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span> </div>
-<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span><span class="comment">// iterator</span></div>
-<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span> </div>
-<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>req_sketch&lt;T, C, A&gt;::const_iterator::const_iterator(LevelsIterator begin, LevelsIterator end):</div>
-<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>    levels_it_(begin),</div>
-<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>    levels_end_(end),</div>
-<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>    compactor_it_(begin == end ? nullptr : (*levels_it_).begin())</div>
-<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>{}</div>
+<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>    sorted_view_ = <span class="keyword">new</span> (AllocSortedView(allocator_).allocate(1)) <a class="code hl_class" href="classdatasketches_1_1quantiles__sorted__view.html">quantiles_sorted_view&lt;T, C, A&gt;</a>(get_sorted_view());</div>
+<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span>  }</div>
+<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>}</div>
+<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span> </div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span><span class="keywordtype">void</span> req_sketch&lt;T, C, A&gt;::reset_sorted_view() {</div>
+<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>  <span class="keywordflow">if</span> (sorted_view_ != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span>    sorted_view_-&gt;~quantiles_sorted_view();</div>
+<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>    <span class="keyword">using </span>AllocSortedView = <span class="keyword">typename</span> std::allocator_traits&lt;A&gt;::template rebind_alloc&lt;quantiles_sorted_view&lt;T, C, A&gt;&gt;;</div>
+<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>    AllocSortedView(allocator_).deallocate(sorted_view_, 1);</div>
+<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>    sorted_view_ = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>  }</div>
+<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>}</div>
 <div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span> </div>
-<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator++() -&gt; const_iterator&amp; {</div>
-<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span>  ++compactor_it_;</div>
-<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>  <span class="keywordflow">if</span> (compactor_it_ == (*levels_it_).end()) {</div>
-<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>    ++levels_it_;</div>
-<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>    <span class="keywordflow">if</span> (levels_it_ != levels_end_) compactor_it_ = (*levels_it_).begin();</div>
-<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>  }</div>
-<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span>}</div>
-<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span> </div>
-<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) -&gt; const_iterator&amp; {</div>
-<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
-<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>  operator++();</div>
-<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>  <span class="keywordflow">return</span> tmp;</div>
-<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>}</div>
-<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span> </div>
-<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span><span class="keywordtype">bool</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>  <span class="keywordflow">if</span> (levels_it_ != other.levels_it_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
-<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>  <span class="keywordflow">if</span> (levels_it_ == levels_end_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
-<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>  <span class="keywordflow">return</span> compactor_it_ == other.compactor_it_;</div>
-<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>}</div>
-<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span> </div>
-<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span><span class="keywordtype">bool</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>  <span class="keywordflow">return</span> !operator==(other);</div>
-<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span>}</div>
-<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span> </div>
-<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
-<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>  <span class="keywordflow">return</span> value_type(*compactor_it_, 1ULL &lt;&lt; (*levels_it_).get_lg_weight());</div>
-<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span>}</div>
-<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span> </div>
-<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
-<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
-<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
-<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>}</div>
-<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span> </div>
-<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span>} <span class="comment">/* namespace datasketches */</span></div>
-<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span> </div>
-<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span><span class="comment">// iterator</span></div>
+<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span> </div>
+<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>req_sketch&lt;T, C, A&gt;::const_iterator::const_iterator(LevelsIterator begin, LevelsIterator end):</div>
+<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>    levels_it_(begin),</div>
+<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>    levels_end_(end),</div>
+<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>    compactor_it_(begin == end ? nullptr : (*levels_it_).begin())</div>
+<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>{}</div>
+<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span> </div>
+<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator++() -&gt; const_iterator&amp; {</div>
+<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span>  ++compactor_it_;</div>
+<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span>  <span class="keywordflow">if</span> (compactor_it_ == (*levels_it_).end()) {</div>
+<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>    ++levels_it_;</div>
+<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>    <span class="keywordflow">if</span> (levels_it_ != levels_end_) compactor_it_ = (*levels_it_).begin();</div>
+<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>  }</div>
+<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span>}</div>
+<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span> </div>
+<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator++(<span class="keywordtype">int</span>) -&gt; const_iterator&amp; {</div>
+<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>  const_iterator tmp(*<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>  operator++();</div>
+<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>  <span class="keywordflow">return</span> tmp;</div>
+<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>}</div>
+<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span> </div>
+<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span><span class="keywordtype">bool</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator==(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>  <span class="keywordflow">if</span> (levels_it_ != other.levels_it_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>  <span class="keywordflow">if</span> (levels_it_ == levels_end_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>  <span class="keywordflow">return</span> compactor_it_ == other.compactor_it_;</div>
+<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>}</div>
+<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span> </div>
+<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span><span class="keywordtype">bool</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator!=(<span class="keyword">const</span> const_iterator&amp; other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>  <span class="keywordflow">return</span> !operator==(other);</div>
+<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>}</div>
+<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span> </div>
+<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator*() const -&gt; reference {</div>
+<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>  <span class="keywordflow">return</span> value_type(*compactor_it_, 1ULL &lt;&lt; (*levels_it_).get_lg_weight());</div>
+<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>}</div>
+<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span> </div>
+<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A&gt;</div>
+<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span><span class="keyword">auto</span> req_sketch&lt;T, C, A&gt;::const_iterator::operator-&gt;() const -&gt; pointer {</div>
+<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>  <span class="keywordflow">return</span> **<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span>}</div>
+<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span> </div>
+<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>} <span class="comment">/* namespace datasketches */</span></div>
+<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span> </div>
+<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span><span class="preprocessor">#endif</span></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</a></div><div class="ttdoc">Sorted view for quantiles sketches (REQ, KLL and Quantiles)</div><div class="ttdef"><b>Definition</b> quantiles_sorted_view.hpp:38</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html">datasketches::req_sketch</a></div><div class="ttdoc">Relative Error Quantiles Sketch.</div><div class="ttdef"><b>Definition</b> req_sketch.hpp:79</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::req_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> req_sketch_impl.hpp:224</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::req_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, Comparator, Allocator &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:269</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a076f89979daa6471a3868cb97ea99b40"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a076f89979daa6471a3868cb97ea99b40">datasketches::req_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> req_sketch_impl.hpp:225</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a0a9c9c240dd591017fd6a80e147b7c00"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a0a9c9c240dd591017fd6a80e147b7c00">datasketches::req_sketch::get_sorted_view</a></div><div class="ttdeci">quantiles_sorted_view&lt; T, Comparator, Allocator &gt; get_sorted_view() const</div><div class="ttdoc">Gets the sorted view of this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:270</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a1936c2c39faaf2c19243949a57cec8e0"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a1936c2c39faaf2c19243949a57cec8e0">datasketches::req_sketch::deserialize</a></div><div class="ttdeci">static req_sketch deserialize(std::istream &amp;is, const SerDe &amp;sd=SerDe(), const Comparator &amp;comparator=Comparator(), const Allocator &amp;allocator=Allocator())</div><div class="ttdoc">This method deserializes a sketc [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::req_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= [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::req_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 in the sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:159</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::req_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= [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::req_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:188</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a20a4d992209b2aa58614c998d143705c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a20a4d992209b2aa58614c998d143705c">datasketches::req_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= [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a31fa76458d81a17dbebfcb828e531f14"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a31fa76458d81a17dbebfcb828e531f14">datasketches::req_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 in the sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:160</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a44226b755e73883ea2c128876e35b1d1"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a44226b755e73883ea2c128876e35b1d1">datasketches::req_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= [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a49bb19e78f36fb72b8496cd6cff71fec"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a49bb19e78f36fb72b8496cd6cff71fec">datasketches::req_sketch::merge</a></div><div class="ttdeci">void merge(FwdSk &amp;&amp;other)</div><div class="ttdoc">Merges another sketch into this one.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:189</div></div>
 <div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a4c80d2361c940f99df9f850615c2dcbe"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a4c80d2361c940f99df9f850615c2dcbe">datasketches::req_sketch::quantile_return_type</a></div><div class="ttdeci">typename quantiles_sorted_view&lt; T, Comparator, Allocator &gt;::quantile_return_type quantile_return_type</div><div class="ttdoc">Quantile return type.</div><div class="ttdef"><b>Definition</b> req_sketch.hpp:92</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::req_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:170</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::req_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;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> req_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::req_sketch::to_string</a></div><div class="ttdeci">string&lt; Allocator &gt; 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> req_sketch_impl.hpp:631</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::req_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> req_sketch_impl.hpp:139</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::req_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> req_sketch_impl.hpp:149</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a687ed2123bdc7e67fbda0c081e3acf21"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">datasketches::req_sketch::get_max_item</a></div><div class="ttdeci">const T &amp; get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:218</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a750349aa79dff6db2d13857ab50248bb"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">datasketches::req_sketch::get_rank_upper_bound</a></div><div class="ttdeci">double get_rank_upper_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate upper bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::req_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;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> req_sketch_imp [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a899bef2c5e0ea489ed4b023d2b9900ee"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">datasketches::req_sketch::get_RSE</a></div><div class="ttdeci">static double get_RSE(uint16_t k, double rank, bool hra, uint64_t n)</div><div class="ttdoc">Returns an a priori estimate of relative standard error (RSE, expressed as a number in [0,...</div><div class="ttdef"><b>Definition</b> req [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a978630658d411c9c79fffa5909f5c8d0"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">datasketches::req_sketch::get_rank_lower_bound</a></div><div class="ttdeci">double get_rank_lower_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate lower bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::req_sketch::get_allocator</a></div><div class="ttdeci">Allocator get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:229</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ab6e85db46b1d76086d5e9b5065b74a46"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">datasketches::req_sketch::operator=</a></div><div class="ttdeci">req_sketch &amp; operator=(const req_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:81</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::req_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 approximate quantile of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:258</ [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad5c959a538216a09ab28c5283585956c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">datasketches::req_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> req_sketch_impl.hpp:724</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::req_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;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> req_sketch_im [...]
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae11e60e117300685401961e36f196f7a"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">datasketches::req_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> req_sketch_impl.hpp:729</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::req_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> req_sketch_impl.hpp:164</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af2fa890815acf3a1418ea8eee466075c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">datasketches::req_sketch::get_min_item</a></div><div class="ttdeci">const T &amp; get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:212</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af6177b85206272c56ee75747bb885735"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">datasketches::req_sketch::is_HRA</a></div><div class="ttdeci">bool is_HRA() const</div><div class="ttdoc">Returns configured parameter High Rank Accuracy.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:144</div></div>
-<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::req_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> req_sketch_impl.hpp:154</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5200c74c52ee0f76d0d34c1ca6aec65c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5200c74c52ee0f76d0d34c1ca6aec65c">datasketches::req_sketch::update</a></div><div class="ttdeci">void update(FwdT &amp;&amp;item)</div><div class="ttdoc">Updates this sketch with the given data item.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:171</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a538940c100e4353b3671ad452d3d3056"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a538940c100e4353b3671ad452d3d3056">datasketches::req_sketch::serialize</a></div><div class="ttdeci">void serialize(std::ostream &amp;os, const SerDe &amp;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> req_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a592a7af55659ff803b26a45552a68dda"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a592a7af55659ff803b26a45552a68dda">datasketches::req_sketch::to_string</a></div><div class="ttdeci">string&lt; Allocator &gt; 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> req_sketch_impl.hpp:640</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a59f4c39b9f2e762e8e3445ef89e1d264"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a59f4c39b9f2e762e8e3445ef89e1d264">datasketches::req_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> req_sketch_impl.hpp:140</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a5a2b7a58dc85678d08752945ff655362"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a5a2b7a58dc85678d08752945ff655362">datasketches::req_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> req_sketch_impl.hpp:150</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a687ed2123bdc7e67fbda0c081e3acf21"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a687ed2123bdc7e67fbda0c081e3acf21">datasketches::req_sketch::get_max_item</a></div><div class="ttdeci">const T &amp; get_max_item() const</div><div class="ttdoc">Returns the max item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:219</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a750349aa79dff6db2d13857ab50248bb"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a750349aa79dff6db2d13857ab50248bb">datasketches::req_sketch::get_rank_upper_bound</a></div><div class="ttdeci">double get_rank_upper_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate upper bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a849dfa06c183fd2fdfe4fe4a7e29d918"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a849dfa06c183fd2fdfe4fe4a7e29d918">datasketches::req_sketch::get_rank</a></div><div class="ttdeci">double get_rank(const T &amp;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> req_sketch_imp [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a899bef2c5e0ea489ed4b023d2b9900ee"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a899bef2c5e0ea489ed4b023d2b9900ee">datasketches::req_sketch::get_RSE</a></div><div class="ttdeci">static double get_RSE(uint16_t k, double rank, bool hra, uint64_t n)</div><div class="ttdoc">Returns an a priori estimate of relative standard error (RSE, expressed as a number in [0,...</div><div class="ttdef"><b>Definition</b> req [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a978630658d411c9c79fffa5909f5c8d0"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a978630658d411c9c79fffa5909f5c8d0">datasketches::req_sketch::get_rank_lower_bound</a></div><div class="ttdeci">double get_rank_lower_bound(double rank, uint8_t num_std_dev) const</div><div class="ttdoc">Returns an approximate lower bound of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp: [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_a9d85cf47c4ecd0580ec623c42006dd1b"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#a9d85cf47c4ecd0580ec623c42006dd1b">datasketches::req_sketch::get_allocator</a></div><div class="ttdeci">Allocator get_allocator() const</div><div class="ttdoc">Returns an instance of the allocator for this sketch.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:230</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ab6e85db46b1d76086d5e9b5065b74a46"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ab6e85db46b1d76086d5e9b5065b74a46">datasketches::req_sketch::operator=</a></div><div class="ttdeci">req_sketch &amp; operator=(const req_sketch &amp;other)</div><div class="ttdoc">Copy assignment.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:82</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ac02fcfb6e706148458a2ef89390223a9"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ac02fcfb6e706148458a2ef89390223a9">datasketches::req_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 approximate quantile of the given normalized rank.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:259</ [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad5c959a538216a09ab28c5283585956c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad5c959a538216a09ab28c5283585956c">datasketches::req_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> req_sketch_impl.hpp:733</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ad9a5259d93d148b5c2050d68e7788716"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ad9a5259d93d148b5c2050d68e7788716">datasketches::req_sketch::get_serialized_size_bytes</a></div><div class="ttdeci">size_t get_serialized_size_bytes(const SerDe &amp;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> req_sketch_im [...]
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae11e60e117300685401961e36f196f7a"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae11e60e117300685401961e36f196f7a">datasketches::req_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> req_sketch_impl.hpp:738</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_ae95a04b1d7dccb3d9b3f3c3d087aa8e6"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#ae95a04b1d7dccb3d9b3f3c3d087aa8e6">datasketches::req_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> req_sketch_impl.hpp:165</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af2fa890815acf3a1418ea8eee466075c"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af2fa890815acf3a1418ea8eee466075c">datasketches::req_sketch::get_min_item</a></div><div class="ttdeci">const T &amp; get_min_item() const</div><div class="ttdoc">Returns the min item of the stream.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:213</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af6177b85206272c56ee75747bb885735"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af6177b85206272c56ee75747bb885735">datasketches::req_sketch::is_HRA</a></div><div class="ttdeci">bool is_HRA() const</div><div class="ttdoc">Returns configured parameter High Rank Accuracy.</div><div class="ttdef"><b>Definition</b> req_sketch_impl.hpp:145</div></div>
+<div class="ttc" id="aclassdatasketches_1_1req__sketch_html_af857be9469a7565252626f27e1f9d74d"><div class="ttname"><a href="classdatasketches_1_1req__sketch.html#af857be9469a7565252626f27e1f9d74d">datasketches::req_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> req_sketch_impl.hpp:155</div></div>
 <div class="ttc" id="anamespacedatasketches_1_1kll__constants_html_ab9f2b631adf46fe04a11814cd1018926"><div class="ttname"><a href="namespacedatasketches_1_1kll__constants.html#ab9f2b631adf46fe04a11814cd1018926">datasketches::kll_constants::MIN_K</a></div><div class="ttdeci">const uint16_t MIN_K</div><div class="ttdoc">min value of parameter K</div><div class="ttdef"><b>Definition</b> kll_sketch.hpp:39</div></div>
 <div class="ttc" id="anamespacedatasketches_1_1req__constants_html_a141418d3d37a4b49c0c5bb41b507f2b5"><div class="ttname"><a href="namespacedatasketches_1_1req__constants.html#a141418d3d37a4b49c0c5bb41b507f2b5">datasketches::req_constants::INIT_NUM_SECTIONS</a></div><div class="ttdeci">const uint8_t INIT_NUM_SECTIONS</div><div class="ttdoc">initial number of sections</div><div class="ttdef"><b>Definition</b> req_common.hpp:35</div></div>
 <div class="ttc" id="anamespacedatasketches_1_1req__constants_html_ab9f2b631adf46fe04a11814cd1018926"><div class="ttname"><a href="namespacedatasketches_1_1req__constants.html#ab9f2b631adf46fe04a11814cd1018926">datasketches::req_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> req_common.hpp:33</div></div>


---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org