<!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.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: hashtable_policy.h 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="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</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">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00374_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">hashtable_policy.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00374.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Internal policy header for unordered_set and unordered_map -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2010-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</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="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file bits/hashtable_policy.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Do not attempt to use it directly.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * @headername{unordered_map,unordered_set}</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> */</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="preprocessor">#ifndef _HASHTABLE_POLICY_H</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#define _HASHTABLE_POLICY_H 1</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <<a class="code" href="a00161.html">tuple</a>></span> <span class="comment">// for std::tuple, std::forward_as_tuple</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00236.html">cstdint</a>></span> <span class="comment">// for std::uint_fast64_t</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00530.html">bits/stl_algobase.h</a>></span> <span class="comment">// for std::min.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">class </span>_Hashtable;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">namespace </span>__detail</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> {<span class="comment"></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> /**</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * @defgroup hashtable-detail Base and Implementation Classes</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * @ingroup unordered_associative_containers</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * @{</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="a05591.html"> 58</a></span>  <span class="keyword">struct </span><a class="code" href="a05591.html">_Hashtable_base</a>;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Helper function: return distance(first, last) for forward</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// iterators, or 0/1 for input iterators.</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Iterator></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::difference_type</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  __distance_fw(_Iterator __first, _Iterator __last,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="a07655.html">std::input_iterator_tag</a>)</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  { <span class="keywordflow">return</span> __first != __last ? 1 : 0; }</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Iterator></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::difference_type</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  __distance_fw(_Iterator __first, _Iterator __last,</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="a07663.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  { <span class="keywordflow">return</span> <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last); }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Iterator></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::difference_type</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  __distance_fw(_Iterator __first, _Iterator __last)</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  { <span class="keywordflow">return</span> __distance_fw(__first, __last,</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first)); }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">struct </span>_Identity</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  _Tp&&</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  operator()(_Tp&& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> std::forward<_Tp>(__x); }</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  };</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">struct </span>_Select1st</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  {</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  operator()(_Tp&& __x) <span class="keyword">const</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  -> decltype(std::get<0>(std::forward<_Tp>(__x)))</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  { <span class="keywordflow">return</span> std::get<0>(std::forward<_Tp>(__x)); }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  };</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="a05603.html"> 98</a></span>  <span class="keyword">struct </span><a class="code" href="a05603.html">_Hashtable_alloc</a>;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// Functor recycling a pool of nodes and using allocation once the pool is</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// empty.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">struct </span>_ReuseOrAllocNode</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">using</span> __node_alloc_type = _NodeAlloc;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">using</span> __hashtable_alloc = <a class="code" href="a05603.html">_Hashtable_alloc<__node_alloc_type></a>;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">using</span> <a class="code" href="a10159.html">__node_alloc_traits</a> =</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">typename</span> __hashtable_alloc::__node_alloc_traits;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> __hashtable_alloc::__node_type;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  _ReuseOrAllocNode(__node_type* __nodes, __hashtable_alloc& __h)</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  : _M_nodes(__nodes), _M_h(__h) { }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  _ReuseOrAllocNode(<span class="keyword">const</span> _ReuseOrAllocNode&) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  ~_ReuseOrAllocNode()</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  { _M_h._M_deallocate_nodes(_M_nodes); }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  __node_type*</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  operator()(_Arg&& __arg)<span class="keyword"> const</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">if</span> (_M_nodes)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  {</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  __node_type* __node = _M_nodes;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  _M_nodes = _M_nodes->_M_next();</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  __node->_M_nxt = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">auto</span>& __a = _M_h._M_node_allocator();</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  __node_alloc_traits::destroy(__a, __node->_M_valptr());</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  __try</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __node_alloc_traits::construct(__a, __node->_M_valptr(),</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  std::forward<_Arg>(__arg));</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __catch(...)</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>  __node->~__node_type();</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  __node_alloc_traits::deallocate(__a, __node, 1);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  __throw_exception_again;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">return</span> __node;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">return</span> _M_h._M_allocate_node(std::forward<_Arg>(__arg));</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">mutable</span> __node_type* _M_nodes;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  __hashtable_alloc& _M_h;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  };</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Functor similar to the previous one but without any pool of nodes to</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// recycle.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">struct </span>_AllocNode</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">using</span> __hashtable_alloc = _Hashtable_alloc<_NodeAlloc>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> __hashtable_alloc::__node_type;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  _AllocNode(__hashtable_alloc& __h)</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  : _M_h(__h) { }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  __node_type*</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  operator()(_Arg&& __arg)<span class="keyword"> const</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h._M_allocate_node(std::forward<_Arg>(__arg)); }</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  __hashtable_alloc& _M_h;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  };</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// Auxiliary types used for all instantiations of _Hashtable nodes</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// and iterators.</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"></span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> /**</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> * struct _Hashtable_traits</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> *</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * Important traits for hash tables.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> *</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * @tparam _Cache_hash_code Boolean value. True if the value of</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * the hash function is stored along with the value. This is a</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> * time-space tradeoff. Storing it may improve lookup speed by</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> * reducing the number of times we need to call the _Equal</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * function.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> *</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @tparam _Constant_iterators Boolean value. True if iterator and</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * const_iterator are both constant iterator types. This is true</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * for unordered_set and unordered_multiset, false for</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * unordered_map and unordered_multimap.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> *</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * @tparam _Unique_keys Boolean value. True if the return value</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * of _Hashtable::count(k) is always at most one, false if it may</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> * be an arbitrary number. This is true for unordered_set and</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * unordered_map, false for unordered_multiset and</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * unordered_multimap.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> */</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _Cache_hash_code, <span class="keywordtype">bool</span> _Constant_iterators, <span class="keywordtype">bool</span> _Unique_keys></div><div class="line"><a name="l00200"></a><span class="lineno"><a class="line" href="a05615.html"> 200</a></span>  <span class="keyword">struct </span><a class="code" href="a05615.html">_Hashtable_traits</a></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">using</span> <a class="code" href="a03043.html">__hash_cached</a> = <a class="code" href="a03043.html">__bool_constant<_Cache_hash_code></a>;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">using</span> <a class="code" href="a03043.html">__constant_iterators</a> = <a class="code" href="a03043.html">__bool_constant<_Constant_iterators></a>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">using</span> <a class="code" href="a03043.html">__unique_keys</a> = <a class="code" href="a03043.html">__bool_constant<_Unique_keys></a>;</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="comment"></span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> /**</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * struct _Hash_node_base</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> *</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * Nodes, used to wrap elements stored in the hash table. A policy</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> * template parameter of class template _Hashtable controls whether</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> * nodes also store a hash code. In some cases (e.g. strings) this</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> * may be a performance win.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> */</span></div><div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="a05619.html"> 215</a></span>  <span class="keyword">struct </span><a class="code" href="a05619.html">_Hash_node_base</a></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="a05619.html">_Hash_node_base</a>* _M_nxt;</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>  <a class="code" href="a05619.html">_Hash_node_base</a>() noexcept : _M_nxt() { }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="a05619.html">_Hash_node_base</a>(<a class="code" href="a05619.html">_Hash_node_base</a>* __next) noexcept : _M_nxt(__next) { }</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> <span class="comment"></span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> /**</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> * struct _Hash_node_value_base</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> *</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> * Node type with the value to store.</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> */</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value></div><div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="a05623.html"> 230</a></span>  <span class="keyword">struct </span><a class="code" href="a05623.html">_Hash_node_value_base</a> : <a class="code" href="a05619.html">_Hash_node_base</a></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">typedef</span> _Value value_type;</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>  __gnu_cxx::__aligned_buffer<_Value> _M_storage;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  _Value*</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  _M_valptr() noexcept</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  { <span class="keywordflow">return</span> _M_storage._M_ptr(); }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> _Value*</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  _M_valptr() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  { <span class="keywordflow">return</span> _M_storage._M_ptr(); }</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>  _Value&</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  _M_v() noexcept</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  { <span class="keywordflow">return</span> *_M_valptr(); }</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> _Value&</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  _M_v() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  { <span class="keywordflow">return</span> *_M_valptr(); }</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  };</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"></span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> /**</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> * Primary template struct _Hash_node.</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> */</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> _Cache_hash_code></div><div class="line"><a name="l00257"></a><span class="lineno"><a class="line" href="a05627.html"> 257</a></span>  <span class="keyword">struct </span><a class="code" href="a05627.html">_Hash_node</a>;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"></span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> /**</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * Specialization for nodes with caches, struct _Hash_node.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> *</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * Base class is __detail::_Hash_node_value_base.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> */</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value></div><div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="a05631.html"> 265</a></span>  <span class="keyword">struct </span><a class="code" href="a05627.html">_Hash_node</a><_Value, true> : <a class="code" href="a05623.html">_Hash_node_value_base</a><_Value></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  {</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  std::size_t _M_hash_code;</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>  <a class="code" href="a05627.html">_Hash_node</a>*</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  _M_next() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  { <span class="keywordflow">return</span> static_cast<_Hash_node*>(this->_M_nxt); }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  };</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"></span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> /**</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> * Specialization for nodes without caches, struct _Hash_node.</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> *</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"> * Base class is __detail::_Hash_node_value_base.</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> */</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value></div><div class="line"><a name="l00280"></a><span class="lineno"><a class="line" href="a05635.html"> 280</a></span>  <span class="keyword">struct </span><a class="code" href="a05627.html">_Hash_node</a><_Value, false> : <a class="code" href="a05623.html">_Hash_node_value_base</a><_Value></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>  <a class="code" href="a05627.html">_Hash_node</a>*</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  _M_next() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  { <span class="keywordflow">return</span> static_cast<_Hash_node*>(this->_M_nxt); }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  };</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"></span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> /// Base class for node iterators.</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> _Cache_hash_code></div><div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="a05639.html"> 289</a></span>  <span class="keyword">struct </span><a class="code" href="a05639.html">_Node_iterator_base</a></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  {</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">using</span> <a class="code" href="a05627.html">__node_type</a> = <a class="code" href="a05627.html">_Hash_node<_Value, _Cache_hash_code></a>;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="a05627.html">__node_type</a>* _M_cur;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> </div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <a class="code" href="a05639.html">_Node_iterator_base</a>(<a class="code" href="a05627.html">__node_type</a>* __p) noexcept</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  : _M_cur(__p) { }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  _M_incr() noexcept</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  { _M_cur = _M_cur->_M_next(); }</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  };</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> _Cache_hash_code></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  operator==(<span class="keyword">const</span> <a class="code" href="a05639.html">_Node_iterator_base<_Value, _Cache_hash_code></a>& __x,</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> <a class="code" href="a05639.html">_Node_iterator_base<_Value, _Cache_hash_code ></a>& __y)</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  noexcept</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  { <span class="keywordflow">return</span> __x._M_cur == __y._M_cur; }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> _Cache_hash_code></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  operator!=(<span class="keyword">const</span> _Node_iterator_base<_Value, _Cache_hash_code>& __x,</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">const</span> _Node_iterator_base<_Value, _Cache_hash_code>& __y)</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  noexcept</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  { <span class="keywordflow">return</span> __x._M_cur != __y._M_cur; }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"></span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> /// Node iterators, used to iterate through all the hashtable.</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache></div><div class="line"><a name="l00319"></a><span class="lineno"><a class="line" href="a05643.html"> 319</a></span>  <span class="keyword">struct </span><a class="code" href="a05643.html">_Node_iterator</a></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  : <span class="keyword">public</span> <a class="code" href="a05639.html">_Node_iterator_base</a><_Value, __cache></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  {</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">using</span> <a class="code" href="a05639.html">__base_type</a> = <a class="code" href="a05639.html">_Node_iterator_base<_Value, __cache></a>;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> <a class="code" href="a05627.html">__base_type::__node_type</a>;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">typedef</span> _Value value_type;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">typedef</span> std::ptrdiff_t difference_type;</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">typedef</span> <a class="code" href="a07663.html">std::forward_iterator_tag</a> <a class="code" href="a07663.html">iterator_category</a>;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> </div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">using</span> pointer = <span class="keyword">typename</span> <a class="code" href="a03047.html">std::conditional</a><__constant_iterators,</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keyword">const</span> _Value*, _Value*>::type;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">using</span> reference = <span class="keyword">typename</span> <a class="code" href="a03047.html">std::conditional</a><__constant_iterators,</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">const</span> _Value&, _Value&>::type;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <a class="code" href="a05643.html">_Node_iterator</a>() noexcept</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  : <a class="code" href="a05639.html">__base_type</a>(0) { }</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> </div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <a class="code" href="a05643.html">_Node_iterator</a>(__node_type* __p) noexcept</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  : <a class="code" href="a05639.html">__base_type</a>(__p) { }</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>  reference</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  operator*() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  { <span class="keywordflow">return</span> this->_M_cur->_M_v(); }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  pointer</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  operator->() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  { <span class="keywordflow">return</span> this->_M_cur->_M_valptr(); }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <a class="code" href="a05643.html">_Node_iterator</a>&</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  operator++() noexcept</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  this->_M_incr();</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <a class="code" href="a05643.html">_Node_iterator</a></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  operator++(<span class="keywordtype">int</span>) noexcept</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <a class="code" href="a05643.html">_Node_iterator</a> __tmp(*<span class="keyword">this</span>);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  this->_M_incr();</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  };</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"></span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"> /// Node const_iterators, used to iterate through all the hashtable.</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache></div><div class="line"><a name="l00370"></a><span class="lineno"><a class="line" href="a05647.html"> 370</a></span>  <span class="keyword">struct </span><a class="code" href="a05647.html">_Node_const_iterator</a></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  : <span class="keyword">public</span> <a class="code" href="a05639.html">_Node_iterator_base</a><_Value, __cache></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  {</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">using</span> <a class="code" href="a05639.html">__base_type</a> = <a class="code" href="a05639.html">_Node_iterator_base<_Value, __cache></a>;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> <a class="code" href="a05627.html">__base_type::__node_type</a>;</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>  <span class="keyword">public</span>:</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">typedef</span> _Value value_type;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">typedef</span> std::ptrdiff_t difference_type;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">typedef</span> <a class="code" href="a07663.html">std::forward_iterator_tag</a> <a class="code" href="a07663.html">iterator_category</a>;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Value* pointer;</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Value& reference;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="a05647.html">_Node_const_iterator</a>() noexcept</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  : <a class="code" href="a05639.html">__base_type</a>(0) { }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="a05647.html">_Node_const_iterator</a>(__node_type* __p) noexcept</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  : <a class="code" href="a05639.html">__base_type</a>(__p) { }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="a05647.html">_Node_const_iterator</a>(<span class="keyword">const</span> <a class="code" href="a05643.html">_Node_iterator</a><_Value, __constant_iterators,</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  __cache>& __x) noexcept</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  : <a class="code" href="a05639.html">__base_type</a>(__x._M_cur) { }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  reference</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  operator*() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  { <span class="keywordflow">return</span> this->_M_cur->_M_v(); }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  pointer</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  operator->() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  { <span class="keywordflow">return</span> this->_M_cur->_M_valptr(); }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <a class="code" href="a05647.html">_Node_const_iterator</a>&</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  operator++() noexcept</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  this->_M_incr();</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> </div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <a class="code" href="a05647.html">_Node_const_iterator</a></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  operator++(<span class="keywordtype">int</span>) noexcept</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  {</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="a05647.html">_Node_const_iterator</a> __tmp(*<span class="keyword">this</span>);</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  this->_M_incr();</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> __tmp;</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>  };</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// Many of class template _Hashtable's template parameters are policy</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="comment">// classes. These are defaults for the policies.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"></span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"> /// Default range hashing function: use division to fold a large number</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"> /// into the range [0, N).</span></div><div class="line"><a name="l00425"></a><span class="lineno"><a class="line" href="a05651.html"> 425</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a05651.html">_Mod_range_hashing</a></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keyword">typedef</span> std::size_t first_argument_type;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">typedef</span> std::size_t second_argument_type;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keyword">typedef</span> std::size_t result_type;</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>  result_type</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  operator()(first_argument_type __num,</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  second_argument_type __den) <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  { <span class="keywordflow">return</span> __num % __den; }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  };</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"></span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> /// Default ranged hash function H. In principle it should be a</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> /// function object composed from objects of type H1 and H2 such that</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> /// h(k, N) = h2(h1(k), N), but that would mean making extra copies of</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> /// h1 and h2. So instead we'll just use a tag to tell class template</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> /// hashtable to do that composition.</span></div><div class="line"><a name="l00442"></a><span class="lineno"><a class="line" href="a05655.html"> 442</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a05655.html">_Default_ranged_hash</a> { };</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"></span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> /// Default value for rehash policy. Bucket size is (usually) the</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> /// smallest prime that keeps the load factor small enough.</span></div><div class="line"><a name="l00446"></a><span class="lineno"><a class="line" href="a05659.html"> 446</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a05659.html">_Prime_rehash_policy</a></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  {</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">using</span> <a class="code" href="a03043.html">__has_load_factor</a> = <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a>;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <a class="code" href="a05659.html">_Prime_rehash_policy</a>(<span class="keywordtype">float</span> __z = 1.0) noexcept</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  : _M_max_load_factor(__z), _M_next_resize(0) { }</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> </div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordtype">float</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  max_load_factor() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  { <span class="keywordflow">return</span> _M_max_load_factor; }</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> </div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// Return a bucket size no smaller than n.</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  std::size_t</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  _M_next_bkt(std::size_t __n) <span class="keyword">const</span>;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">// Return a bucket count appropriate for n elements</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  std::size_t</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  _M_bkt_for_elements(std::size_t __n)<span class="keyword"> const</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> __builtin_ceil(__n / (<span class="keywordtype">long</span> <span class="keywordtype">double</span>)_M_max_load_factor); }</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// __n_bkt is current bucket count, __n_elt is current element count,</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// and __n_ins is number of elements to be inserted. Do we need to</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// increase bucket count? If so, return make_pair(true, n), where n</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// is the new bucket count. If not, return make_pair(false, 0).</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="a07767.html">std::pair<bool, std::size_t></a></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  std::size_t __n_ins) <span class="keyword">const</span>;</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">typedef</span> std::size_t _State;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  _State</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  _M_state()<span class="keyword"> const</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_next_resize; }</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  _M_reset() noexcept</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  { _M_next_resize = 0; }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  _M_reset(_State __state)</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  { _M_next_resize = __state; }</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>  <span class="keyword">static</span> <span class="keyword">const</span> std::size_t _S_growth_factor = 2;</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordtype">float</span> _M_max_load_factor;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keyword">mutable</span> std::size_t _M_next_resize;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  };</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"></span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"> /// Range hashing function assuming that second arg is a power of 2.</span></div><div class="line"><a name="l00495"></a><span class="lineno"><a class="line" href="a05663.html"> 495</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a05663.html">_Mask_range_hashing</a></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">typedef</span> std::size_t first_argument_type;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">typedef</span> std::size_t second_argument_type;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">typedef</span> std::size_t result_type;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  result_type</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  operator()(first_argument_type __num,</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  second_argument_type __den) <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  { <span class="keywordflow">return</span> __num & (__den - 1); }</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> <span class="comment"></span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment"> /// Compute closest power of 2.</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"></span> _GLIBCXX14_CONSTEXPR</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">inline</span> std::size_t</div><div class="line"><a name="l00510"></a><span class="lineno"><a class="line" href="a01491.html#ga467c90cac9f40425bac6a54f9a54ad9e"> 510</a></span>  <a class="code" href="a01491.html#ga467c90cac9f40425bac6a54f9a54ad9e">__clp2</a>(std::size_t __n) noexcept</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  {</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="preprocessor">#if __SIZEOF_SIZE_T__ >= 8</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  std::uint_fast64_t __x = __n;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  std::uint_fast32_t __x = __n;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">// Algorithm from Hacker's Delight, Figure 3-3.</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  __x = __x - 1;</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  __x = __x | (__x >> 1);</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  __x = __x | (__x >> 2);</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  __x = __x | (__x >> 4);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  __x = __x | (__x >> 8);</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  __x = __x | (__x >>16);</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="preprocessor">#if __SIZEOF_SIZE_T__ >= 8</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  __x = __x | (__x >>32);</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">return</span> __x + 1;</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"></span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> /// Rehash policy providing power of 2 bucket numbers. Avoids modulo</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> /// operations.</span></div><div class="line"><a name="l00532"></a><span class="lineno"><a class="line" href="a05667.html"> 532</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a05667.html">_Power2_rehash_policy</a></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  {</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keyword">using</span> <a class="code" href="a03043.html">__has_load_factor</a> = <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a>;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <a class="code" href="a05667.html">_Power2_rehash_policy</a>(<span class="keywordtype">float</span> __z = 1.0) noexcept</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  : _M_max_load_factor(__z), _M_next_resize(0) { }</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> </div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordtype">float</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  max_load_factor() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  { <span class="keywordflow">return</span> _M_max_load_factor; }</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> </div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// Return a bucket size no smaller than n (as long as n is not above the</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// highest power of 2).</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  std::size_t</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  _M_next_bkt(std::size_t __n) noexcept</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  {</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __max_width = std::min<size_t>(<span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>), 8);</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __max_bkt = size_t(1) << (__max_width * __CHAR_BIT__ - 1);</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  std::size_t __res = <a class="code" href="a01491.html#ga467c90cac9f40425bac6a54f9a54ad9e">__clp2</a>(__n);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">if</span> (__res == __n)</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  __res <<= 1;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> </div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">if</span> (__res == 0)</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  __res = __max_bkt;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">if</span> (__res == __max_bkt)</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// Set next resize to the max value so that we never try to rehash again</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// as we already reach the biggest possible bucket number.</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// Note that it might result in max_load_factor not being respected.</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  _M_next_resize = std::size_t(-1);</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  _M_next_resize</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  = __builtin_ceil(__res * (<span class="keywordtype">long</span> <span class="keywordtype">double</span>)_M_max_load_factor);</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">return</span> __res;</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  }</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> </div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// Return a bucket count appropriate for n elements</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  std::size_t</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  _M_bkt_for_elements(std::size_t __n) <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  { <span class="keywordflow">return</span> __builtin_ceil(__n / (<span class="keywordtype">long</span> <span class="keywordtype">double</span>)_M_max_load_factor); }</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// __n_bkt is current bucket count, __n_elt is current element count,</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// and __n_ins is number of elements to be inserted. Do we need to</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// increase bucket count? If so, return make_pair(true, n), where n</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// is the new bucket count. If not, return make_pair(false, 0).</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <a class="code" href="a07767.html">std::pair<bool, std::size_t></a></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  std::size_t __n_ins) noexcept</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  {</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (__n_elt + __n_ins >= _M_next_resize)</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordtype">long</span> <span class="keywordtype">double</span> __min_bkts = (__n_elt + __n_ins)</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  / (<span class="keywordtype">long</span> <span class="keywordtype">double</span>)_M_max_load_factor;</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">if</span> (__min_bkts >= __n_bkt)</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(<span class="keyword">true</span>,</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  _M_next_bkt(std::max<std::size_t>(__builtin_floor(__min_bkts) + 1,</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  __n_bkt * _S_growth_factor)));</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  _M_next_resize</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  = __builtin_floor(__n_bkt * (<span class="keywordtype">long</span> <span class="keywordtype">double</span>)_M_max_load_factor);</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(<span class="keyword">false</span>, 0);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  }</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(<span class="keyword">false</span>, 0);</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> </div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">typedef</span> std::size_t _State;</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  _State</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  _M_state() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  { <span class="keywordflow">return</span> _M_next_resize; }</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  _M_reset() noexcept</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  { _M_next_resize = 0; }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  _M_reset(_State __state) noexcept</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  { _M_next_resize = __state; }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> </div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::size_t _S_growth_factor = 2;</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> </div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordtype">float</span> _M_max_load_factor;</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  std::size_t _M_next_resize;</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  };</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> </div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// Base classes for std::_Hashtable. We define these base classes</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// because in some cases we want to do different things depending on</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// the value of a policy class. In some cases the policy class</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// affects which member functions and nested typedefs are defined;</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// we handle that by specializing base class templates. Several of</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="comment">// the base class templates need to access other members of class</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// template _Hashtable, so we use a variant of the "Curiously</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// Recurring Template Pattern" (CRTP) technique.</span></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="comment"></span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="comment"> /**</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment"> * Primary class template _Map_base.</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment"> *</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment"> * If the hashtable has a value type of the form pair<T1, T2> and a</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment"> * key extraction policy (_ExtractKey) that returns the first part</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment"> * of the pair, the hashtable gets a mapped_type typedef. If it</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"> * satisfies those criteria and also has unique keys, then it also</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="comment"> * gets an operator[].</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="comment"> */</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits,</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordtype">bool</span> _Unique_keys = _Traits::__unique_keys::value></div><div class="line"><a name="l00643"></a><span class="lineno"><a class="line" href="a05671.html"> 643</a></span>  <span class="keyword">struct </span><a class="code" href="a05671.html">_Map_base</a> { };</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"></span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> /// Partial specialization, __unique_keys set to false.</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00649"></a><span class="lineno"><a class="line" href="a05675.html"> 649</a></span>  <span class="keyword">struct </span><a class="code" href="a05671.html">_Map_base</a><_Key, _Pair, _Alloc, _Select1st, _Equal,</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, false></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  {</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">using</span> mapped_type = <span class="keyword">typename</span> <a class="code" href="a01707.html">std::tuple_element<1, _Pair>::type</a>;</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  };</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="comment"></span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> /// Partial specialization, __unique_keys set to true.</span></div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00659"></a><span class="lineno"><a class="line" href="a05679.html"> 659</a></span>  <span class="keyword">struct </span><a class="code" href="a05671.html">_Map_base</a><_Key, _Pair, _Alloc, _Select1st, _Equal,</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, true></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  {</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keyword">using</span> <a class="code" href="a05591.html">__hashtable_base</a> = <a class="code" href="a05591.html">__detail::_Hashtable_base</a><_Key, _Pair,</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  _Select1st,</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  _Traits>;</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> </div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Key, _Pair, _Alloc,</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  _Select1st, _Equal,</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits>;</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keyword">using</span> __hash_code = <span class="keyword">typename</span> __hashtable_base::__hash_code;</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> __hashtable_base::__node_type;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> </div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keyword">using</span> key_type = <span class="keyword">typename</span> __hashtable_base::key_type;</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keyword">using</span> iterator = <span class="keyword">typename</span> <a class="code" href="a05643.html">__hashtable_base::iterator</a>;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keyword">using</span> mapped_type = <span class="keyword">typename</span> <a class="code" href="a01707.html">std::tuple_element<1, _Pair>::type</a>;</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> </div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  mapped_type&</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  operator[](<span class="keyword">const</span> key_type& __k);</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  mapped_type&</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  operator[](key_type&& __k);</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span> </div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="comment">// DR 761. unordered_map needs an at() member function.</span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  mapped_type&</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  at(<span class="keyword">const</span> key_type& __k);</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> </div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">const</span> mapped_type&</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  at(<span class="keyword">const</span> key_type& __k) <span class="keyword">const</span>;</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  };</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> </div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <a class="code" href="a05671.html">_Map_base</a><_Key, _Pair, _Alloc, _Select1st, _Equal,</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, <span class="keyword">true</span>>::</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  operator[](<span class="keyword">const</span> key_type& __k)</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  -> mapped_type&</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  {</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  __hashtable* __h = static_cast<__hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  __hash_code __code = __h->_M_hash_code(__k);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  std::size_t __n = __h->_M_bucket_index(__k, __code);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  __node_type* __p = __h->_M_find_node(__n, __k, __code);</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">if</span> (!__p)</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  {</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  __p = __h->_M_allocate_node(<a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <a class="code" href="a02883.html">std::tuple<const key_type&></a>(__k),</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <a class="code" href="a02883.html">std::tuple<></a>());</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">return</span> __h->_M_insert_unique_node(__n, __code, __p)->second;</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  }</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span> </div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">return</span> __p->_M_v().second;</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> </div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  _Map_base<_Key, _Pair, _Alloc, _Select1st, _Equal,</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, <span class="keyword">true</span>>::</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  operator[](key_type&& __k)</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  -> mapped_type&</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  {</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  __hashtable* __h = static_cast<__hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  __hash_code __code = __h->_M_hash_code(__k);</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  std::size_t __n = __h->_M_bucket_index(__k, __code);</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  __node_type* __p = __h->_M_find_node(__n, __k, __code);</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> </div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keywordflow">if</span> (!__p)</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  {</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  __p = __h->_M_allocate_node(<a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  std::forward_as_tuple(std::move(__k)),</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <a class="code" href="a02883.html">std::tuple<></a>());</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">return</span> __h->_M_insert_unique_node(__n, __code, __p)->second;</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> </div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">return</span> __p->_M_v().second;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> </div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  _Map_base<_Key, _Pair, _Alloc, _Select1st, _Equal,</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, <span class="keyword">true</span>>::</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  at(<span class="keyword">const</span> key_type& __k)</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  -> mapped_type&</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  {</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  __hashtable* __h = static_cast<__hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  __hash_code __code = __h->_M_hash_code(__k);</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  std::size_t __n = __h->_M_bucket_index(__k, __code);</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  __node_type* __p = __h->_M_find_node(__n, __k, __code);</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">if</span> (!__p)</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  __throw_out_of_range(__N(<span class="stringliteral">"_Map_base::at"</span>));</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">return</span> __p->_M_v().second;</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  }</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> </div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  _Map_base<_Key, _Pair, _Alloc, _Select1st, _Equal,</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, <span class="keyword">true</span>>::</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  at(<span class="keyword">const</span> key_type& __k) <span class="keyword">const</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  -> <span class="keyword">const</span> mapped_type&</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  {</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keyword">const</span> __hashtable* __h = static_cast<const __hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  __hash_code __code = __h->_M_hash_code(__k);</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  std::size_t __n = __h->_M_bucket_index(__k, __code);</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  __node_type* __p = __h->_M_find_node(__n, __k, __code);</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (!__p)</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  __throw_out_of_range(__N(<span class="stringliteral">"_Map_base::at"</span>));</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">return</span> __p->_M_v().second;</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="comment"></span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="comment"> /**</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="comment"> * Primary class template _Insert_base.</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="comment"> *</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> <span class="comment"> * Defines @c insert member functions appropriate to all _Hashtables.</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="comment"> */</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00792"></a><span class="lineno"><a class="line" href="a05683.html"> 792</a></span>  <span class="keyword">struct </span><a class="code" href="a05683.html">_Insert_base</a></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  {</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Key, _Value, _Alloc, _ExtractKey,</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  _RehashPolicy, _Traits>;</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> </div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keyword">using</span> <a class="code" href="a05591.html">__hashtable_base</a> = <a class="code" href="a05591.html">_Hashtable_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  _Traits>;</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> </div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">using</span> value_type = <span class="keyword">typename</span> __hashtable_base::value_type;</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keyword">using</span> iterator = <span class="keyword">typename</span> <a class="code" href="a05643.html">__hashtable_base::iterator</a>;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keyword">using</span> const_iterator = <span class="keyword">typename</span> <a class="code" href="a05647.html">__hashtable_base::const_iterator</a>;</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keyword">using</span> size_type = <span class="keyword">typename</span> __hashtable_base::size_type;</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">using</span> __unique_keys = <span class="keyword">typename</span> __hashtable_base::__unique_keys;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">using</span> __ireturn_type = <span class="keyword">typename</span> __hashtable_base::__ireturn_type;</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keyword">using</span> <a class="code" href="a05627.html">__node_type</a> = <a class="code" href="a05627.html">_Hash_node<_Value, _Traits::__hash_cached::value></a>;</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">using</span> __node_alloc_type = __alloc_rebind<_Alloc, __node_type>;</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keyword">using</span> __node_gen_type = _AllocNode<__node_alloc_type>;</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> </div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <a class="code" href="a05583.html">__hashtable</a>&</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  _M_conjure_hashtable()</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  { <span class="keywordflow">return</span> *(static_cast<__hashtable*>(<span class="keyword">this</span>)); }</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> </div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _NodeGetter></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  _M_insert_range(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keyword">const</span> _NodeGetter&, <a class="code" href="a03043.html">true_type</a>);</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> </div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _NodeGetter></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  _M_insert_range(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keyword">const</span> _NodeGetter&, <a class="code" href="a03043.html">false_type</a>);</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> </div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  __ireturn_type</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  insert(<span class="keyword">const</span> value_type& __v)</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  {</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = _M_conjure_hashtable();</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  __node_gen_type __node_gen(__h);</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">return</span> __h._M_insert(__v, __node_gen, __unique_keys());</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  }</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> </div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  iterator</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  insert(const_iterator __hint, <span class="keyword">const</span> value_type& __v)</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  {</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = _M_conjure_hashtable();</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  __node_gen_type __node_gen(__h); </div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">return</span> __h._M_insert(__hint, __v, __node_gen, __unique_keys());</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  }</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> </div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  insert(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  { this->insert(__l.begin(), __l.end()); }</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  insert(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  {</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = _M_conjure_hashtable();</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  __node_gen_type __node_gen(__h);</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keywordflow">return</span> _M_insert_range(__first, __last, __node_gen, __unique_keys());</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  }</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  };</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span> </div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _NodeGetter></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <a class="code" href="a05683.html">_Insert_base</a><_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  _RehashPolicy, _Traits>::</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  _M_insert_range(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keyword">const</span> _NodeGetter& __node_gen, <a class="code" href="a03043.html">true_type</a>)</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  {</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  size_type __n_elt = __detail::__distance_fw(__first, __last);</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">if</span> (__n_elt == 0)</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> </div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  __hashtable& __h = _M_conjure_hashtable();</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  {</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span> (__h._M_insert(*__first, __node_gen, __unique_keys(),</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  __n_elt).second)</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  __n_elt = 1;</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__n_elt != 1)</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  --__n_elt;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> </div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _NodeGetter></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  _Insert_base<_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  _RehashPolicy, _Traits>::</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  _M_insert_range(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">const</span> _NodeGetter& __node_gen, <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  {</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keyword">using</span> __rehash_type = <span class="keyword">typename</span> __hashtable::__rehash_type;</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">using</span> __rehash_state = <span class="keyword">typename</span> __hashtable::__rehash_state;</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keyword">using</span> pair_type = <a class="code" href="a07767.html">std::pair<bool, std::size_t></a>;</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> </div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  size_type __n_elt = __detail::__distance_fw(__first, __last);</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordflow">if</span> (__n_elt == 0)</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  __hashtable& __h = _M_conjure_hashtable();</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  __rehash_type& __rehash = __h._M_rehash_policy;</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keyword">const</span> __rehash_state& __saved_state = __rehash._M_state();</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  pair_type __do_rehash = __rehash._M_need_rehash(__h._M_bucket_count,</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  __h._M_element_count,</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  __n_elt);</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> </div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keywordflow">if</span> (__do_rehash.first)</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  __h._M_rehash(__do_rehash.second, __saved_state);</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> </div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  __h._M_insert(*__first, __node_gen, __unique_keys());</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span> <span class="comment"></span></div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> <span class="comment"> /**</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> <span class="comment"> * Primary class template _Insert.</span></div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span> <span class="comment"> *</span></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span> <span class="comment"> * Defines @c insert member functions that depend on _Hashtable policies,</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span> <span class="comment"> * via partial specializations.</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> <span class="comment"> */</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits,</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keywordtype">bool</span> _Constant_iterators = _Traits::__constant_iterators::value></div><div class="line"><a name="l00929"></a><span class="lineno"><a class="line" href="a05687.html"> 929</a></span>  <span class="keyword">struct </span><a class="code" href="a05687.html">_Insert</a>;</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment"></span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment"> /// Specialization.</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00936"></a><span class="lineno"><a class="line" href="a05691.html"> 936</a></span>  <span class="keyword">struct </span><a class="code" href="a05687.html">_Insert</a><_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  _RehashPolicy, _Traits, true></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  : <span class="keyword">public</span> <a class="code" href="a05683.html">_Insert_base</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  {</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keyword">using</span> <a class="code" href="a05683.html">__base_type</a> = <a class="code" href="a05683.html">_Insert_base</a><_Key, _Value, _Alloc, _ExtractKey,</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  _RehashPolicy, _Traits>;</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">using</span> <a class="code" href="a05591.html">__hashtable_base</a> = <a class="code" href="a05591.html">_Hashtable_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  _Traits>;</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> </div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">using</span> value_type = <span class="keyword">typename</span> __base_type::value_type;</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keyword">using</span> iterator = <span class="keyword">typename</span> __base_type::iterator;</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keyword">using</span> const_iterator = <span class="keyword">typename</span> __base_type::const_iterator;</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> </div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keyword">using</span> __unique_keys = <span class="keyword">typename</span> __base_type::__unique_keys;</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keyword">using</span> __ireturn_type = <span class="keyword">typename</span> __hashtable_base::__ireturn_type;</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <span class="keyword">typename</span> <a class="code" href="a05583.html">__base_type::__hashtable</a>;</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keyword">using</span> __node_gen_type = <span class="keyword">typename</span> __base_type::__node_gen_type;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> </div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keyword">using</span> __base_type::insert;</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> </div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  __ireturn_type</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  insert(value_type&& __v)</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  {</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = this->_M_conjure_hashtable();</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  __node_gen_type __node_gen(__h);</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordflow">return</span> __h._M_insert(std::move(__v), __node_gen, __unique_keys());</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  }</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> </div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  iterator</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  insert(const_iterator __hint, value_type&& __v)</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  {</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = this->_M_conjure_hashtable();</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  __node_gen_type __node_gen(__h);</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">return</span> __h._M_insert(__hint, std::move(__v), __node_gen,</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  __unique_keys());</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  }</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  };</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"></span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> /// Specialization.</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00983"></a><span class="lineno"><a class="line" href="a05695.html"> 983</a></span>  <span class="keyword">struct </span><a class="code" href="a05687.html">_Insert</a><_Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  _RehashPolicy, _Traits, false></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  : <span class="keyword">public</span> <a class="code" href="a05683.html">_Insert_base</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  {</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keyword">using</span> <a class="code" href="a05683.html">__base_type</a> = <a class="code" href="a05683.html">_Insert_base</a><_Key, _Value, _Alloc, _ExtractKey,</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  _RehashPolicy, _Traits>;</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keyword">using</span> value_type = <span class="keyword">typename</span> __base_type::value_type;</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keyword">using</span> iterator = <span class="keyword">typename</span> __base_type::iterator;</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keyword">using</span> const_iterator = <span class="keyword">typename</span> __base_type::const_iterator;</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> </div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keyword">using</span> __unique_keys = <span class="keyword">typename</span> __base_type::__unique_keys;</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <span class="keyword">typename</span> <a class="code" href="a05583.html">__base_type::__hashtable</a>;</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keyword">using</span> __ireturn_type = <span class="keyword">typename</span> __base_type::__ireturn_type;</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span> </div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keyword">using</span> __base_type::insert;</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> </div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keyword">using</span> <a class="code" href="a03575.html">__is_cons</a> = <a class="code" href="a03575.html">std::is_constructible<value_type, _Pair&&></a>;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> </div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keyword">using</span> <a class="code" href="a04191.html">_IFcons</a> = <a class="code" href="a04191.html">std::enable_if<__is_cons<_Pair>::value</a>>;</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> </div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keyword">using</span> _IFconsp = <span class="keyword">typename</span> <a class="code" href="a04191.html">_IFcons<_Pair>::type</a>;</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> </div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> = _IFconsp<_Pair>></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  __ireturn_type</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  insert(_Pair&& __v)</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  {</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = this->_M_conjure_hashtable();</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">return</span> __h._M_emplace(__unique_keys(), std::forward<_Pair>(__v));</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  }</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> = _IFconsp<_Pair>></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  iterator</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  insert(const_iterator __hint, _Pair&& __v)</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  {</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <a class="code" href="a05583.html">__hashtable</a>& __h = this->_M_conjure_hashtable();</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">return</span> __h._M_emplace(__hint, __unique_keys(),</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  std::forward<_Pair>(__v));</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  }</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  };</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> </div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Policy></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keyword">using</span> __has_load_factor = <span class="keyword">typename</span> _Policy::__has_load_factor;</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="comment"></span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="comment"> /**</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="comment"> * Primary class template _Rehash_base.</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="comment"> *</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> <span class="comment"> * Give hashtable the max_load_factor functions and reserve iff the</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="comment"> * rehash policy supports it.</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="comment"> */</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits,</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keyword">typename</span> =</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  __detected_or_t<std::false_type, __has_load_factor, _RehashPolicy>></div><div class="line"><a name="l01043"></a><span class="lineno"><a class="line" href="a05699.html"> 1043</a></span>  <span class="keyword">struct </span><a class="code" href="a05699.html">_Rehash_base</a>;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span> <span class="comment"></span></div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> <span class="comment"> /// Specialization when rehash policy doesn't provide load factor management.</span></div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01050"></a><span class="lineno"><a class="line" href="a05703.html"> 1050</a></span>  <span class="keyword">struct </span><a class="code" href="a05699.html">_Rehash_base</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits,</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <a class="code" href="a01541.html">std</a>::<a class="code" href="a03043.html">false_type</a>></div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  {</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  };</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> <span class="comment"></span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> <span class="comment"> /// Specialization when rehash policy provide load factor management.</span></div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01061"></a><span class="lineno"><a class="line" href="a05707.html"> 1061</a></span>  <span class="keyword">struct </span><a class="code" href="a05699.html">_Rehash_base</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits,</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <a class="code" href="a01541.html">std</a>::<a class="code" href="a03043.html">true_type</a>></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  {</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Key, _Value, _Alloc, _ExtractKey,</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  _Equal, _H1, _H2, _Hash,</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  _RehashPolicy, _Traits>;</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> </div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordtype">float</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  max_load_factor() <span class="keyword">const</span> noexcept</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  {</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keyword">const</span> <a class="code" href="a05583.html">__hashtable</a>* __this = static_cast<const __hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">return</span> __this->__rehash_policy().max_load_factor();</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> </div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  max_load_factor(<span class="keywordtype">float</span> __z)</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  {</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <a class="code" href="a05583.html">__hashtable</a>* __this = static_cast<__hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  __this->__rehash_policy(_RehashPolicy(__z));</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  }</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> </div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  reserve(std::size_t __n)</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  {</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <a class="code" href="a05583.html">__hashtable</a>* __this = static_cast<__hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  __this->rehash(__builtin_ceil(__n / max_load_factor()));</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  }</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  };</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="comment"></span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="comment"> /**</span></div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="comment"> * Primary class template _Hashtable_ebo_helper.</span></div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> <span class="comment"> *</span></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <span class="comment"> * Helper class using EBO when it is not forbidden (the type is not</span></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span> <span class="comment"> * final) and when it is worth it (the type is empty.)</span></div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span> <span class="comment"> */</span></div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keyword">template</span><<span class="keywordtype">int</span> _Nm, <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keywordtype">bool</span> __use_ebo = !__is_final(_Tp) && __is_empty(_Tp)></div><div class="line"><a name="l01099"></a><span class="lineno"><a class="line" href="a05711.html"> 1099</a></span>  <span class="keyword">struct </span><a class="code" href="a05711.html">_Hashtable_ebo_helper</a>;</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span> <span class="comment"></span></div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span> <span class="comment"> /// Specialization using EBO.</span></div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keywordtype">int</span> _Nm, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01103"></a><span class="lineno"><a class="line" href="a05715.html"> 1103</a></span>  <span class="keyword">struct </span><a class="code" href="a05711.html">_Hashtable_ebo_helper</a><_Nm, _Tp, true></div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  : <span class="keyword">private</span> _Tp</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  {</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <a class="code" href="a05711.html">_Hashtable_ebo_helper</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> </div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _OtherTp></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <a class="code" href="a05711.html">_Hashtable_ebo_helper</a>(_OtherTp&& __tp)</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  : _Tp(std::forward<_OtherTp>(__tp))</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  { }</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> </div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keyword">static</span> <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  _S_cget(<span class="keyword">const</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a>& __eboh)</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  { <span class="keywordflow">return</span> static_cast<const _Tp&>(__eboh); }</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> </div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keyword">static</span> _Tp&</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  _S_get(<a class="code" href="a05711.html">_Hashtable_ebo_helper</a>& __eboh)</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  { <span class="keywordflow">return</span> static_cast<_Tp&>(__eboh); }</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  };</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span> <span class="comment"></span></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> <span class="comment"> /// Specialization not using EBO.</span></div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keywordtype">int</span> _Nm, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01124"></a><span class="lineno"><a class="line" href="a05719.html"> 1124</a></span>  <span class="keyword">struct </span><a class="code" href="a05711.html">_Hashtable_ebo_helper</a><_Nm, _Tp, false></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  {</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <a class="code" href="a05711.html">_Hashtable_ebo_helper</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> </div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _OtherTp></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <a class="code" href="a05711.html">_Hashtable_ebo_helper</a>(_OtherTp&& __tp)</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  : _M_tp(std::forward<_OtherTp>(__tp))</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  { }</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> </div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keyword">static</span> <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  _S_cget(<span class="keyword">const</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a>& __eboh)</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  { <span class="keywordflow">return</span> __eboh._M_tp; }</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> </div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keyword">static</span> _Tp&</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  _S_get(<a class="code" href="a05711.html">_Hashtable_ebo_helper</a>& __eboh)</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  { <span class="keywordflow">return</span> __eboh._M_tp; }</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span> </div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  _Tp _M_tp;</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  };</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> <span class="comment"></span></div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> <span class="comment"> /**</span></div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="comment"> * Primary class template _Local_iterator_base.</span></div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="comment"> *</span></div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="comment"> * Base class for local iterators, used to iterate within a bucket</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> <span class="comment"> * but not between buckets.</span></div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span> <span class="comment"> */</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordtype">bool</span> __cache_hash_code></div><div class="line"><a name="l01154"></a><span class="lineno"><a class="line" href="a05723.html"> 1154</a></span>  <span class="keyword">struct </span><a class="code" href="a05723.html">_Local_iterator_base</a>;</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="comment"></span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="comment"> /**</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> <span class="comment"> * Primary class template _Hash_code_base.</span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="comment"> *</span></div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="comment"> * Encapsulates two policy issues that aren't quite orthogonal.</span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> <span class="comment"> * (1) the difference between using a ranged hash function and using</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> <span class="comment"> * the combination of a hash function and a range-hashing function.</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> <span class="comment"> * In the former case we don't have such things as hash codes, so</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> <span class="comment"> * we have a dummy type as placeholder.</span></div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="comment"> * (2) Whether or not we cache hash codes. Caching hash codes is</span></div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="comment"> * meaningless if we have a ranged hash function.</span></div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> <span class="comment"> *</span></div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> <span class="comment"> * We also put the key extraction objects here, for convenience.</span></div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> <span class="comment"> * Each specialization derives from one or more of the template</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span> <span class="comment"> * parameters to benefit from Ebo. This is important as this type</span></div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> <span class="comment"> * is inherited in some cases by the _Local_iterator_base type used</span></div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> <span class="comment"> * to implement local_iterator and const_local_iterator. As with</span></div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="comment"> * any iterator type we prefer to make it as small as possible.</span></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> <span class="comment"> *</span></div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> <span class="comment"> * Primary template is unused except as a hook for specializations.</span></div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> <span class="comment"> */</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="keywordtype">bool</span> __cache_hash_code></div><div class="line"><a name="l01179"></a><span class="lineno"><a class="line" href="a05727.html"> 1179</a></span>  <span class="keyword">struct </span><a class="code" href="a05727.html">_Hash_code_base</a>;</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> <span class="comment"></span></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> <span class="comment"> /// Specialization: ranged hash function, no caching hash codes. H1</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> <span class="comment"> /// and H2 are provided but ignored. We define a dummy hash code type.</span></div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash></div><div class="line"><a name="l01185"></a><span class="lineno"><a class="line" href="a05731.html"> 1185</a></span>  <span class="keyword">struct </span><a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey, _H1, _H2, _Hash, false></div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  : <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><0, _ExtractKey>,</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><1, _Hash></div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  {</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_extract_key</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<0, _ExtractKey></a>;</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_hash</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<1, _Hash></a>;</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span> </div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keyword">typedef</span> <span class="keywordtype">void</span>* __hash_code;</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keyword">typedef</span> <a class="code" href="a05635.html">_Hash_node<_Value, false></a> <a class="code" href="a05635.html">__node_type</a>;</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> </div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="comment">// We need the default constructor for the local iterators and _Hashtable</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="comment">// default constructor.</span></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <a class="code" href="a05727.html">_Hash_code_base</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span> </div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <a class="code" href="a05727.html">_Hash_code_base</a>(<span class="keyword">const</span> _ExtractKey& __ex, <span class="keyword">const</span> _H1&, <span class="keyword">const</span> _H2&,</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keyword">const</span> _Hash& __h)</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  : <a class="code" href="a05711.html">__ebo_extract_key</a>(__ex), <a class="code" href="a05711.html">__ebo_hash</a>(__h) { }</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> </div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  __hash_code</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  _M_hash_code(<span class="keyword">const</span> _Key& __key)<span class="keyword"> const</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> 0; }</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> </div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  std::size_t</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  _M_bucket_index(<span class="keyword">const</span> _Key& __k, __hash_code, std::size_t __n)<span class="keyword"> const</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ranged_hash()(__k, __n); }</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> </div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  std::size_t</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  _M_bucket_index(<span class="keyword">const</span> <a class="code" href="a05635.html">__node_type</a>* __p, std::size_t __n) <span class="keyword">const</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  noexcept( noexcept(declval<const _Hash&>()(declval<const _Key&>(),</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  (std::size_t)0)) )</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  { <span class="keywordflow">return</span> _M_ranged_hash()(_M_extract()(__p->_M_v()), __n); }</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> </div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  _M_store_code(<a class="code" href="a05635.html">__node_type</a>*, __hash_code)<span class="keyword"> const</span></div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> <span class="keyword"> </span>{ }</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span> </div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  _M_copy_code(<a class="code" href="a05635.html">__node_type</a>*, <span class="keyword">const</span> <a class="code" href="a05635.html">__node_type</a>*)<span class="keyword"> const</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> <span class="keyword"> </span>{ }</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> </div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  _M_swap(<a class="code" href="a05727.html">_Hash_code_base</a>& __x)</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  {</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  std::swap(_M_extract(), __x._M_extract());</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  std::swap(_M_ranged_hash(), __x._M_ranged_hash());</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  }</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span> </div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="keyword">const</span> _ExtractKey&</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  _M_extract()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_extract_key::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> </div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  _ExtractKey&</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  _M_extract() { <span class="keywordflow">return</span> __ebo_extract_key::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span> </div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="keyword">const</span> _Hash&</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  _M_ranged_hash()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_hash::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> </div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  _Hash&</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  _M_ranged_hash() { <span class="keywordflow">return</span> __ebo_hash::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  };</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span> </div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="comment">// No specialization for ranged hash function while caching hash codes.</span></div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="comment">// That combination is meaningless, and trying to do it is an error.</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"></span></div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> <span class="comment"> /// Specialization: ranged hash function, cache hash codes. This</span></div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> <span class="comment"> /// combination is meaningless, so we provide only a declaration</span></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> <span class="comment"> /// and no definition.</span></div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash></div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="keyword">struct </span><a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey, _H1, _H2, _Hash, true>;</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> <span class="comment"></span></div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> <span class="comment"> /// Specialization: hash function and range-hashing function, no</span></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span> <span class="comment"> /// caching of hash codes.</span></div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> <span class="comment"> /// Provides typedef and accessor required by C++ 11.</span></div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2></div><div class="line"><a name="l01262"></a><span class="lineno"><a class="line" href="a05735.html"> 1262</a></span>  <span class="keyword">struct </span><a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey, _H1, _H2,</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <a class="code" href="a05655.html">_Default_ranged_hash</a>, false></div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  : <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><0, _ExtractKey>,</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><1, _H1>,</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><2, _H2></div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  {</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_extract_key</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<0, _ExtractKey></a>;</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_h1</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<1, _H1></a>;</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_h2</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<2, _H2></a>;</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> </div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="comment">// Gives the local iterator implementation access to _M_bucket_index().</span></div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keyword">friend</span> <span class="keyword">struct </span><a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey, _H1, _H2,</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <a class="code" href="a05655.html">_Default_ranged_hash</a>, false>;</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> </div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keyword">typedef</span> _H1 hasher;</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> </div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  hasher</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  hash_function()<span class="keyword"> const</span></div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h1(); }</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span> </div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keyword">typedef</span> std::size_t __hash_code;</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="keyword">typedef</span> <a class="code" href="a05635.html">_Hash_node<_Value, false></a> <a class="code" href="a05635.html">__node_type</a>;</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> </div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="comment">// We need the default constructor for the local iterators and _Hashtable</span></div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  <span class="comment">// default constructor.</span></div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <a class="code" href="a05727.html">_Hash_code_base</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> </div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <a class="code" href="a05727.html">_Hash_code_base</a>(<span class="keyword">const</span> _ExtractKey& __ex,</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keyword">const</span> _H1& __h1, <span class="keyword">const</span> _H2& __h2,</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keyword">const</span> <a class="code" href="a05655.html">_Default_ranged_hash</a>&)</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  : <a class="code" href="a05711.html">__ebo_extract_key</a>(__ex), <a class="code" href="a05711.html">__ebo_h1</a>(__h1), <a class="code" href="a05711.html">__ebo_h2</a>(__h2) { }</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> </div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  __hash_code</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  _M_hash_code(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  static_assert(__is_invocable<const _H1&, const _Key&>{},</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="stringliteral">"hash function must be invocable with an argument of key type"</span>);</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keywordflow">return</span> _M_h1()(__k);</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  }</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> </div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  std::size_t</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  _M_bucket_index(<span class="keyword">const</span> _Key&, __hash_code __c, std::size_t __n)<span class="keyword"> const</span></div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h2()(__c, __n); }</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span> </div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  std::size_t</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  _M_bucket_index(<span class="keyword">const</span> <a class="code" href="a05635.html">__node_type</a>* __p, std::size_t __n) <span class="keyword">const</span></div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  noexcept( noexcept(declval<const _H1&>()(declval<const _Key&>()))</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  && noexcept(declval<const _H2&>()((__hash_code)0,</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  (std::size_t)0)) )</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  { <span class="keywordflow">return</span> _M_h2()(_M_h1()(_M_extract()(__p->_M_v())), __n); }</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> </div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  _M_store_code(<a class="code" href="a05635.html">__node_type</a>*, __hash_code)<span class="keyword"> const</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="keyword"> </span>{ }</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> </div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  _M_copy_code(<a class="code" href="a05635.html">__node_type</a>*, <span class="keyword">const</span> <a class="code" href="a05635.html">__node_type</a>*)<span class="keyword"> const</span></div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> <span class="keyword"> </span>{ }</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> </div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  _M_swap(<a class="code" href="a05727.html">_Hash_code_base</a>& __x)</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  {</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  std::swap(_M_extract(), __x._M_extract());</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  std::swap(_M_h1(), __x._M_h1());</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  std::swap(_M_h2(), __x._M_h2());</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  }</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> </div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keyword">const</span> _ExtractKey&</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  _M_extract()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_extract_key::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span> </div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  _ExtractKey&</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  _M_extract() { <span class="keywordflow">return</span> __ebo_extract_key::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> </div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keyword">const</span> _H1&</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  _M_h1()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_h1::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> </div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  _H1&</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  _M_h1() { <span class="keywordflow">return</span> __ebo_h1::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span> </div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="keyword">const</span> _H2&</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  _M_h2()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_h2::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> </div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  _H2&</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  _M_h2() { <span class="keywordflow">return</span> __ebo_h2::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  };</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> <span class="comment"></span></div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span> <span class="comment"> /// Specialization: hash function and range-hashing function,</span></div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span> <span class="comment"> /// caching hash codes. H is provided but ignored. Provides</span></div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> <span class="comment"> /// typedef and accessor required by C++ 11.</span></div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2></div><div class="line"><a name="l01356"></a><span class="lineno"><a class="line" href="a05739.html"> 1356</a></span>  <span class="keyword">struct </span><a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey, _H1, _H2,</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <a class="code" href="a05655.html">_Default_ranged_hash</a>, true></div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  : <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><0, _ExtractKey>,</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><1, _H1>,</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><2, _H2></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  {</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="comment">// Gives the local iterator implementation access to _M_h2().</span></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keyword">friend</span> <span class="keyword">struct </span><a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey, _H1, _H2,</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <a class="code" href="a05655.html">_Default_ranged_hash</a>, true>;</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> </div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_extract_key</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<0, _ExtractKey></a>;</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_h1</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<1, _H1></a>;</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__ebo_h2</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<2, _H2></a>;</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span> </div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keyword">typedef</span> _H1 hasher;</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span> </div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  hasher</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  hash_function()<span class="keyword"> const</span></div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h1(); }</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> </div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keyword">typedef</span> std::size_t __hash_code;</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keyword">typedef</span> <a class="code" href="a05631.html">_Hash_node<_Value, true></a> <a class="code" href="a05631.html">__node_type</a>;</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> </div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="comment">// We need the default constructor for _Hashtable default constructor.</span></div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <a class="code" href="a05727.html">_Hash_code_base</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  <a class="code" href="a05727.html">_Hash_code_base</a>(<span class="keyword">const</span> _ExtractKey& __ex,</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <span class="keyword">const</span> _H1& __h1, <span class="keyword">const</span> _H2& __h2,</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="keyword">const</span> <a class="code" href="a05655.html">_Default_ranged_hash</a>&)</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  : <a class="code" href="a05711.html">__ebo_extract_key</a>(__ex), <a class="code" href="a05711.html">__ebo_h1</a>(__h1), <a class="code" href="a05711.html">__ebo_h2</a>(__h2) { }</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span> </div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  __hash_code</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  _M_hash_code(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  static_assert(__is_invocable<const _H1&, const _Key&>{},</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="stringliteral">"hash function must be invocable with an argument of key type"</span>);</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <span class="keywordflow">return</span> _M_h1()(__k);</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  }</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> </div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  std::size_t</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  _M_bucket_index(<span class="keyword">const</span> _Key&, __hash_code __c,</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  std::size_t __n)<span class="keyword"> const</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h2()(__c, __n); }</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> </div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  std::size_t</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  _M_bucket_index(<span class="keyword">const</span> <a class="code" href="a05631.html">__node_type</a>* __p, std::size_t __n) <span class="keyword">const</span></div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  noexcept( noexcept(declval<const _H2&>()((__hash_code)0,</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  (std::size_t)0)) )</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  { <span class="keywordflow">return</span> _M_h2()(__p->_M_hash_code, __n); }</div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span> </div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  _M_store_code(<a class="code" href="a05631.html">__node_type</a>* __n, __hash_code __c)<span class="keyword"> const</span></div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="keyword"> </span>{ __n->_M_hash_code = __c; }</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> </div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  _M_copy_code(<a class="code" href="a05631.html">__node_type</a>* __to, <span class="keyword">const</span> <a class="code" href="a05631.html">__node_type</a>* __from)<span class="keyword"> const</span></div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> <span class="keyword"> </span>{ __to->_M_hash_code = __from->_M_hash_code; }</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span> </div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  _M_swap(<a class="code" href="a05727.html">_Hash_code_base</a>& __x)</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  {</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  std::swap(_M_extract(), __x._M_extract());</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  std::swap(_M_h1(), __x._M_h1());</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  std::swap(_M_h2(), __x._M_h2());</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  }</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span> </div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <span class="keyword">const</span> _ExtractKey&</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  _M_extract()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_extract_key::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> </div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  _ExtractKey&</div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  _M_extract() { <span class="keywordflow">return</span> __ebo_extract_key::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span> </div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keyword">const</span> _H1&</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  _M_h1()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_h1::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span> </div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  _H1&</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  _M_h1() { <span class="keywordflow">return</span> __ebo_h1::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> </div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  <span class="keyword">const</span> _H2&</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  _M_h2()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> __ebo_h2::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> </div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  _H2&</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  _M_h2() { <span class="keywordflow">return</span> __ebo_h2::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  };</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="comment"></span></div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> <span class="comment"> /**</span></div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> <span class="comment"> * Primary class template _Equal_helper.</span></div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span> <span class="comment"> *</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> <span class="comment"> */</span></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="keyword">typename</span> _Equal, <span class="keyword">typename</span> _HashCodeType,</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordtype">bool</span> __cache_hash_code></div><div class="line"><a name="l01450"></a><span class="lineno"><a class="line" href="a05743.html"> 1450</a></span>  <span class="keyword">struct </span><a class="code" href="a05743.html">_Equal_helper</a>;</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> <span class="comment"></span></div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> <span class="comment"> /// Specialization.</span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="keyword">typename</span> _Equal, <span class="keyword">typename</span> _HashCodeType></div><div class="line"><a name="l01455"></a><span class="lineno"><a class="line" href="a05747.html"> 1455</a></span>  <span class="keyword">struct </span><a class="code" href="a05743.html">_Equal_helper</a><_Key, _Value, _ExtractKey, _Equal, _HashCodeType, true></div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  {</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  _S_equals(<span class="keyword">const</span> _Equal& __eq, <span class="keyword">const</span> _ExtractKey& __extract,</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keyword">const</span> _Key& __k, _HashCodeType __c, <a class="code" href="a05631.html">_Hash_node<_Value, true></a>* __n)</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  { <span class="keywordflow">return</span> __c == __n->_M_hash_code && __eq(__k, __extract(__n->_M_v())); }</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  };</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span> <span class="comment"></span></div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span> <span class="comment"> /// Specialization.</span></div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  <span class="keyword">typename</span> _Equal, <span class="keyword">typename</span> _HashCodeType></div><div class="line"><a name="l01466"></a><span class="lineno"><a class="line" href="a05751.html"> 1466</a></span>  <span class="keyword">struct </span><a class="code" href="a05743.html">_Equal_helper</a><_Key, _Value, _ExtractKey, _Equal, _HashCodeType, false></div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  {</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  _S_equals(<span class="keyword">const</span> _Equal& __eq, <span class="keyword">const</span> _ExtractKey& __extract,</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  <span class="keyword">const</span> _Key& __k, _HashCodeType, <a class="code" href="a05635.html">_Hash_node<_Value, false></a>* __n)</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  { <span class="keywordflow">return</span> __eq(__k, __extract(__n->_M_v())); }</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  };</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span> </div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> <span class="comment"></span></div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span> <span class="comment"> /// Partial specialization used when nodes contain a cached hash code.</span></div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash></div><div class="line"><a name="l01478"></a><span class="lineno"><a class="line" href="a05755.html"> 1478</a></span>  <span class="keyword">struct </span><a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  _H1, _H2, _Hash, true></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  : <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><0, _H2></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  {</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="keyword">using</span> <a class="code" href="a05711.html">__base_type</a> = <a class="code" href="a05711.html">_Hashtable_ebo_helper<0, _H2></a>;</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <span class="keyword">using</span> <a class="code" href="a05727.html">__hash_code_base</a> = <a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  _H1, _H2, _Hash, <span class="keyword">true</span>>;</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span> </div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <a class="code" href="a05723.html">_Local_iterator_base</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  <a class="code" href="a05723.html">_Local_iterator_base</a>(<span class="keyword">const</span> <a class="code" href="a05727.html">__hash_code_base</a>& __base,</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  <a class="code" href="a05631.html">_Hash_node<_Value, true></a>* __p,</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  std::size_t __bkt, std::size_t __bkt_count)</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  : <a class="code" href="a05711.html">__base_type</a>(__base._M_h2()),</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  _M_cur(__p), _M_bucket(__bkt), _M_bucket_count(__bkt_count) { }</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span> </div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  _M_incr()</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  {</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  _M_cur = _M_cur->_M_next();</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  <span class="keywordflow">if</span> (_M_cur)</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  {</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  std::size_t __bkt</div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  = __base_type::_S_get(*<span class="keyword">this</span>)(_M_cur->_M_hash_code,</div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  _M_bucket_count);</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="keywordflow">if</span> (__bkt != _M_bucket)</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  _M_cur = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  }</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  }</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> </div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  <a class="code" href="a05631.html">_Hash_node<_Value, true></a>* _M_cur;</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  std::size_t _M_bucket;</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  std::size_t _M_bucket_count;</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span> </div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keyword">const</span> <span class="keywordtype">void</span>*</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  _M_curr()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_cur; } <span class="comment">// for equality ops</span></div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span> </div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  std::size_t</div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  _M_get_bucket()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_bucket; } <span class="comment">// for debug mode</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  };</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> </div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="comment">// Uninitialized storage for a _Hash_code_base.</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="comment">// This type is DefaultConstructible and Assignable even if the</span></div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  <span class="comment">// _Hash_code_base type isn't, so that _Local_iterator_base<..., false></span></div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="comment">// can be DefaultConstructible and Assignable.</span></div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  template<typename _Tp, bool _IsEmpty = std::is_empty<_Tp>::value></div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="keyword">struct </span>_Hash_code_storage</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  {</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  __gnu_cxx::__aligned_buffer<_Tp> _M_storage;</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> </div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  _Tp*</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  _M_h() { <span class="keywordflow">return</span> _M_storage._M_ptr(); }</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> </div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keyword">const</span> _Tp*</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  _M_h()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_storage._M_ptr(); }</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  };</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span> </div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="comment">// Empty partial specialization for empty _Hash_code_base types.</span></div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="keyword">struct </span>_Hash_code_storage<_Tp, true></div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  {</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  static_assert( <a class="code" href="a03483.html">std::is_empty<_Tp>::value</a>, <span class="stringliteral">"Type must be empty"</span> );</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span> </div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="comment">// As _Tp is an empty type there will be no bytes written/read through</span></div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="comment">// the cast pointer, so no strict-aliasing violation.</span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  _Tp*</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  _M_h() { <span class="keywordflow">return</span> reinterpret_cast<_Tp*>(<span class="keyword">this</span>); }</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> </div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keyword">const</span> _Tp*</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  _M_h()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> reinterpret_cast<const _Tp*>(<span class="keyword">this</span>); }</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  };</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> </div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash></div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  <span class="keyword">using</span> __hash_code_for_local_iter</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  = _Hash_code_storage<_Hash_code_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  _H1, _H2, _Hash, <span class="keyword">false</span>>>;</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> </div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  <span class="comment">// Partial specialization used when hash codes are not cached</span></div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash></div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keyword">struct </span>_Local_iterator_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  _H1, _H2, _Hash, false></div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  : __hash_code_for_local_iter<_Key, _Value, _ExtractKey, _H1, _H2, _Hash></div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  {</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="keyword">using</span> __hash_code_base = _Hash_code_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  _H1, _H2, _Hash, <span class="keyword">false</span>>;</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span> </div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  _Local_iterator_base() : _M_bucket_count(-1) { }</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> </div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  _Local_iterator_base(<span class="keyword">const</span> __hash_code_base& __base,</div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  _Hash_node<_Value, false>* __p,</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  std::size_t __bkt, std::size_t __bkt_count)</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  : _M_cur(__p), _M_bucket(__bkt), _M_bucket_count(__bkt_count)</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  { _M_init(__base); }</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span> </div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  ~_Local_iterator_base()</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  {</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keywordflow">if</span> (_M_bucket_count != -1)</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  _M_destroy();</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  }</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span> </div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  _Local_iterator_base(<span class="keyword">const</span> _Local_iterator_base& __iter)</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  : _M_cur(__iter._M_cur), _M_bucket(__iter._M_bucket),</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  _M_bucket_count(__iter._M_bucket_count)</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  {</div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  <span class="keywordflow">if</span> (_M_bucket_count != -1)</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  _M_init(*__iter._M_h());</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  }</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span> </div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  _Local_iterator_base&</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  operator=(<span class="keyword">const</span> _Local_iterator_base& __iter)</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  {</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <span class="keywordflow">if</span> (_M_bucket_count != -1)</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  _M_destroy();</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  _M_cur = __iter._M_cur;</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  _M_bucket = __iter._M_bucket;</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  _M_bucket_count = __iter._M_bucket_count;</div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keywordflow">if</span> (_M_bucket_count != -1)</div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  _M_init(*__iter._M_h());</div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  }</div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> </div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  _M_incr()</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  {</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  _M_cur = _M_cur->_M_next();</div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  <span class="keywordflow">if</span> (_M_cur)</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  {</div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  std::size_t __bkt = this->_M_h()->_M_bucket_index(_M_cur,</div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  _M_bucket_count);</div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="keywordflow">if</span> (__bkt != _M_bucket)</div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  _M_cur = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  }</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  }</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span> </div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  _Hash_node<_Value, false>* _M_cur;</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  std::size_t _M_bucket;</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  std::size_t _M_bucket_count;</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span> </div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  _M_init(<span class="keyword">const</span> __hash_code_base& __base)</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  { ::new(this->_M_h()) __hash_code_base(__base); }</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span> </div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  _M_destroy() { this->_M_h()->~__hash_code_base(); }</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span> </div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keyword">const</span> <span class="keywordtype">void</span>*</div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  _M_curr()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_cur; } <span class="comment">// for equality ops and debug mode</span></div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> </div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  std::size_t</div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  _M_get_bucket()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_bucket; } <span class="comment">// for debug mode</span></div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  };</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> </div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash, <span class="keywordtype">bool</span> __cache></div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  operator==(<span class="keyword">const</span> _Local_iterator_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  _H1, _H2, _Hash, __cache>& __x,</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keyword">const</span> _Local_iterator_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  _H1, _H2, _Hash, __cache>& __y)</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  { <span class="keywordflow">return</span> __x._M_curr() == __y._M_curr(); }</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> </div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash, <span class="keywordtype">bool</span> __cache></div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  operator!=(<span class="keyword">const</span> _Local_iterator_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  _H1, _H2, _Hash, __cache>& __x,</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keyword">const</span> _Local_iterator_base<_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  _H1, _H2, _Hash, __cache>& __y)</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  { <span class="keywordflow">return</span> __x._M_curr() != __y._M_curr(); }</div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span> <span class="comment"></span></div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span> <span class="comment"> /// local iterators</span></div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache></div><div class="line"><a name="l01657"></a><span class="lineno"><a class="line" href="a05771.html"> 1657</a></span>  <span class="keyword">struct </span><a class="code" href="a05771.html">_Local_iterator</a></div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  : <span class="keyword">public</span> <a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  _H1, _H2, _Hash, __cache></div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  {</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <span class="keyword">using</span> <a class="code" href="a05723.html">__base_type</a> = <a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  _H1, _H2, _Hash, __cache>;</div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="keyword">using</span> __hash_code_base = <span class="keyword">typename</span> __base_type::__hash_code_base;</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  <span class="keyword">typedef</span> _Value value_type;</div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a03047.html">std::conditional</a><__constant_iterators,</div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="keyword">const</span> _Value*, _Value*>::type</div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  pointer;</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a03047.html">std::conditional</a><__constant_iterators,</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="keyword">const</span> _Value&, _Value&>::type</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  reference;</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="keyword">typedef</span> std::ptrdiff_t difference_type;</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="keyword">typedef</span> <a class="code" href="a07663.html">std::forward_iterator_tag</a> <a class="code" href="a07663.html">iterator_category</a>;</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> </div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <a class="code" href="a05771.html">_Local_iterator</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> </div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  <a class="code" href="a05771.html">_Local_iterator</a>(<span class="keyword">const</span> __hash_code_base& __base,</div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  <a class="code" href="a05627.html">_Hash_node<_Value, __cache></a>* __p,</div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  std::size_t __bkt, std::size_t __bkt_count)</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  : <a class="code" href="a05723.html">__base_type</a>(__base, __p, __bkt, __bkt_count)</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  { }</div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span> </div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  reference</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <a class="code" href="a01470.html#gaf84b7343bdda8ed9615cd8f5a61c5e83">operator*</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur->_M_v(); }</div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span> </div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  pointer</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  operator->()<span class="keyword"> const</span></div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur->_M_valptr(); }</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span> </div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <a class="code" href="a05771.html">_Local_iterator</a>&</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  operator++()</div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  {</div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  this->_M_incr();</div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  }</div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span> </div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <a class="code" href="a05771.html">_Local_iterator</a></div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  operator++(<span class="keywordtype">int</span>)</div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  {</div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <a class="code" href="a05771.html">_Local_iterator</a> __tmp(*<span class="keyword">this</span>);</div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  this->_M_incr();</div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  }</div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  };</div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span> <span class="comment"></span></div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span> <span class="comment"> /// local const_iterators</span></div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _ExtractKey,</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache></div><div class="line"><a name="l01712"></a><span class="lineno"><a class="line" href="a05775.html"> 1712</a></span>  <span class="keyword">struct </span><a class="code" href="a05775.html">_Local_const_iterator</a></div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  : <span class="keyword">public</span> <a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  _H1, _H2, _Hash, __cache></div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  {</div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="keyword">using</span> <a class="code" href="a05723.html">__base_type</a> = <a class="code" href="a05723.html">_Local_iterator_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  _H1, _H2, _Hash, __cache>;</div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  <span class="keyword">using</span> __hash_code_base = <span class="keyword">typename</span> __base_type::__hash_code_base;</div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span> </div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  <span class="keyword">typedef</span> _Value value_type;</div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Value* pointer;</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Value& reference;</div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <span class="keyword">typedef</span> std::ptrdiff_t difference_type;</div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="keyword">typedef</span> <a class="code" href="a07663.html">std::forward_iterator_tag</a> <a class="code" href="a07663.html">iterator_category</a>;</div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span> </div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <a class="code" href="a05775.html">_Local_const_iterator</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> </div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  <a class="code" href="a05775.html">_Local_const_iterator</a>(<span class="keyword">const</span> __hash_code_base& __base,</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  <a class="code" href="a05627.html">_Hash_node<_Value, __cache></a>* __p,</div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  std::size_t __bkt, std::size_t __bkt_count)</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  : <a class="code" href="a05723.html">__base_type</a>(__base, __p, __bkt, __bkt_count)</div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  { }</div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> </div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <a class="code" href="a05775.html">_Local_const_iterator</a>(<span class="keyword">const</span> <a class="code" href="a05771.html">_Local_iterator</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  _H1, _H2, _Hash,</div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  __constant_iterators,</div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  __cache>& __x)</div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  : <a class="code" href="a05723.html">__base_type</a>(__x)</div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  { }</div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span> </div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  reference</div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  <a class="code" href="a01470.html#gaf84b7343bdda8ed9615cd8f5a61c5e83">operator*</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur->_M_v(); }</div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span> </div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  pointer</div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  operator->()<span class="keyword"> const</span></div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur->_M_valptr(); }</div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span> </div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  <a class="code" href="a05775.html">_Local_const_iterator</a>&</div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  operator++()</div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  {</div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  this->_M_incr();</div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  }</div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span> </div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  <a class="code" href="a05775.html">_Local_const_iterator</a></div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  operator++(<span class="keywordtype">int</span>)</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  {</div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  <a class="code" href="a05775.html">_Local_const_iterator</a> __tmp(*<span class="keyword">this</span>);</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  this->_M_incr();</div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  }</div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  };</div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span> <span class="comment"></span></div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span> <span class="comment"> /**</span></div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span> <span class="comment"> * Primary class template _Hashtable_base.</span></div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span> <span class="comment"> *</span></div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span> <span class="comment"> * Helper class adding management of _Equal functor to</span></div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span> <span class="comment"> * _Hash_code_base type.</span></div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span> <span class="comment"> *</span></div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span> <span class="comment"> * Base class templates are:</span></div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span> <span class="comment"> * - __detail::_Hash_code_base</span></div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span> <span class="comment"> * - __detail::_Hashtable_ebo_helper</span></div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span> <span class="comment"> */</span></div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,</div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  <span class="keyword">struct </span><a class="code" href="a05591.html">_Hashtable_base</a></div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  : <span class="keyword">public</span> <a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey, _H1, _H2, _Hash,</div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  _Traits::__hash_cached::value>,</div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <span class="keyword">private</span> <a class="code" href="a05711.html">_Hashtable_ebo_helper</a><0, _Equal></div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  {</div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="keyword">typedef</span> _Key key_type;</div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="keyword">typedef</span> _Value value_type;</div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  <span class="keyword">typedef</span> _Equal key_equal;</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <span class="keyword">typedef</span> std::size_t size_type;</div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  <span class="keyword">typedef</span> std::ptrdiff_t difference_type;</div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span> </div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  <span class="keyword">using</span> __traits_type = _Traits;</div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  <span class="keyword">using</span> __hash_cached = <span class="keyword">typename</span> __traits_type::__hash_cached;</div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  <span class="keyword">using</span> __constant_iterators = <span class="keyword">typename</span> __traits_type::__constant_iterators;</div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  <span class="keyword">using</span> __unique_keys = <span class="keyword">typename</span> __traits_type::__unique_keys;</div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> </div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  <span class="keyword">using</span> __hash_code_base = <a class="code" href="a05727.html">_Hash_code_base</a><_Key, _Value, _ExtractKey,</div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  _H1, _H2, _Hash,</div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  __hash_cached::value>;</div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span> </div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <span class="keyword">using</span> __hash_code = <span class="keyword">typename</span> __hash_code_base::__hash_code;</div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> __hash_code_base::__node_type;</div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span> </div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  <span class="keyword">using</span> <a class="code" href="a07675.html">iterator</a> = <a class="code" href="a05643.html">__detail::_Node_iterator</a><value_type,</div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  __constant_iterators::value,</div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  __hash_cached::value>;</div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span> </div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  <span class="keyword">using</span> const_iterator = <a class="code" href="a05647.html">__detail::_Node_const_iterator</a><value_type,</div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  __constant_iterators::value,</div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  __hash_cached::value>;</div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span> </div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="keyword">using</span> local_iterator = <a class="code" href="a05771.html">__detail::_Local_iterator</a><key_type, value_type,</div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  _ExtractKey, _H1, _H2, _Hash,</div><div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  __constant_iterators::value,</div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  __hash_cached::value>;</div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span> </div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  <span class="keyword">using</span> const_local_iterator = <a class="code" href="a05775.html">__detail::_Local_const_iterator</a><key_type,</div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  value_type,</div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  _ExtractKey, _H1, _H2, _Hash,</div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  __constant_iterators::value,</div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  __hash_cached::value>;</div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span> </div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keyword">using</span> __ireturn_type = <span class="keyword">typename</span> <a class="code" href="a03047.html">std::conditional</a><__unique_keys::value,</div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a>,</div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <a class="code" href="a07675.html">iterator</a>>::type;</div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="keyword">using</span> _EqualEBO = <a class="code" href="a05711.html">_Hashtable_ebo_helper<0, _Equal></a>;</div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="keyword">using</span> _EqualHelper = <a class="code" href="a05743.html">_Equal_helper</a><_Key, _Value, _ExtractKey, _Equal,</div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  __hash_code, __hash_cached::value>;</div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span> </div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <a class="code" href="a05591.html">_Hashtable_base</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <a class="code" href="a05591.html">_Hashtable_base</a>(<span class="keyword">const</span> _ExtractKey& __ex, <span class="keyword">const</span> _H1& __h1, <span class="keyword">const</span> _H2& __h2,</div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <span class="keyword">const</span> _Hash& __hash, <span class="keyword">const</span> _Equal& __eq)</div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  : __hash_code_base(__ex, __h1, __h2, __hash), _EqualEBO(__eq)</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  { }</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span> </div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  _M_equals(<span class="keyword">const</span> _Key& __k, __hash_code __c, __node_type* __n)<span class="keyword"> const</span></div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  static_assert(__is_invocable<const _Equal&, const _Key&, const _Key&>{},</div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  <span class="stringliteral">"key equality predicate must be invocable with two arguments of "</span></div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="stringliteral">"key type"</span>);</div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keywordflow">return</span> _EqualHelper::_S_equals(_M_eq(), this->_M_extract(),</div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  __k, __c, __n);</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  }</div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> </div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  _M_swap(_Hashtable_base& __x)</div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  {</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  __hash_code_base::_M_swap(__x);</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  std::swap(_M_eq(), __x._M_eq());</div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  }</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span> </div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <span class="keyword">const</span> _Equal&</div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  _M_eq()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _EqualEBO::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span> </div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  _Equal&</div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  _M_eq() { <span class="keywordflow">return</span> _EqualEBO::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  };</div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span> <span class="comment"></span></div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span> <span class="comment"> /**</span></div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span> <span class="comment"> * struct _Equality_base.</span></div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span> <span class="comment"> *</span></div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span> <span class="comment"> * Common types and functions for class _Equality.</span></div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span> <span class="comment"> */</span></div><div class="line"><a name="l01867"></a><span class="lineno"><a class="line" href="a05779.html"> 1867</a></span>  <span class="keyword">struct </span><a class="code" href="a05779.html">_Equality_base</a></div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  {</div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Uiterator></div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  _S_is_permutation(_Uiterator, _Uiterator, _Uiterator);</div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  };</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span> </div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  <span class="comment">// See std::is_permutation in N3068.</span></div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Uiterator></div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  _Equality_base::</div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  _S_is_permutation(_Uiterator __first1, _Uiterator __last1,</div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  _Uiterator __first2)</div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  {</div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, ++__first2)</div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  <span class="keywordflow">if</span> (!(*__first1 == *__first2))</div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> </div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  <span class="keywordflow">if</span> (__first1 == __last1)</div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> </div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  _Uiterator __last2 = __first2;</div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__last2, <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first1, __last1));</div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span> </div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <span class="keywordflow">for</span> (_Uiterator __it1 = __first1; __it1 != __last1; ++__it1)</div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  {</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  _Uiterator __tmp = __first1;</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <span class="keywordflow">while</span> (__tmp != __it1 && !<span class="keywordtype">bool</span>(*__tmp == *__it1))</div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  ++__tmp;</div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span> </div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  <span class="comment">// We've seen this one before.</span></div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <span class="keywordflow">if</span> (__tmp != __it1)</div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span> </div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  std::ptrdiff_t __n2 = 0;</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="keywordflow">for</span> (__tmp = __first2; __tmp != __last2; ++__tmp)</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <span class="keywordflow">if</span> (*__tmp == *__it1)</div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  ++__n2;</div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span> </div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  <span class="keywordflow">if</span> (!__n2)</div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span> </div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  std::ptrdiff_t __n1 = 0;</div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  <span class="keywordflow">for</span> (__tmp = __it1; __tmp != __last1; ++__tmp)</div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  <span class="keywordflow">if</span> (*__tmp == *__it1)</div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  ++__n1;</div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span> </div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  <span class="keywordflow">if</span> (__n1 != __n2)</div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  }</div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  }</div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> <span class="comment"></span></div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span> <span class="comment"> /**</span></div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span> <span class="comment"> * Primary class template _Equality.</span></div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span> <span class="comment"> *</span></div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span> <span class="comment"> * This is for implementing equality comparison for unordered</span></div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span> <span class="comment"> * containers, per N3068, by John Lakos and Pablo Halpern.</span></div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span> <span class="comment"> * Algorithmically, we follow closely the reference implementations</span></div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span> <span class="comment"> * therein.</span></div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span> <span class="comment"> */</span></div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits,</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  <span class="keywordtype">bool</span> _Unique_keys = _Traits::__unique_keys::value></div><div class="line"><a name="l01934"></a><span class="lineno"><a class="line" href="a05783.html"> 1934</a></span>  <span class="keyword">struct </span><a class="code" href="a05783.html">_Equality</a>;</div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span> <span class="comment"></span></div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span> <span class="comment"> /// Specialization.</span></div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01941"></a><span class="lineno"><a class="line" href="a05787.html"> 1941</a></span>  <span class="keyword">struct </span><a class="code" href="a05783.html">_Equality</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, true></div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  {</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits>;</div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span> </div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  _M_equal(<span class="keyword">const</span> <a class="code" href="a05583.html">__hashtable</a>&) <span class="keyword">const</span>;</div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  };</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span> </div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  <a class="code" href="a05783.html">_Equality</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, <span class="keyword">true</span>>::</div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  _M_equal(<span class="keyword">const</span> __hashtable& __other)<span class="keyword"> const</span></div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  <span class="keyword">const</span> __hashtable* __this = static_cast<const __hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span> </div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  <span class="keywordflow">if</span> (__this->size() != __other.size())</div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span> </div><div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> __itx = __this->begin(); __itx != __this->end(); ++__itx)</div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  {</div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __ity = __other.find(_ExtractKey()(*__itx));</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="keywordflow">if</span> (__ity == __other.end() || !bool(*__ity == *__itx))</div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  }</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  }</div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span> <span class="comment"></span></div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span> <span class="comment"> /// Specialization.</span></div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01979"></a><span class="lineno"><a class="line" href="a05791.html"> 1979</a></span>  <span class="keyword">struct </span><a class="code" href="a05783.html">_Equality</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, false></div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  : <span class="keyword">public</span> <a class="code" href="a05779.html">_Equality_base</a></div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  {</div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits>;</div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span> </div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  _M_equal(<span class="keyword">const</span> <a class="code" href="a05583.html">__hashtable</a>&) <span class="keyword">const</span>;</div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  };</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span> </div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,</div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,</div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <a class="code" href="a05783.html">_Equality</a><_Key, _Value, _Alloc, _ExtractKey, _Equal,</div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  _H1, _H2, _Hash, _RehashPolicy, _Traits, <span class="keyword">false</span>>::</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  _M_equal(<span class="keyword">const</span> __hashtable& __other)<span class="keyword"> const</span></div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  <span class="keyword">const</span> __hashtable* __this = static_cast<const __hashtable*>(<span class="keyword">this</span>);</div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span> </div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  <span class="keywordflow">if</span> (__this->size() != __other.size())</div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span> </div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> __itx = __this->begin(); __itx != __this->end();)</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  {</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __xrange = __this->equal_range(_ExtractKey()(*__itx));</div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __yrange = __other.equal_range(_ExtractKey()(*__itx));</div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span> </div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="keywordflow">if</span> (<a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__xrange.first, __xrange.second)</div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  != <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__yrange.first, __yrange.second))</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span> </div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  <span class="keywordflow">if</span> (!_S_is_permutation(__xrange.first, __xrange.second,</div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  __yrange.first))</div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span> </div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  __itx = __xrange.second;</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  }</div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  }</div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span> <span class="comment"></span></div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span> <span class="comment"> /**</span></div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span> <span class="comment"> * This type deals with all allocation and keeps an allocator instance through</span></div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span> <span class="comment"> * inheritance to benefit from EBO when possible.</span></div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span> <span class="comment"> */</span></div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keyword">struct </span>_Hashtable_alloc : <span class="keyword">private</span> _Hashtable_ebo_helper<0, _NodeAlloc></div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  {</div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  <span class="keyword">using</span> __ebo_node_alloc = _Hashtable_ebo_helper<0, _NodeAlloc>;</div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keyword">using</span> __node_type = <span class="keyword">typename</span> _NodeAlloc::value_type;</div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keyword">using</span> __node_alloc_type = _NodeAlloc;</div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  <span class="comment">// Use __gnu_cxx to benefit from _S_always_equal and al.</span></div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  <span class="keyword">using</span> __node_alloc_traits = <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<__node_alloc_type></a>;</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span> </div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="keyword">using</span> __value_alloc_traits = <span class="keyword">typename</span> __node_alloc_traits::template</div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  rebind_traits<typename __node_type::value_type>;</div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span> </div><div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  <span class="keyword">using</span> __node_base = __detail::_Hash_node_base;</div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  <span class="keyword">using</span> __bucket_type = __node_base*; </div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  <span class="keyword">using</span> __bucket_alloc_type =</div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  __alloc_rebind<__node_alloc_type, __bucket_type>;</div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  <span class="keyword">using</span> __bucket_alloc_traits = <a class="code" href="a04639.html">std::allocator_traits<__bucket_alloc_type></a>;</div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span> </div><div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  _Hashtable_alloc() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  _Hashtable_alloc(<span class="keyword">const</span> _Hashtable_alloc&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  _Hashtable_alloc(_Hashtable_alloc&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span> </div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  _Hashtable_alloc(_Alloc&& __a)</div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  : __ebo_node_alloc(<a class="code" href="a01541.html">std</a>::<a class="code" href="a01480.html#gacb5baec338e12b99cb6bddea7506c7c6">forward</a><_Alloc>(__a))</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  { }</div><div class="line"><a name="l02054"></a><span class="lineno"> 2054</span> </div><div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  __node_alloc_type&</div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  _M_node_allocator()</div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  { <span class="keywordflow">return</span> __ebo_node_alloc::_S_get(*<span class="keyword">this</span>); }</div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span> </div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="keyword">const</span> __node_alloc_type&</div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  _M_node_allocator()<span class="keyword"> const</span></div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> __ebo_node_alloc::_S_cget(*<span class="keyword">this</span>); }</div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span> </div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  __node_type*</div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  _M_allocate_node(_Args&&... __args);</div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span> </div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  _M_deallocate_node(__node_type* __n);</div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span> </div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="comment">// Deallocate the linked list of nodes pointed to by __n</span></div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  _M_deallocate_nodes(__node_type* __n);</div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span> </div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  __bucket_type*</div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  _M_allocate_buckets(std::size_t __n);</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span> </div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  _M_deallocate_buckets(__bucket_type*, std::size_t __n);</div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  };</div><div class="line"><a name="l02080"></a><span class="lineno"> 2080</span> </div><div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  <span class="comment">// Definitions of class template _Hashtable_alloc's out-of-line member</span></div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <span class="comment">// functions.</span></div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="keyword">typename</span> _Hashtable_alloc<_NodeAlloc>::__node_type*</div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  _Hashtable_alloc<_NodeAlloc>::_M_allocate_node(_Args&&... __args)</div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  {</div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  <span class="keyword">auto</span> __nptr = __node_alloc_traits::allocate(_M_node_allocator(), 1);</div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  __node_type* __n = std::__to_address(__nptr);</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  __try</div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  {</div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  ::new ((<span class="keywordtype">void</span>*)__n) __node_type;</div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  __node_alloc_traits::construct(_M_node_allocator(),</div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  __n->_M_valptr(),</div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <span class="keywordflow">return</span> __n;</div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  }</div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  __catch(...)</div><div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  {</div><div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  __node_alloc_traits::deallocate(_M_node_allocator(), __nptr, 1);</div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  __throw_exception_again;</div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  }</div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  }</div><div class="line"><a name="l02104"></a><span class="lineno"> 2104</span> </div><div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  _Hashtable_alloc<_NodeAlloc>::_M_deallocate_node(__node_type* __n)</div><div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  {</div><div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __node_alloc_traits::pointer _Ptr;</div><div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  <span class="keyword">auto</span> __ptr = <a class="code" href="a06251.html">std::pointer_traits<_Ptr>::pointer_to</a>(*__n);</div><div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  __node_alloc_traits::destroy(_M_node_allocator(), __n->_M_valptr());</div><div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  __n->~__node_type();</div><div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  __node_alloc_traits::deallocate(_M_node_allocator(), __ptr, 1);</div><div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  }</div><div class="line"><a name="l02115"></a><span class="lineno"> 2115</span> </div><div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  _Hashtable_alloc<_NodeAlloc>::_M_deallocate_nodes(__node_type* __n)</div><div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  {</div><div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  <span class="keywordflow">while</span> (__n)</div><div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  {</div><div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  __node_type* __tmp = __n;</div><div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  __n = __n->_M_next();</div><div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  _M_deallocate_node(__tmp);</div><div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  }</div><div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  }</div><div class="line"><a name="l02127"></a><span class="lineno"> 2127</span> </div><div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  <span class="keyword">typename</span> _Hashtable_alloc<_NodeAlloc>::__bucket_type*</div><div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  _Hashtable_alloc<_NodeAlloc>::_M_allocate_buckets(std::size_t __n)</div><div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  {</div><div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  __bucket_alloc_type __alloc(_M_node_allocator());</div><div class="line"><a name="l02133"></a><span class="lineno"> 2133</span> </div><div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  <span class="keyword">auto</span> __ptr = __bucket_alloc_traits::allocate(__alloc, __n);</div><div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  __bucket_type* __p = std::__to_address(__ptr);</div><div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  __builtin_memset(__p, 0, __n * <span class="keyword">sizeof</span>(__bucket_type));</div><div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  <span class="keywordflow">return</span> __p;</div><div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  }</div><div class="line"><a name="l02139"></a><span class="lineno"> 2139</span> </div><div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _NodeAlloc></div><div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  _Hashtable_alloc<_NodeAlloc>::_M_deallocate_buckets(__bucket_type* __bkts,</div><div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  std::size_t __n)</div><div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  {</div><div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __bucket_alloc_traits::pointer _Ptr;</div><div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <span class="keyword">auto</span> __ptr = <a class="code" href="a06251.html">std::pointer_traits<_Ptr>::pointer_to</a>(*__bkts);</div><div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  __bucket_alloc_type __alloc(_M_node_allocator());</div><div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  __bucket_alloc_traits::deallocate(__alloc, __ptr, __n);</div><div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  }</div><div class="line"><a name="l02150"></a><span class="lineno"> 2150</span> <span class="comment"></span></div><div class="line"><a name="l02151"></a><span class="lineno"> 2151</span> <span class="comment"> //@} hashtable-detail</span></div><div class="line"><a name="l02152"></a><span class="lineno"> 2152</span> <span class="comment"></span>} <span class="comment">// namespace __detail</span></div><div class="line"><a name="l02153"></a><span class="lineno"> 2153</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l02154"></a><span class="lineno"> 2154</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l02155"></a><span class="lineno"> 2155</span> </div><div class="line"><a name="l02156"></a><span class="lineno"> 2156</span> <span class="preprocessor">#endif // _HASHTABLE_POLICY_H</span></div><div class="ttc" id="a05647_html"><div class="ttname"><a href="a05647.html">std::__detail::_Node_const_iterator</a></div><div class="ttdoc">Node const_iterators, used to iterate through all the hashtable.</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00370">hashtable_policy.h:370</a></div></div>
<div class="ttc" id="a05635_html"><div class="ttname"><a href="a05635.html">std::__detail::_Hash_node< _Value, false ></a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00280">hashtable_policy.h:280</a></div></div>
<div class="ttc" id="a05723_html"><div class="ttname"><a href="a05723.html">std::__detail::_Local_iterator_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01154">hashtable_policy.h:1154</a></div></div>
<div class="ttc" id="a05623_html"><div class="ttname"><a href="a05623.html">std::__detail::_Hash_node_value_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00230">hashtable_policy.h:230</a></div></div>
<div class="ttc" id="a07767_html"><div class="ttname"><a href="a07767.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
<div class="ttc" id="a01479_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant< bool, true > true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00075">type_traits:75</a></div></div>
<div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a07655_html"><div class="ttname"><a href="a07655.html">std::input_iterator_tag</a></div><div class="ttdoc">Marking input iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00089">stl_iterator_base_types.h:89</a></div></div>
<div class="ttc" id="a05779_html"><div class="ttname"><a href="a05779.html">std::__detail::_Equality_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01867">hashtable_policy.h:1867</a></div></div>
<div class="ttc" id="a05667_html"><div class="ttname"><a href="a05667.html">std::__detail::_Power2_rehash_policy</a></div><div class="ttdoc">Rehash policy providing power of 2 bucket numbers. Avoids modulo operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00532">hashtable_policy.h:532</a></div></div>
<div class="ttc" id="a01707_html"><div class="ttname"><a href="a01707.html">std::tuple_element</a></div><div class="ttdoc">tuple_element</div><div class="ttdef"><b>Definition:</b> <a href="a00041_source.html#l00359">array:359</a></div></div>
<div class="ttc" id="a05655_html"><div class="ttname"><a href="a05655.html">std::__detail::_Default_ranged_hash</a></div><div class="ttdoc">Default ranged hash function H. In principle it should be a function object composed from objects of ...</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00442">hashtable_policy.h:442</a></div></div>
<div class="ttc" id="a05743_html"><div class="ttname"><a href="a05743.html">std::__detail::_Equal_helper</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01450">hashtable_policy.h:1450</a></div></div>
<div class="ttc" id="a05643_html"><div class="ttname"><a href="a05643.html">std::__detail::_Node_iterator</a></div><div class="ttdoc">Node iterators, used to iterate through all the hashtable.</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00319">hashtable_policy.h:319</a></div></div>
<div class="ttc" id="a00530_html"><div class="ttname"><a href="a00530.html">stl_algobase.h</a></div></div>
<div class="ttc" id="a07675_html"><div class="ttname"><a href="a07675.html">std::iterator</a></div><div class="ttdoc">Common iterator class.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00118">stl_iterator_base_types.h:118</a></div></div>
<div class="ttc" id="a04639_html"><div class="ttname"><a href="a04639.html">std::allocator_traits</a></div><div class="ttdoc">Uniform interface to all allocator types.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00083">bits/alloc_traits.h:83</a></div></div>
<div class="ttc" id="a05699_html"><div class="ttname"><a href="a05699.html">std::__detail::_Rehash_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01043">hashtable_policy.h:1043</a></div></div>
<div class="ttc" id="a04191_html"><div class="ttname"><a href="a04191.html">std::enable_if</a></div><div class="ttdoc">Define a member typedef type only if a boolean constant is true.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l01913">type_traits:1913</a></div></div>
<div class="ttc" id="a07663_html"><div class="ttname"><a href="a07663.html">std::forward_iterator_tag</a></div><div class="ttdoc">Forward iterators support a superset of input iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00095">stl_iterator_base_types.h:95</a></div></div>
<div class="ttc" id="a05687_html"><div class="ttname"><a href="a05687.html">std::__detail::_Insert</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00929">hashtable_policy.h:929</a></div></div>
<div class="ttc" id="a05775_html"><div class="ttname"><a href="a05775.html">std::__detail::_Local_const_iterator</a></div><div class="ttdoc">local const_iterators</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01712">hashtable_policy.h:1712</a></div></div>
<div class="ttc" id="a05663_html"><div class="ttname"><a href="a05663.html">std::__detail::_Mask_range_hashing</a></div><div class="ttdoc">Range hashing function assuming that second arg is a power of 2.</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00495">hashtable_policy.h:495</a></div></div>
<div class="ttc" id="a03047_html"><div class="ttname"><a href="a03047.html">std::conditional</a></div><div class="ttdoc">Define a member typedef type to one of two argument types.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00092">type_traits:92</a></div></div>
<div class="ttc" id="a01541_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00202">stl_iterator_base_funcs.h:202</a></div></div>
<div class="ttc" id="a01480_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00524">stl_pair.h:524</a></div></div>
<div class="ttc" id="a05783_html"><div class="ttname"><a href="a05783.html">std::__detail::_Equality</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01934">hashtable_policy.h:1934</a></div></div>
<div class="ttc" id="a05683_html"><div class="ttname"><a href="a05683.html">std::__detail::_Insert_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00792">hashtable_policy.h:792</a></div></div>
<div class="ttc" id="a05583_html"><div class="ttname"><a href="a05583.html">std::_Hashtable</a></div><div class="ttdef"><b>Definition:</b> <a href="a16827_source.html#l00173">bits/hashtable.h:173</a></div></div>
<div class="ttc" id="a01470_html_gaf84b7343bdda8ed9615cd8f5a61c5e83"><div class="ttname"><a href="a01470.html#gaf84b7343bdda8ed9615cd8f5a61c5e83">std::operator*</a></div><div class="ttdeci">complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)</div><div class="ttdoc">Return new complex value x times y.</div><div class="ttdef"><b>Definition:</b> <a href="a00053_source.html#l00386">complex:386</a></div></div>
<div class="ttc" id="a03043_html"><div class="ttname"><a href="a03043.html">std::integral_constant</a></div><div class="ttdoc">integral_constant</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00057">type_traits:57</a></div></div>
<div class="ttc" id="a01655_html"><div class="ttname"><a href="a01655.html">std::initializer_list</a></div><div class="ttdoc">initializer_list</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00047">initializer_list:47</a></div></div>
<div class="ttc" id="a00161_html"><div class="ttname"><a href="a00161.html">tuple</a></div></div>
<div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a03575_html"><div class="ttname"><a href="a03575.html">std::is_constructible</a></div><div class="ttdoc">is_constructible</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00872">type_traits:872</a></div></div>
<div class="ttc" id="a05711_html"><div class="ttname"><a href="a05711.html">std::__detail::_Hashtable_ebo_helper</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01099">hashtable_policy.h:1099</a></div></div>
<div class="ttc" id="a03483_html"><div class="ttname"><a href="a03483.html">std::is_empty</a></div><div class="ttdoc">is_empty</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00692">type_traits:692</a></div></div>
<div class="ttc" id="a01507_html_ga89d3a7d239086516917bb7f6f9da213c"><div class="ttname"><a href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a></div><div class="ttdeci">constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00205">stl_iterator_base_types.h:205</a></div></div>
<div class="ttc" id="a05631_html"><div class="ttname"><a href="a05631.html">std::__detail::_Hash_node< _Value, true ></a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00265">hashtable_policy.h:265</a></div></div>
<div class="ttc" id="a01479_html_gaebe6729ab5488ecc76c762873d226857"><div class="ttname"><a href="a01479.html#gaebe6729ab5488ecc76c762873d226857">std::false_type</a></div><div class="ttdeci">integral_constant< bool, false > false_type</div><div class="ttdoc">The type used as a compile-time boolean with false value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00078">type_traits:78</a></div></div>
<div class="ttc" id="a02883_html"><div class="ttname"><a href="a02883.html">std::tuple</a></div><div class="ttdoc">Primary class template, tuple.</div><div class="ttdef"><b>Definition:</b> <a href="a00161_source.html#l00053">tuple:53</a></div></div>
<div class="ttc" id="a01491_html_ga467c90cac9f40425bac6a54f9a54ad9e"><div class="ttname"><a href="a01491.html#ga467c90cac9f40425bac6a54f9a54ad9e">std::__detail::__clp2</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR std::size_t __clp2(std::size_t __n) noexcept</div><div class="ttdoc">Compute closest power of 2.</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00510">hashtable_policy.h:510</a></div></div>
<div class="ttc" id="a05651_html"><div class="ttname"><a href="a05651.html">std::__detail::_Mod_range_hashing</a></div><div class="ttdoc">Default range hashing function: use division to fold a large number into the range [0,...</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00425">hashtable_policy.h:425</a></div></div>
<div class="ttc" id="a06251_html"><div class="ttname"><a href="a06251.html">std::pointer_traits</a></div><div class="ttdoc">Uniform interface to all pointer-like types.</div><div class="ttdef"><b>Definition:</b> <a href="a00446_source.html#l00078">ptr_traits.h:78</a></div></div>
<div class="ttc" id="a10159_html"><div class="ttname"><a href="a10159.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++11 allocators.</div><div class="ttdef"><b>Definition:</b> <a href="a16479_source.html#l00050">ext/alloc_traits.h:50</a></div></div>
<div class="ttc" id="a01480_html_gacb5baec338e12b99cb6bddea7506c7c6"><div class="ttname"><a href="a01480.html#gacb5baec338e12b99cb6bddea7506c7c6">std::forward</a></div><div class="ttdeci">constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept</div><div class="ttdoc">Forward an lvalue.</div><div class="ttdef"><b>Definition:</b> <a href="a00422_source.html#l00074">move.h:74</a></div></div>
<div class="ttc" id="a05619_html"><div class="ttname"><a href="a05619.html">std::__detail::_Hash_node_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00215">hashtable_policy.h:215</a></div></div>
<div class="ttc" id="a05771_html"><div class="ttname"><a href="a05771.html">std::__detail::_Local_iterator</a></div><div class="ttdoc">local iterators</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01657">hashtable_policy.h:1657</a></div></div>
<div class="ttc" id="a05671_html"><div class="ttname"><a href="a05671.html">std::__detail::_Map_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00643">hashtable_policy.h:643</a></div></div>
<div class="ttc" id="a01480_html_ga4be4b722e942cd646f19614bcff7a328"><div class="ttname"><a href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a></div><div class="ttdeci">_GLIBCXX17_INLINE constexpr piecewise_construct_t piecewise_construct</div><div class="ttdoc">piecewise_construct</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00079">stl_pair.h:79</a></div></div>
<div class="ttc" id="a05639_html"><div class="ttname"><a href="a05639.html">std::__detail::_Node_iterator_base</a></div><div class="ttdoc">Base class for node iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00289">hashtable_policy.h:289</a></div></div>
<div class="ttc" id="a05591_html"><div class="ttname"><a href="a05591.html">std::__detail::_Hashtable_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00058">hashtable_policy.h:58</a></div></div>
<div class="ttc" id="a05727_html"><div class="ttname"><a href="a05727.html">std::__detail::_Hash_code_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l01179">hashtable_policy.h:1179</a></div></div>
<div class="ttc" id="a05627_html"><div class="ttname"><a href="a05627.html">std::__detail::_Hash_node</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00257">hashtable_policy.h:257</a></div></div>
<div class="ttc" id="a05615_html"><div class="ttname"><a href="a05615.html">std::__detail::_Hashtable_traits</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00200">hashtable_policy.h:200</a></div></div>
<div class="ttc" id="a05603_html"><div class="ttname"><a href="a05603.html">std::__detail::_Hashtable_alloc</a></div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00098">hashtable_policy.h:98</a></div></div>
<div class="ttc" id="a00236_html"><div class="ttname"><a href="a00236.html">cstdint</a></div></div>
<div class="ttc" id="a05659_html"><div class="ttname"><a href="a05659.html">std::__detail::_Prime_rehash_policy</a></div><div class="ttdoc">Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...</div><div class="ttdef"><b>Definition:</b> <a href="a00374_source.html#l00446">hashtable_policy.h:446</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00374.html">hashtable_policy.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
344
