| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <meta http-equiv="X-UA-Compatible" content="IE=9"/> |
| <meta name="generator" content="Doxygen 1.9.1"/> |
| <meta name="viewport" content="width=device-width, initial-scale=1"/> |
| <title>datasketches-cpp: req/include/req_compactor_impl.hpp Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.js"></script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </head> |
| <body> |
| <div id="top"><!-- do not remove this div, it is closed by doxygen! --> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td id="projectalign" style="padding-left: 0.5em;"> |
| <div id="projectname">datasketches-cpp |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.9.1 --> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| var searchBox = new SearchBox("searchBox", "search",false,'Search','.html'); |
| /* @license-end */ |
| </script> |
| <script type="text/javascript" src="menudata.js"></script> |
| <script type="text/javascript" src="menu.js"></script> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| $(function() { |
| initMenu('',true,false,'search.php','Search'); |
| $(document).ready(function() { init_search(); }); |
| }); |
| /* @license-end */</script> |
| <div id="main-nav"></div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_0449671fe79755ed26e25ef166543162.html">req</a></li><li class="navelem"><a class="el" href="dir_33f2f37c686242631bbdb651f95cf35d.html">include</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">req_compactor_impl.hpp</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * or more contributor license agreements. See the NOTICE file</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * distributed with this work for additional information</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * to you under the Apache License, Version 2.0 (the</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * "License"); you may not use this file except in compliance</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * with the License. You may obtain a copy of the License at</span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * Unless required by applicable law or agreed to in writing,</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * software distributed under the License is distributed on an</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * KIND, either express or implied. See the License for the</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * specific language governing permissions and limitations</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * under the License.</span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#ifndef REQ_COMPACTOR_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#define REQ_COMPACTOR_IMPL_HPP_</span></div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <stdexcept></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <cmath></span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "count_zeros.hpp"</span></div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "conditional_forward.hpp"</span></div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "common_defs.hpp"</span></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  </div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span><a class="code" href="namespacedatasketches.html">datasketches</a> {</div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> req_compactor<T, C, A>::req_compactor(<span class="keywordtype">bool</span> hra, uint8_t lg_weight, uint32_t section_size,</div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> sorted):</div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> lg_weight_(lg_weight),</div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span> hra_(hra),</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span> coin_(false),</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> sorted_(sorted),</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> section_size_raw_(static_cast<float>(section_size)),</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> section_size_(section_size),</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span> num_sections_(req_constants::<a class="code" href="namespacedatasketches_1_1req__constants.html#a141418d3d37a4b49c0c5bb41b507f2b5">INIT_NUM_SECTIONS</a>),</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span> state_(0),</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> num_items_(0),</div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> capacity_(2 * get_nom_capacity()),</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span> items_(allocator_.allocate(capacity_))</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span> {}</div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span> req_compactor<T, C, A>::~req_compactor() {</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (items_ != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin(); it != end(); ++it) (*it).~T();</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  allocator_.deallocate(items_, capacity_);</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span> }</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  </div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span> req_compactor<T, C, A>::req_compactor(<span class="keyword">const</span> req_compactor& other):</div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span> comparator_(other.comparator_),</div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span> allocator_(other.allocator_),</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span> lg_weight_(other.lg_weight_),</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span> hra_(other.hra_),</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> coin_(other.coin_),</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span> sorted_(other.sorted_),</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span> section_size_raw_(other.section_size_raw_),</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span> section_size_(other.section_size_),</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span> num_sections_(other.num_sections_),</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span> state_(other.state_),</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span> num_items_(other.num_items_),</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span> capacity_(other.capacity_),</div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span> items_(nullptr)</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span> {</div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">if</span> (other.items_ != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  items_ = allocator_.allocate(capacity_);</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> uint32_t from = hra_ ? capacity_ - num_items_ : 0;</div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> uint32_t to = hra_ ? capacity_ : num_items_;</div> |
| <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">for</span> (uint32_t i = from; i < to; ++i) <span class="keyword">new</span> (items_ + i) T(other.items_[i]);</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span> }</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span> req_compactor<T, C, A>::req_compactor(req_compactor&& other) noexcept :</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span> comparator_(std::move(other.comparator_)),</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span> allocator_(std::move(other.allocator_)),</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span> lg_weight_(other.lg_weight_),</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span> hra_(other.hra_),</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span> coin_(other.coin_),</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span> sorted_(other.sorted_),</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span> section_size_raw_(other.section_size_raw_),</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span> section_size_(other.section_size_),</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span> num_sections_(other.num_sections_),</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span> state_(other.state_),</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span> num_items_(other.num_items_),</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span> capacity_(other.capacity_),</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span> items_(other.items_)</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span> {</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  other.items_ = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span> }</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span> req_compactor<T, C, A>& req_compactor<T, C, A>::operator=(<span class="keyword">const</span> req_compactor& other) {</div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  req_compactor copy(other);</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  std::swap(comparator_, copy.comparator_);</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::swap(allocator_, copy.allocator_);</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  std::swap(lg_weight_, copy.lg_weight_);</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  std::swap(hra_, copy.hra_);</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::swap(coin_, copy.coin_);</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::swap(sorted_, copy.sorted_);</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::swap(section_size_raw_, copy.section_size_raw_);</div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::swap(section_size_, copy.section_size_);</div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::swap(num_sections_, copy.num_sections_);</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  std::swap(state_, copy.state_);</div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  std::swap(num_items_, copy.num_items_);</div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::swap(capacity_, copy.capacity_);</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  std::swap(items_, copy.items_);</div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span> }</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span> req_compactor<T, C, A>& req_compactor<T, C, A>::operator=(req_compactor&& other) {</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  std::swap(comparator_, other.comparator_);</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  std::swap(allocator_, other.allocator_);</div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  std::swap(lg_weight_, other.lg_weight_);</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  std::swap(hra_, other.hra_);</div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  std::swap(coin_, other.coin_);</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  std::swap(sorted_, other.sorted_);</div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::swap(section_size_raw_, other.section_size_raw_);</div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  std::swap(section_size_, other.section_size_);</div> |
| <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::swap(num_sections_, other.num_sections_);</div> |
| <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  std::swap(state_, other.state_);</div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  std::swap(num_items_, other.num_items_);</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  std::swap(capacity_, other.capacity_);</div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  std::swap(items_, other.items_);</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00137"></a><span class="lineno"> 137</span> }</div> |
| <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div> |
| <div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">template</span><<span class="keyword">typename</span> TT, <span class="keyword">typename</span> CC, <span class="keyword">typename</span> AA></div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span> req_compactor<T, C, A>::req_compactor(<span class="keyword">const</span> req_compactor<TT, CC, AA>& other, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span> lg_weight_(other.lg_weight_),</div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span> hra_(other.hra_),</div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span> coin_(other.coin_),</div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span> sorted_(other.sorted_),</div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span> section_size_raw_(other.section_size_raw_),</div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span> section_size_(other.section_size_),</div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span> num_sections_(other.num_sections_),</div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span> state_(other.state_),</div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span> num_items_(other.num_items_),</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span> capacity_(other.capacity_),</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span> items_(nullptr)</div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span> {</div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (other.items_ != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  items_ = allocator_.allocate(capacity_);</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">const</span> uint32_t from = hra_ ? capacity_ - num_items_ : 0;</div> |
| <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">const</span> uint32_t to = hra_ ? capacity_ : num_items_;</div> |
| <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">for</span> (uint32_t i = from; i < to; ++i) <span class="keyword">new</span> (items_ + i) T(other.items_[i]);</div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (sorted_ && !std::is_sorted(items_ + from, items_ + to, comparator_)) {</div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"items must be sorted"</span>);</div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span> }</div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  </div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="keywordtype">bool</span> req_compactor<T, C, A>::is_sorted()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">return</span> sorted_;</div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span> }</div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span> uint32_t req_compactor<T, C, A>::get_num_items()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">return</span> num_items_;</div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span> }</div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span> uint32_t req_compactor<T, C, A>::get_nom_capacity()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">return</span> req_constants::MULTIPLIER * num_sections_ * section_size_;</div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span> }</div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span> uint8_t req_compactor<T, C, A>::get_lg_weight()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> lg_weight_;</div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span> }</div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span> uint64_t req_compactor<T, C, A>::compute_weight(<span class="keyword">const</span> T& item, <span class="keywordtype">bool</span> inclusive)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (!sorted_) <span class="keyword">const_cast<</span>req_compactor*<span class="keyword">></span>(<span class="keyword">this</span>)->sort(); <span class="comment">// allow sorting as a side effect</span></div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">auto</span> it = inclusive ?</div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  std::upper_bound(begin(), end(), item, comparator_) :</div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  std::lower_bound(begin(), end(), item, comparator_);</div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">return</span> std::distance(begin(), it) << lg_weight_;</div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span> }</div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdT></div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::append(FwdT&& item) {</div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">if</span> (num_items_ == capacity_) grow(capacity_ + get_nom_capacity());</div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">const</span> uint32_t i = hra_ ? capacity_ - num_items_ - 1 : num_items_;</div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">new</span> (items_ + i) T(std::forward<FwdT>(item));</div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  ++num_items_;</div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (num_items_ > 1) sorted_ = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  </div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::grow(uint32_t new_capacity) {</div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  T* new_items = allocator_.allocate(new_capacity);</div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  uint32_t new_i = hra_ ? new_capacity - num_items_ : 0;</div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin(); it != end(); ++it, ++new_i) {</div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">new</span> (new_items + new_i) T(std::move(*it));</div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  (*it).~T();</div> |
| <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div> |
| <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  allocator_.deallocate(items_, capacity_);</div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  items_ = new_items;</div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  capacity_ = new_capacity;</div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span> }</div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::ensure_space(uint32_t num) {</div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (num_items_ + num > capacity_) grow(num_items_ + num + get_nom_capacity());</div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span> }</div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  </div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keyword">const</span> T* req_compactor<T, C, A>::begin()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">return</span> items_ + (hra_ ? capacity_ - num_items_ : 0);</div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span> }</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="keyword">const</span> T* req_compactor<T, C, A>::end()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> items_ + (hra_ ? capacity_ : num_items_);</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span> }</div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span> T* req_compactor<T, C, A>::begin() {</div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span> items_ + (hra_ ? capacity_ - num_items_ : 0);</div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  </div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span> T* req_compactor<T, C, A>::end() {</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">return</span> items_ + (hra_ ? capacity_ : num_items_);</div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span> }</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">template</span><<span class="keyword">typename</span> FwdC></div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::merge(FwdC&& other) {</div> |
| <div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// TODO: swap if other is larger?</span></div> |
| <div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (lg_weight_ != other.lg_weight_) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"weight mismatch"</span>);</div> |
| <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  state_ |= other.state_;</div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">while</span> (ensure_enough_sections()) {}</div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  ensure_space(other.get_num_items());</div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  sort();</div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">auto</span> offset = hra_ ? capacity_ - num_items_ : num_items_;</div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">auto</span> from = hra_ ? begin() - other.get_num_items() : end();</div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">auto</span> to = from + other.get_num_items();</div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">auto</span> other_it = other.begin();</div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = from; it != to; ++it, ++other_it) <span class="keyword">new</span> (it) T(conditional_forward<FwdC>(*other_it));</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (!other.sorted_) std::sort(from, to, comparator_);</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (num_items_ > 0) std::inplace_merge(hra_ ? from : begin(), items_ + offset, hra_ ? end() : to, C());</div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  num_items_ += other.get_num_items();</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span> }</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  </div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::sort() {</div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (!sorted_) {</div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  std::sort(begin(), end(), comparator_);</div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  sorted_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span> }</div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  </div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span> std::pair<uint32_t, uint32_t> req_compactor<T, C, A>::compact(req_compactor& next) {</div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">const</span> uint32_t starting_nom_capacity = get_nom_capacity();</div> |
| <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// choose a part of the buffer to compact</span></div> |
| <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">const</span> uint32_t secs_to_compact = std::min<uint32_t>(count_trailing_zeros_in_u64(~state_) + 1, num_sections_);</div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">auto</span> compaction_range = compute_compaction_range(secs_to_compact);</div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (compaction_range.second - compaction_range.first < 2) <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">"compaction range error"</span>);</div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> ((state_ & 1) == 1) { coin_ = !coin_; } <span class="comment">// for odd flip coin;</span></div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">else</span> { coin_ = random_utils::random_bit(); } <span class="comment">// random coin flip</span></div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  </div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num = (compaction_range.second - compaction_range.first) / 2;</div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  next.ensure_space(num);</div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">auto</span> next_middle = hra_ ? next.begin() : next.end();</div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">auto</span> next_empty = hra_ ? next.begin() - num : next.end();</div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  promote_evens_or_odds(begin() + compaction_range.first, begin() + compaction_range.second, coin_, next_empty);</div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  next.num_items_ += num;</div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  std::inplace_merge(next.begin(), next_middle, next.end(), comparator_);</div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = compaction_range.first; i < compaction_range.second; ++i) (*(begin() + i)).~T();</div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  num_items_ -= compaction_range.second - compaction_range.first;</div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  ++state_;</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  ensure_enough_sections();</div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> std::pair<uint32_t, uint32_t>(</div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  num,</div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  get_nom_capacity() - starting_nom_capacity</div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  );</div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span> }</div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  </div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="keywordtype">bool</span> req_compactor<T, C, A>::ensure_enough_sections() {</div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> ssr = section_size_raw_ / sqrtf(2);</div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">const</span> uint32_t ne = nearest_even(ssr);</div> |
| <div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (state_ >= <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(1ULL << (num_sections_ - 1)) && ne >= req_constants::MIN_K) {</div> |
| <div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  section_size_raw_ = ssr;</div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  section_size_ = ne;</div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  num_sections_ <<= 1;</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (capacity_ < 2 * get_nom_capacity()) grow(2 * get_nom_capacity());</div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  }</div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span> }</div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  </div> |
| <div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00315"></a><span class="lineno"> 315</span> std::pair<uint32_t, uint32_t> req_compactor<T, C, A>::compute_compaction_range(uint32_t secs_to_compact)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  uint32_t non_compact = get_nom_capacity() / 2 + (num_sections_ - secs_to_compact) * section_size_;</div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// make compacted region even</span></div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (((num_items_ - non_compact) & 1) == 1) ++non_compact;</div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">const</span> uint32_t low = hra_ ? 0 : non_compact;</div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> uint32_t high = hra_ ? num_items_ - non_compact : num_items_;</div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">return</span> std::pair<uint32_t, uint32_t>(low, high);</div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span> }</div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  </div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span> uint32_t req_compactor<T, C, A>::nearest_even(<span class="keywordtype">float</span> value) {</div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(round(value / 2)) << 1;</div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span> }</div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="keyword">template</span><<span class="keyword">typename</span> InIter, <span class="keyword">typename</span> OutIter></div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::promote_evens_or_odds(InIter from, InIter to, <span class="keywordtype">bool</span> odds, OutIter dst) {</div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (from == to) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  InIter i = from;</div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">if</span> (odds) ++i;</div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">while</span> (i != to) {</div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">new</span> (dst) T(std::move(*i));</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  ++dst;</div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  ++i;</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (i == to) <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  ++i;</div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span> }</div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  </div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment">// implementation for fixed-size arithmetic types (integral and floating point)</span></div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span> template<typename S, typename TT, typename std::enable_if<std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="keywordtype">size_t</span> req_compactor<T, C, A>::get_serialized_size_bytes(<span class="keyword">const</span> S&)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(state_) + <span class="keyword">sizeof</span>(section_size_raw_) + <span class="keyword">sizeof</span>(lg_weight_) + <span class="keyword">sizeof</span>(num_sections_) +</div> |
| <div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">sizeof</span>(uint16_t) + <span class="comment">// padding</span></div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">sizeof</span>(uint32_t) + <span class="comment">// num_items</span></div> |
| <div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">sizeof</span>(TT) * num_items_;</div> |
| <div class="line"><a name="l00352"></a><span class="lineno"> 352</span> }</div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  </div> |
| <div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// implementation for all other types</span></div> |
| <div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span> template<typename S, typename TT, typename std::enable_if<!std::is_arithmetic<TT>::value, <span class="keywordtype">int</span>>::type></div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="keywordtype">size_t</span> req_compactor<T, C, A>::get_serialized_size_bytes(<span class="keyword">const</span> S& serde)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordtype">size_t</span> size = <span class="keyword">sizeof</span>(state_) + <span class="keyword">sizeof</span>(section_size_raw_) + <span class="keyword">sizeof</span>(lg_weight_) + <span class="keyword">sizeof</span>(num_sections_) +</div> |
| <div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">sizeof</span>(uint16_t) + <span class="comment">// padding</span></div> |
| <div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">sizeof</span>(uint32_t); <span class="comment">// num_items</span></div> |
| <div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = begin(); it != end(); ++it) size += serde.size_of_item(*it);</div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> size;</div> |
| <div class="line"><a name="l00363"></a><span class="lineno"> 363</span> }</div> |
| <div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div> |
| <div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="keywordtype">void</span> req_compactor<T, C, A>::serialize(std::ostream& os, <span class="keyword">const</span> S& serde)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  write(os, state_);</div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  write(os, section_size_raw_);</div> |
| <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  write(os, lg_weight_);</div> |
| <div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  write(os, num_sections_);</div> |
| <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">const</span> uint16_t padding = 0;</div> |
| <div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  write(os, padding);</div> |
| <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  write(os, num_items_);</div> |
| <div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  serde.serialize(os, begin(), num_items_);</div> |
| <div class="line"><a name="l00376"></a><span class="lineno"> 376</span> }</div> |
| <div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  </div> |
| <div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="keywordtype">size_t</span> req_compactor<T, C, A>::serialize(<span class="keywordtype">void</span>* dst, <span class="keywordtype">size_t</span> capacity, <span class="keyword">const</span> S& serde)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  uint8_t* ptr = <span class="keyword">static_cast<</span>uint8_t*<span class="keyword">></span>(dst);</div> |
| <div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">const</span> uint8_t* end_ptr = ptr + capacity;</div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  ptr += copy_to_mem(state_, ptr);</div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  ptr += copy_to_mem(section_size_raw_, ptr);</div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  ptr += copy_to_mem(lg_weight_, ptr);</div> |
| <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  ptr += copy_to_mem(num_sections_, ptr);</div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">const</span> uint16_t padding = 0;</div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  ptr += copy_to_mem(padding, ptr);</div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  ptr += copy_to_mem(num_items_, ptr);</div> |
| <div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  ptr += serde.serialize(ptr, end_ptr - ptr, begin(), num_items_);</div> |
| <div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">return</span> ptr - <span class="keyword">static_cast<</span>uint8_t*<span class="keyword">></span>(dst);</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span> }</div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  </div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span> req_compactor<T, C, A> req_compactor<T, C, A>::deserialize(std::istream& is, <span class="keyword">const</span> S& serde,</div> |
| <div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> sorted, <span class="keywordtype">bool</span> hra) {</div> |
| <div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">auto</span> state = read<decltype(state_)>(is);</div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">auto</span> section_size_raw = read<decltype(section_size_raw_)>(is);</div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">auto</span> lg_weight = read<decltype(lg_weight_)>(is);</div> |
| <div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">auto</span> num_sections = read<decltype(num_sections_)>(is);</div> |
| <div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  read<uint16_t>(is); <span class="comment">// padding</span></div> |
| <div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">auto</span> num_items = read<uint32_t>(is);</div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keyword">auto</span> items = deserialize_items(is, serde, allocator, num_items);</div> |
| <div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">return</span> req_compactor(hra, lg_weight, sorted, section_size_raw, num_sections, state, std::move(items), num_items,</div> |
| <div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  comparator, allocator);</div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span> }</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  </div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00411"></a><span class="lineno"> 411</span> req_compactor<T, C, A> req_compactor<T, C, A>::deserialize(std::istream& is, <span class="keyword">const</span> S& serde,</div> |
| <div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> sorted, uint16_t k, uint8_t num_items, <span class="keywordtype">bool</span> hra) {</div> |
| <div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">auto</span> items = deserialize_items(is, serde, allocator, num_items);</div> |
| <div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">return</span> req_compactor(hra, 0, sorted, k, req_constants::INIT_NUM_SECTIONS, 0, std::move(items), num_items,</div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  comparator, allocator);</div> |
| <div class="line"><a name="l00416"></a><span class="lineno"> 416</span> }</div> |
| <div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  </div> |
| <div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="keyword">auto</span> req_compactor<T, C, A>::deserialize_items(std::istream& is, <span class="keyword">const</span> S& serde, <span class="keyword">const</span> A& allocator, uint32_t num)</div> |
| <div class="line"><a name="l00421"></a><span class="lineno"> 421</span> -> std::unique_ptr<T, items_deleter> {</div> |
| <div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  A alloc(allocator);</div> |
| <div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  std::unique_ptr<T, items_deleter> items(alloc.allocate(num), items_deleter(allocator, <span class="keyword">false</span>, num));</div> |
| <div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  serde.deserialize(is, items.get(), num);</div> |
| <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="comment">// serde did not throw, enable destructors</span></div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"error reading from std::istream"</span>);</div> |
| <div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> items;</div> |
| <div class="line"><a name="l00429"></a><span class="lineno"> 429</span> }</div> |
| <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div> |
| <div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span> std::pair<req_compactor<T, C, A>, <span class="keywordtype">size_t</span>> req_compactor<T, C, A>::deserialize(<span class="keyword">const</span> <span class="keywordtype">void</span>* bytes, <span class="keywordtype">size_t</span> size,</div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">const</span> S& serde, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> sorted, <span class="keywordtype">bool</span> hra) {</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  ensure_minimum_memory(size, 8);</div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes);</div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes) + size;</div> |
| <div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  </div> |
| <div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  uint64_t state;</div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  ptr += copy_from_mem(ptr, state);</div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordtype">float</span> section_size_raw;</div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  ptr += copy_from_mem(ptr, section_size_raw);</div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  uint8_t lg_weight;</div> |
| <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  ptr += copy_from_mem(ptr, lg_weight);</div> |
| <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  uint8_t num_sections;</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  ptr += copy_from_mem(ptr, num_sections);</div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  ptr += 2; <span class="comment">// padding</span></div> |
| <div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  uint32_t num_items;</div> |
| <div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  ptr += copy_from_mem(ptr, num_items);</div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">auto</span> pair = deserialize_items(ptr, end_ptr - ptr, serde, allocator, num_items);</div> |
| <div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  ptr += pair.second;</div> |
| <div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">return</span> std::pair<req_compactor, size_t>(</div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  req_compactor(hra, lg_weight, sorted, section_size_raw, num_sections, state, std::move(pair.first), num_items,</div> |
| <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  comparator, allocator),</div> |
| <div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  ptr - <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes)</div> |
| <div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  );</div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div> |
| <div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  </div> |
| <div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</span> std::pair<req_compactor<T, C, A>, <span class="keywordtype">size_t</span>> req_compactor<T, C, A>::deserialize(<span class="keyword">const</span> <span class="keywordtype">void</span>* bytes, <span class="keywordtype">size_t</span> size,</div> |
| <div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> S& serde, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> sorted, uint16_t k, uint8_t num_items, <span class="keywordtype">bool</span> hra) {</div> |
| <div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">auto</span> pair = deserialize_items(bytes, size, serde, allocator, num_items);</div> |
| <div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">return</span> std::pair<req_compactor, size_t>(</div> |
| <div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  req_compactor(hra, 0, sorted, k, req_constants::INIT_NUM_SECTIONS, 0, std::move(pair.first), num_items,</div> |
| <div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  comparator, allocator),</div> |
| <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  pair.second</div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  );</div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span> }</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  </div> |
| <div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="keyword">template</span><<span class="keyword">typename</span> S></div> |
| <div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="keyword">auto</span> req_compactor<T, C, A>::deserialize_items(<span class="keyword">const</span> <span class="keywordtype">void</span>* bytes, <span class="keywordtype">size_t</span> size, <span class="keyword">const</span> S& serde, <span class="keyword">const</span> A& allocator, uint32_t num)</div> |
| <div class="line"><a name="l00474"></a><span class="lineno"> 474</span> -> std::pair<std::unique_ptr<T, items_deleter>, <span class="keywordtype">size_t</span>> {</div> |
| <div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* ptr = <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes);</div> |
| <div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* end_ptr = <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes) + size;</div> |
| <div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  A alloc(allocator);</div> |
| <div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::unique_ptr<T, items_deleter> items(alloc.allocate(num), items_deleter(allocator, <span class="keyword">false</span>, num));</div> |
| <div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  ptr += serde.deserialize(ptr, end_ptr - ptr, items.get(), num);</div> |
| <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="comment">// serde did not throw, enable destructors</span></div> |
| <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  items.get_deleter().set_destroy(<span class="keyword">true</span>);</div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">return</span> std::pair<std::unique_ptr<T, items_deleter>, <span class="keywordtype">size_t</span>>(</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  std::move(items),</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  ptr - <span class="keyword">static_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(bytes)</div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  );</div> |
| <div class="line"><a name="l00486"></a><span class="lineno"> 486</span> }</div> |
| <div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  </div> |
| <div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  </div> |
| <div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00490"></a><span class="lineno"> 490</span> req_compactor<T, C, A>::req_compactor(<span class="keywordtype">bool</span> hra, uint8_t lg_weight, <span class="keywordtype">bool</span> sorted, <span class="keywordtype">float</span> section_size_raw, uint8_t num_sections,</div> |
| <div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  uint64_t state, std::unique_ptr<T, items_deleter> items, uint32_t num_items, <span class="keyword">const</span> C& comparator, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span> comparator_(comparator),</div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span> allocator_(allocator),</div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span> lg_weight_(lg_weight),</div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span> hra_(hra),</div> |
| <div class="line"><a name="l00496"></a><span class="lineno"> 496</span> coin_(random_utils::random_bit()),</div> |
| <div class="line"><a name="l00497"></a><span class="lineno"> 497</span> sorted_(sorted),</div> |
| <div class="line"><a name="l00498"></a><span class="lineno"> 498</span> section_size_raw_(section_size_raw),</div> |
| <div class="line"><a name="l00499"></a><span class="lineno"> 499</span> section_size_(nearest_even(section_size_raw)),</div> |
| <div class="line"><a name="l00500"></a><span class="lineno"> 500</span> num_sections_(num_sections),</div> |
| <div class="line"><a name="l00501"></a><span class="lineno"> 501</span> state_(state),</div> |
| <div class="line"><a name="l00502"></a><span class="lineno"> 502</span> num_items_(num_items),</div> |
| <div class="line"><a name="l00503"></a><span class="lineno"> 503</span> capacity_(num_items),</div> |
| <div class="line"><a name="l00504"></a><span class="lineno"> 504</span> items_(items.release())</div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span> {}</div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  </div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> C, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="keyword">class </span>req_compactor<T, C, A>::items_deleter {</div> |
| <div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  items_deleter(<span class="keyword">const</span> A& allocator, <span class="keywordtype">bool</span> destroy, <span class="keywordtype">size_t</span> num): allocator_(allocator), destroy_(destroy), num_(num) {}</div> |
| <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">void</span> operator() (T* ptr) {</div> |
| <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (destroy_) {</div> |
| <div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < num_; ++i) {</div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  ptr[i].~T();</div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  }</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  allocator_.deallocate(ptr, num_);</div> |
| <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div> |
| <div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  }</div> |
| <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordtype">void</span> set_destroy(<span class="keywordtype">bool</span> destroy) { destroy_ = destroy; }</div> |
| <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  A allocator_;</div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordtype">bool</span> destroy_;</div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordtype">size_t</span> num_;</div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span> };</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  </div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span> } <span class="comment">/* namespace datasketches */</span></div> |
| <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  </div> |
| <div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="preprocessor">#endif</span></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_html"><div class="ttname"><a href="namespacedatasketches.html">datasketches</a></div><div class="ttdoc">DataSketches namespace.</div><div class="ttdef"><b>Definition:</b> binomial_bounds.hpp:38</div></div> |
| </div><!-- fragment --></div><!-- contents --> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 |
| </small></address> |
| </body> |
| </html> |
