<!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++: unordered_map.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('a00623_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">unordered_map.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00623.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">// unordered_map implementation -*- 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/unordered_map.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. @headername{unordered_map}</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#ifndef _UNORDERED_MAP_H</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define _UNORDERED_MAP_H</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> /// Base types for unordered_map.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keywordtype">bool</span> _Cache></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="a01541.html#a84b02064179c0ef21d0189a7bf15803b"> 40</a></span>  <span class="keyword">using</span> <a class="code" href="a05615.html">__umap_traits</a> = <a class="code" href="a05615.html">__detail::_Hashtable_traits<_Cache, false, true></a>;</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,</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">typename</span> _Hash = <a class="code" href="a02839.html">hash<_Key></a>,</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">typename</span> _Pred = <a class="code" href="a07367.html">std::equal_to<_Key></a>,</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04707.html">std::allocator<std::pair<const _Key, _Tp></a> >,</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">typename</span> _Tr = <a class="code" href="a05615.html">__umap_traits<__cache_default<_Key, _Hash>::value</a>>></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__umap_hashtable</a> = <a class="code" href="a05583.html">_Hashtable<_Key, std::pair<const _Key, _Tp></a>,</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  _Alloc, __detail::_Select1st,</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  _Pred, _Hash,</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <a class="code" href="a05651.html">__detail::_Mod_range_hashing</a>,</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <a class="code" href="a05655.html">__detail::_Default_ranged_hash</a>,</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="a05659.html">__detail::_Prime_rehash_policy</a>, _Tr>;</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="comment"> /// Base types for unordered_multimap.</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keywordtype">bool</span> _Cache></div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="a01541.html#a1a55f2ace43a0a61a859367d227d245f"> 57</a></span>  <span class="keyword">using</span> <a class="code" href="a05615.html">__ummap_traits</a> = <a class="code" href="a05615.html">__detail::_Hashtable_traits<_Cache, false, false></a>;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">typename</span> _Hash = <a class="code" href="a02839.html">hash<_Key></a>,</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">typename</span> _Pred = <a class="code" href="a07367.html">std::equal_to<_Key></a>,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04707.html">std::allocator<std::pair<const _Key, _Tp></a> >,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">typename</span> _Tr = <a class="code" href="a05615.html">__ummap_traits<__cache_default<_Key, _Hash>::value</a>>></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__ummap_hashtable</a> = <a class="code" href="a05583.html">_Hashtable<_Key, std::pair<const _Key, _Tp></a>,</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _Alloc, __detail::_Select1st,</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  _Pred, _Hash,</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <a class="code" href="a05651.html">__detail::_Mod_range_hashing</a>,</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="a05655.html">__detail::_Default_ranged_hash</a>,</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="a05659.html">__detail::_Prime_rehash_policy</a>, _Tr>;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="a07995.html"> 73</a></span>  <span class="keyword">class </span><a class="code" href="a07995.html">unordered_multimap</a>;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"></span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> /**</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @brief A standard container composed of unique keys (containing</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * at most one of each key value) that associates values of another type</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * with the keys.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> *</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * @ingroup unordered_associative_containers</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> *</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * @tparam _Key Type of key objects.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * @tparam _Tp Type of mapped objects.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * @tparam _Hash Hashing function object type, defaults to hash<_Value>.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * @tparam _Pred Predicate function object type, defaults</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * to equal_to<_Value>.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to </span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * std::allocator<std::pair<const _Key, _Tp>>.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> *</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, and</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * <a href="tables.html#xx">unordered associative container</a></span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> *</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * The resulting value type of the container is std::pair<const _Key, _Tp>.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> *</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * Base is _Hashtable, dispatched at compile time via template</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * alias __umap_hashtable.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> */</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typename</span> _Hash = <a class="code" href="a02839.html">hash<_Key></a>,</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typename</span> _Pred = <a class="code" href="a07367.html">equal_to<_Key></a>,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04707.html">allocator<std::pair<const _Key, _Tp></a>>></div><div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="a07999.html"> 102</a></span>  <span class="keyword">class </span><a class="code" href="a07999.html">unordered_map</a></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">typedef</span> <a class="code" href="a05583.html">__umap_hashtable<_Key, _Tp, _Hash, _Pred, _Alloc></a> <a class="code" href="a05583.html">_Hashtable</a>;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="a05583.html">_Hashtable</a> _M_h;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// typedefs:</span><span class="comment"></span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"></span><span class="comment"> /// Public typedefs.</span></div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="a07999.html#ac563e7804340b706c3efeca91157585b"> 111</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_type <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>;</div><div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c"> 112</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::value_type <a class="code" href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c">value_type</a>;</div><div class="line"><a name="l00113"></a><span class="lineno"><a class="line" href="a07999.html#a6d830d6d91653672a6f20b748327622b"> 113</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::mapped_type <a class="code" href="a07999.html#a6d830d6d91653672a6f20b748327622b">mapped_type</a>;</div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e"> 114</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::hasher <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>;</div><div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc"> 115</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_equal <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>;</div><div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="a07999.html#a434ca8d37d3262f336f06903abbd170b"> 116</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::allocator_type <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>;<span class="comment"></span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"></span><span class="comment"> /// Iterator-related typedefs.</span></div><div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="a07999.html#ac0072ca4cb745124af7e8ae199b017c5"> 121</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::pointer <a class="code" href="a07999.html#ac0072ca4cb745124af7e8ae199b017c5">pointer</a>;</div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="a07999.html#a16fbc4a1f8abfebdee17e4d6303c03a3"> 122</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_pointer <a class="code" href="a07999.html#a16fbc4a1f8abfebdee17e4d6303c03a3">const_pointer</a>;</div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="a07999.html#a3e1eaafb2b3f1f11809491426d373485"> 123</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::reference <a class="code" href="a07999.html#a3e1eaafb2b3f1f11809491426d373485">reference</a>;</div><div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="a07999.html#aaa3ed5ea37fb02cd6a5eacf89409f52d"> 124</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_reference <a class="code" href="a07999.html#aaa3ed5ea37fb02cd6a5eacf89409f52d">const_reference</a>;</div><div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816"> 125</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::iterator <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a>;</div><div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3"> 126</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_iterator <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a>;</div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="a07999.html#aab940536a56eb520d8e7143ce5c4af3a"> 127</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::local_iterator <a class="code" href="a07999.html#aab940536a56eb520d8e7143ce5c4af3a">local_iterator</a>;</div><div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="a07999.html#af0cb2cf999f96def015e87c3cca6691d"> 128</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_local_iterator <a class="code" href="a07999.html#af0cb2cf999f96def015e87c3cca6691d">const_local_iterator</a>;</div><div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="a07999.html#acefc3dbfc16b70562f92193d01156479"> 129</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::size_type <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a>;</div><div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="a07999.html#aede8ad7332db3b16e68cec19c0dd963e"> 130</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::difference_type <a class="code" href="a07999.html#aede8ad7332db3b16e68cec19c0dd963e">difference_type</a>;<span class="comment"></span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"></span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">using</span> node_type = <span class="keyword">typename</span> _Hashtable::node_type;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">using</span> insert_return_type = <span class="keyword">typename</span> _Hashtable::insert_return_type;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">//construct/destroy/copy</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"></span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> /// Default constructor.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"></span> <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"></span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> /**</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> */</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="a07999.html#a743946b3813b8ec54b762a6edbae2934"> 151</a></span>  <a class="code" href="a07999.html#a743946b3813b8ec54b762a6edbae2934">unordered_map</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n,</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>& __hf = <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>(),</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>& __eql = <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(),</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a = <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>())</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  : _M_h(__n, __hf, __eql, __a)</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="comment"></span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> /**</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * @brief Builds an %unordered_map from a range.</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> *</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> * Create an %unordered_map consisting of copies of the elements from</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> * [__first,__last). This is linear in N (where N is</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> */</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="a07999.html#a94bb8e6f25731bdc01fb6c7b34022579"> 172</a></span>  <a class="code" href="a07999.html#a94bb8e6f25731bdc01fb6c7b34022579">unordered_map</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n = 0,</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>& __hf = <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>(),</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>& __eql = <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(),</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a = <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>())</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  : _M_h(__first, __last, __n, __hf, __eql, __a)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</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"> /// Copy constructor.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"></span> <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(<span class="keyword">const</span> <a class="code" href="a07999.html">unordered_map</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"></span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> /// Move constructor.</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"></span> <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(<a class="code" href="a07999.html">unordered_map</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"></span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> /**</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> * @brief Creates an %unordered_map with no elements.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> */</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00191"></a><span class="lineno"><a class="line" href="a07999.html#ac2f6c6ba48b39f7e17b4760d809ebf26"> 191</a></span>  <a class="code" href="a07999.html#ac2f6c6ba48b39f7e17b4760d809ebf26">unordered_map</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  : _M_h(__a)</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  { }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">/*</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * @brief Copy constructor with allocator argument.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * @param __uset Input %unordered_map to copy.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> */</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(<span class="keyword">const</span> <a class="code" href="a07999.html">unordered_map</a>& __umap,</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  : _M_h(__umap._M_h, __a)</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  { }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">/*</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> * @brief Move constructor with allocator argument.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> * @param __uset Input %unordered_map to move.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * @param __a An allocator object.</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>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(<a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>&& __umap,</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  : _M_h(<a class="code" href="a01541.html">std</a>::move(__umap._M_h), __a)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  { }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"></span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> /**</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> * @brief Builds an %unordered_map from an initializer_list.</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> *</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> * Create an %unordered_map consisting of copies of the elements in the</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> * list. This is linear in N (where N is @a __l.size()).</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> */</span></div><div class="line"><a name="l00226"></a><span class="lineno"><a class="line" href="a07999.html#acae490543303c7ea2365e5a53bc7d131"> 226</a></span>  <a class="code" href="a07999.html#acae490543303c7ea2365e5a53bc7d131">unordered_map</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n = 0,</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>& __hf = <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>(),</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>& __eql = <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(),</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a = <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>())</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  : _M_h(__l, __n, __hf, __eql, __a)</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  { }</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  : <a class="code" href="a07999.html">unordered_map</a>(__n, <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>(), <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(), __a)</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  { }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>& __hf,</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  : <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(__n, __hf, <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(), __a)</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  { }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n,</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  : <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(__first, __last, __n, <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>(), <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(), __a)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  { }</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>& __hf,</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  : <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(__first, __last, __n, __hf, <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(), __a)</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  { }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n,</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  : <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(__l, __n, <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>(), <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(), __a)</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  { }</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a>& __hf,</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a>& __a)</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  : <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>(__l, __n, __hf, <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a>(), __a)</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  { }</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"></span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> /// Copy assignment operator.</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"></span> <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>&</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="a07999.html#aca0525353d274a1abca19e123ca58702">operator=</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"></span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> /// Move assignment operator.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"></span> <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>&</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="a07999.html#aca0525353d274a1abca19e123ca58702">operator=</a>(<a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>&&) = <span class="keywordflow">default</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"> /**</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> * @brief %Unordered_map list assignment operator.</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> *</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> * This function fills an %unordered_map with copies of the elements in</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"> * the initializer list @a __l.</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"> *</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"> * Note that the assignment completely changes the %unordered_map and</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"> * that the resulting %unordered_map's size is the same as the number</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> * of elements assigned.</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> */</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">unordered_map</a>&</div><div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="a07999.html#a46087d4d85698c13e7fe5e10f13821d1"> 289</a></span>  <a class="code" href="a07999.html#a46087d4d85698c13e7fe5e10f13821d1">operator=</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</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>  _M_h = __l;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"></span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> /// Returns the allocator object used by the %unordered_map.</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"></span> <a class="code" href="a07999.html#a434ca8d37d3262f336f06903abbd170b">allocator_type</a></div><div class="line"><a name="l00297"></a><span class="lineno"><a class="line" href="a07999.html#a13808c3062786f090b1af63937f15963"> 297</a></span>  <a class="code" href="a07999.html#a13808c3062786f090b1af63937f15963">get_allocator</a>() const noexcept</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  { <span class="keywordflow">return</span> _M_h.get_allocator(); }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// size and capacity:</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"></span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> /// Returns true if the %unordered_map is empty.</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"></span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00304"></a><span class="lineno"><a class="line" href="a07999.html#a4d72f478fb0cd05cc612e7ac746131ac"> 304</a></span>  <a class="code" href="a07999.html#a4d72f478fb0cd05cc612e7ac746131ac">empty</a>() const noexcept</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  { <span class="keywordflow">return</span> _M_h.empty(); }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment"></span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"> /// Returns the size of the %unordered_map.</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"></span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l00309"></a><span class="lineno"><a class="line" href="a07999.html#a7d1de2c7389176716aceeaba3b1c2bb7"> 309</a></span>  <a class="code" href="a07999.html#a7d1de2c7389176716aceeaba3b1c2bb7">size</a>() const noexcept</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  { <span class="keywordflow">return</span> _M_h.size(); }</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"></span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> /// Returns the maximum size of the %unordered_map.</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"></span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l00314"></a><span class="lineno"><a class="line" href="a07999.html#a695e48bcb2fa9e91ad07d3f7c45016dd"> 314</a></span>  <a class="code" href="a07999.html#a695e48bcb2fa9e91ad07d3f7c45016dd">max_size</a>() const noexcept</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  { <span class="keywordflow">return</span> _M_h.max_size(); }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// iterators.</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"></span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"> /**</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> * Returns a read/write iterator that points to the first element in the</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> */</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00324"></a><span class="lineno"><a class="line" href="a07999.html#ac90866b0f04d5366339b63f8e26bde06"> 324</a></span>  <a class="code" href="a07999.html#ac90866b0f04d5366339b63f8e26bde06">begin</a>() noexcept</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"></span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"> * element in the %unordered_map.</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment"> */</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a></div><div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="a07999.html#a9d409d14c46998843b60af82785dfd80"> 333</a></span>  <a class="code" href="a07999.html#a9d409d14c46998843b60af82785dfd80">begin</a>() const noexcept</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a></div><div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="a07999.html#af9610ba94f6f17e7af50d7280638fa17"> 337</a></span>  <a class="code" href="a07999.html#af9610ba94f6f17e7af50d7280638fa17">cbegin</a>() const noexcept</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  { <span class="keywordflow">return</span> _M_h.begin(); }<span class="comment"></span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> /**</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> * Returns a read/write iterator that points one past the last element in</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> * the %unordered_map.</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> */</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="a07999.html#a42872e15c417c6f944d019315553951e"> 346</a></span>  <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>() noexcept</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  { <span class="keywordflow">return</span> _M_h.end(); }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"></span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> * element in the %unordered_map.</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> */</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a></div><div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="a07999.html#a6b763e0c9c40786e19c26f5fa97e3ab6"> 355</a></span>  <a class="code" href="a07999.html#a6b763e0c9c40786e19c26f5fa97e3ab6">end</a>() const noexcept</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  { <span class="keywordflow">return</span> _M_h.end(); }</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>  <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a></div><div class="line"><a name="l00359"></a><span class="lineno"><a class="line" href="a07999.html#ab862dadbaf3147cfc02bd383ed35e1f9"> 359</a></span>  <a class="code" href="a07999.html#ab862dadbaf3147cfc02bd383ed35e1f9">cend</a>() const noexcept</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  { <span class="keywordflow">return</span> _M_h.end(); }<span class="comment"></span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"></span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// modifiers.</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"></span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"> /**</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"> *</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> * @param __args Arguments used to generate a new pair instance (see</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"> * std::piecewise_contruct for passing arguments to each</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment"> * part of the pair constructor).</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment"> *</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment"> * to the possibly inserted pair, and the second is a bool that</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment"> * is true if the pair was actually inserted.</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> *</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> * This function attempts to build and insert a (key, value) %pair into</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> * the %unordered_map.</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> * An %unordered_map relies on unique keys and thus a %pair is only</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> * inserted if its first element (the key) is not already present in the</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> *</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> */</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00387"></a><span class="lineno"><a class="line" href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0"> 387</a></span>  <a class="code" href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  { <span class="keywordflow">return</span> _M_h.emplace(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"></span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> /**</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> *</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the pair</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> * should be inserted.</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> * @param __args Arguments used to generate a new pair instance (see</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"> * std::piecewise_contruct for passing arguments to each</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> * part of the pair constructor).</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * @return An iterator that points to the element with key of the</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> * std::pair built from @a __args (may or may not be that</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"> * std::pair).</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> *</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> * and thus does not return a boolean like the single-argument emplace()</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * does.</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> *</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> * See</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> *</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> */</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00418"></a><span class="lineno"><a class="line" href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e"> 418</a></span>  <a class="code" href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e">emplace_hint</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __pos, _Args&&... __args)</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  { <span class="keywordflow">return</span> _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"></span> node_type</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  extract(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __pos)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  {</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  __glibcxx_assert(__pos != <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>());</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">return</span> _M_h.extract(__pos);</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"></span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"></span> node_type</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  extract(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __key)</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  { <span class="keywordflow">return</span> _M_h.extract(__key); }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"></span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"></span> insert_return_type</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <a class="code" href="a07999.html#a047d2b3433747276ee6daa9eba154295">insert</a>(node_type&& __nh)</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node(std::move(__nh)); }</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"></span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"></span> <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="a07999.html#a047d2b3433747276ee6daa9eba154295">insert</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a>, node_type&& __nh)</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node(std::move(__nh)).position; }</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="preprocessor">#define __cpp_lib_unordered_map_try_emplace 201411</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> /**</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment"> *</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment"> * @param __k Key to use for finding a possibly existing pair in</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> * the unordered_map.</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"> * @param __args Arguments used to generate the .second for a </span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> * new pair instance.</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> *</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> * to the possibly inserted pair, and the second is a bool that</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"> * is true if the pair was actually inserted.</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> *</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> * This function attempts to build and insert a (key, value) %pair into</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> * the %unordered_map.</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> * An %unordered_map relies on unique keys and thus a %pair is only</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> * inserted if its first element (the key) is not already present in the</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> * If a %pair is not inserted, this function has no effect.</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> *</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> */</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">template</span> <<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  pair<iterator, bool></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  try_emplace(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k, _Args&&... __args)</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  {</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  __i = <a class="code" href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0">emplace</a>(<a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  std::forward_as_tuple(__k),</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  std::forward_as_tuple(</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  std::forward<_Args>(__args)...))</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  .first;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">true</span>};</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">false</span>};</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> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// move-capable overload</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keyword">template</span> <<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  pair<iterator, bool></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  try_emplace(<a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>&& __k, _Args&&... __args)</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>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</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>  __i = <a class="code" href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0">emplace</a>(<a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  std::forward_as_tuple(std::move(__k)),</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  std::forward_as_tuple(</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  std::forward<_Args>(__args)...))</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  .first;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">true</span>};</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">false</span>};</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"></span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment"> /**</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="comment"> * %unordered_map.</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"> * @param __hint An iterator that serves as a hint as to where the pair</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"> * should be inserted.</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="comment"> * @param __k Key to use for finding a possibly existing pair in</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="comment"> * the unordered_map.</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="comment"> * @param __args Arguments used to generate the .second for a </span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment"> * new pair instance.</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment"> * @return An iterator that points to the element with key of the</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment"> * std::pair built from @a __args (may or may not be that</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="comment"> * std::pair).</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"> *</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment"> * and thus does not return a boolean like the single-argument emplace()</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment"> * does. However, if insertion did not take place,</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment"> * this function has no effect.</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment"> *</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> * See</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> *</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> */</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">template</span> <<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  try_emplace(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, <span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k,</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  _Args&&... __args)</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="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  __i = <a class="code" href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e">emplace_hint</a>(__hint, <a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  std::forward_as_tuple(__k),</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  std::forward_as_tuple(</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  std::forward<_Args>(__args)...));</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">return</span> __i;</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// move-capable overload</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keyword">template</span> <<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  try_emplace(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>&& __k, _Args&&... __args)</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  {</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  __i = <a class="code" href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e">emplace_hint</a>(__hint, <a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  std::forward_as_tuple(std::move(__k)),</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  std::forward_as_tuple(</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  std::forward<_Args>(__args)...));</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">return</span> __i;</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="preprocessor">#endif // C++17</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"></span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> * @brief Attempts to insert a std::pair into the %unordered_map.</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"></span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> * @param __x Pair to be inserted (see std::make_pair for easy</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> * creation of pairs).</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> *</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> * @return A pair, of which the first element is an iterator that </span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> * points to the possibly inserted pair, and the second is </span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * a bool that is true if the pair was actually inserted.</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> *</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> * This function attempts to insert a (key, value) %pair into the</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> * %unordered_map. An %unordered_map relies on unique keys and thus a</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="comment"> * %pair is only inserted if its first element (the key) is not already</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"> * present in the %unordered_map.</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="comment"> *</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> */</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00579"></a><span class="lineno"><a class="line" href="a07999.html#a047d2b3433747276ee6daa9eba154295"> 579</a></span>  <a class="code" href="a07999.html#a047d2b3433747276ee6daa9eba154295">insert</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c">value_type</a>& __x)</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  { <span class="keywordflow">return</span> _M_h.insert(__x); }</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// 2354. Unnecessary copying when inserting into maps with braced-init</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00585"></a><span class="lineno"><a class="line" href="a07999.html#adb80cc201b9b5b821e8ef73492106db3"> 585</a></span>  <a class="code" href="a07999.html#adb80cc201b9b5b821e8ef73492106db3">insert</a>(<a class="code" href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c">value_type</a>&& __x)</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  { <span class="keywordflow">return</span> _M_h.insert(std::move(__x)); }</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> </div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  __enable_if_t<is_constructible<value_type, _Pair&&>::value,</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <a class="code" href="a07767.html">pair<iterator, bool></a>></div><div class="line"><a name="l00591"></a><span class="lineno"><a class="line" href="a07999.html#aae182defe617c8d37e27b27b09277ea9"> 591</a></span>  <a class="code" href="a07999.html#aae182defe617c8d37e27b27b09277ea9">insert</a>(_Pair&& __x)</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  { <span class="keywordflow">return</span> _M_h.emplace(std::forward<_Pair>(__x)); }<span class="comment"></span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> * @brief Attempts to insert a std::pair into the %unordered_map.</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment"> * @param __hint An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> * pair should be inserted.</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"> * @param __x Pair to be inserted (see std::make_pair for easy creation</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> * of pairs).</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * @a __x (may or may not be the %pair passed in).</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> *</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * and thus does not return a boolean like the single-argument insert()</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * does. Note that the first parameter is only a hint and can</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="comment"> *</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="comment"> * See</span></div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> *</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment"> */</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00618"></a><span class="lineno"><a class="line" href="a07999.html#a3eb7753105411145e2d8476cf300b348"> 618</a></span>  <a class="code" href="a07999.html#a3eb7753105411145e2d8476cf300b348">insert</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, <span class="keyword">const</span> <a class="code" href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c">value_type</a>& __x)</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, __x); }</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// 2354. Unnecessary copying when inserting into maps with braced-init</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00624"></a><span class="lineno"><a class="line" href="a07999.html#a01d23be5cd83c13117d269bc1df1488f"> 624</a></span>  <a class="code" href="a07999.html#a01d23be5cd83c13117d269bc1df1488f">insert</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, <a class="code" href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c">value_type</a>&& __x)</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, std::move(__x)); }</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> </div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  __enable_if_t<is_constructible<value_type, _Pair&&>::value, <a class="code" href="a07675.html">iterator</a>></div><div class="line"><a name="l00629"></a><span class="lineno"><a class="line" href="a07999.html#ae4f015606d8e138c72eb87ce5f89ed50"> 629</a></span>  <a class="code" href="a07999.html#ae4f015606d8e138c72eb87ce5f89ed50">insert</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, _Pair&& __x)</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  { <span class="keywordflow">return</span> _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }<span class="comment"></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"></span><span class="comment"></span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment"> /**</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment"> * @brief A template function that attempts to insert a range of</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> *</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> */</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00644"></a><span class="lineno"><a class="line" href="a07999.html#a0c40f8641ff4ca47fe2998a46404cf37"> 644</a></span>  <a class="code" href="a07999.html#a0c40f8641ff4ca47fe2998a46404cf37">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  { _M_h.insert(__first, __last); }</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"></span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"> /**</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment"> * @brief Attempts to insert a list of elements into the %unordered_map.</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment"> * to be inserted.</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment"> *</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment"> */</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00655"></a><span class="lineno"><a class="line" href="a07999.html#a191d1d95c2d102dc1057677df000aaec"> 655</a></span>  <a class="code" href="a07999.html#a191d1d95c2d102dc1057677df000aaec">insert</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  { _M_h.insert(__l); }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> </div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="preprocessor">#define __cpp_lib_unordered_map_insertion 201411</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> <span class="comment"> /**</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="comment"> * @brief Attempts to insert a std::pair into the %unordered_map.</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"> * @param __k Key to use for finding a possibly existing pair in</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"> * the map.</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> * @param __obj Argument used to generate the .second for a pair </span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="comment"> * instance.</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> <span class="comment"> *</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="comment"> * @return A pair, of which the first element is an iterator that </span></div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="comment"> * points to the possibly inserted pair, and the second is </span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment"> * a bool that is true if the pair was actually inserted.</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"> *</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment"> * This function attempts to insert a (key, value) %pair into the</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment"> * %unordered_map. An %unordered_map relies on unique keys and thus a</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment"> * %pair is only inserted if its first element (the key) is not already</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="comment"> * present in the %unordered_map.</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="comment"> * If the %pair was already in the %unordered_map, the .second of </span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> * the %pair is assigned from __obj.</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> *</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> */</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Obj></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <a class="code" href="a07767.html">pair<iterator, bool></a></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  insert_or_assign(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k, _Obj&& __obj)</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <a class="code" href="a07675.html">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  __i = <a class="code" href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0">emplace</a>(<a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  std::forward_as_tuple(__k),</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  std::forward_as_tuple(std::forward<_Obj>(__obj)))</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  .first;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">true</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>  (*__i).second = std::forward<_Obj>(__obj);</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">false</span>};</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  }</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> </div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// move-capable overload</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Obj></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  pair<iterator, bool></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  insert_or_assign(<a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>&& __k, _Obj&& __obj)</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  {</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  {</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  __i = <a class="code" href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0">emplace</a>(<a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  std::forward_as_tuple(std::move(__k)),</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  std::forward_as_tuple(std::forward<_Obj>(__obj)))</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  .first;</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">true</span>};</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  }</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  (*__i).second = std::forward<_Obj>(__obj);</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">return</span> {__i, <span class="keyword">false</span>};</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  }</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment"></span></div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment"> /**</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment"> * @brief Attempts to insert a std::pair into the %unordered_map.</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment"> * @param __hint An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment"> * pair should be inserted.</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment"> * @param __k Key to use for finding a possibly existing pair in</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment"> * the unordered_map.</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="comment"> * @param __obj Argument used to generate the .second for a pair </span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment"> * instance.</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="comment"> * @a __x (may or may not be the %pair passed in).</span></div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> <span class="comment"> *</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment"> * and thus does not return a boolean like the single-argument insert()</span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span> <span class="comment"> * does. </span></div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> <span class="comment"> * If the %pair was already in the %unordered map, the .second of</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="comment"> * the %pair is assigned from __obj.</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"> * Note that the first parameter is only a hint and can</span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment"> *</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment"> * See</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"> *</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> */</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Obj></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  insert_or_assign(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, <span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k,</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  _Obj&& __obj)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  {</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  {</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">return</span> <a class="code" href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e">emplace_hint</a>(__hint, <a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  std::forward_as_tuple(__k),</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  std::forward_as_tuple(</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  std::forward<_Obj>(__obj)));</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  }</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  (*__i).second = std::forward<_Obj>(__obj);</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keywordflow">return</span> __i;</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  }</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// move-capable overload</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Obj></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  insert_or_assign(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __hint, <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>&& __k, _Obj&& __obj)</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>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __i = <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(__k);</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a07999.html#a42872e15c417c6f944d019315553951e">end</a>())</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordflow">return</span> <a class="code" href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e">emplace_hint</a>(__hint, <a class="code" href="a01480.html#ga4be4b722e942cd646f19614bcff7a328">std::piecewise_construct</a>,</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  std::forward_as_tuple(std::move(__k)),</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  std::forward_as_tuple(</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  std::forward<_Obj>(__obj)));</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  (*__i).second = std::forward<_Obj>(__obj);</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordflow">return</span> __i;</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  }</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="comment"></span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> <span class="comment"> * @brief Erases an element from an %unordered_map.</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="comment"> * @a __position prior to the element being erased. If no such</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="comment"> *</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> <span class="comment"> * from an %unordered_map.</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="comment"> * Note that this function only erases the element, and that if the</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> <span class="comment"> * element is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span> <span class="comment"> */</span></div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a></div><div class="line"><a name="l00792"></a><span class="lineno"><a class="line" href="a07999.html#adef61b0f6b1e43cfdb648e247277ba00"> 792</a></span>  <a class="code" href="a07999.html#adef61b0f6b1e43cfdb648e247277ba00">erase</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __position)</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> </div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="comment">// LWG 2059.</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00797"></a><span class="lineno"><a class="line" href="a07999.html#ab04b983f5337e79f121f2df4bbaa283c"> 797</a></span>  <a class="code" href="a07999.html#ab04b983f5337e79f121f2df4bbaa283c">erase</a>(<a class="code" href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">iterator</a> __position)</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }<span class="comment"></span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="comment"> /**</span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> <span class="comment"> * @param __x Key of element to be erased.</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="comment"> * @return The number of elements erased.</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="comment"> *</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="comment"> * This function erases all the elements located by the given key from</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="comment"> * an %unordered_map. For an %unordered_map the result of this function</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="comment"> * can only be 0 (not present) or 1 (present).</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> <span class="comment"> * Note that this function only erases the element, and that if the</span></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> <span class="comment"> * element is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> <span class="comment"> */</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l00814"></a><span class="lineno"><a class="line" href="a07999.html#a56149c061cd4aca92d631f7ad5a5a737"> 814</a></span>  <a class="code" href="a07999.html#a56149c061cd4aca92d631f7ad5a5a737">erase</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __x)</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  { <span class="keywordflow">return</span> _M_h.erase(__x); }</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment"></span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment"> /**</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from an</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> <span class="comment"> * %unordered_map.</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="comment"> * @return The iterator @a __last.</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> <span class="comment"> *</span></div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> <span class="comment"> * This function erases a sequence of elements from an %unordered_map.</span></div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> <span class="comment"> * Note that this function only erases the elements, and that if</span></div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment"> */</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00832"></a><span class="lineno"><a class="line" href="a07999.html#a1b17775816c782568baefd357cd50e88"> 832</a></span>  <a class="code" href="a07999.html#a1b17775816c782568baefd357cd50e88">erase</a>(<a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __first, <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a> __last)</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  { <span class="keywordflow">return</span> _M_h.erase(__first, __last); }</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"></span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> <span class="comment"> /**</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="comment"> * Erases all elements in an %unordered_map.</span></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment"> * Note that this function only erases the elements, and that if the</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> <span class="comment"> * elements themselves are pointers, the pointed-to memory is not touched</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> <span class="comment"> */</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00842"></a><span class="lineno"><a class="line" href="a07999.html#a9728c777ec0429619531a26201560c18"> 842</a></span>  <a class="code" href="a07999.html#a9728c777ec0429619531a26201560c18">clear</a>() noexcept</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  { _M_h.clear(); }</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> <span class="comment"></span></div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="comment"> /**</span></div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="comment"> * @brief Swaps data with another %unordered_map.</span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span> <span class="comment"> * @param __x An %unordered_map of the same element and allocator</span></div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> <span class="comment"> * types.</span></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="comment"> *</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span> <span class="comment"> * This exchanges the elements between two %unordered_map in constant</span></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span> <span class="comment"> * time.</span></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="comment"> * std::swap(m1,m2) will feed to this function.</span></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="comment"> */</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00856"></a><span class="lineno"><a class="line" href="a07999.html#ae06bac0d1fbee8603ec2ac806950b1ba"> 856</a></span>  <a class="code" href="a07999.html#ae06bac0d1fbee8603ec2ac806950b1ba">swap</a>(<a class="code" href="a07999.html">unordered_map</a>& __x)</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  noexcept( noexcept(_M_h.swap(__x._M_h)) )</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  { _M_h.swap(__x._M_h); }</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span> </div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keyword">friend</span> <span class="keyword">class </span>std::_Hash_merge_helper;</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> </div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  merge(<a class="code" href="a07999.html">unordered_map<_Key, _Tp, _H2, _P2, _Alloc></a>& __source)</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  {</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keyword">using</span> _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  }</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> </div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  { merge(__source); }</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="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  {</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keyword">using</span> _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));</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> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  { merge(__source); }</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> </div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// observers.</span></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span> <span class="comment"></span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span> <span class="comment"> /// Returns the hash functor object with which the %unordered_map was</span></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span> <span class="comment"> /// constructed.</span></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> <span class="comment"></span> <a class="code" href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">hasher</a></div><div class="line"><a name="l00896"></a><span class="lineno"><a class="line" href="a07999.html#ac9588299378201162e3f7da7e7d30fdf"> 896</a></span>  <a class="code" href="a07999.html#ac9588299378201162e3f7da7e7d30fdf">hash_function</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.hash_function(); }</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> <span class="comment"></span></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="comment"> /// Returns the key comparison object with which the %unordered_map was</span></div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> <span class="comment"> /// constructed.</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> <span class="comment"></span> <a class="code" href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">key_equal</a></div><div class="line"><a name="l00902"></a><span class="lineno"><a class="line" href="a07999.html#aa956e7eb800e72fbab9b54f3ef006d8e"> 902</a></span>  <a class="code" href="a07999.html#aa956e7eb800e72fbab9b54f3ef006d8e">key_eq</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.key_eq(); }</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> </div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// lookup.</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> <span class="comment"></span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> * @brief Tries to locate an element in an %unordered_map.</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment"> * found.</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> <span class="comment"> *</span></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</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>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00920"></a><span class="lineno"><a class="line" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40"> 920</a></span>  <a class="code" href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">find</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __x)</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  { <span class="keywordflow">return</span> _M_h.find(__x); }</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span> </div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <a class="code" href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">const_iterator</a></div><div class="line"><a name="l00924"></a><span class="lineno"><a class="line" href="a07999.html#a589217c1b2ed3f77f57aeb41d5192d0d"> 924</a></span>  <a class="code" href="a07999.html#a589217c1b2ed3f77f57aeb41d5192d0d">find</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.find(__x); }<span class="comment"></span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> <span class="comment"> /**</span></div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="comment"> * @brief Finds the number of elements.</span></div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment"> * @param __x Key to count.</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment"> * @return Number of elements with specified key.</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment"> *</span></div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="comment"> * This function only makes sense for %unordered_multimap; for</span></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="comment"> * %unordered_map the result will either be 0 (not present) or 1</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="comment"> * (present).</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> <span class="comment"> */</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l00938"></a><span class="lineno"><a class="line" href="a07999.html#a4cbd19e5e859635c70822a7e1faa8e36"> 938</a></span>  <a class="code" href="a07999.html#a4cbd19e5e859635c70822a7e1faa8e36">count</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.count(__x); }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="comment"></span></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span> <span class="comment"> *</span></div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="comment"> * This function probably only makes sense for %unordered_multimap.</span></div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> <span class="comment"> */</span></div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <a class="code" href="a07767.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l00951"></a><span class="lineno"><a class="line" href="a07999.html#a301e117827c134ed289b5d19e5c8a36e"> 951</a></span>  <a class="code" href="a07999.html#a301e117827c134ed289b5d19e5c8a36e">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __x)</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  { <span class="keywordflow">return</span> _M_h.equal_range(__x); }</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> </div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <a class="code" href="a07767.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l00955"></a><span class="lineno"><a class="line" href="a07999.html#a21e644ce722b02f5304757ea9be5b23e"> 955</a></span>  <a class="code" href="a07999.html#a21e644ce722b02f5304757ea9be5b23e">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.equal_range(__x); }<span class="comment"></span></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span> <span class="comment"> * @brief Subscript ( @c [] ) access to %unordered_map data.</span></div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> <span class="comment"> * @param __k The key for which data should be retrieved.</span></div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span> <span class="comment"> * @return A reference to the data of the (key,data) %pair.</span></div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="comment"> *</span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="comment"> * Allows for easy lookup with the subscript ( @c [] )operator. Returns</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="comment"> * data associated with the key specified in subscript. If the key does</span></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="comment"> * not exist, a pair with that key is created using default values, which</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span> <span class="comment"> * is then returned.</span></div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span> <span class="comment"> *</span></div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="comment"> * Lookup requires constant time.</span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> */</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <a class="code" href="a07999.html#a6d830d6d91653672a6f20b748327622b">mapped_type</a>&</div><div class="line"><a name="l00973"></a><span class="lineno"><a class="line" href="a07999.html#a2d7a21a98b09239b8745900308e63643"> 973</a></span>  <a class="code" href="a07999.html#a2d7a21a98b09239b8745900308e63643">operator[]</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k)</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  { <span class="keywordflow">return</span> _M_h[__k]; }</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>  <a class="code" href="a07999.html#a6d830d6d91653672a6f20b748327622b">mapped_type</a>&</div><div class="line"><a name="l00977"></a><span class="lineno"><a class="line" href="a07999.html#a21d659d8a7b18d41726d04ed6451d1ce"> 977</a></span>  <a class="code" href="a07999.html#a21d659d8a7b18d41726d04ed6451d1ce">operator[]</a>(<a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>&& __k)</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  { <span class="keywordflow">return</span> _M_h[std::move(__k)]; }<span class="comment"></span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="comment"> * @brief Access to %unordered_map data.</span></div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="comment"> * @param __k The key for which data should be retrieved.</span></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="comment"> * @return A reference to the data whose key is equal to @a __k, if</span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment"> * such a data is present in the %unordered_map.</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="comment"> * @throw std::out_of_range If no such data is present.</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="comment"> */</span></div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <a class="code" href="a07999.html#a6d830d6d91653672a6f20b748327622b">mapped_type</a>&</div><div class="line"><a name="l00990"></a><span class="lineno"><a class="line" href="a07999.html#a801392267ec716837238015f8cefe60a"> 990</a></span>  <a class="code" href="a07999.html#a801392267ec716837238015f8cefe60a">at</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k)</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  { <span class="keywordflow">return</span> _M_h.at(__k); }</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> </div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keyword">const</span> <a class="code" href="a07999.html#a6d830d6d91653672a6f20b748327622b">mapped_type</a>&</div><div class="line"><a name="l00994"></a><span class="lineno"><a class="line" href="a07999.html#a1f78ebfeb9bf55bc807a075eb22cb2aa"> 994</a></span>  <a class="code" href="a07999.html#a1f78ebfeb9bf55bc807a075eb22cb2aa">at</a>(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __k)<span class="keyword"> const</span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.at(__k); }<span class="comment"></span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="comment"></span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="comment">// bucket interface.</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> <span class="comment"></span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> <span class="comment"> /// Returns the number of buckets of the %unordered_map.</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="comment"></span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l01002"></a><span class="lineno"><a class="line" href="a07999.html#ac8a1a3c1d13adf8908c863a707fa40aa"> 1002</a></span>  <a class="code" href="a07999.html#ac8a1a3c1d13adf8908c863a707fa40aa">bucket_count</a>() const noexcept</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  { <span class="keywordflow">return</span> _M_h.bucket_count(); }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> <span class="comment"></span></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="comment"> /// Returns the maximum number of buckets of the %unordered_map.</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> <span class="comment"></span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l01007"></a><span class="lineno"><a class="line" href="a07999.html#af29f5a18a09a36adb720b6907e45eacd"> 1007</a></span>  <a class="code" href="a07999.html#af29f5a18a09a36adb720b6907e45eacd">max_bucket_count</a>() const noexcept</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  { <span class="keywordflow">return</span> _M_h.max_bucket_count(); }</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="comment">/*</span></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> <span class="comment"> * @brief Returns the number of elements in a given bucket.</span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> <span class="comment"> * @param __n A bucket index.</span></div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> <span class="comment"> * @return The number of elements in the bucket.</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> <span class="comment"> */</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  bucket_size(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket_size(__n); }</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> </div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="comment">/*</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="comment"> * @brief Returns the bucket index of a given element.</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="comment"> * @param __key A key instance.</span></div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> <span class="comment"> * @return The key bucket index.</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment"> */</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  bucket(<span class="keyword">const</span> <a class="code" href="a07999.html#ac563e7804340b706c3efeca91157585b">key_type</a>& __key)<span class="keyword"> const</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket(__key); }</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="comment"></span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment"> /**</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment"> * @brief Returns a read/write iterator pointing to the first bucket</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="comment"> * element.</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="comment"> * @return A read/write local iterator.</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>  <a class="code" href="a07999.html#aab940536a56eb520d8e7143ce5c4af3a">local_iterator</a></div><div class="line"><a name="l01035"></a><span class="lineno"><a class="line" href="a07999.html#ae0eddd81ee3d218ade072a8becffaff6"> 1035</a></span>  <a class="code" href="a07999.html#ae0eddd81ee3d218ade072a8becffaff6">begin</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  { <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="comment"></span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to the first</span></div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="comment"> * bucket element.</span></div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span> <span class="comment"> * @return A read-only local iterator.</span></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>  <a class="code" href="a07999.html#af0cb2cf999f96def015e87c3cca6691d">const_local_iterator</a></div><div class="line"><a name="l01046"></a><span class="lineno"><a class="line" href="a07999.html#a73cb0bbad75ff10a8493cdb155b81146"> 1046</a></span>  <a class="code" href="a07999.html#a73cb0bbad75ff10a8493cdb155b81146">begin</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> </div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <a class="code" href="a07999.html#af0cb2cf999f96def015e87c3cca6691d">const_local_iterator</a></div><div class="line"><a name="l01050"></a><span class="lineno"><a class="line" href="a07999.html#a326f910adabc220031b93dc6b472b913"> 1050</a></span>  <a class="code" href="a07999.html#a326f910adabc220031b93dc6b472b913">cbegin</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cbegin(__n); }<span class="comment"></span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span> <span class="comment"> /**</span></div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> <span class="comment"> * @brief Returns a read/write iterator pointing to one past the last</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> <span class="comment"> * bucket elements.</span></div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="comment"> * @return A read/write local iterator.</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="comment"> */</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <a class="code" href="a07999.html#aab940536a56eb520d8e7143ce5c4af3a">local_iterator</a></div><div class="line"><a name="l01061"></a><span class="lineno"><a class="line" href="a07999.html#ab91675efcde6f50894587cdb2037a4fc"> 1061</a></span>  <a class="code" href="a07999.html#ab91675efcde6f50894587cdb2037a4fc">end</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  { <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="comment"></span></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to one past</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="comment"> * the last bucket elements.</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"> */</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <a class="code" href="a07999.html#af0cb2cf999f96def015e87c3cca6691d">const_local_iterator</a></div><div class="line"><a name="l01072"></a><span class="lineno"><a class="line" href="a07999.html#a606977180c30d7a49a36846a45f4e355"> 1072</a></span>  <a class="code" href="a07999.html#a606977180c30d7a49a36846a45f4e355">end</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.end(__n); }</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>  <a class="code" href="a07999.html#af0cb2cf999f96def015e87c3cca6691d">const_local_iterator</a></div><div class="line"><a name="l01076"></a><span class="lineno"><a class="line" href="a07999.html#a786093f27f238f88c21ecbfe11e27981"> 1076</a></span>  <a class="code" href="a07999.html#a786093f27f238f88c21ecbfe11e27981">cend</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cend(__n); }<span class="comment"></span></div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> <span class="comment"></span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="comment">// hash policy.</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> <span class="comment"></span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> <span class="comment"> /// Returns the average number of elements per bucket.</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l01084"></a><span class="lineno"><a class="line" href="a07999.html#add961e22f4549e2c94846946fbd25a7d"> 1084</a></span>  <a class="code" href="a07999.html#add961e22f4549e2c94846946fbd25a7d">load_factor</a>() const noexcept</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  { <span class="keywordflow">return</span> _M_h.load_factor(); }</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> <span class="comment"></span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> <span class="comment"> /// Returns a positive number that the %unordered_map tries to keep the</span></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> <span class="comment"> /// load factor less than or equal to.</span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l01090"></a><span class="lineno"><a class="line" href="a07999.html#ae2f58d908f2e03656fce158550d9ba73"> 1090</a></span>  <a class="code" href="a07999.html#ae2f58d908f2e03656fce158550d9ba73">max_load_factor</a>() const noexcept</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  { <span class="keywordflow">return</span> _M_h.max_load_factor(); }</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="comment"></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"> * @brief Change the %unordered_map maximum load factor.</span></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span> <span class="comment"> * @param __z The new maximum load factor.</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="keywordtype">void</span></div><div class="line"><a name="l01098"></a><span class="lineno"><a class="line" href="a07999.html#a0584274b6378b6d962debbe96f5c5cb6"> 1098</a></span>  <a class="code" href="a07999.html#a0584274b6378b6d962debbe96f5c5cb6">max_load_factor</a>(<span class="keywordtype">float</span> __z)</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  { _M_h.max_load_factor(__z); }</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"> /**</span></div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> <span class="comment"> * @brief May rehash the %unordered_map.</span></div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> <span class="comment"> * @param __n The new number of buckets.</span></div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="comment"> *</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="comment"> * Rehash will occur only if the new number of buckets respect the</span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <span class="comment"> * %unordered_map maximum load factor.</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> <span class="comment"> */</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01109"></a><span class="lineno"><a class="line" href="a07999.html#af81fbed78a715d3c81e8c7655669c7e7"> 1109</a></span>  <a class="code" href="a07999.html#af81fbed78a715d3c81e8c7655669c7e7">rehash</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  { _M_h.rehash(__n); }</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> <span class="comment"></span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> <span class="comment"> /**</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> <span class="comment"> * @brief Prepare the %unordered_map for a specified number of</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> <span class="comment"> * @param __n Number of elements required.</span></div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> <span class="comment"> *</span></div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> <span class="comment"> * Same as rehash(ceil(n / max_load_factor())).</span></div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> <span class="comment"> */</span></div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01120"></a><span class="lineno"><a class="line" href="a07999.html#a2eee23bd13796426f3018c8a9341202f"> 1120</a></span>  <a class="code" href="a07999.html#a2eee23bd13796426f3018c8a9341202f">reserve</a>(<a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">size_type</a> __n)</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  { _M_h.reserve(__n); }</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> </div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key1, <span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Pred1,</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">typename</span> _Alloc1></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  operator==(<span class="keyword">const</span> <a class="code" href="a07999.html">unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1></a>&,</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keyword">const</span> <a class="code" href="a07999.html">unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1></a>&);</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  };</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span> </div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></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>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keyword">typename</span> _Hash = hash<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keyword">typename</span> _Pred = equal_to<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keyword">typename</span> _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  unordered_map(_InputIterator, _InputIterator,</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">typename</span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">unordered_map<int, int>::size_type</a> = {},</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  -> unordered_map<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  __iter_val_t<_InputIterator>,</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> </div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash = hash<_Key>,</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="keyword">typename</span> _Pred = equal_to<_Key>,</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keyword">typename</span> _Allocator = allocator<pair<const _Key, _Tp>>,</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  unordered_map(initializer_list<pair<_Key, _Tp>>,</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keyword">typename</span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">unordered_map<int, int>::size_type</a> = {},</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  -> unordered_map<_Key, _Tp, _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> </div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  unordered_map(_InputIterator, _InputIterator,</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="keyword">typename</span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">unordered_map<int, int>::size_type</a>, _Allocator)</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  -> unordered_map<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  __iter_val_t<_InputIterator>,</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  hash<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  equal_to<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  _Allocator>;</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> </div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  unordered_map(_InputIterator, _InputIterator, _Allocator)</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  -> unordered_map<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  __iter_val_t<_InputIterator>,</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  hash<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  equal_to<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  _Allocator>;</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> </div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  unordered_map(_InputIterator, _InputIterator,</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keyword">typename</span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">unordered_map<int, int>::size_type</a>,</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  _Hash, _Allocator)</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  -> unordered_map<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  __iter_val_t<_InputIterator>, _Hash,</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  equal_to<__iter_key_t<_InputIterator>>, _Allocator>;</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> </div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  unordered_map(initializer_list<pair<_Key, _Tp>>,</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keyword">typename</span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">unordered_map<int, int>::size_type</a>,</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  _Allocator)</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> </div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  unordered_map(initializer_list<pair<_Key, _Tp>>, _Allocator)</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;</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="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  unordered_map(initializer_list<pair<_Key, _Tp>>,</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keyword">typename</span> <a class="code" href="a07999.html#acefc3dbfc16b70562f92193d01156479">unordered_map<int, int>::size_type</a>,</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  _Hash, _Allocator)</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  -> unordered_map<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> </div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span> <span class="comment"></span></div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span> <span class="comment"> /**</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="comment"> * @brief A standard container composed of equivalent keys</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> <span class="comment"> * (possibly containing multiple of each key value) that associates</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="comment"> * values of another type with the keys.</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> <span class="comment"> *</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> <span class="comment"> * @ingroup unordered_associative_containers</span></div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> <span class="comment"> *</span></div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="comment"> * @tparam _Key Type of key objects.</span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> <span class="comment"> * @tparam _Tp Type of mapped objects.</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="comment"> * @tparam _Hash Hashing function object type, defaults to hash<_Value>.</span></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment"> * @tparam _Pred Predicate function object type, defaults</span></div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="comment"> * to equal_to<_Value>.</span></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span> <span class="comment"> * std::allocator<std::pair<const _Key, _Tp>>.</span></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span> <span class="comment"> *</span></div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, and</span></div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span> <span class="comment"> * <a href="tables.html#xx">unordered associative container</a></span></div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span> <span class="comment"> *</span></div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> <span class="comment"> * The resulting value type of the container is std::pair<const _Key, _Tp>.</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> <span class="comment"> *</span></div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> <span class="comment"> * Base is _Hashtable, dispatched at compile time via template</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> <span class="comment"> * alias __ummap_hashtable.</span></div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> <span class="comment"> */</span></div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp,</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="keyword">typename</span> _Hash = hash<_Key>,</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keyword">typename</span> _Pred = equal_to<_Key>,</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="keyword">typename</span> _Alloc = allocator<std::pair<const _Key, _Tp>>></div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keyword">class </span>unordered_multimap</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  {</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="keyword">typedef</span> __ummap_hashtable<_Key, _Tp, _Hash, _Pred, _Alloc> _Hashtable;</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  _Hashtable _M_h;</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span> </div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="comment">// typedefs:</span><span class="comment"></span></div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="comment"></span><span class="comment"> /// Public typedefs.</span></div><div class="line"><a name="l01242"></a><span class="lineno"><a class="line" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0"> 1242</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_type <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>;</div><div class="line"><a name="l01243"></a><span class="lineno"><a class="line" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8"> 1243</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::value_type <a class="code" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">value_type</a>;</div><div class="line"><a name="l01244"></a><span class="lineno"><a class="line" href="a07995.html#a3e1544ab885cd443cf557eb35db830e8"> 1244</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::mapped_type <a class="code" href="a07995.html#a3e1544ab885cd443cf557eb35db830e8">mapped_type</a>;</div><div class="line"><a name="l01245"></a><span class="lineno"><a class="line" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6"> 1245</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::hasher <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>;</div><div class="line"><a name="l01246"></a><span class="lineno"><a class="line" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d"> 1246</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_equal <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>;</div><div class="line"><a name="l01247"></a><span class="lineno"><a class="line" href="a07995.html#aab5213cbfd6797faef226b949240b8ec"> 1247</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::allocator_type <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>;<span class="comment"></span></div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> <span class="comment"></span><span class="comment"> /// Iterator-related typedefs.</span></div><div class="line"><a name="l01252"></a><span class="lineno"><a class="line" href="a07995.html#aa9c05aec6bb3f18770d191869543334a"> 1252</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::pointer <a class="code" href="a07995.html#aa9c05aec6bb3f18770d191869543334a">pointer</a>;</div><div class="line"><a name="l01253"></a><span class="lineno"><a class="line" href="a07995.html#ac2aca480ec930cab8cee31638ec6aa0c"> 1253</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_pointer <a class="code" href="a07995.html#ac2aca480ec930cab8cee31638ec6aa0c">const_pointer</a>;</div><div class="line"><a name="l01254"></a><span class="lineno"><a class="line" href="a07995.html#a08487e5381fd61795c61cfa0fed8e48f"> 1254</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::reference <a class="code" href="a07995.html#a08487e5381fd61795c61cfa0fed8e48f">reference</a>;</div><div class="line"><a name="l01255"></a><span class="lineno"><a class="line" href="a07995.html#a580c722f453604f50c163788a75fd6c3"> 1255</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_reference <a class="code" href="a07995.html#a580c722f453604f50c163788a75fd6c3">const_reference</a>;</div><div class="line"><a name="l01256"></a><span class="lineno"><a class="line" href="a07995.html#a0fffce26090303390cc7fce06b5f6615"> 1256</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::iterator <a class="code" href="a07995.html#a0fffce26090303390cc7fce06b5f6615">iterator</a>;</div><div class="line"><a name="l01257"></a><span class="lineno"><a class="line" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141"> 1257</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_iterator <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a>;</div><div class="line"><a name="l01258"></a><span class="lineno"><a class="line" href="a07995.html#a8cb5d0ca110f847b3fceed2d07472710"> 1258</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::local_iterator <a class="code" href="a07995.html#a8cb5d0ca110f847b3fceed2d07472710">local_iterator</a>;</div><div class="line"><a name="l01259"></a><span class="lineno"><a class="line" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5"> 1259</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_local_iterator <a class="code" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">const_local_iterator</a>;</div><div class="line"><a name="l01260"></a><span class="lineno"><a class="line" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024"> 1260</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::size_type <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a>;</div><div class="line"><a name="l01261"></a><span class="lineno"><a class="line" href="a07995.html#ab91e542e87512944adfb13fcff51d7c8"> 1261</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::difference_type <a class="code" href="a07995.html#ab91e542e87512944adfb13fcff51d7c8">difference_type</a>;<span class="comment"></span></div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> <span class="comment"></span></div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <span class="keyword">using</span> node_type = <span class="keyword">typename</span> _Hashtable::node_type;</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> </div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="comment">//construct/destroy/copy</span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span> <span class="comment"></span></div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> <span class="comment"> /// Default constructor.</span></div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> <span class="comment"></span> <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> <span class="comment"></span></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span> <span class="comment"> /**</span></div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> <span class="comment"> * @param __n Mnimal initial number of buckets.</span></div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> <span class="comment"> */</span></div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l01281"></a><span class="lineno"><a class="line" href="a07995.html#a4afc31e2217e4e10c6c821d38d9fa668"> 1281</a></span>  <a class="code" href="a07995.html#a4afc31e2217e4e10c6c821d38d9fa668">unordered_multimap</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n,</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>& __hf = <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>(),</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>& __eql = <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(),</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a = <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>())</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  : _M_h(__n, __hf, __eql, __a)</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  { }</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="comment"></span></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="comment"> /**</span></div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> <span class="comment"> * @brief Builds an %unordered_multimap from a range.</span></div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> <span class="comment"> *</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span> <span class="comment"> * Create an %unordered_multimap consisting of copies of the elements</span></div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> <span class="comment"> * from [__first,__last). This is linear in N (where N is</span></div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span> <span class="comment"> */</span></div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01302"></a><span class="lineno"><a class="line" href="a07995.html#a94fbf8cd5ee67d47203f4a01bb2d6568"> 1302</a></span>  <a class="code" href="a07995.html#a94fbf8cd5ee67d47203f4a01bb2d6568">unordered_multimap</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n = 0,</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>& __hf = <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>(),</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>& __eql = <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(),</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a = <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>())</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  : _M_h(__first, __last, __n, __hf, __eql, __a)</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> <span class="comment"></span></div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> <span class="comment"> /// Copy constructor.</span></div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span> <span class="comment"></span> <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(<span class="keyword">const</span> <a class="code" href="a07995.html">unordered_multimap</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> <span class="comment"></span></div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> <span class="comment"> /// Move constructor.</span></div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="comment"></span> <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(<a class="code" href="a07995.html">unordered_multimap</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> <span class="comment"></span></div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> <span class="comment"> /**</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> <span class="comment"> * @brief Creates an %unordered_multimap with no elements.</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> <span class="comment"> */</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l01321"></a><span class="lineno"><a class="line" href="a07995.html#ab7ecc0576cd505fe517ffbbae066d3d6"> 1321</a></span>  <a class="code" href="a07995.html#ab7ecc0576cd505fe517ffbbae066d3d6">unordered_multimap</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  : _M_h(__a)</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> </div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="comment">/*</span></div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> <span class="comment"> * @brief Copy constructor with allocator argument.</span></div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> <span class="comment"> * @param __uset Input %unordered_multimap to copy.</span></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span> <span class="comment"> */</span></div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(<span class="keyword">const</span> <a class="code" href="a07995.html">unordered_multimap</a>& __ummap,</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  : _M_h(__ummap._M_h, __a)</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</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>  <span class="comment">/*</span></div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span> <span class="comment"> * @brief Move constructor with allocator argument.</span></div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> <span class="comment"> * @param __uset Input %unordered_multimap to move.</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> <span class="comment"> */</span></div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(<a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>&& __ummap,</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  : _M_h(<a class="code" href="a01541.html">std</a>::move(__ummap._M_h), __a)</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="comment"></span></div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span> <span class="comment"> /**</span></div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> <span class="comment"> * @brief Builds an %unordered_multimap from an initializer_list.</span></div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span> <span class="comment"> *</span></div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> <span class="comment"> * Create an %unordered_multimap consisting of copies of the elements in</span></div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> <span class="comment"> * the list. This is linear in N (where N is @a __l.size()).</span></div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span> <span class="comment"> */</span></div><div class="line"><a name="l01356"></a><span class="lineno"><a class="line" href="a07995.html#aa11b69676f9f379ea2274cd722fae38d"> 1356</a></span>  <a class="code" href="a07995.html#aa11b69676f9f379ea2274cd722fae38d">unordered_multimap</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n = 0,</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>& __hf = <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>(),</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>& __eql = <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(),</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a = <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>())</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  : _M_h(__l, __n, __hf, __eql, __a)</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  { }</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> </div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  : <a class="code" href="a07995.html">unordered_multimap</a>(__n, <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>(), <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(), __a)</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> </div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>& __hf,</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  : <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(__n, __hf, <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(), __a)</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  { }</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> </div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n,</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  : <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(__first, __last, __n, <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>(), <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(), __a)</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  { }</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span> </div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>& __hf,</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  : <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(__first, __last, __n, __hf, <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(), __a)</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  { }</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span> </div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n,</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  : <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(__l, __n, <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>(), <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(), __a)</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  { }</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span> </div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a>& __hf,</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  <span class="keyword">const</span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a>& __a)</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  : <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>(__l, __n, __hf, <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a>(), __a)</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  { }</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> <span class="comment"></span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <span class="comment"> /// Copy assignment operator.</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> <span class="comment"></span> <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>&</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <a class="code" href="a07995.html#a04b3ff006b08f143403c12e743ced9b6">operator=</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> <span class="comment"></span></div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> <span class="comment"> /// Move assignment operator.</span></div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="comment"></span> <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>&</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <a class="code" href="a07995.html#a04b3ff006b08f143403c12e743ced9b6">operator=</a>(<a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> <span class="comment"></span></div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span> <span class="comment"> /**</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span> <span class="comment"> * @brief %Unordered_multimap list assignment operator.</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="comment"> *</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <span class="comment"> * This function fills an %unordered_multimap with copies of the</span></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span> <span class="comment"> * elements in the initializer list @a __l.</span></div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span> <span class="comment"> *</span></div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> <span class="comment"> * Note that the assignment completely changes the %unordered_multimap</span></div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span> <span class="comment"> * and that the resulting %unordered_multimap's size is the same as the</span></div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> <span class="comment"> * number of elements assigned.</span></div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span> <span class="comment"> */</span></div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <a class="code" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>&</div><div class="line"><a name="l01419"></a><span class="lineno"><a class="line" href="a07995.html#a1dd84e27aa97a782f79e757eadcd5461"> 1419</a></span>  <a class="code" href="a07995.html#a1dd84e27aa97a782f79e757eadcd5461">operator=</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  {</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  _M_h = __l;</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="keywordflow">return</span> *<span class="keyword">this</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="comment"></span></div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span> <span class="comment"> /// Returns the allocator object used by the %unordered_multimap.</span></div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> <span class="comment"></span> <a class="code" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a></div><div class="line"><a name="l01427"></a><span class="lineno"><a class="line" href="a07995.html#afb20a72b3b3284f980ec948c79e3b59d"> 1427</a></span>  <a class="code" href="a07995.html#afb20a72b3b3284f980ec948c79e3b59d">get_allocator</a>() const noexcept</div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  { <span class="keywordflow">return</span> _M_h.get_allocator(); }</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="comment">// size and capacity:</span></div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span> <span class="comment"></span></div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span> <span class="comment"> /// Returns true if the %unordered_multimap is empty.</span></div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> <span class="comment"></span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01434"></a><span class="lineno"><a class="line" href="a07995.html#ada14f82918a4a9fcfaf3c4ce218d1e70"> 1434</a></span>  <a class="code" href="a07995.html#ada14f82918a4a9fcfaf3c4ce218d1e70">empty</a>() const noexcept</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  { <span class="keywordflow">return</span> _M_h.empty(); }</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> <span class="comment"></span></div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> <span class="comment"> /// Returns the size of the %unordered_multimap.</span></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> <span class="comment"></span> <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01439"></a><span class="lineno"><a class="line" href="a07995.html#af02efb64c18107a5c4f13a1983cfa5a3"> 1439</a></span>  <a class="code" href="a07995.html#af02efb64c18107a5c4f13a1983cfa5a3">size</a>() const noexcept</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  { <span class="keywordflow">return</span> _M_h.size(); }</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> <span class="comment"></span></div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="comment"> /// Returns the maximum size of the %unordered_multimap.</span></div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> <span class="comment"></span> <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01444"></a><span class="lineno"><a class="line" href="a07995.html#accd0a24f61c8161dbd0fe216ead19142"> 1444</a></span>  <a class="code" href="a07995.html#accd0a24f61c8161dbd0fe216ead19142">max_size</a>() const noexcept</div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  { <span class="keywordflow">return</span> _M_h.max_size(); }</div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> </div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="comment">// iterators.</span></div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> <span class="comment"></span></div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span> <span class="comment"> /**</span></div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span> <span class="comment"> * Returns a read/write iterator that points to the first element in the</span></div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> <span class="comment"> * %unordered_multimap.</span></div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> <span class="comment"> */</span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01454"></a><span class="lineno"><a class="line" href="a07995.html#a1e8a71d9534d9f9cf27de31a025a3053"> 1454</a></span>  <a class="code" href="a07995.html#a1e8a71d9534d9f9cf27de31a025a3053">begin</a>() noexcept</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span> <span class="comment"></span></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span> <span class="comment"> * element in the %unordered_multimap.</span></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span> <span class="comment"> */</span></div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a></div><div class="line"><a name="l01463"></a><span class="lineno"><a class="line" href="a07995.html#a1fd8297776af120bf58bb6252562fc35"> 1463</a></span>  <a class="code" href="a07995.html#a1fd8297776af120bf58bb6252562fc35">begin</a>() const noexcept</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> </div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a></div><div class="line"><a name="l01467"></a><span class="lineno"><a class="line" href="a07995.html#ae1c99977950ad720b2b10f6daf6c31ab"> 1467</a></span>  <a class="code" href="a07995.html#ae1c99977950ad720b2b10f6daf6c31ab">cbegin</a>() const noexcept</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  { <span class="keywordflow">return</span> _M_h.begin(); }<span class="comment"></span></div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> <span class="comment"> /**</span></div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span> <span class="comment"> * Returns a read/write iterator that points one past the last element in</span></div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span> <span class="comment"> * the %unordered_multimap.</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>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01476"></a><span class="lineno"><a class="line" href="a07995.html#a708a8efab9b1b9d8f1e41ca3ae2caaa5"> 1476</a></span>  <a class="code" href="a07995.html#a708a8efab9b1b9d8f1e41ca3ae2caaa5">end</a>() noexcept</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  { <span class="keywordflow">return</span> _M_h.end(); }</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> <span class="comment"></span></div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> <span class="comment"> * element in the %unordered_multimap.</span></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> <span class="comment"> */</span></div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a></div><div class="line"><a name="l01485"></a><span class="lineno"><a class="line" href="a07995.html#a0921ff9d001238f2f5b92f025378a37d"> 1485</a></span>  <a class="code" href="a07995.html#a0921ff9d001238f2f5b92f025378a37d">end</a>() const noexcept</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  { <span class="keywordflow">return</span> _M_h.end(); }</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> </div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a></div><div class="line"><a name="l01489"></a><span class="lineno"><a class="line" href="a07995.html#acc5c6d3a39a12f7d21e8886534eaa591"> 1489</a></span>  <a class="code" href="a07995.html#acc5c6d3a39a12f7d21e8886534eaa591">cend</a>() const noexcept</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  { <span class="keywordflow">return</span> _M_h.end(); }<span class="comment"></span></div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> <span class="comment"></span></div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <span class="comment">// modifiers.</span></div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> <span class="comment"></span></div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span> <span class="comment"> /**</span></div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the</span></div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> <span class="comment"> * %unordered_multimap.</span></div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="comment"> *</span></div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> <span class="comment"> * @param __args Arguments used to generate a new pair instance (see</span></div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="comment"> * std::piecewise_contruct for passing arguments to each</span></div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> <span class="comment"> * part of the pair constructor).</span></div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span> <span class="comment"> *</span></div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span> <span class="comment"> * @return An iterator that points to the inserted pair.</span></div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span> <span class="comment"> *</span></div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span> <span class="comment"> * This function attempts to build and insert a (key, value) %pair into</span></div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span> <span class="comment"> * the %unordered_multimap.</span></div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> <span class="comment"> *</span></div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span> <span class="comment"> */</span></div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01512"></a><span class="lineno"><a class="line" href="a07995.html#a4d00357a4ca15a9cdffa4aef992859c8"> 1512</a></span>  <a class="code" href="a07995.html#a4d00357a4ca15a9cdffa4aef992859c8">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  { <span class="keywordflow">return</span> _M_h.emplace(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span> <span class="comment"></span></div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span> <span class="comment"> /**</span></div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the</span></div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span> <span class="comment"> * %unordered_multimap.</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> <span class="comment"> *</span></div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the pair</span></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> <span class="comment"> * should be inserted.</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> <span class="comment"> * @param __args Arguments used to generate a new pair instance (see</span></div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> <span class="comment"> * std::piecewise_contruct for passing arguments to each</span></div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> <span class="comment"> * part of the pair constructor).</span></div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> <span class="comment"> * @return An iterator that points to the element with key of the</span></div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span> <span class="comment"> * std::pair built from @a __args.</span></div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span> <span class="comment"> *</span></div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span> <span class="comment"> *</span></div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> <span class="comment"> * See</span></div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span> <span class="comment"> *</span></div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span> <span class="comment"> */</span></div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01539"></a><span class="lineno"><a class="line" href="a07995.html#af7f415a309a77497c41538b60d358fed"> 1539</a></span>  <a class="code" href="a07995.html#af7f415a309a77497c41538b60d358fed">emplace_hint</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __pos, _Args&&... __args)</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  { <span class="keywordflow">return</span> _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span> <span class="comment"></span></div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span> <span class="comment"> * @brief Inserts a std::pair into the %unordered_multimap.</span></div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> <span class="comment"> * @param __x Pair to be inserted (see std::make_pair for easy</span></div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> <span class="comment"> * creation of pairs).</span></div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> <span class="comment"> *</span></div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span> <span class="comment"> * @return An iterator that points to the inserted pair.</span></div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> <span class="comment"> *</span></div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> <span class="comment"> */</span></div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01553"></a><span class="lineno"><a class="line" href="a07995.html#a79303f819716015a95be11962dda3e53"> 1553</a></span>  <a class="code" href="a07995.html#a79303f819716015a95be11962dda3e53">insert</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">value_type</a>& __x)</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  { <span class="keywordflow">return</span> _M_h.insert(__x); }</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> </div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01557"></a><span class="lineno"><a class="line" href="a07995.html#a73f5c66280686af351a204b1d98774b6"> 1557</a></span>  <a class="code" href="a07995.html#a73f5c66280686af351a204b1d98774b6">insert</a>(<a class="code" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">value_type</a>&& __x)</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  { <span class="keywordflow">return</span> _M_h.insert(std::move(__x)); }</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span> </div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  __enable_if_t<is_constructible<value_type, _Pair&&>::value, <a class="code" href="a07675.html">iterator</a>></div><div class="line"><a name="l01562"></a><span class="lineno"><a class="line" href="a07995.html#ade6cdef7282f352738f0a2bde236cf06"> 1562</a></span>  <a class="code" href="a07995.html#ade6cdef7282f352738f0a2bde236cf06">insert</a>(_Pair&& __x)</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  { <span class="keywordflow">return</span> _M_h.emplace(std::forward<_Pair>(__x)); }<span class="comment"></span></div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span> <span class="comment"> * @brief Inserts a std::pair into the %unordered_multimap.</span></div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> <span class="comment"> * @param __hint An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span> <span class="comment"> * pair should be inserted.</span></div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span> <span class="comment"> * @param __x Pair to be inserted (see std::make_pair for easy creation</span></div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span> <span class="comment"> * of pairs).</span></div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span> <span class="comment"> * @a __x (may or may not be the %pair passed in).</span></div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span> <span class="comment"> *</span></div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span> <span class="comment"> *</span></div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> <span class="comment"> * See</span></div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> <span class="comment"> *</span></div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> <span class="comment"> */</span></div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01587"></a><span class="lineno"><a class="line" href="a07995.html#aeb4625ec1e0a22af00ccb220e4c7c7b2"> 1587</a></span>  <a class="code" href="a07995.html#aeb4625ec1e0a22af00ccb220e4c7c7b2">insert</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __hint, <span class="keyword">const</span> <a class="code" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">value_type</a>& __x)</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, __x); }</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>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  <span class="comment">// 2354. Unnecessary copying when inserting into maps with braced-init</span></div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01593"></a><span class="lineno"><a class="line" href="a07995.html#af90dcd39d44bdeffe788e78ca829d639"> 1593</a></span>  <a class="code" href="a07995.html#af90dcd39d44bdeffe788e78ca829d639">insert</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __hint, <a class="code" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">value_type</a>&& __x)</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, std::move(__x)); }</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span> </div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair></div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  __enable_if_t<is_constructible<value_type, _Pair&&>::value, <a class="code" href="a07675.html">iterator</a>></div><div class="line"><a name="l01598"></a><span class="lineno"><a class="line" href="a07995.html#af7389296b49f59cc5a612fd769daaeeb"> 1598</a></span>  <a class="code" href="a07995.html#af7389296b49f59cc5a612fd769daaeeb">insert</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __hint, _Pair&& __x)</div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  { <span class="keywordflow">return</span> _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }<span class="comment"></span></div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> <span class="comment"> /**</span></div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span> <span class="comment"> * @brief A template function that attempts to insert a range of</span></div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span> <span class="comment"> *</span></div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span> <span class="comment"> */</span></div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01613"></a><span class="lineno"><a class="line" href="a07995.html#a46f035c31a44c4051965af7868d40e77"> 1613</a></span>  <a class="code" href="a07995.html#a46f035c31a44c4051965af7868d40e77">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  { _M_h.insert(__first, __last); }</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span> <span class="comment"></span></div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span> <span class="comment"> /**</span></div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span> <span class="comment"> * @brief Attempts to insert a list of elements into the</span></div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span> <span class="comment"> * %unordered_multimap.</span></div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements</span></div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span> <span class="comment"> * to be inserted.</span></div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span> <span class="comment"> *</span></div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span> <span class="comment"> */</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"><a class="line" href="a07995.html#acb1935806673ced5dae48aa64d8cabc3"> 1625</a></span>  <a class="code" href="a07995.html#acb1935806673ced5dae48aa64d8cabc3">insert</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  { _M_h.insert(__l); }</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span> </div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> <span class="comment"></span> node_type</div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  extract(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __pos)</div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  {</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  __glibcxx_assert(__pos != <a class="code" href="a07995.html#a708a8efab9b1b9d8f1e41ca3ae2caaa5">end</a>());</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  <span class="keywordflow">return</span> _M_h.extract(__pos);</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  }</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span> <span class="comment"></span></div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span> <span class="comment"></span> node_type</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  extract(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __key)</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  { <span class="keywordflow">return</span> _M_h.extract(__key); }</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span> <span class="comment"></span></div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> <span class="comment"></span> <a class="code" href="a07995.html#a0fffce26090303390cc7fce06b5f6615">iterator</a></div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <a class="code" href="a07995.html#a79303f819716015a95be11962dda3e53">insert</a>(node_type&& __nh)</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node_multi(<a class="code" href="a07995.html#acc5c6d3a39a12f7d21e8886534eaa591">cend</a>(), std::move(__nh)); }</div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span> <span class="comment"></span></div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span> <span class="comment"></span> <a class="code" href="a07995.html#a0fffce26090303390cc7fce06b5f6615">iterator</a></div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <a class="code" href="a07995.html#a79303f819716015a95be11962dda3e53">insert</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __hint, node_type&& __nh)</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span> <span class="preprocessor">#endif // C++17</span></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"> //@{</span></div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span> <span class="comment"> * @brief Erases an element from an %unordered_multimap.</span></div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span> <span class="comment"> * @a __position prior to the element being erased. If no such</span></div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span> <span class="comment"> *</span></div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span> <span class="comment"> * from an %unordered_multimap.</span></div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span> <span class="comment"> * Note that this function only erases the element, and that if the</span></div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span> <span class="comment"> * element is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> <span class="comment"> */</span></div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <a class="code" href="a07995.html#a0fffce26090303390cc7fce06b5f6615">iterator</a></div><div class="line"><a name="l01668"></a><span class="lineno"><a class="line" href="a07995.html#a671564fa7d5dd0e04b651e78861c89ba"> 1668</a></span>  <a class="code" href="a07995.html#a671564fa7d5dd0e04b651e78861c89ba">erase</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __position)</div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> </div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="comment">// LWG 2059.</span></div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01673"></a><span class="lineno"><a class="line" href="a07995.html#a08eec5ee5f497c48d356443110934fdd"> 1673</a></span>  <a class="code" href="a07995.html#a08eec5ee5f497c48d356443110934fdd">erase</a>(<a class="code" href="a07995.html#a0fffce26090303390cc7fce06b5f6615">iterator</a> __position)</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }<span class="comment"></span></div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> <span class="comment"> /**</span></div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span> <span class="comment"> * @param __x Key of elements to be erased.</span></div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span> <span class="comment"> * @return The number of elements erased.</span></div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span> <span class="comment"> *</span></div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span> <span class="comment"> * This function erases all the elements located by the given key from</span></div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span> <span class="comment"> * an %unordered_multimap.</span></div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> <span class="comment"> * Note that this function only erases the element, and that if the</span></div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span> <span class="comment"> * element is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span> <span class="comment"> */</span></div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01689"></a><span class="lineno"><a class="line" href="a07995.html#a09397dfd53f29fdbc8809d37ab11b142"> 1689</a></span>  <a class="code" href="a07995.html#a09397dfd53f29fdbc8809d37ab11b142">erase</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __x)</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  { <span class="keywordflow">return</span> _M_h.erase(__x); }</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span> <span class="comment"></span></div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span> <span class="comment"> /**</span></div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from an</span></div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span> <span class="comment"> * %unordered_multimap.</span></div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span> <span class="comment"> * @return The iterator @a __last.</span></div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> <span class="comment"> *</span></div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span> <span class="comment"> * This function erases a sequence of elements from an</span></div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> <span class="comment"> * %unordered_multimap.</span></div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span> <span class="comment"> * Note that this function only erases the elements, and that if</span></div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span> <span class="comment"> */</span></div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01708"></a><span class="lineno"><a class="line" href="a07995.html#aa38e97c00a7b10fb37726206ebc57800"> 1708</a></span>  <a class="code" href="a07995.html#aa38e97c00a7b10fb37726206ebc57800">erase</a>(<a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __first, <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> __last)</div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  { <span class="keywordflow">return</span> _M_h.erase(__first, __last); }</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span> <span class="comment"></span></div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span> <span class="comment"> /**</span></div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span> <span class="comment"> * Erases all elements in an %unordered_multimap.</span></div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span> <span class="comment"> * Note that this function only erases the elements, and that if the</span></div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span> <span class="comment"> * elements themselves are pointers, the pointed-to memory is not touched</span></div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span> <span class="comment"> */</span></div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01718"></a><span class="lineno"><a class="line" href="a07995.html#a96159c845937ab5729b5ed41a7ef6071"> 1718</a></span>  <a class="code" href="a07995.html#a96159c845937ab5729b5ed41a7ef6071">clear</a>() noexcept</div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  { _M_h.clear(); }</div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span> <span class="comment"></span></div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span> <span class="comment"> /**</span></div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span> <span class="comment"> * @brief Swaps data with another %unordered_multimap.</span></div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span> <span class="comment"> * @param __x An %unordered_multimap of the same element and allocator</span></div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span> <span class="comment"> * types.</span></div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span> <span class="comment"> *</span></div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span> <span class="comment"> * This exchanges the elements between two %unordered_multimap in</span></div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span> <span class="comment"> * constant time.</span></div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> <span class="comment"> * std::swap(m1,m2) will feed to this function.</span></div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span> <span class="comment"> */</span></div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01732"></a><span class="lineno"><a class="line" href="a07995.html#ac8d3f27e1315796ddcc9b55378f90ce7"> 1732</a></span>  <a class="code" href="a07995.html#ac8d3f27e1315796ddcc9b55378f90ce7">swap</a>(<a class="code" href="a07995.html">unordered_multimap</a>& __x)</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  noexcept( noexcept(_M_h.swap(__x._M_h)) )</div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  { _M_h.swap(__x._M_h); }</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> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>></div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <span class="keyword">friend</span> <span class="keyword">class </span>std::_Hash_merge_helper;</div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span> </div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  merge(<a class="code" href="a07995.html">unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc></a>& __source)</div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  {</div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  <span class="keyword">using</span> _Merge_helper</div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  = _Hash_merge_helper<unordered_multimap, _H2, _P2>;</div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  }</div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span> </div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  { merge(__source); }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)</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>  <span class="keyword">using</span> _Merge_helper</div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  = _Hash_merge_helper<unordered_multimap, _H2, _P2>;</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  }</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span> </div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  { merge(__source); }</div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span> </div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  <span class="comment">// observers.</span></div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span> <span class="comment"></span></div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span> <span class="comment"> /// Returns the hash functor object with which the %unordered_multimap</span></div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span> <span class="comment"> /// was constructed.</span></div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span> <span class="comment"></span> <a class="code" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a></div><div class="line"><a name="l01774"></a><span class="lineno"><a class="line" href="a07995.html#a208a268d709e23f97d5763d2f24de4f2"> 1774</a></span>  <a class="code" href="a07995.html#a208a268d709e23f97d5763d2f24de4f2">hash_function</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.hash_function(); }</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="comment"> /// Returns the key comparison object with which the %unordered_multimap</span></div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span> <span class="comment"> /// was constructed.</span></div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span> <span class="comment"></span> <a class="code" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a></div><div class="line"><a name="l01780"></a><span class="lineno"><a class="line" href="a07995.html#a32226343bc7c4b8b0b14914fd3d105cb"> 1780</a></span>  <a class="code" href="a07995.html#a32226343bc7c4b8b0b14914fd3d105cb">key_eq</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.key_eq(); }</div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span> </div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <span class="comment">// lookup.</span></div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> <span class="comment"></span></div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span> <span class="comment"> * @brief Tries to locate an element in an %unordered_multimap.</span></div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span> <span class="comment"> * found.</span></div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span> <span class="comment"> *</span></div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</span></div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> <span class="comment"> */</span></div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01798"></a><span class="lineno"><a class="line" href="a07995.html#a9f64e8fbc46b2fec76e96499ac91c8b6"> 1798</a></span>  <a class="code" href="a07995.html#a9f64e8fbc46b2fec76e96499ac91c8b6">find</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __x)</div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  { <span class="keywordflow">return</span> _M_h.find(__x); }</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>  <a class="code" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a></div><div class="line"><a name="l01802"></a><span class="lineno"><a class="line" href="a07995.html#a3a54562ef76d4966a496b86691fdfb12"> 1802</a></span>  <a class="code" href="a07995.html#a3a54562ef76d4966a496b86691fdfb12">find</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.find(__x); }<span class="comment"></span></div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span> <span class="comment"> /**</span></div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span> <span class="comment"> * @brief Finds the number of elements.</span></div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span> <span class="comment"> * @param __x Key to count.</span></div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span> <span class="comment"> * @return Number of elements with specified key.</span></div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span> <span class="comment"> */</span></div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01812"></a><span class="lineno"><a class="line" href="a07995.html#a323e46db071ea6d46dca69efbbc4d075"> 1812</a></span>  <a class="code" href="a07995.html#a323e46db071ea6d46dca69efbbc4d075">count</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.count(__x); }</div><div class="line"><a name="l01814"></a><span class="lineno"> 1814</span> <span class="comment"></span></div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span> <span class="comment"> */</span></div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <a class="code" href="a07767.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l01823"></a><span class="lineno"><a class="line" href="a07995.html#a55b2bb934fcc4f41eaa67280c73ff1d5"> 1823</a></span>  <a class="code" href="a07995.html#a55b2bb934fcc4f41eaa67280c73ff1d5">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __x)</div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  { <span class="keywordflow">return</span> _M_h.equal_range(__x); }</div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span> </div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <a class="code" href="a07767.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l01827"></a><span class="lineno"><a class="line" href="a07995.html#a6c608c4a4f2041d5045df49143124cfa"> 1827</a></span>  <a class="code" href="a07995.html#a6c608c4a4f2041d5045df49143124cfa">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.equal_range(__x); }<span class="comment"></span></div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span> <span class="comment"></span></div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="comment">// bucket interface.</span></div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span> <span class="comment"></span></div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span> <span class="comment"> /// Returns the number of buckets of the %unordered_multimap.</span></div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span> <span class="comment"></span> <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01835"></a><span class="lineno"><a class="line" href="a07995.html#a0c57013bd56a6fc373659c4e5807a64d"> 1835</a></span>  <a class="code" href="a07995.html#a0c57013bd56a6fc373659c4e5807a64d">bucket_count</a>() const noexcept</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  { <span class="keywordflow">return</span> _M_h.bucket_count(); }</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span> <span class="comment"></span></div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span> <span class="comment"> /// Returns the maximum number of buckets of the %unordered_multimap.</span></div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span> <span class="comment"></span> <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01840"></a><span class="lineno"><a class="line" href="a07995.html#a193e48c36ac0f5888911cf991428a287"> 1840</a></span>  <a class="code" href="a07995.html#a193e48c36ac0f5888911cf991428a287">max_bucket_count</a>() const noexcept</div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  { <span class="keywordflow">return</span> _M_h.max_bucket_count(); }</div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span> </div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="comment">/*</span></div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span> <span class="comment"> * @brief Returns the number of elements in a given bucket.</span></div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span> <span class="comment"> * @param __n A bucket index.</span></div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span> <span class="comment"> * @return The number of elements in the bucket.</span></div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> <span class="comment"> */</span></div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  bucket_size(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket_size(__n); }</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span> </div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  <span class="comment">/*</span></div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span> <span class="comment"> * @brief Returns the bucket index of a given element.</span></div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span> <span class="comment"> * @param __key A key instance.</span></div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span> <span class="comment"> * @return The key bucket index.</span></div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span> <span class="comment"> */</span></div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a></div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  bucket(<span class="keyword">const</span> <a class="code" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a>& __key)<span class="keyword"> const</span></div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket(__key); }</div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  <span class="comment"></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"> * @brief Returns a read/write iterator pointing to the first bucket</span></div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span> <span class="comment"> * element.</span></div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span> <span class="comment"> * @return A read/write local iterator.</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"> 1867</span>  <a class="code" href="a07995.html#a8cb5d0ca110f847b3fceed2d07472710">local_iterator</a></div><div class="line"><a name="l01868"></a><span class="lineno"><a class="line" href="a07995.html#a72025b859653a260f7e14bac43feae79"> 1868</a></span>  <a class="code" href="a07995.html#a72025b859653a260f7e14bac43feae79">begin</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)</div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  { <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span> <span class="comment"></span></div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to the first</span></div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span> <span class="comment"> * bucket element.</span></div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span> <span class="comment"> */</span></div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <a class="code" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">const_local_iterator</a></div><div class="line"><a name="l01879"></a><span class="lineno"><a class="line" href="a07995.html#aabce46436201e63f88dbebc168f9d84a"> 1879</a></span>  <a class="code" href="a07995.html#aabce46436201e63f88dbebc168f9d84a">begin</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.begin(__n); }</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>  <a class="code" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">const_local_iterator</a></div><div class="line"><a name="l01883"></a><span class="lineno"><a class="line" href="a07995.html#ad4f2132ee625dc5b3a48d28a495d552f"> 1883</a></span>  <a class="code" href="a07995.html#ad4f2132ee625dc5b3a48d28a495d552f">cbegin</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cbegin(__n); }<span class="comment"></span></div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span> <span class="comment"> /**</span></div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> <span class="comment"> * @brief Returns a read/write iterator pointing to one past the last</span></div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span> <span class="comment"> * bucket elements.</span></div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span> <span class="comment"> * @return A read/write local iterator.</span></div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span> <span class="comment"> */</span></div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <a class="code" href="a07995.html#a8cb5d0ca110f847b3fceed2d07472710">local_iterator</a></div><div class="line"><a name="l01894"></a><span class="lineno"><a class="line" href="a07995.html#a4209ed9ce2c4549ded624445fa59416f"> 1894</a></span>  <a class="code" href="a07995.html#a4209ed9ce2c4549ded624445fa59416f">end</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  { <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span> <span class="comment"></span></div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to one past</span></div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span> <span class="comment"> * the last bucket elements.</span></div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span> <span class="comment"> */</span></div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <a class="code" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">const_local_iterator</a></div><div class="line"><a name="l01905"></a><span class="lineno"><a class="line" href="a07995.html#aa7cd9ddc32c88838cfcd1f2cc53ae5ab"> 1905</a></span>  <a class="code" href="a07995.html#aa7cd9ddc32c88838cfcd1f2cc53ae5ab">end</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span> </div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <a class="code" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">const_local_iterator</a></div><div class="line"><a name="l01909"></a><span class="lineno"><a class="line" href="a07995.html#aeabc377e8c2f5b367388ee5e4e0aff99"> 1909</a></span>  <a class="code" href="a07995.html#aeabc377e8c2f5b367388ee5e4e0aff99">cend</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cend(__n); }<span class="comment"></span></div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span> <span class="comment"></span></div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  <span class="comment">// hash policy.</span></div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span> <span class="comment"></span></div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span> <span class="comment"> /// Returns the average number of elements per bucket.</span></div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l01917"></a><span class="lineno"><a class="line" href="a07995.html#a02888ba9dce21c5e16ba09734ebdb642"> 1917</a></span>  <a class="code" href="a07995.html#a02888ba9dce21c5e16ba09734ebdb642">load_factor</a>() const noexcept</div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  { <span class="keywordflow">return</span> _M_h.load_factor(); }</div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span> <span class="comment"></span></div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> <span class="comment"> /// Returns a positive number that the %unordered_multimap tries to keep</span></div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span> <span class="comment"> /// the load factor less than or equal to.</span></div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l01923"></a><span class="lineno"><a class="line" href="a07995.html#a72250fbcb87cc6ea4998eb8f00465650"> 1923</a></span>  <a class="code" href="a07995.html#a72250fbcb87cc6ea4998eb8f00465650">max_load_factor</a>() const noexcept</div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  { <span class="keywordflow">return</span> _M_h.max_load_factor(); }</div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span> <span class="comment"></span></div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span> <span class="comment"> /**</span></div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span> <span class="comment"> * @brief Change the %unordered_multimap maximum load factor.</span></div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span> <span class="comment"> * @param __z The new maximum load factor.</span></div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span> <span class="comment"> */</span></div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01931"></a><span class="lineno"><a class="line" href="a07995.html#afea08a0d2315df4b6da1318c74be7114"> 1931</a></span>  <a class="code" href="a07995.html#afea08a0d2315df4b6da1318c74be7114">max_load_factor</a>(<span class="keywordtype">float</span> __z)</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  { _M_h.max_load_factor(__z); }</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span> <span class="comment"></span></div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span> <span class="comment"> /**</span></div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span> <span class="comment"> * @brief May rehash the %unordered_multimap.</span></div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span> <span class="comment"> * @param __n The new number of buckets.</span></div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span> <span class="comment"> *</span></div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span> <span class="comment"> * Rehash will occur only if the new number of buckets respect the</span></div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span> <span class="comment"> * %unordered_multimap maximum load factor.</span></div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span> <span class="comment"> */</span></div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01942"></a><span class="lineno"><a class="line" href="a07995.html#ac9032d22474fc3c5ec4d0b74362b5f4e"> 1942</a></span>  <a class="code" href="a07995.html#ac9032d22474fc3c5ec4d0b74362b5f4e">rehash</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)</div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  { _M_h.rehash(__n); }</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span> <span class="comment"></span></div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span> <span class="comment"> /**</span></div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span> <span class="comment"> * @brief Prepare the %unordered_multimap for a specified number of</span></div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span> <span class="comment"> * @param __n Number of elements required.</span></div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span> <span class="comment"> *</span></div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span> <span class="comment"> * Same as rehash(ceil(n / max_load_factor())).</span></div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span> <span class="comment"> */</span></div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01953"></a><span class="lineno"><a class="line" href="a07995.html#a9167538c4058279e45627d0a68f3d030"> 1953</a></span>  <a class="code" href="a07995.html#a9167538c4058279e45627d0a68f3d030">reserve</a>(<a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> __n)</div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  { _M_h.reserve(__n); }</div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span> </div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key1, <span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Pred1,</div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  <span class="keyword">typename</span> _Alloc1></div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  operator==(<span class="keyword">const</span> <a class="code" href="a07995.html">unordered_multimap</a><_Key1, _Tp1,</div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  _Hash1, _Pred1, _Alloc1>&,</div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="keyword">const</span> <a class="code" href="a07995.html">unordered_multimap</a><_Key1, _Tp1,</div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  _Hash1, _Pred1, _Alloc1>&);</div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</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="preprocessor">#if __cpp_deduction_guides >= 201606</span></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">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="keyword">typename</span> _Hash = hash<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  <span class="keyword">typename</span> _Pred = equal_to<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  <span class="keyword">typename</span> _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  unordered_multimap(_InputIterator, _InputIterator,</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">unordered_multimap<int, int>::size_type</a> = {},</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  _Hash = _Hash(), _Pred = _Pred(),</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  _Allocator = _Allocator())</div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  -> unordered_multimap<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  __iter_val_t<_InputIterator>, _Hash, _Pred,</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  _Allocator>;</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span> </div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash = hash<_Key>,</div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <span class="keyword">typename</span> _Pred = equal_to<_Key>,</div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="keyword">typename</span> _Allocator = allocator<pair<const _Key, _Tp>>,</div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  unordered_multimap(initializer_list<pair<_Key, _Tp>>,</div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">unordered_multimap<int, int>::size_type</a> = {},</div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  _Hash = _Hash(), _Pred = _Pred(),</div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  _Allocator = _Allocator())</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  -> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span> </div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  unordered_multimap(_InputIterator, _InputIterator,</div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">unordered_multimap<int, int>::size_type</a>, _Allocator)</div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  -> unordered_multimap<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  __iter_val_t<_InputIterator>,</div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  hash<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  equal_to<__iter_key_t<_InputIterator>>, _Allocator>;</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="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  unordered_multimap(_InputIterator, _InputIterator, _Allocator)</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  -> unordered_multimap<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  __iter_val_t<_InputIterator>,</div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  hash<__iter_key_t<_InputIterator>>,</div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  equal_to<__iter_key_t<_InputIterator>>, _Allocator>;</div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span> </div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  unordered_multimap(_InputIterator, _InputIterator,</div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">unordered_multimap<int, int>::size_type</a>, _Hash,</div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  _Allocator)</div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  -> unordered_multimap<__iter_key_t<_InputIterator>,</div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  __iter_val_t<_InputIterator>, _Hash,</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  equal_to<__iter_key_t<_InputIterator>>, _Allocator>;</div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span> </div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  unordered_multimap(initializer_list<pair<_Key, _Tp>>,</div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">unordered_multimap<int, int>::size_type</a>,</div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  _Allocator)</div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;</div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span> </div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  unordered_multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;</div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span> </div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  unordered_multimap(initializer_list<pair<_Key, _Tp>>,</div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  <a class="code" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">unordered_multimap<int, int>::size_type</a>,</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  _Hash, _Allocator)</div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  -> unordered_multimap<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;</div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span> </div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l02040"></a><span class="lineno"> 2040</span> </div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  { __x.swap(__y); }</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span> </div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  { __x.swap(__y); }</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>  <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  operator==(<span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  { <span class="keywordflow">return</span> __x._M_h._M_equal(__y._M_h); }</div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span> </div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  operator!=(<span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  <span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  { <span class="keywordflow">return</span> !(__x == __y); }</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="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  operator==(<span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  { <span class="keywordflow">return</span> __x._M_h._M_equal(__y._M_h); }</div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span> </div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  operator!=(<span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  <span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span> </div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span> _GLIBCXX_END_NAMESPACE_CONTAINER</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="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <span class="comment">// Allow std::unordered_map access to internals of compatible maps.</span></div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Eq1,</div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Hash2, <span class="keyword">typename</span> _Eq2></div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="keyword">struct </span>_Hash_merge_helper<</div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  _GLIBCXX_STD_C::unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>,</div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  _Hash2, _Eq2></div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  {</div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  <span class="keyword">using</span> unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;</div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  <span class="keyword">using</span> unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;</div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span> </div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="keyword">friend</span> unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>;</div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span> </div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)</div><div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  { <span class="keywordflow">return</span> __map._M_h; }</div><div class="line"><a name="l02100"></a><span class="lineno"> 2100</span> </div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)</div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  { <span class="keywordflow">return</span> __map._M_h; }</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> </div><div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="comment">// Allow std::unordered_multimap access to internals of compatible maps.</span></div><div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Eq1,</div><div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Hash2, <span class="keyword">typename</span> _Eq2></div><div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  <span class="keyword">struct </span>_Hash_merge_helper<</div><div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,</div><div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  _Hash2, _Eq2></div><div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  {</div><div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  <span class="keyword">using</span> unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;</div><div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  <span class="keyword">using</span> unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;</div><div class="line"><a name="l02118"></a><span class="lineno"> 2118</span> </div><div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  <span class="keyword">friend</span> unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;</div><div class="line"><a name="l02120"></a><span class="lineno"> 2120</span> </div><div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)</div><div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  { <span class="keywordflow">return</span> __map._M_h; }</div><div class="line"><a name="l02124"></a><span class="lineno"> 2124</span> </div><div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)</div><div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  { <span class="keywordflow">return</span> __map._M_h; }</div><div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  };</div><div class="line"><a name="l02129"></a><span class="lineno"> 2129</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l02130"></a><span class="lineno"> 2130</span> </div><div class="line"><a name="l02131"></a><span class="lineno"> 2131</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l02132"></a><span class="lineno"> 2132</span> } <span class="comment">// namespace std</span></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="preprocessor">#endif </span><span class="comment">/* _UNORDERED_MAP_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07999_html_ac0072ca4cb745124af7e8ae199b017c5"><div class="ttname"><a href="a07999.html#ac0072ca4cb745124af7e8ae199b017c5">std::unordered_map::pointer</a></div><div class="ttdeci">_Hashtable::pointer pointer</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00121">unordered_map.h:121</a></div></div>
<div class="ttc" id="a07999_html_ae2f58d908f2e03656fce158550d9ba73"><div class="ttname"><a href="a07999.html#ae2f58d908f2e03656fce158550d9ba73">std::unordered_map::max_load_factor</a></div><div class="ttdeci">float max_load_factor() const noexcept</div><div class="ttdoc">Returns a positive number that the unordered_map tries to keep the load factor less than or equal to.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01090">unordered_map.h:1090</a></div></div>
<div class="ttc" id="a07995_html_a193e48c36ac0f5888911cf991428a287"><div class="ttname"><a href="a07995.html#a193e48c36ac0f5888911cf991428a287">std::unordered_multimap::max_bucket_count</a></div><div class="ttdeci">size_type max_bucket_count() const noexcept</div><div class="ttdoc">Returns the maximum number of buckets of the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01840">unordered_map.h:1840</a></div></div>
<div class="ttc" id="a07995_html_a4d00357a4ca15a9cdffa4aef992859c8"><div class="ttname"><a href="a07995.html#a4d00357a4ca15a9cdffa4aef992859c8">std::unordered_multimap::emplace</a></div><div class="ttdeci">iterator emplace(_Args &&... __args)</div><div class="ttdoc">Attempts to build and insert a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01512">unordered_map.h:1512</a></div></div>
<div class="ttc" id="a07367_html"><div class="ttname"><a href="a07367.html">std::equal_to</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00331">stl_function.h:331</a></div></div>
<div class="ttc" id="a07999_html_a191d1d95c2d102dc1057677df000aaec"><div class="ttname"><a href="a07999.html#a191d1d95c2d102dc1057677df000aaec">std::unordered_map::insert</a></div><div class="ttdeci">void insert(initializer_list< value_type > __l)</div><div class="ttdoc">Attempts to insert a list of elements into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00655">unordered_map.h:655</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="a07999_html_a7d1de2c7389176716aceeaba3b1c2bb7"><div class="ttname"><a href="a07999.html#a7d1de2c7389176716aceeaba3b1c2bb7">std::unordered_map::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdoc">Returns the size of the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00309">unordered_map.h:309</a></div></div>
<div class="ttc" id="a07995_html_ada14f82918a4a9fcfaf3c4ce218d1e70"><div class="ttname"><a href="a07995.html#ada14f82918a4a9fcfaf3c4ce218d1e70">std::unordered_multimap::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdoc">Returns true if the unordered_multimap is empty.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01434">unordered_map.h:1434</a></div></div>
<div class="ttc" id="a07995_html_aa9c05aec6bb3f18770d191869543334a"><div class="ttname"><a href="a07995.html#aa9c05aec6bb3f18770d191869543334a">std::unordered_multimap::pointer</a></div><div class="ttdeci">_Hashtable::pointer pointer</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01252">unordered_map.h:1252</a></div></div>
<div class="ttc" id="a07995_html_ac98a77485a1a68eaadb6a7c8b5d4b141"><div class="ttname"><a href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">std::unordered_multimap::const_iterator</a></div><div class="ttdeci">_Hashtable::const_iterator const_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01257">unordered_map.h:1257</a></div></div>
<div class="ttc" id="a07995_html_afea08a0d2315df4b6da1318c74be7114"><div class="ttname"><a href="a07995.html#afea08a0d2315df4b6da1318c74be7114">std::unordered_multimap::max_load_factor</a></div><div class="ttdeci">void max_load_factor(float __z)</div><div class="ttdoc">Change the unordered_multimap maximum load factor.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01931">unordered_map.h:1931</a></div></div>
<div class="ttc" id="a07995_html_ac9032d22474fc3c5ec4d0b74362b5f4e"><div class="ttname"><a href="a07995.html#ac9032d22474fc3c5ec4d0b74362b5f4e">std::unordered_multimap::rehash</a></div><div class="ttdeci">void rehash(size_type __n)</div><div class="ttdoc">May rehash the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01942">unordered_map.h:1942</a></div></div>
<div class="ttc" id="a07999_html_ac2f6c6ba48b39f7e17b4760d809ebf26"><div class="ttname"><a href="a07999.html#ac2f6c6ba48b39f7e17b4760d809ebf26">std::unordered_map::unordered_map</a></div><div class="ttdeci">unordered_map(const allocator_type &__a)</div><div class="ttdoc">Creates an unordered_map with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00191">unordered_map.h:191</a></div></div>
<div class="ttc" id="a07995_html_ab91e542e87512944adfb13fcff51d7c8"><div class="ttname"><a href="a07995.html#ab91e542e87512944adfb13fcff51d7c8">std::unordered_multimap::difference_type</a></div><div class="ttdeci">_Hashtable::difference_type difference_type</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01261">unordered_map.h:1261</a></div></div>
<div class="ttc" id="a07999_html_a786093f27f238f88c21ecbfe11e27981"><div class="ttname"><a href="a07999.html#a786093f27f238f88c21ecbfe11e27981">std::unordered_map::cend</a></div><div class="ttdeci">const_local_iterator cend(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to one past the last bucket elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01076">unordered_map.h:1076</a></div></div>
<div class="ttc" id="a07999_html_a047d2b3433747276ee6daa9eba154295"><div class="ttname"><a href="a07999.html#a047d2b3433747276ee6daa9eba154295">std::unordered_map::insert</a></div><div class="ttdeci">std::pair< iterator, bool > insert(const value_type &__x)</div><div class="ttdoc">Attempts to insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00579">unordered_map.h:579</a></div></div>
<div class="ttc" id="a07995_html_acb1935806673ced5dae48aa64d8cabc3"><div class="ttname"><a href="a07995.html#acb1935806673ced5dae48aa64d8cabc3">std::unordered_multimap::insert</a></div><div class="ttdeci">void insert(initializer_list< value_type > __l)</div><div class="ttdoc">Attempts to insert a list of elements into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01625">unordered_map.h:1625</a></div></div>
<div class="ttc" id="a07999_html_a3e1eaafb2b3f1f11809491426d373485"><div class="ttname"><a href="a07999.html#a3e1eaafb2b3f1f11809491426d373485">std::unordered_map::reference</a></div><div class="ttdeci">_Hashtable::reference reference</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00123">unordered_map.h:123</a></div></div>
<div class="ttc" id="a04707_html"><div class="ttname"><a href="a04707.html">std::allocator</a></div><div class="ttdoc">The standard allocator, as per [20.4].</div><div class="ttdef"><b>Definition:</b> <a href="a00272_source.html#l00108">allocator.h:108</a></div></div>
<div class="ttc" id="a07995_html_aabce46436201e63f88dbebc168f9d84a"><div class="ttname"><a href="a07995.html#aabce46436201e63f88dbebc168f9d84a">std::unordered_multimap::begin</a></div><div class="ttdeci">const_local_iterator begin(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to the first bucket element.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01879">unordered_map.h:1879</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="a07999_html_a2d7a21a98b09239b8745900308e63643"><div class="ttname"><a href="a07999.html#a2d7a21a98b09239b8745900308e63643">std::unordered_map::operator[]</a></div><div class="ttdeci">mapped_type & operator[](const key_type &__k)</div><div class="ttdoc">Subscript ( [] ) access to unordered_map data.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00973">unordered_map.h:973</a></div></div>
<div class="ttc" id="a07999_html_a6d830d6d91653672a6f20b748327622b"><div class="ttname"><a href="a07999.html#a6d830d6d91653672a6f20b748327622b">std::unordered_map::mapped_type</a></div><div class="ttdeci">_Hashtable::mapped_type mapped_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00113">unordered_map.h:113</a></div></div>
<div class="ttc" id="a07999_html_a1b17775816c782568baefd357cd50e88"><div class="ttname"><a href="a07999.html#a1b17775816c782568baefd357cd50e88">std::unordered_map::erase</a></div><div class="ttdeci">iterator erase(const_iterator __first, const_iterator __last)</div><div class="ttdoc">Erases a [__first,__last) range of elements from an unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00832">unordered_map.h:832</a></div></div>
<div class="ttc" id="a07999_html"><div class="ttname"><a href="a07999.html">std::unordered_map</a></div><div class="ttdoc">A standard container composed of unique keys (containing at most one of each key value) that associat...</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00102">unordered_map.h:102</a></div></div>
<div class="ttc" id="a07999_html_a21d659d8a7b18d41726d04ed6451d1ce"><div class="ttname"><a href="a07999.html#a21d659d8a7b18d41726d04ed6451d1ce">std::unordered_map::operator[]</a></div><div class="ttdeci">mapped_type & operator[](key_type &&__k)</div><div class="ttdoc">Subscript ( [] ) access to unordered_map data.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00977">unordered_map.h:977</a></div></div>
<div class="ttc" id="a07999_html_a695e48bcb2fa9e91ad07d3f7c45016dd"><div class="ttname"><a href="a07999.html#a695e48bcb2fa9e91ad07d3f7c45016dd">std::unordered_map::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdoc">Returns the maximum size of the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00314">unordered_map.h:314</a></div></div>
<div class="ttc" id="a07999_html_a801392267ec716837238015f8cefe60a"><div class="ttname"><a href="a07999.html#a801392267ec716837238015f8cefe60a">std::unordered_map::at</a></div><div class="ttdeci">mapped_type & at(const key_type &__k)</div><div class="ttdoc">Access to unordered_map data.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00990">unordered_map.h:990</a></div></div>
<div class="ttc" id="a07995_html_accd0a24f61c8161dbd0fe216ead19142"><div class="ttname"><a href="a07995.html#accd0a24f61c8161dbd0fe216ead19142">std::unordered_multimap::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdoc">Returns the maximum size of the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01444">unordered_map.h:1444</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="a07999_html_adef61b0f6b1e43cfdb648e247277ba00"><div class="ttname"><a href="a07999.html#adef61b0f6b1e43cfdb648e247277ba00">std::unordered_map::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from an unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00792">unordered_map.h:792</a></div></div>
<div class="ttc" id="a07999_html_a9d409d14c46998843b60af82785dfd80"><div class="ttname"><a href="a07999.html#a9d409d14c46998843b60af82785dfd80">std::unordered_map::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00333">unordered_map.h:333</a></div></div>
<div class="ttc" id="a07999_html_a6bc68dfdbfb4fe6917fe43aaec5385c6"><div class="ttname"><a href="a07999.html#a6bc68dfdbfb4fe6917fe43aaec5385c6">std::unordered_map::unordered_map</a></div><div class="ttdeci">unordered_map()=default</div><div class="ttdoc">Default constructor.</div></div>
<div class="ttc" id="a07995_html_afabc6af09a31459a08760bcec32a0b6d"><div class="ttname"><a href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">std::unordered_multimap::key_equal</a></div><div class="ttdeci">_Hashtable::key_equal key_equal</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01246">unordered_map.h:1246</a></div></div>
<div class="ttc" id="a07999_html_a6b763e0c9c40786e19c26f5fa97e3ab6"><div class="ttname"><a href="a07999.html#a6b763e0c9c40786e19c26f5fa97e3ab6">std::unordered_map::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00355">unordered_map.h:355</a></div></div>
<div class="ttc" id="a02839_html"><div class="ttname"><a href="a02839.html">std::hash</a></div><div class="ttdoc">Primary class template hash.</div><div class="ttdef"><b>Definition:</b> <a href="a00155_source.html#l00142">system_error:142</a></div></div>
<div class="ttc" id="a07999_html_af7e7d39b4a188c7aa535d0431ae8f14c"><div class="ttname"><a href="a07999.html#af7e7d39b4a188c7aa535d0431ae8f14c">std::unordered_map::value_type</a></div><div class="ttdeci">_Hashtable::value_type value_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00112">unordered_map.h:112</a></div></div>
<div class="ttc" id="a07995_html_aa38e97c00a7b10fb37726206ebc57800"><div class="ttname"><a href="a07995.html#aa38e97c00a7b10fb37726206ebc57800">std::unordered_multimap::erase</a></div><div class="ttdeci">iterator erase(const_iterator __first, const_iterator __last)</div><div class="ttdoc">Erases a [__first,__last) range of elements from an unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01708">unordered_map.h:1708</a></div></div>
<div class="ttc" id="a07999_html_a56149c061cd4aca92d631f7ad5a5a737"><div class="ttname"><a href="a07999.html#a56149c061cd4aca92d631f7ad5a5a737">std::unordered_map::erase</a></div><div class="ttdeci">size_type erase(const key_type &__x)</div><div class="ttdoc">Erases elements according to the provided key.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00814">unordered_map.h:814</a></div></div>
<div class="ttc" id="a07999_html_a301e117827c134ed289b5d19e5c8a36e"><div class="ttname"><a href="a07999.html#a301e117827c134ed289b5d19e5c8a36e">std::unordered_map::equal_range</a></div><div class="ttdeci">std::pair< iterator, iterator > equal_range(const key_type &__x)</div><div class="ttdoc">Finds a subsequence matching given key.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00951">unordered_map.h:951</a></div></div>
<div class="ttc" id="a07999_html_aede8ad7332db3b16e68cec19c0dd963e"><div class="ttname"><a href="a07999.html#aede8ad7332db3b16e68cec19c0dd963e">std::unordered_map::difference_type</a></div><div class="ttdeci">_Hashtable::difference_type difference_type</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00130">unordered_map.h:130</a></div></div>
<div class="ttc" id="a07995_html_a0fffce26090303390cc7fce06b5f6615"><div class="ttname"><a href="a07995.html#a0fffce26090303390cc7fce06b5f6615">std::unordered_multimap::iterator</a></div><div class="ttdeci">_Hashtable::iterator iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01256">unordered_map.h:1256</a></div></div>
<div class="ttc" id="a07999_html_a13808c3062786f090b1af63937f15963"><div class="ttname"><a href="a07999.html#a13808c3062786f090b1af63937f15963">std::unordered_map::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Returns the allocator object used by the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00297">unordered_map.h:297</a></div></div>
<div class="ttc" id="a07999_html_a326f910adabc220031b93dc6b472b913"><div class="ttname"><a href="a07999.html#a326f910adabc220031b93dc6b472b913">std::unordered_map::cbegin</a></div><div class="ttdeci">const_local_iterator cbegin(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to the first bucket element.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01050">unordered_map.h:1050</a></div></div>
<div class="ttc" id="a07999_html_ab91675efcde6f50894587cdb2037a4fc"><div class="ttname"><a href="a07999.html#ab91675efcde6f50894587cdb2037a4fc">std::unordered_map::end</a></div><div class="ttdeci">local_iterator end(size_type __n)</div><div class="ttdoc">Returns a read/write iterator pointing to one past the last bucket elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01061">unordered_map.h:1061</a></div></div>
<div class="ttc" id="a07995_html_a96159c845937ab5729b5ed41a7ef6071"><div class="ttname"><a href="a07995.html#a96159c845937ab5729b5ed41a7ef6071">std::unordered_multimap::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01718">unordered_map.h:1718</a></div></div>
<div class="ttc" id="a07995_html_ac8d3f27e1315796ddcc9b55378f90ce7"><div class="ttname"><a href="a07995.html#ac8d3f27e1315796ddcc9b55378f90ce7">std::unordered_multimap::swap</a></div><div class="ttdeci">void swap(unordered_multimap &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))</div><div class="ttdoc">Swaps data with another unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01732">unordered_map.h:1732</a></div></div>
<div class="ttc" id="a07995_html_a9f64e8fbc46b2fec76e96499ac91c8b6"><div class="ttname"><a href="a07995.html#a9f64e8fbc46b2fec76e96499ac91c8b6">std::unordered_multimap::find</a></div><div class="ttdeci">iterator find(const key_type &__x)</div><div class="ttdoc">Tries to locate an element in an unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01798">unordered_map.h:1798</a></div></div>
<div class="ttc" id="a07995_html"><div class="ttname"><a href="a07995.html">std::unordered_multimap</a></div><div class="ttdoc">A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00073">unordered_map.h:73</a></div></div>
<div class="ttc" id="a07995_html_a79303f819716015a95be11962dda3e53"><div class="ttname"><a href="a07995.html#a79303f819716015a95be11962dda3e53">std::unordered_multimap::insert</a></div><div class="ttdeci">iterator insert(const value_type &__x)</div><div class="ttdoc">Inserts a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01553">unordered_map.h:1553</a></div></div>
<div class="ttc" id="a07995_html_a3a54562ef76d4966a496b86691fdfb12"><div class="ttname"><a href="a07995.html#a3a54562ef76d4966a496b86691fdfb12">std::unordered_multimap::find</a></div><div class="ttdeci">const_iterator find(const key_type &__x) const</div><div class="ttdoc">Tries to locate an element in an unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01802">unordered_map.h:1802</a></div></div>
<div class="ttc" id="a07995_html_a1fd8297776af120bf58bb6252562fc35"><div class="ttname"><a href="a07995.html#a1fd8297776af120bf58bb6252562fc35">std::unordered_multimap::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01463">unordered_map.h:1463</a></div></div>
<div class="ttc" id="a07995_html_acc5c6d3a39a12f7d21e8886534eaa591"><div class="ttname"><a href="a07995.html#acc5c6d3a39a12f7d21e8886534eaa591">std::unordered_multimap::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01489">unordered_map.h:1489</a></div></div>
<div class="ttc" id="a07999_html_ab862dadbaf3147cfc02bd383ed35e1f9"><div class="ttname"><a href="a07999.html#ab862dadbaf3147cfc02bd383ed35e1f9">std::unordered_map::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00359">unordered_map.h:359</a></div></div>
<div class="ttc" id="a07995_html_a208a268d709e23f97d5763d2f24de4f2"><div class="ttname"><a href="a07995.html#a208a268d709e23f97d5763d2f24de4f2">std::unordered_multimap::hash_function</a></div><div class="ttdeci">hasher hash_function() const</div><div class="ttdoc">Returns the hash functor object with which the unordered_multimap was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01774">unordered_map.h:1774</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="a07999_html_a0c40f8641ff4ca47fe2998a46404cf37"><div class="ttname"><a href="a07999.html#a0c40f8641ff4ca47fe2998a46404cf37">std::unordered_map::insert</a></div><div class="ttdeci">void insert(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A template function that attempts to insert a range of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00644">unordered_map.h:644</a></div></div>
<div class="ttc" id="a07999_html_acefc3dbfc16b70562f92193d01156479"><div class="ttname"><a href="a07999.html#acefc3dbfc16b70562f92193d01156479">std::unordered_map::size_type</a></div><div class="ttdeci">_Hashtable::size_type size_type</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00129">unordered_map.h:129</a></div></div>
<div class="ttc" id="a07995_html_a708a8efab9b1b9d8f1e41ca3ae2caaa5"><div class="ttname"><a href="a07995.html#a708a8efab9b1b9d8f1e41ca3ae2caaa5">std::unordered_multimap::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01476">unordered_map.h:1476</a></div></div>
<div class="ttc" id="a07999_html_a4cbd19e5e859635c70822a7e1faa8e36"><div class="ttname"><a href="a07999.html#a4cbd19e5e859635c70822a7e1faa8e36">std::unordered_map::count</a></div><div class="ttdeci">size_type count(const key_type &__x) const</div><div class="ttdoc">Finds the number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00938">unordered_map.h:938</a></div></div>
<div class="ttc" id="a07999_html_a0584274b6378b6d962debbe96f5c5cb6"><div class="ttname"><a href="a07999.html#a0584274b6378b6d962debbe96f5c5cb6">std::unordered_map::max_load_factor</a></div><div class="ttdeci">void max_load_factor(float __z)</div><div class="ttdoc">Change the unordered_map maximum load factor.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01098">unordered_map.h:1098</a></div></div>
<div class="ttc" id="a07995_html_a4baa45433c393ecfab2c784b8de381e8"><div class="ttname"><a href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">std::unordered_multimap::value_type</a></div><div class="ttdeci">_Hashtable::value_type value_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01243">unordered_map.h:1243</a></div></div>
<div class="ttc" id="a07999_html_a606977180c30d7a49a36846a45f4e355"><div class="ttname"><a href="a07999.html#a606977180c30d7a49a36846a45f4e355">std::unordered_map::end</a></div><div class="ttdeci">const_local_iterator end(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to one past the last bucket elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01072">unordered_map.h:1072</a></div></div>
<div class="ttc" id="a07999_html_a46087d4d85698c13e7fe5e10f13821d1"><div class="ttname"><a href="a07999.html#a46087d4d85698c13e7fe5e10f13821d1">std::unordered_map::operator=</a></div><div class="ttdeci">unordered_map & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Unordered_map list assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00289">unordered_map.h:289</a></div></div>
<div class="ttc" id="a07995_html_a0c57013bd56a6fc373659c4e5807a64d"><div class="ttname"><a href="a07995.html#a0c57013bd56a6fc373659c4e5807a64d">std::unordered_multimap::bucket_count</a></div><div class="ttdeci">size_type bucket_count() const noexcept</div><div class="ttdoc">Returns the number of buckets of the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01835">unordered_map.h:1835</a></div></div>
<div class="ttc" id="a07999_html_aca0525353d274a1abca19e123ca58702"><div class="ttname"><a href="a07999.html#aca0525353d274a1abca19e123ca58702">std::unordered_map::operator=</a></div><div class="ttdeci">unordered_map & operator=(const unordered_map &)=default</div><div class="ttdoc">Copy assignment operator.</div></div>
<div class="ttc" id="a07995_html_ab9e187c541bf3fe290dd21b514abd024"><div class="ttname"><a href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">std::unordered_multimap::size_type</a></div><div class="ttdeci">_Hashtable::size_type size_type</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01260">unordered_map.h:1260</a></div></div>
<div class="ttc" id="a07999_html_acb0e1b9ce26687d13dace99250f876e3"><div class="ttname"><a href="a07999.html#acb0e1b9ce26687d13dace99250f876e3">std::unordered_map::const_iterator</a></div><div class="ttdeci">_Hashtable::const_iterator const_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00126">unordered_map.h:126</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="a07999_html_ac9588299378201162e3f7da7e7d30fdf"><div class="ttname"><a href="a07999.html#ac9588299378201162e3f7da7e7d30fdf">std::unordered_map::hash_function</a></div><div class="ttdeci">hasher hash_function() const</div><div class="ttdoc">Returns the hash functor object with which the unordered_map was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00896">unordered_map.h:896</a></div></div>
<div class="ttc" id="a07999_html_add961e22f4549e2c94846946fbd25a7d"><div class="ttname"><a href="a07999.html#add961e22f4549e2c94846946fbd25a7d">std::unordered_map::load_factor</a></div><div class="ttdeci">float load_factor() const noexcept</div><div class="ttdoc">Returns the average number of elements per bucket.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01084">unordered_map.h:1084</a></div></div>
<div class="ttc" id="a07995_html_a04b3ff006b08f143403c12e743ced9b6"><div class="ttname"><a href="a07995.html#a04b3ff006b08f143403c12e743ced9b6">std::unordered_multimap::operator=</a></div><div class="ttdeci">unordered_multimap & operator=(const unordered_multimap &)=default</div><div class="ttdoc">Copy assignment operator.</div></div>
<div class="ttc" id="a07995_html_a4209ed9ce2c4549ded624445fa59416f"><div class="ttname"><a href="a07995.html#a4209ed9ce2c4549ded624445fa59416f">std::unordered_multimap::end</a></div><div class="ttdeci">local_iterator end(size_type __n)</div><div class="ttdoc">Returns a read/write iterator pointing to one past the last bucket elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01894">unordered_map.h:1894</a></div></div>
<div class="ttc" id="a07999_html_a73cb0bbad75ff10a8493cdb155b81146"><div class="ttname"><a href="a07999.html#a73cb0bbad75ff10a8493cdb155b81146">std::unordered_map::begin</a></div><div class="ttdeci">const_local_iterator begin(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to the first bucket element.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01046">unordered_map.h:1046</a></div></div>
<div class="ttc" id="a07999_html_ac563e7804340b706c3efeca91157585b"><div class="ttname"><a href="a07999.html#ac563e7804340b706c3efeca91157585b">std::unordered_map::key_type</a></div><div class="ttdeci">_Hashtable::key_type key_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00111">unordered_map.h:111</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="a07999_html_ac90866b0f04d5366339b63f8e26bde06"><div class="ttname"><a href="a07999.html#ac90866b0f04d5366339b63f8e26bde06">std::unordered_map::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00324">unordered_map.h:324</a></div></div>
<div class="ttc" id="a07995_html_ae1c99977950ad720b2b10f6daf6c31ab"><div class="ttname"><a href="a07995.html#ae1c99977950ad720b2b10f6daf6c31ab">std::unordered_multimap::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01467">unordered_map.h:1467</a></div></div>
<div class="ttc" id="a07995_html_a8cb5d0ca110f847b3fceed2d07472710"><div class="ttname"><a href="a07995.html#a8cb5d0ca110f847b3fceed2d07472710">std::unordered_multimap::local_iterator</a></div><div class="ttdeci">_Hashtable::local_iterator local_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01258">unordered_map.h:1258</a></div></div>
<div class="ttc" id="a07999_html_adb80cc201b9b5b821e8ef73492106db3"><div class="ttname"><a href="a07999.html#adb80cc201b9b5b821e8ef73492106db3">std::unordered_map::insert</a></div><div class="ttdeci">std::pair< iterator, bool > insert(value_type &&__x)</div><div class="ttdoc">Attempts to insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00585">unordered_map.h:585</a></div></div>
<div class="ttc" id="a07995_html_a6c608c4a4f2041d5045df49143124cfa"><div class="ttname"><a href="a07995.html#a6c608c4a4f2041d5045df49143124cfa">std::unordered_multimap::equal_range</a></div><div class="ttdeci">std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const</div><div class="ttdoc">Finds a subsequence matching given key.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01827">unordered_map.h:1827</a></div></div>
<div class="ttc" id="a07999_html_a2eee23bd13796426f3018c8a9341202f"><div class="ttname"><a href="a07999.html#a2eee23bd13796426f3018c8a9341202f">std::unordered_map::reserve</a></div><div class="ttdeci">void reserve(size_type __n)</div><div class="ttdoc">Prepare the unordered_map for a specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01120">unordered_map.h:1120</a></div></div>
<div class="ttc" id="a07999_html_a42872e15c417c6f944d019315553951e"><div class="ttname"><a href="a07999.html#a42872e15c417c6f944d019315553951e">std::unordered_map::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00346">unordered_map.h:346</a></div></div>
<div class="ttc" id="a07995_html_a8a087ced0dd9a5d8e57c101627b67fb6"><div class="ttname"><a href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">std::unordered_multimap::hasher</a></div><div class="ttdeci">_Hashtable::hasher hasher</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01245">unordered_map.h:1245</a></div></div>
<div class="ttc" id="a07999_html_af81fbed78a715d3c81e8c7655669c7e7"><div class="ttname"><a href="a07999.html#af81fbed78a715d3c81e8c7655669c7e7">std::unordered_map::rehash</a></div><div class="ttdeci">void rehash(size_type __n)</div><div class="ttdoc">May rehash the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01109">unordered_map.h:1109</a></div></div>
<div class="ttc" id="a07999_html_a3eb7753105411145e2d8476cf300b348"><div class="ttname"><a href="a07999.html#a3eb7753105411145e2d8476cf300b348">std::unordered_map::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, const value_type &__x)</div><div class="ttdoc">Attempts to insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00618">unordered_map.h:618</a></div></div>
<div class="ttc" id="a07995_html_ab7ecc0576cd505fe517ffbbae066d3d6"><div class="ttname"><a href="a07995.html#ab7ecc0576cd505fe517ffbbae066d3d6">std::unordered_multimap::unordered_multimap</a></div><div class="ttdeci">unordered_multimap(const allocator_type &__a)</div><div class="ttdoc">Creates an unordered_multimap with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01321">unordered_map.h:1321</a></div></div>
<div class="ttc" id="a07999_html_ab04b983f5337e79f121f2df4bbaa283c"><div class="ttname"><a href="a07999.html#ab04b983f5337e79f121f2df4bbaa283c">std::unordered_map::erase</a></div><div class="ttdeci">iterator erase(iterator __position)</div><div class="ttdoc">Erases an element from an unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00797">unordered_map.h:797</a></div></div>
<div class="ttc" id="a07999_html_acae490543303c7ea2365e5a53bc7d131"><div class="ttname"><a href="a07999.html#acae490543303c7ea2365e5a53bc7d131">std::unordered_map::unordered_map</a></div><div class="ttdeci">unordered_map(initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds an unordered_map from an initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00226">unordered_map.h:226</a></div></div>
<div class="ttc" id="a07999_html_aa956e7eb800e72fbab9b54f3ef006d8e"><div class="ttname"><a href="a07999.html#aa956e7eb800e72fbab9b54f3ef006d8e">std::unordered_map::key_eq</a></div><div class="ttdeci">key_equal key_eq() const</div><div class="ttdoc">Returns the key comparison object with which the unordered_map was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00902">unordered_map.h:902</a></div></div>
<div class="ttc" id="a07995_html_af7f415a309a77497c41538b60d358fed"><div class="ttname"><a href="a07995.html#af7f415a309a77497c41538b60d358fed">std::unordered_multimap::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Attempts to build and insert a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01539">unordered_map.h:1539</a></div></div>
<div class="ttc" id="a07995_html_a55b2bb934fcc4f41eaa67280c73ff1d5"><div class="ttname"><a href="a07995.html#a55b2bb934fcc4f41eaa67280c73ff1d5">std::unordered_multimap::equal_range</a></div><div class="ttdeci">std::pair< iterator, iterator > equal_range(const key_type &__x)</div><div class="ttdoc">Finds a subsequence matching given key.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01823">unordered_map.h:1823</a></div></div>
<div class="ttc" id="a07999_html_a1f78ebfeb9bf55bc807a075eb22cb2aa"><div class="ttname"><a href="a07999.html#a1f78ebfeb9bf55bc807a075eb22cb2aa">std::unordered_map::at</a></div><div class="ttdeci">const mapped_type & at(const key_type &__k) const</div><div class="ttdoc">Access to unordered_map data.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00994">unordered_map.h:994</a></div></div>
<div class="ttc" id="a07995_html_a08eec5ee5f497c48d356443110934fdd"><div class="ttname"><a href="a07995.html#a08eec5ee5f497c48d356443110934fdd">std::unordered_multimap::erase</a></div><div class="ttdeci">iterator erase(iterator __position)</div><div class="ttdoc">Erases an element from an unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01673">unordered_map.h:1673</a></div></div>
<div class="ttc" id="a07995_html_a46f035c31a44c4051965af7868d40e77"><div class="ttname"><a href="a07995.html#a46f035c31a44c4051965af7868d40e77">std::unordered_multimap::insert</a></div><div class="ttdeci">void insert(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A template function that attempts to insert a range of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01613">unordered_map.h:1613</a></div></div>
<div class="ttc" id="a07995_html_a72250fbcb87cc6ea4998eb8f00465650"><div class="ttname"><a href="a07995.html#a72250fbcb87cc6ea4998eb8f00465650">std::unordered_multimap::max_load_factor</a></div><div class="ttdeci">float max_load_factor() const noexcept</div><div class="ttdoc">Returns a positive number that the unordered_multimap tries to keep the load factor less than or equa...</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01923">unordered_map.h:1923</a></div></div>
<div class="ttc" id="a07999_html_a4d72f478fb0cd05cc612e7ac746131ac"><div class="ttname"><a href="a07999.html#a4d72f478fb0cd05cc612e7ac746131ac">std::unordered_map::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdoc">Returns true if the unordered_map is empty.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00304">unordered_map.h:304</a></div></div>
<div class="ttc" id="a07995_html_a580c722f453604f50c163788a75fd6c3"><div class="ttname"><a href="a07995.html#a580c722f453604f50c163788a75fd6c3">std::unordered_multimap::const_reference</a></div><div class="ttdeci">_Hashtable::const_reference const_reference</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01255">unordered_map.h:1255</a></div></div>
<div class="ttc" id="a07999_html_ae4f015606d8e138c72eb87ce5f89ed50"><div class="ttname"><a href="a07999.html#ae4f015606d8e138c72eb87ce5f89ed50">std::unordered_map::insert</a></div><div class="ttdeci">__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(const_iterator __hint, _Pair &&__x)</div><div class="ttdoc">Attempts to insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00629">unordered_map.h:629</a></div></div>
<div class="ttc" id="a07999_html_a434ca8d37d3262f336f06903abbd170b"><div class="ttname"><a href="a07999.html#a434ca8d37d3262f336f06903abbd170b">std::unordered_map::allocator_type</a></div><div class="ttdeci">_Hashtable::allocator_type allocator_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00116">unordered_map.h:116</a></div></div>
<div class="ttc" id="a07999_html_ac8a1a3c1d13adf8908c863a707fa40aa"><div class="ttname"><a href="a07999.html#ac8a1a3c1d13adf8908c863a707fa40aa">std::unordered_map::bucket_count</a></div><div class="ttdeci">size_type bucket_count() const noexcept</div><div class="ttdoc">Returns the number of buckets of the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01002">unordered_map.h:1002</a></div></div>
<div class="ttc" id="a07999_html_af9610ba94f6f17e7af50d7280638fa17"><div class="ttname"><a href="a07999.html#af9610ba94f6f17e7af50d7280638fa17">std::unordered_map::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00337">unordered_map.h:337</a></div></div>
<div class="ttc" id="a07995_html_aa7cd9ddc32c88838cfcd1f2cc53ae5ab"><div class="ttname"><a href="a07995.html#aa7cd9ddc32c88838cfcd1f2cc53ae5ab">std::unordered_multimap::end</a></div><div class="ttdeci">const_local_iterator end(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to one past the last bucket elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01905">unordered_map.h:1905</a></div></div>
<div class="ttc" id="a07995_html_ade6cdef7282f352738f0a2bde236cf06"><div class="ttname"><a href="a07995.html#ade6cdef7282f352738f0a2bde236cf06">std::unordered_multimap::insert</a></div><div class="ttdeci">__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(_Pair &&__x)</div><div class="ttdoc">Inserts a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01562">unordered_map.h:1562</a></div></div>
<div class="ttc" id="a07995_html_a1dd84e27aa97a782f79e757eadcd5461"><div class="ttname"><a href="a07995.html#a1dd84e27aa97a782f79e757eadcd5461">std::unordered_multimap::operator=</a></div><div class="ttdeci">unordered_multimap & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Unordered_multimap list assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01419">unordered_map.h:1419</a></div></div>
<div class="ttc" id="a07995_html_a73f5c66280686af351a204b1d98774b6"><div class="ttname"><a href="a07995.html#a73f5c66280686af351a204b1d98774b6">std::unordered_multimap::insert</a></div><div class="ttdeci">iterator insert(value_type &&__x)</div><div class="ttdoc">Inserts a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01557">unordered_map.h:1557</a></div></div>
<div class="ttc" id="a07995_html_a722b99e1c15c3f0538bb6e2a2df15c32"><div class="ttname"><a href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">std::unordered_multimap::unordered_multimap</a></div><div class="ttdeci">unordered_multimap()=default</div><div class="ttdoc">Default constructor.</div></div>
<div class="ttc" id="a07999_html_aaa3ed5ea37fb02cd6a5eacf89409f52d"><div class="ttname"><a href="a07999.html#aaa3ed5ea37fb02cd6a5eacf89409f52d">std::unordered_map::const_reference</a></div><div class="ttdeci">_Hashtable::const_reference const_reference</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00124">unordered_map.h:124</a></div></div>
<div class="ttc" id="a07995_html_afb20a72b3b3284f980ec948c79e3b59d"><div class="ttname"><a href="a07995.html#afb20a72b3b3284f980ec948c79e3b59d">std::unordered_multimap::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Returns the allocator object used by the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01427">unordered_map.h:1427</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="a07999_html_a917dcd56682abf611f68cb72cbfb7d3e"><div class="ttname"><a href="a07999.html#a917dcd56682abf611f68cb72cbfb7d3e">std::unordered_map::hasher</a></div><div class="ttdeci">_Hashtable::hasher hasher</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00114">unordered_map.h:114</a></div></div>
<div class="ttc" id="a07999_html_aab940536a56eb520d8e7143ce5c4af3a"><div class="ttname"><a href="a07999.html#aab940536a56eb520d8e7143ce5c4af3a">std::unordered_map::local_iterator</a></div><div class="ttdeci">_Hashtable::local_iterator local_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00127">unordered_map.h:127</a></div></div>
<div class="ttc" id="a07995_html_ae371392b325c1cdecb9bfdb891ee9fb0"><div class="ttname"><a href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">std::unordered_multimap::key_type</a></div><div class="ttdeci">_Hashtable::key_type key_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01242">unordered_map.h:1242</a></div></div>
<div class="ttc" id="a07999_html_a21e644ce722b02f5304757ea9be5b23e"><div class="ttname"><a href="a07999.html#a21e644ce722b02f5304757ea9be5b23e">std::unordered_map::equal_range</a></div><div class="ttdeci">std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const</div><div class="ttdoc">Finds a subsequence matching given key.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00955">unordered_map.h:955</a></div></div>
<div class="ttc" id="a07999_html_aa2c22cafc2b6f068358049c8fdb7bda0"><div class="ttname"><a href="a07999.html#aa2c22cafc2b6f068358049c8fdb7bda0">std::unordered_map::emplace</a></div><div class="ttdeci">std::pair< iterator, bool > emplace(_Args &&... __args)</div><div class="ttdoc">Attempts to build and insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00387">unordered_map.h:387</a></div></div>
<div class="ttc" id="a07995_html_a08487e5381fd61795c61cfa0fed8e48f"><div class="ttname"><a href="a07995.html#a08487e5381fd61795c61cfa0fed8e48f">std::unordered_multimap::reference</a></div><div class="ttdeci">_Hashtable::reference reference</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01254">unordered_map.h:1254</a></div></div>
<div class="ttc" id="a07995_html_a02888ba9dce21c5e16ba09734ebdb642"><div class="ttname"><a href="a07995.html#a02888ba9dce21c5e16ba09734ebdb642">std::unordered_multimap::load_factor</a></div><div class="ttdeci">float load_factor() const noexcept</div><div class="ttdoc">Returns the average number of elements per bucket.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01917">unordered_map.h:1917</a></div></div>
<div class="ttc" id="a07995_html_a72025b859653a260f7e14bac43feae79"><div class="ttname"><a href="a07995.html#a72025b859653a260f7e14bac43feae79">std::unordered_multimap::begin</a></div><div class="ttdeci">local_iterator begin(size_type __n)</div><div class="ttdoc">Returns a read/write iterator pointing to the first bucket element.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01868">unordered_map.h:1868</a></div></div>
<div class="ttc" id="a07995_html_a94fbf8cd5ee67d47203f4a01bb2d6568"><div class="ttname"><a href="a07995.html#a94fbf8cd5ee67d47203f4a01bb2d6568">std::unordered_multimap::unordered_multimap</a></div><div class="ttdeci">unordered_multimap(_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds an unordered_multimap from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01302">unordered_map.h:1302</a></div></div>
<div class="ttc" id="a07999_html_af36454c8cd5831988060bdf85a4d4d6e"><div class="ttname"><a href="a07999.html#af36454c8cd5831988060bdf85a4d4d6e">std::unordered_map::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Attempts to build and insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00418">unordered_map.h:418</a></div></div>
<div class="ttc" id="a07999_html_aae182defe617c8d37e27b27b09277ea9"><div class="ttname"><a href="a07999.html#aae182defe617c8d37e27b27b09277ea9">std::unordered_map::insert</a></div><div class="ttdeci">__enable_if_t< is_constructible< value_type, _Pair && >::value, pair< iterator, bool > > insert(_Pair &&__x)</div><div class="ttdoc">Attempts to insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00591">unordered_map.h:591</a></div></div>
<div class="ttc" id="a07995_html_a3e1544ab885cd443cf557eb35db830e8"><div class="ttname"><a href="a07995.html#a3e1544ab885cd443cf557eb35db830e8">std::unordered_multimap::mapped_type</a></div><div class="ttdeci">_Hashtable::mapped_type mapped_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01244">unordered_map.h:1244</a></div></div>
<div class="ttc" id="a07995_html_ac2aca480ec930cab8cee31638ec6aa0c"><div class="ttname"><a href="a07995.html#ac2aca480ec930cab8cee31638ec6aa0c">std::unordered_multimap::const_pointer</a></div><div class="ttdeci">_Hashtable::const_pointer const_pointer</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01253">unordered_map.h:1253</a></div></div>
<div class="ttc" id="a07995_html_ad4f2132ee625dc5b3a48d28a495d552f"><div class="ttname"><a href="a07995.html#ad4f2132ee625dc5b3a48d28a495d552f">std::unordered_multimap::cbegin</a></div><div class="ttdeci">const_local_iterator cbegin(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to the first bucket element.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01883">unordered_map.h:1883</a></div></div>
<div class="ttc" id="a07995_html_ab04f4d4643b5de9638d2f5aaa31d94e5"><div class="ttname"><a href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">std::unordered_multimap::const_local_iterator</a></div><div class="ttdeci">_Hashtable::const_local_iterator const_local_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01259">unordered_map.h:1259</a></div></div>
<div class="ttc" id="a07995_html_a323e46db071ea6d46dca69efbbc4d075"><div class="ttname"><a href="a07995.html#a323e46db071ea6d46dca69efbbc4d075">std::unordered_multimap::count</a></div><div class="ttdeci">size_type count(const key_type &__x) const</div><div class="ttdoc">Finds the number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01812">unordered_map.h:1812</a></div></div>
<div class="ttc" id="a07999_html_ae06bac0d1fbee8603ec2ac806950b1ba"><div class="ttname"><a href="a07999.html#ae06bac0d1fbee8603ec2ac806950b1ba">std::unordered_map::swap</a></div><div class="ttdeci">void swap(unordered_map &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))</div><div class="ttdoc">Swaps data with another unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00856">unordered_map.h:856</a></div></div>
<div class="ttc" id="a07995_html_a0921ff9d001238f2f5b92f025378a37d"><div class="ttname"><a href="a07995.html#a0921ff9d001238f2f5b92f025378a37d">std::unordered_multimap::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01485">unordered_map.h:1485</a></div></div>
<div class="ttc" id="a07995_html_aeabc377e8c2f5b367388ee5e4e0aff99"><div class="ttname"><a href="a07995.html#aeabc377e8c2f5b367388ee5e4e0aff99">std::unordered_multimap::cend</a></div><div class="ttdeci">const_local_iterator cend(size_type __n) const</div><div class="ttdoc">Returns a read-only (constant) iterator pointing to one past the last bucket elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01909">unordered_map.h:1909</a></div></div>
<div class="ttc" id="a07995_html_a32226343bc7c4b8b0b14914fd3d105cb"><div class="ttname"><a href="a07995.html#a32226343bc7c4b8b0b14914fd3d105cb">std::unordered_multimap::key_eq</a></div><div class="ttdeci">key_equal key_eq() const</div><div class="ttdoc">Returns the key comparison object with which the unordered_multimap was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01780">unordered_map.h:1780</a></div></div>
<div class="ttc" id="a07999_html_a01d23be5cd83c13117d269bc1df1488f"><div class="ttname"><a href="a07999.html#a01d23be5cd83c13117d269bc1df1488f">std::unordered_map::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, value_type &&__x)</div><div class="ttdoc">Attempts to insert a std::pair into the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00624">unordered_map.h:624</a></div></div>
<div class="ttc" id="a07999_html_af0cb2cf999f96def015e87c3cca6691d"><div class="ttname"><a href="a07999.html#af0cb2cf999f96def015e87c3cca6691d">std::unordered_map::const_local_iterator</a></div><div class="ttdeci">_Hashtable::const_local_iterator const_local_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00128">unordered_map.h:128</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="a07995_html_aab5213cbfd6797faef226b949240b8ec"><div class="ttname"><a href="a07995.html#aab5213cbfd6797faef226b949240b8ec">std::unordered_multimap::allocator_type</a></div><div class="ttdeci">_Hashtable::allocator_type allocator_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01247">unordered_map.h:1247</a></div></div>
<div class="ttc" id="a07999_html_aab5cec3a4b8e6f4030f5baeacf92edbc"><div class="ttname"><a href="a07999.html#aab5cec3a4b8e6f4030f5baeacf92edbc">std::unordered_map::key_equal</a></div><div class="ttdeci">_Hashtable::key_equal key_equal</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00115">unordered_map.h:115</a></div></div>
<div class="ttc" id="a07999_html_ae0eddd81ee3d218ade072a8becffaff6"><div class="ttname"><a href="a07999.html#ae0eddd81ee3d218ade072a8becffaff6">std::unordered_map::begin</a></div><div class="ttdeci">local_iterator begin(size_type __n)</div><div class="ttdoc">Returns a read/write iterator pointing to the first bucket element.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01035">unordered_map.h:1035</a></div></div>
<div class="ttc" id="a07999_html_a94bb8e6f25731bdc01fb6c7b34022579"><div class="ttname"><a href="a07999.html#a94bb8e6f25731bdc01fb6c7b34022579">std::unordered_map::unordered_map</a></div><div class="ttdeci">unordered_map(_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds an unordered_map from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00172">unordered_map.h:172</a></div></div>
<div class="ttc" id="a07995_html_a1e8a71d9534d9f9cf27de31a025a3053"><div class="ttname"><a href="a07995.html#a1e8a71d9534d9f9cf27de31a025a3053">std::unordered_multimap::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01454">unordered_map.h:1454</a></div></div>
<div class="ttc" id="a07999_html_a589217c1b2ed3f77f57aeb41d5192d0d"><div class="ttname"><a href="a07999.html#a589217c1b2ed3f77f57aeb41d5192d0d">std::unordered_map::find</a></div><div class="ttdeci">const_iterator find(const key_type &__x) const</div><div class="ttdoc">Tries to locate an element in an unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00924">unordered_map.h:924</a></div></div>
<div class="ttc" id="a07995_html_af90dcd39d44bdeffe788e78ca829d639"><div class="ttname"><a href="a07995.html#af90dcd39d44bdeffe788e78ca829d639">std::unordered_multimap::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, value_type &&__x)</div><div class="ttdoc">Inserts a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01593">unordered_map.h:1593</a></div></div>
<div class="ttc" id="a07999_html_a16fbc4a1f8abfebdee17e4d6303c03a3"><div class="ttname"><a href="a07999.html#a16fbc4a1f8abfebdee17e4d6303c03a3">std::unordered_map::const_pointer</a></div><div class="ttdeci">_Hashtable::const_pointer const_pointer</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00122">unordered_map.h:122</a></div></div>
<div class="ttc" id="a07999_html_af29f5a18a09a36adb720b6907e45eacd"><div class="ttname"><a href="a07999.html#af29f5a18a09a36adb720b6907e45eacd">std::unordered_map::max_bucket_count</a></div><div class="ttdeci">size_type max_bucket_count() const noexcept</div><div class="ttdoc">Returns the maximum number of buckets of the unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01007">unordered_map.h:1007</a></div></div>
<div class="ttc" id="a07995_html_af7389296b49f59cc5a612fd769daaeeb"><div class="ttname"><a href="a07995.html#af7389296b49f59cc5a612fd769daaeeb">std::unordered_multimap::insert</a></div><div class="ttdeci">__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(const_iterator __hint, _Pair &&__x)</div><div class="ttdoc">Inserts a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01598">unordered_map.h:1598</a></div></div>
<div class="ttc" id="a07999_html_ad62fc2387c4fa4aefe228c14239f8c40"><div class="ttname"><a href="a07999.html#ad62fc2387c4fa4aefe228c14239f8c40">std::unordered_map::find</a></div><div class="ttdeci">iterator find(const key_type &__x)</div><div class="ttdoc">Tries to locate an element in an unordered_map.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00920">unordered_map.h:920</a></div></div>
<div class="ttc" id="a07995_html_a671564fa7d5dd0e04b651e78861c89ba"><div class="ttname"><a href="a07995.html#a671564fa7d5dd0e04b651e78861c89ba">std::unordered_multimap::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from an unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01668">unordered_map.h:1668</a></div></div>
<div class="ttc" id="a07995_html_aa11b69676f9f379ea2274cd722fae38d"><div class="ttname"><a href="a07995.html#aa11b69676f9f379ea2274cd722fae38d">std::unordered_multimap::unordered_multimap</a></div><div class="ttdeci">unordered_multimap(initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds an unordered_multimap from an initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01356">unordered_map.h:1356</a></div></div>
<div class="ttc" id="a07995_html_af02efb64c18107a5c4f13a1983cfa5a3"><div class="ttname"><a href="a07995.html#af02efb64c18107a5c4f13a1983cfa5a3">std::unordered_multimap::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdoc">Returns the size of the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01439">unordered_map.h:1439</a></div></div>
<div class="ttc" id="a07995_html_a4afc31e2217e4e10c6c821d38d9fa668"><div class="ttname"><a href="a07995.html#a4afc31e2217e4e10c6c821d38d9fa668">std::unordered_multimap::unordered_multimap</a></div><div class="ttdeci">unordered_multimap(size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Default constructor creates no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01281">unordered_map.h:1281</a></div></div>
<div class="ttc" id="a07995_html_aeb4625ec1e0a22af00ccb220e4c7c7b2"><div class="ttname"><a href="a07995.html#aeb4625ec1e0a22af00ccb220e4c7c7b2">std::unordered_multimap::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, const value_type &__x)</div><div class="ttdoc">Inserts a std::pair into the unordered_multimap.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01587">unordered_map.h:1587</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="a07995_html_a9167538c4058279e45627d0a68f3d030"><div class="ttname"><a href="a07995.html#a9167538c4058279e45627d0a68f3d030">std::unordered_multimap::reserve</a></div><div class="ttdeci">void reserve(size_type __n)</div><div class="ttdoc">Prepare the unordered_multimap for a specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01953">unordered_map.h:1953</a></div></div>
<div class="ttc" id="a07999_html_a743946b3813b8ec54b762a6edbae2934"><div class="ttname"><a href="a07999.html#a743946b3813b8ec54b762a6edbae2934">std::unordered_map::unordered_map</a></div><div class="ttdeci">unordered_map(size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Default constructor creates no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00151">unordered_map.h:151</a></div></div>
<div class="ttc" id="a07995_html_a09397dfd53f29fdbc8809d37ab11b142"><div class="ttname"><a href="a07995.html#a09397dfd53f29fdbc8809d37ab11b142">std::unordered_multimap::erase</a></div><div class="ttdeci">size_type erase(const key_type &__x)</div><div class="ttdoc">Erases elements according to the provided key.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l01689">unordered_map.h:1689</a></div></div>
<div class="ttc" id="a07999_html_a0526d137ece77ce98d550cd2d6fd1816"><div class="ttname"><a href="a07999.html#a0526d137ece77ce98d550cd2d6fd1816">std::unordered_map::iterator</a></div><div class="ttdeci">_Hashtable::iterator iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00125">unordered_map.h:125</a></div></div>
<div class="ttc" id="a07999_html_a9728c777ec0429619531a26201560c18"><div class="ttname"><a href="a07999.html#a9728c777ec0429619531a26201560c18">std::unordered_map::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00623_source.html#l00842">unordered_map.h:842</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="a00623.html">unordered_map.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
>
571
