<!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_set.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('a00626_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">unordered_set.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00626.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_set 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_set.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_set}</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_SET_H</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define _UNORDERED_SET_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_set.</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#a39fcc5869a652c651d6911a64a020e21"> 40</a></span>  <span class="keyword">using</span> <a class="code" href="a05615.html">__uset_traits</a> = <a class="code" href="a05615.html">__detail::_Hashtable_traits<_Cache, true, 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> _Value,</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">typename</span> _Hash = <a class="code" href="a02839.html">hash<_Value></a>,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">typename</span> _Pred = <a class="code" href="a07367.html">std::equal_to<_Value></a>,</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04707.html">std::allocator<_Value></a>,</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">typename</span> _Tr = <a class="code" href="a05615.html">__uset_traits<__cache_default<_Value, _Hash>::value</a>>></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__uset_hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Value, _Value, _Alloc,</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  __detail::_Identity, _Pred, _Hash,</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="a05651.html">__detail::_Mod_range_hashing</a>,</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <a class="code" href="a05655.html">__detail::_Default_ranged_hash</a>,</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <a class="code" href="a05659.html">__detail::_Prime_rehash_policy</a>, _Tr>;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> /// Base types for unordered_multiset.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keywordtype">bool</span> _Cache></div><div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="a01541.html#a82ea41b760d4cfe35fb4ce095415a24a"> 55</a></span>  <span class="keyword">using</span> <a class="code" href="a05615.html">__umset_traits</a> = <a class="code" href="a05615.html">__detail::_Hashtable_traits<_Cache, true, false></a>;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value,</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">typename</span> _Hash = <a class="code" href="a02839.html">hash<_Value></a>,</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">typename</span> _Pred = <a class="code" href="a07367.html">std::equal_to<_Value></a>,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04707.html">std::allocator<_Value></a>,</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">typename</span> _Tr = <a class="code" href="a05615.html">__umset_traits<__cache_default<_Value, _Hash>::value</a>>></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">using</span> <a class="code" href="a05583.html">__umset_hashtable</a> = <a class="code" href="a05583.html">_Hashtable</a><_Value, _Value, _Alloc,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  __detail::_Identity,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  _Pred, _Hash,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="a05651.html">__detail::_Mod_range_hashing</a>,</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="a05655.html">__detail::_Default_ranged_hash</a>,</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <a class="code" href="a05659.html">__detail::_Prime_rehash_policy</a>, _Tr>;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="a08003.html"> 70</a></span>  <span class="keyword">class </span><a class="code" href="a08003.html">unordered_multiset</a>;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"></span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> /**</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * @brief A standard container composed of unique keys (containing</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * at most one of each key value) in which the elements' keys are</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * the elements themselves.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> *</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * @ingroup unordered_associative_containers</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> *</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * @tparam _Value Type of key objects.</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * @tparam _Hash Hashing function object type, defaults to hash<_Value>.</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 _Pred Predicate function object type, defaults to</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * equal_to<_Value>.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> *</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Key>.</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> *</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, and</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * <a href="tables.html#xx">unordered associative container</a></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"> * Base is _Hashtable, dispatched at compile time via template</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * alias __uset_hashtable.</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="keyword">template</span><<span class="keyword">typename</span> _Value,</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typename</span> _Hash = <a class="code" href="a02839.html">hash<_Value></a>,</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typename</span> _Pred = <a class="code" href="a07367.html">equal_to<_Value></a>,</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04707.html">allocator<_Value></a>></div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="a08007.html"> 97</a></span>  <span class="keyword">class </span><a class="code" href="a08007.html">unordered_set</a></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typedef</span> <a class="code" href="a05583.html">__uset_hashtable<_Value, _Hash, _Pred, _Alloc></a> <a class="code" href="a05583.html">_Hashtable</a>;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="code" href="a05583.html">_Hashtable</a> _M_h;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// typedefs:</span><span class="comment"></span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"></span><span class="comment"> /// Public typedefs.</span></div><div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e"> 106</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_type <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>;</div><div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff"> 107</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::value_type <a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a>;</div><div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7"> 108</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::hasher <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>;</div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c"> 109</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_equal <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>;</div><div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="a08007.html#a9bba281b4f65b14513a532e398d37642"> 110</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::allocator_type <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>;<span class="comment"></span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"></span><span class="comment"> /// Iterator-related typedefs.</span></div><div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="a08007.html#af18aca91916dd9537f3c33cd7746b0f4"> 115</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::pointer <a class="code" href="a08007.html#af18aca91916dd9537f3c33cd7746b0f4">pointer</a>;</div><div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="a08007.html#a64c2420ac682e15e195863aecf2bcb8b"> 116</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_pointer <a class="code" href="a08007.html#a64c2420ac682e15e195863aecf2bcb8b">const_pointer</a>;</div><div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="a08007.html#a111a313624cf9219526288500218d406"> 117</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::reference <a class="code" href="a08007.html#a111a313624cf9219526288500218d406">reference</a>;</div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="a08007.html#a795d0f609bd9032858d61acc386ee11a"> 118</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_reference <a class="code" href="a08007.html#a795d0f609bd9032858d61acc386ee11a">const_reference</a>;</div><div class="line"><a name="l00119"></a><span class="lineno"><a class="line" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e"> 119</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::iterator <a class="code" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a>;</div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46"> 120</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_iterator <a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a>;</div><div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="a08007.html#a41daefac0150734553a1b8ae994520e6"> 121</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::local_iterator <a class="code" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a>;</div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="a08007.html#ad71108e3e7466e69cf84def961574aec"> 122</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_local_iterator <a class="code" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a>;</div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="a08007.html#a489606b8c31cc86a461912f292dac389"> 123</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::size_type <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a>;</div><div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="a08007.html#a78081fffb25f4c7c28a59c7cf4218c51"> 124</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::difference_type <a class="code" href="a08007.html#a78081fffb25f4c7c28a59c7cf4218c51">difference_type</a>;<span class="comment"></span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"></span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">using</span> node_type = <span class="keyword">typename</span> _Hashtable::node_type;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">using</span> insert_return_type = <span class="keyword">typename</span> _Hashtable::insert_return_type;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// construct/destroy/copy</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"></span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> /// Default constructor.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"></span> <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"></span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> /**</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> * @param __a An allocator object.</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="keyword">explicit</span></div><div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="a08007.html#aca41292a5bd6091c80f15eb124d35b05"> 145</a></span>  <a class="code" href="a08007.html#aca41292a5bd6091c80f15eb124d35b05">unordered_set</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n,</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>& __hf = <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(),</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>& __eql = <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(),</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a = <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>())</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  : _M_h(__n, __hf, __eql, __a)</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  { }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"></span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> /**</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> * @brief Builds an %unordered_set from a range.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> *</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * Create an %unordered_set consisting of copies of the elements from</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * [__first,__last). This is linear in N (where N is</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> */</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="a08007.html#adbea625ce309dd45648ae7d2d2fae5ad"> 166</a></span>  <a class="code" href="a08007.html#adbea625ce309dd45648ae7d2d2fae5ad">unordered_set</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n = 0,</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>& __hf = <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(),</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>& __eql = <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(),</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a = <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>())</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  : _M_h(__first, __last, __n, __hf, __eql, __a)</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  { }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"></span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> /// Copy constructor.</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"></span> <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(<span class="keyword">const</span> <a class="code" href="a08007.html">unordered_set</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"></span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> /// Move constructor.</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"></span> <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(<a class="code" href="a08007.html">unordered_set</a>&&) = <span class="keywordflow">default</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"> /**</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * @brief Creates an %unordered_set with no elements.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> */</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="a08007.html#a5d4ca5472cfe1e526ea39765ef1eba0c"> 185</a></span>  <a class="code" href="a08007.html#a5d4ca5472cfe1e526ea39765ef1eba0c">unordered_set</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  : _M_h(__a)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  { }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </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="comment"> * @brief Copy constructor with allocator argument.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * @param __uset Input %unordered_set to copy.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> */</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(<span class="keyword">const</span> <a class="code" href="a08007.html">unordered_set</a>& __uset,</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  : _M_h(__uset._M_h, __a)</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  { }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</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> <span class="comment"> * @brief Move constructor with allocator argument.</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> * @param __uset Input %unordered_set to move.</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> */</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(<a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>&& __uset,</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  : _M_h(<a class="code" href="a01541.html">std</a>::move(__uset._M_h), __a)</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  { }</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"></span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> /**</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * @brief Builds an %unordered_set from an initializer_list.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> *</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * Create an %unordered_set consisting of copies of the elements in the</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> * list. This is linear in N (where N is @a __l.size()).</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> */</span></div><div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="a08007.html#a060e030a56e63250f388344e5888702a"> 220</a></span>  <a class="code" href="a08007.html#a060e030a56e63250f388344e5888702a">unordered_set</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n = 0,</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>& __hf = <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(),</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>& __eql = <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(),</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a = <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>())</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  : _M_h(__l, __n, __hf, __eql, __a)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  { }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  : <a class="code" href="a08007.html">unordered_set</a>(__n, <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(), <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), __a)</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  { }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>& __hf,</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  : <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(__n, __hf, <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), __a)</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  { }</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n,</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  : <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(__first, __last, __n, <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(), <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), __a)</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  { }</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>& __hf,</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  : <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(__first, __last, __n, __hf, <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a>(), __a)</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> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n,</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  : <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(__l, __n, <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>(), <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">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="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a>& __hf,</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a>& __a)</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  : <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>(__l, __n, __hf, <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">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> <span class="comment"></span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> /// Copy assignment operator.</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"></span> <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>&</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <a class="code" href="a08007.html#a28b4eb4e12733c87d05ecd05c23e4269">operator=</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"></span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> /// Move assignment operator.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"></span> <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>&</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="a08007.html#a28b4eb4e12733c87d05ecd05c23e4269">operator=</a>(<a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"></span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"> /**</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> * @brief %Unordered_set list assignment operator.</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> *</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> * This function fills an %unordered_set with copies of the elements in</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> * the initializer list @a __l.</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"> * Note that the assignment completely changes the %unordered_set and</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> * that the resulting %unordered_set's size is the same as the number</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> * of elements assigned.</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> */</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="a08007.html#aace23136ea294ea67dcfe292b896b110">unordered_set</a>&</div><div class="line"><a name="l00283"></a><span class="lineno"><a class="line" href="a08007.html#a3c34d8e0d4bfc8c91c4b54b5199edc04"> 283</a></span>  <a class="code" href="a08007.html#a3c34d8e0d4bfc8c91c4b54b5199edc04">operator=</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  _M_h = __l;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"></span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment"> /// Returns the allocator object used by the %unordered_set.</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="comment"></span> <a class="code" href="a08007.html#a9bba281b4f65b14513a532e398d37642">allocator_type</a></div><div class="line"><a name="l00291"></a><span class="lineno"><a class="line" href="a08007.html#acf6e31142497379c81e5853765ffd9a4"> 291</a></span>  <a class="code" href="a08007.html#acf6e31142497379c81e5853765ffd9a4">get_allocator</a>() const noexcept</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  { <span class="keywordflow">return</span> _M_h.get_allocator(); }</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">// size and capacity:</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"></span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> /// Returns true if the %unordered_set is empty.</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"></span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00298"></a><span class="lineno"><a class="line" href="a08007.html#a4e8d8d725e5ce055255edf7f58bbf726"> 298</a></span>  <a class="code" href="a08007.html#a4e8d8d725e5ce055255edf7f58bbf726">empty</a>() const noexcept</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  { <span class="keywordflow">return</span> _M_h.empty(); }</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"></span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> /// Returns the size of the %unordered_set.</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"></span> <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00303"></a><span class="lineno"><a class="line" href="a08007.html#a73ec5052e45a7a980d1968a0805a32dd"> 303</a></span>  <a class="code" href="a08007.html#a73ec5052e45a7a980d1968a0805a32dd">size</a>() const noexcept</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  { <span class="keywordflow">return</span> _M_h.size(); }</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"></span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment"> /// Returns the maximum size of the %unordered_set.</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"></span> <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00308"></a><span class="lineno"><a class="line" href="a08007.html#afbad50ec9cd24208c2b33f35aa50f371"> 308</a></span>  <a class="code" href="a08007.html#afbad50ec9cd24208c2b33f35aa50f371">max_size</a>() const noexcept</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  { <span class="keywordflow">return</span> _M_h.max_size(); }</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// iterators.</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"></span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> * element in the %unordered_set.</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> */</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00319"></a><span class="lineno"><a class="line" href="a08007.html#af200bc1dbcbedeabebd796791807ae31"> 319</a></span>  <a class="code" href="a08007.html#af200bc1dbcbedeabebd796791807ae31">begin</a>() noexcept</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></div><div class="line"><a name="l00323"></a><span class="lineno"><a class="line" href="a08007.html#a3d563863f9fd94aa7573fecb9c027c23"> 323</a></span>  <a class="code" href="a08007.html#a3d563863f9fd94aa7573fecb9c027c23">begin</a>() const noexcept</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  { <span class="keywordflow">return</span> _M_h.begin(); }<span class="comment"></span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"></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 one past the last</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"> * element in the %unordered_set.</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="a07675.html">iterator</a></div><div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="a08007.html#aa28c45008761a27eecdaeefaab68fa0e"> 333</a></span>  <a class="code" href="a08007.html#aa28c45008761a27eecdaeefaab68fa0e">end</a>() noexcept</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  { <span class="keywordflow">return</span> _M_h.end(); }</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="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></div><div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="a08007.html#a9ead8905955f0942591a17d70f8405c8"> 337</a></span>  <a class="code" href="a08007.html#a9ead8905955f0942591a17d70f8405c8">end</a>() const noexcept</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  { <span class="keywordflow">return</span> _M_h.end(); }<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-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> * element in the %unordered_set.</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="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></div><div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="a08007.html#a4bc73af25660f155f196c73298073f27"> 346</a></span>  <a class="code" href="a08007.html#a4bc73af25660f155f196c73298073f27">cbegin</a>() const noexcept</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</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"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> * element in the %unordered_set.</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> */</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></div><div class="line"><a name="l00354"></a><span class="lineno"><a class="line" href="a08007.html#a155f3d6e9b8a3a59bb03969355ae5f73"> 354</a></span>  <a class="code" href="a08007.html#a155f3d6e9b8a3a59bb03969355ae5f73">cend</a>() const noexcept</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  { <span class="keywordflow">return</span> _M_h.end(); }</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// modifiers.</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"></span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"> /**</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> * @brief Attempts to build and insert an element into the</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> * %unordered_set.</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> * @param __args Arguments used to generate an element.</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> * to the possibly inserted element, and the second is a bool</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"> * that is true if the element was actually inserted.</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> *</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> * This function attempts to build and insert an element into the</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"> * %unordered_set. An %unordered_set relies on unique keys and thus an</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> * element is only inserted if it is not already present in the</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"> * %unordered_set.</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment"> *</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"> */</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="a08007.html#ae5af2f1d8d0746c3db3357561a73c6f7"> 376</a></span>  <a class="code" href="a08007.html#ae5af2f1d8d0746c3db3357561a73c6f7">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  { <span class="keywordflow">return</span> _M_h.emplace(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"></span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> /**</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> * @brief Attempts to insert an element into the %unordered_set.</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> * @param __args Arguments used to generate the element to be</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"> * @return An iterator that points to the element with key equivalent to</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> * the one generated from @a __args (may or may not be the</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> * element itself).</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> *</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> * and thus does not return a boolean like the single-argument emplace()</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> * does. Note that the first parameter is only a hint and can</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> *</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> * For more on @a hinting, see:</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"> *</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> */</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00402"></a><span class="lineno"><a class="line" href="a08007.html#a8d66aca929c29059391648628f2e250b"> 402</a></span>  <a class="code" href="a08007.html#a8d66aca929c29059391648628f2e250b">emplace_hint</a>(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __pos, _Args&&... __args)</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  { <span class="keywordflow">return</span> _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"></span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> * @brief Attempts to insert an element into the %unordered_set.</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> * to the possibly inserted element, and the second is a bool</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"> * that is true if the element was actually inserted.</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> *</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> * This function attempts to insert an element into the %unordered_set.</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"> * An %unordered_set relies on unique keys and thus an element is only</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> * inserted if it is not already present in the %unordered_set.</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"> *</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> */</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00420"></a><span class="lineno"><a class="line" href="a08007.html#ac9fa0bc82f5e6fae38a8d225f468608d"> 420</a></span>  <a class="code" href="a08007.html#ac9fa0bc82f5e6fae38a8d225f468608d">insert</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a>& __x)</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  { <span class="keywordflow">return</span> _M_h.insert(__x); }</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="a07767.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00424"></a><span class="lineno"><a class="line" href="a08007.html#abc0147e25845cc780f71f1b14cd41cce"> 424</a></span>  <a class="code" href="a08007.html#abc0147e25845cc780f71f1b14cd41cce">insert</a>(<a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a>&& __x)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  { <span class="keywordflow">return</span> _M_h.insert(std::move(__x)); }<span class="comment"></span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> * @brief Attempts to insert an element into the %unordered_set.</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> * @param __hint An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> * @a __x (may or may not be the element passed in).</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> *</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> * and thus does not return a boolean like the single-argument insert()</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> * does. Note that the first parameter is only a hint and can</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> *</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"> * For more on @a hinting, see:</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> *</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> * Insertion requires amortized constant.</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"> */</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00449"></a><span class="lineno"><a class="line" href="a08007.html#a6b211cbe01ddf94104caf45b393ae933"> 449</a></span>  <a class="code" href="a08007.html#a6b211cbe01ddf94104caf45b393ae933">insert</a>(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __hint, <span class="keyword">const</span> <a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a>& __x)</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, __x); }</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00453"></a><span class="lineno"><a class="line" href="a08007.html#a9e27a7160d0253be3bc02bf9c2fd4d62"> 453</a></span>  <a class="code" href="a08007.html#a9e27a7160d0253be3bc02bf9c2fd4d62">insert</a>(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __hint, <a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">value_type</a>&& __x)</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, std::move(__x)); }<span class="comment"></span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"> /**</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> * @brief A template function that attempts to insert a range of</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> *</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> * Complexity similar to that of the range constructor.</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="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00468"></a><span class="lineno"><a class="line" href="a08007.html#ab8d7bdf04f958f040cfd842c6e2d7b6b"> 468</a></span>  <a class="code" href="a08007.html#ab8d7bdf04f958f040cfd842c6e2d7b6b">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  { _M_h.insert(__first, __last); }</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"></span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> /**</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> * @brief Attempts to insert a list of elements into the %unordered_set.</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> * to be inserted.</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="comment"> *</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment"> */</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="a08007.html#adaa06dc3ca7393564cf03ce38cbe5d74"> 479</a></span>  <a class="code" href="a08007.html#adaa06dc3ca7393564cf03ce38cbe5d74">insert</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  { _M_h.insert(__l); }</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="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment"></span> node_type</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  extract(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __pos)</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  {</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  __glibcxx_assert(__pos != <a class="code" href="a08007.html#aa28c45008761a27eecdaeefaab68fa0e">end</a>());</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> _M_h.extract(__pos);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment"></span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"></span> node_type</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  extract(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __key)</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  { <span class="keywordflow">return</span> _M_h.extract(__key); }</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="comment"></span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"></span> insert_return_type</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <a class="code" href="a08007.html#ac9fa0bc82f5e6fae38a8d225f468608d">insert</a>(node_type&& __nh)</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node(std::move(__nh)); }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"></span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"></span> <a class="code" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="code" href="a08007.html#ac9fa0bc82f5e6fae38a8d225f468608d">insert</a>(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a>, node_type&& __nh)</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node(std::move(__nh)).position; }</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="preprocessor">#endif // C++17</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"> //@{</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="comment"> * @brief Erases an element from an %unordered_set.</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment"> * @a __position prior to the element being erased. If no such</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment"> *</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"> * from an %unordered_set. Note that this function only erases the</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment"> * element, and that if the element is itself a pointer, the pointed-to</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment"> * memory is not touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment"> */</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <a class="code" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a></div><div class="line"><a name="l00522"></a><span class="lineno"><a class="line" href="a08007.html#acef2fe55c494314acad1104ba1488cf6"> 522</a></span>  <a class="code" href="a08007.html#acef2fe55c494314acad1104ba1488cf6">erase</a>(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __position)</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// LWG 2059.</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00527"></a><span class="lineno"><a class="line" href="a08007.html#a5475af91b7b075f1315091b522eacd3e"> 527</a></span>  <a class="code" href="a08007.html#a5475af91b7b075f1315091b522eacd3e">erase</a>(<a class="code" href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">iterator</a> __position)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }<span class="comment"></span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> /**</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment"> * @param __x Key of element to be erased.</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> * @return The number of elements erased.</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> *</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> * This function erases all the elements located by the given key from</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> * an %unordered_set. For an %unordered_set the result of this function</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> * can only be 0 (not present) or 1 (present).</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> */</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00544"></a><span class="lineno"><a class="line" href="a08007.html#ac935f6a3b65fe0e5629ada1699c86868"> 544</a></span>  <a class="code" href="a08007.html#ac935f6a3b65fe0e5629ada1699c86868">erase</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __x)</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  { <span class="keywordflow">return</span> _M_h.erase(__x); }</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="comment"></span></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="comment"> /**</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from an</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"> * %unordered_set.</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"> * @return The iterator @a __last.</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment"> *</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment"> * This function erases a sequence of elements from an %unordered_set.</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</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>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00562"></a><span class="lineno"><a class="line" href="a08007.html#acd7b3eed2fde01c393da9d14f1aa03b9"> 562</a></span>  <a class="code" href="a08007.html#acd7b3eed2fde01c393da9d14f1aa03b9">erase</a>(<a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __first, <a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a> __last)</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  { <span class="keywordflow">return</span> _M_h.erase(__first, __last); }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"></span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> /**</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> * Erases all elements in an %unordered_set. Note that this function only</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> * erases the elements, and that if the elements themselves are pointers,</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> * the pointed-to memory is not touched in any way. Managing the pointer</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * is the user's responsibility.</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="keywordtype">void</span></div><div class="line"><a name="l00572"></a><span class="lineno"><a class="line" href="a08007.html#ad8049c5e823b2e158de097c48b4bcb0d"> 572</a></span>  <a class="code" href="a08007.html#ad8049c5e823b2e158de097c48b4bcb0d">clear</a>() noexcept</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  { _M_h.clear(); }</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"></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"> * @brief Swaps data with another %unordered_set.</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> * @param __x An %unordered_set of the same element and allocator</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"> * types.</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment"> *</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment"> * This exchanges the elements between two sets in constant time.</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="comment"> * std::swap(s1,s2) will feed to this function.</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment"> */</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00585"></a><span class="lineno"><a class="line" href="a08007.html#a688f24d7010519e2bfa001db6fe180e7"> 585</a></span>  <a class="code" href="a08007.html#a688f24d7010519e2bfa001db6fe180e7">swap</a>(<a class="code" href="a08007.html">unordered_set</a>& __x)</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  noexcept( noexcept(_M_h.swap(__x._M_h)) )</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  { _M_h.swap(__x._M_h); }</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> </div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00590"></a><span class="lineno"> 590</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="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">friend</span> <span class="keyword">class </span>std::_Hash_merge_helper;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> </div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  merge(<a class="code" href="a08007.html">unordered_set<_Value, _H2, _P2, _Alloc></a>& __source)</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  {</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">using</span> _Merge_helper = _Hash_merge_helper<unordered_set, _H2, _P2>;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  merge(unordered_set<_Value, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  { merge(__source); }</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  merge(unordered_multiset<_Value, _H2, _P2, _Alloc>& __source)</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  {</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keyword">using</span> _Merge_helper = _Hash_merge_helper<unordered_set, _H2, _P2>;</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> </div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  merge(unordered_multiset<_Value, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  { merge(__source); }</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> </div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// observers.</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <span class="comment"></span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment"> /// Returns the hash functor object with which the %unordered_set was</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment"> /// constructed.</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment"></span> <a class="code" href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">hasher</a></div><div class="line"><a name="l00625"></a><span class="lineno"><a class="line" href="a08007.html#a7e199daf0d314f4d3e72f1e694571a8b"> 625</a></span>  <a class="code" href="a08007.html#a7e199daf0d314f4d3e72f1e694571a8b">hash_function</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.hash_function(); }</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> <span class="comment"></span></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="comment"> /// Returns the key comparison object with which the %unordered_set was</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="comment"> /// constructed.</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment"></span> <a class="code" href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">key_equal</a></div><div class="line"><a name="l00631"></a><span class="lineno"><a class="line" href="a08007.html#a91423e12bcd7c66a7b92c919af9e61a2"> 631</a></span>  <a class="code" href="a08007.html#a91423e12bcd7c66a7b92c919af9e61a2">key_eq</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.key_eq(); }</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> </div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// lookup.</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"></span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment"> * @brief Tries to locate an element in an %unordered_set.</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> * @param __x Element to be located.</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> * found.</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> *</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</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>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00649"></a><span class="lineno"><a class="line" href="a08007.html#af673d30d52e825e4f8da4c8770f0589b"> 649</a></span>  <a class="code" href="a08007.html#af673d30d52e825e4f8da4c8770f0589b">find</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __x)</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  { <span class="keywordflow">return</span> _M_h.find(__x); }</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">const_iterator</a></div><div class="line"><a name="l00653"></a><span class="lineno"><a class="line" href="a08007.html#a1f05b3fd1a72e6b246b0e5ce8d0937cf"> 653</a></span>  <a class="code" href="a08007.html#a1f05b3fd1a72e6b246b0e5ce8d0937cf">find</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.find(__x); }<span class="comment"></span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="comment"> /**</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="comment"> * @brief Finds the number of elements.</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment"> * @param __x Element to located.</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="comment"> * @return Number of elements with specified key.</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"> * This function only makes sense for unordered_multisets; for</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"> * unordered_set the result will either be 0 (not present) or 1</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"> * (present).</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> */</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00667"></a><span class="lineno"><a class="line" href="a08007.html#a1f89dfe5f4807151e3829f060b103efc"> 667</a></span>  <a class="code" href="a08007.html#a1f89dfe5f4807151e3829f060b103efc">count</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.count(__x); }</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="comment"></span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="comment"> *</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> * This function probably only makes sense for multisets.</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>  <a class="code" href="a07767.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l00680"></a><span class="lineno"><a class="line" href="a08007.html#ae91bd4ef581ac83337d7cced559349e2"> 680</a></span>  <a class="code" href="a08007.html#ae91bd4ef581ac83337d7cced559349e2">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __x)</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  { <span class="keywordflow">return</span> _M_h.equal_range(__x); }</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="a07767.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l00684"></a><span class="lineno"><a class="line" href="a08007.html#ae5f593da6d71d91fb83d2e6023ad8d87"> 684</a></span>  <a class="code" href="a08007.html#ae5f593da6d71d91fb83d2e6023ad8d87">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</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="l00686"></a><span class="lineno"> 686</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> <span class="comment"></span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// bucket interface.</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> <span class="comment"></span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="comment"> /// Returns the number of buckets of the %unordered_set.</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="comment"></span> <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00692"></a><span class="lineno"><a class="line" href="a08007.html#ae5b2e99866a8b463ab6f9fe577f08297"> 692</a></span>  <a class="code" href="a08007.html#ae5b2e99866a8b463ab6f9fe577f08297">bucket_count</a>() const noexcept</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  { <span class="keywordflow">return</span> _M_h.bucket_count(); }</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> <span class="comment"></span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="comment"> /// Returns the maximum number of buckets of the %unordered_set.</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"></span> <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00697"></a><span class="lineno"><a class="line" href="a08007.html#afc90e16afa79bd929b49590dc8637b00"> 697</a></span>  <a class="code" href="a08007.html#afc90e16afa79bd929b49590dc8637b00">max_bucket_count</a>() const noexcept</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  { <span class="keywordflow">return</span> _M_h.max_bucket_count(); }</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> </div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">/*</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> * @brief Returns the number of elements in a given bucket.</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"> * @param __n A bucket index.</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> * @return The number of elements in the bucket.</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="comment"> */</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  bucket_size(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket_size(__n); }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">/*</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> * @brief Returns the bucket index of a given element.</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> * @param __key A key instance.</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment"> * @return The key bucket index.</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment"> */</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  bucket(<span class="keyword">const</span> <a class="code" href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">key_type</a>& __key)<span class="keyword"> const</span></div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket(__key); }</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment"></span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to the first</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment"> * bucket element.</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="comment"> */</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <a class="code" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a></div><div class="line"><a name="l00726"></a><span class="lineno"><a class="line" href="a08007.html#aab994b1b759354f0bdd30f6e04b86b68"> 726</a></span>  <a class="code" href="a08007.html#aab994b1b759354f0bdd30f6e04b86b68">begin</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  { <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> </div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <a class="code" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a></div><div class="line"><a name="l00730"></a><span class="lineno"><a class="line" href="a08007.html#a28389b5527a3ee6a52adc2ee72e67029"> 730</a></span>  <a class="code" href="a08007.html#a28389b5527a3ee6a52adc2ee72e67029">begin</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> </div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <a class="code" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a></div><div class="line"><a name="l00734"></a><span class="lineno"><a class="line" href="a08007.html#a30a15b1c31e75c9cfd56a4b3f24fe1ce"> 734</a></span>  <a class="code" href="a08007.html#a30a15b1c31e75c9cfd56a4b3f24fe1ce">cbegin</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cbegin(__n); }<span class="comment"></span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to one past</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> * the last bucket elements.</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> <span class="comment"> */</span></div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <a class="code" href="a08007.html#a41daefac0150734553a1b8ae994520e6">local_iterator</a></div><div class="line"><a name="l00746"></a><span class="lineno"><a class="line" href="a08007.html#a70a807c039d620efcfd2b96048c3471a"> 746</a></span>  <a class="code" href="a08007.html#a70a807c039d620efcfd2b96048c3471a">end</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  { <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> </div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <a class="code" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a></div><div class="line"><a name="l00750"></a><span class="lineno"><a class="line" href="a08007.html#a124d7201aeadabc2a92e74fde00ec347"> 750</a></span>  <a class="code" href="a08007.html#a124d7201aeadabc2a92e74fde00ec347">end</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> </div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <a class="code" href="a08007.html#ad71108e3e7466e69cf84def961574aec">const_local_iterator</a></div><div class="line"><a name="l00754"></a><span class="lineno"><a class="line" href="a08007.html#a5f19f51483e14e3006bf1d6c0c7ec00a"> 754</a></span>  <a class="code" href="a08007.html#a5f19f51483e14e3006bf1d6c0c7ec00a">cend</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cend(__n); }<span class="comment"></span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment"></span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// hash policy.</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"></span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"> /// Returns the average number of elements per bucket.</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l00762"></a><span class="lineno"><a class="line" href="a08007.html#a6e7300347a4173c3ad35217600d28f50"> 762</a></span>  <a class="code" href="a08007.html#a6e7300347a4173c3ad35217600d28f50">load_factor</a>() const noexcept</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  { <span class="keywordflow">return</span> _M_h.load_factor(); }</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"></span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment"> /// Returns a positive number that the %unordered_set tries to keep the</span></div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"> /// load factor less than or equal to.</span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l00768"></a><span class="lineno"><a class="line" href="a08007.html#ac182f2597af135950bfc3b1cd09575ec"> 768</a></span>  <a class="code" href="a08007.html#ac182f2597af135950bfc3b1cd09575ec">max_load_factor</a>() const noexcept</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  { <span class="keywordflow">return</span> _M_h.max_load_factor(); }</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"></span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> /**</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> * @brief Change the %unordered_set maximum load factor.</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * @param __z The new maximum load factor.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> */</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00776"></a><span class="lineno"><a class="line" href="a08007.html#a086929d624211470ff2b20a0ba23a86d"> 776</a></span>  <a class="code" href="a08007.html#a086929d624211470ff2b20a0ba23a86d">max_load_factor</a>(<span class="keywordtype">float</span> __z)</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  { _M_h.max_load_factor(__z); }</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> <span class="comment"></span></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> <span class="comment"> /**</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="comment"> * @brief May rehash the %unordered_set.</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> <span class="comment"> * @param __n The new number of buckets.</span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="comment"> *</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="comment"> * Rehash will occur only if the new number of buckets respect the</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="comment"> * %unordered_set maximum load factor.</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="comment"> */</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00787"></a><span class="lineno"><a class="line" href="a08007.html#a6f3606a68d349ec1e1e5de56116a39fd"> 787</a></span>  <a class="code" href="a08007.html#a6f3606a68d349ec1e1e5de56116a39fd">rehash</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  { _M_h.rehash(__n); }</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="comment"></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> <span class="comment"> * @brief Prepare the %unordered_set for a specified number of</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> <span class="comment"> * @param __n Number of elements required.</span></div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> <span class="comment"> *</span></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> <span class="comment"> * Same as rehash(ceil(n / max_load_factor())).</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> <span class="comment"> */</span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00798"></a><span class="lineno"><a class="line" href="a08007.html#aeb44171c81ee124bbb21a113ff318530"> 798</a></span>  <a class="code" href="a08007.html#aeb44171c81ee124bbb21a113ff318530">reserve</a>(<a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">size_type</a> __n)</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  { _M_h.reserve(__n); }</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> </div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value1, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Pred1,</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">typename</span> _Alloc1></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  operator==(<span class="keyword">const</span> <a class="code" href="a08007.html">unordered_set<_Value1, _Hash1, _Pred1, _Alloc1></a>&,</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keyword">const</span> <a class="code" href="a08007.html">unordered_set<_Value1, _Hash1, _Pred1, _Alloc1></a>&);</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  };</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> </div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">typename</span> _Hash =</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  hash<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keyword">typename</span> _Pred =</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  equal_to<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keyword">typename</span> _Allocator =</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  allocator<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  unordered_set(_InputIterator, _InputIterator,</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">unordered_set<int>::size_type</a> = {},</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  -> unordered_set<<span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type,</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span> </div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash = hash<_Tp>,</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keyword">typename</span> _Pred = equal_to<_Tp>,</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keyword">typename</span> _Allocator = allocator<_Tp>,</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  unordered_set(initializer_list<_Tp>,</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">unordered_set<int>::size_type</a> = {},</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> </div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  unordered_set(_InputIterator, _InputIterator,</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">unordered_set<int>::size_type</a>, _Allocator)</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  -> <a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">unordered_set<typename iterator_traits<_InputIterator>::value_type</a>,</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  hash<</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  equal_to<</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  _Allocator>;</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> </div><div class="line"><a name="l00846"></a><span class="lineno"> 846</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="l00847"></a><span class="lineno"> 847</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  unordered_set(_InputIterator, _InputIterator,</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">unordered_set<int>::size_type</a>,</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  _Hash, _Allocator)</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  -> <a class="code" href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">unordered_set<typename iterator_traits<_InputIterator>::value_type</a>,</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  _Hash,</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  equal_to<</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  _Allocator>;</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span> </div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  unordered_set(initializer_list<_Tp>,</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">unordered_set<int>::size_type</a>, _Allocator)</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;</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> _Tp, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  unordered_set(initializer_list<_Tp>,</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <a class="code" href="a08007.html#a489606b8c31cc86a461912f292dac389">unordered_set<int>::size_type</a>, _Hash, _Allocator)</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span> </div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> <span class="comment"></span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="comment"> /**</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> <span class="comment"> * @brief A standard container composed of equivalent keys</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="comment"> * (possibly containing multiple of each key value) in which the</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span> <span class="comment"> * elements' keys are the elements themselves.</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span> <span class="comment"> *</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> <span class="comment"> * @ingroup unordered_associative_containers</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span> <span class="comment"> *</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> <span class="comment"> * @tparam _Value Type of key objects.</span></div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span> <span class="comment"> * @tparam _Hash Hashing function object type, defaults to hash<_Value>.</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span> <span class="comment"> * @tparam _Pred Predicate function object type, defaults</span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> <span class="comment"> * to equal_to<_Value>.</span></div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Key>.</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="comment"> *</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, and</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="comment"> * <a href="tables.html#xx">unordered associative container</a></span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="comment"> *</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> <span class="comment"> * Base is _Hashtable, dispatched at compile time via template</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="comment"> * alias __umset_hashtable.</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> <span class="comment"> */</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value,</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keyword">typename</span> _Hash = hash<_Value>,</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keyword">typename</span> _Pred = equal_to<_Value>,</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">typename</span> _Alloc = allocator<_Value>></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keyword">class </span>unordered_multiset</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  {</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">typedef</span> __umset_hashtable<_Value, _Hash, _Pred, _Alloc> _Hashtable;</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  _Hashtable _M_h;</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> </div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// typedefs:</span><span class="comment"></span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="comment"></span><span class="comment"> /// Public typedefs.</span></div><div class="line"><a name="l00904"></a><span class="lineno"><a class="line" href="a08003.html#a5728c1ad04495272ee1ee21fac011010"> 904</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_type <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>;</div><div class="line"><a name="l00905"></a><span class="lineno"><a class="line" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c"> 905</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::value_type <a class="code" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">value_type</a>;</div><div class="line"><a name="l00906"></a><span class="lineno"><a class="line" href="a08003.html#ac241bbf11679cbce9942578ecc48d776"> 906</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::hasher <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>;</div><div class="line"><a name="l00907"></a><span class="lineno"><a class="line" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe"> 907</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::key_equal <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>;</div><div class="line"><a name="l00908"></a><span class="lineno"><a class="line" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df"> 908</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::allocator_type <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>;<span class="comment"></span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment"></span><span class="comment"> /// Iterator-related typedefs.</span></div><div class="line"><a name="l00913"></a><span class="lineno"><a class="line" href="a08003.html#a0fd1cffa71f49d5bcea5c9fa1cb36312"> 913</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::pointer <a class="code" href="a08003.html#a0fd1cffa71f49d5bcea5c9fa1cb36312">pointer</a>;</div><div class="line"><a name="l00914"></a><span class="lineno"><a class="line" href="a08003.html#aa107c9adeffdf499edd13a0a88ed8cbc"> 914</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_pointer <a class="code" href="a08003.html#aa107c9adeffdf499edd13a0a88ed8cbc">const_pointer</a>;</div><div class="line"><a name="l00915"></a><span class="lineno"><a class="line" href="a08003.html#a81000aff43253d8859a4c59d35a89029"> 915</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::reference <a class="code" href="a08003.html#a81000aff43253d8859a4c59d35a89029">reference</a>;</div><div class="line"><a name="l00916"></a><span class="lineno"><a class="line" href="a08003.html#ab16debc24d07c39201f4aaa943b8ba6d"> 916</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_reference <a class="code" href="a08003.html#ab16debc24d07c39201f4aaa943b8ba6d">const_reference</a>;</div><div class="line"><a name="l00917"></a><span class="lineno"><a class="line" href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0"> 917</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::iterator <a class="code" href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0">iterator</a>;</div><div class="line"><a name="l00918"></a><span class="lineno"><a class="line" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4"> 918</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_iterator <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a>;</div><div class="line"><a name="l00919"></a><span class="lineno"><a class="line" href="a08003.html#a2b13af1127b00c668e4e277c0053c2c3"> 919</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::local_iterator <a class="code" href="a08003.html#a2b13af1127b00c668e4e277c0053c2c3">local_iterator</a>;</div><div class="line"><a name="l00920"></a><span class="lineno"><a class="line" href="a08003.html#af3443472eeb3187e370e7c523c5df91e"> 920</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::const_local_iterator <a class="code" href="a08003.html#af3443472eeb3187e370e7c523c5df91e">const_local_iterator</a>;</div><div class="line"><a name="l00921"></a><span class="lineno"><a class="line" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb"> 921</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::size_type <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a>;</div><div class="line"><a name="l00922"></a><span class="lineno"><a class="line" href="a08003.html#a0dfc41e4c0a1ec68c0e4ee0fba4783ee"> 922</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Hashtable::difference_type <a class="code" href="a08003.html#a0dfc41e4c0a1ec68c0e4ee0fba4783ee">difference_type</a>;<span class="comment"></span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> <span class="comment"></span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keyword">using</span> node_type = <span class="keyword">typename</span> _Hashtable::node_type;</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> </div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="comment">// construct/destroy/copy</span></div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment"></span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment"> /// Default constructor.</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment"></span> <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="comment"></span></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="comment"> /**</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="comment"> * @param __a An allocator object.</span></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="keyword">explicit</span></div><div class="line"><a name="l00942"></a><span class="lineno"><a class="line" href="a08003.html#ac6084dcccef761538983acc055a3d106"> 942</a></span>  <a class="code" href="a08003.html#ac6084dcccef761538983acc055a3d106">unordered_multiset</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n,</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>& __hf = <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>(),</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>& __eql = <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(),</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a = <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>())</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  : _M_h(__n, __hf, __eql, __a)</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  { }</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="comment"></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> <span class="comment"> * @brief Builds an %unordered_multiset from a range.</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="comment"> * @param __a An allocator object.</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"> * Create an %unordered_multiset consisting of copies of the elements</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="comment"> * from [__first,__last). This is linear in N (where N is</span></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span> <span class="comment"> */</span></div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00963"></a><span class="lineno"><a class="line" href="a08003.html#a342b7c9edfa273379f949beb9a00fd4a"> 963</a></span>  <a class="code" href="a08003.html#a342b7c9edfa273379f949beb9a00fd4a">unordered_multiset</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n = 0,</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>& __hf = <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>(),</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>& __eql = <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(),</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a = <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>())</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  : _M_h(__first, __last, __n, __hf, __eql, __a)</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  { }</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="comment"></span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> /// Copy constructor.</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="comment"></span> <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(<span class="keyword">const</span> <a class="code" href="a08003.html">unordered_multiset</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="comment"></span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"> /// Move constructor.</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"></span> <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(<a class="code" href="a08003.html">unordered_multiset</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment"></span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"> /**</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> * @brief Builds an %unordered_multiset from an initializer_list.</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> <span class="comment"> * @param __n Minimal initial number of buckets.</span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment"> * @param __hf A hash functor.</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment"> * @param __eql A key equality functor.</span></div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="comment"> *</span></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="comment"> * Create an %unordered_multiset consisting of copies of the elements in</span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment"> * the list. This is linear in N (where N is @a __l.size()).</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="comment"> */</span></div><div class="line"><a name="l00988"></a><span class="lineno"><a class="line" href="a08003.html#a67d09e2826cd252504705969c1cbad8b"> 988</a></span>  <a class="code" href="a08003.html#a67d09e2826cd252504705969c1cbad8b">unordered_multiset</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n = 0,</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>& __hf = <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>(),</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>& __eql = <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(),</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a = <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>())</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  : _M_h(__l, __n, __hf, __eql, __a)</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  { }</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="comment"></span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"> /// Copy assignment operator.</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="comment"></span> <a class="code" href="a08003.html">unordered_multiset</a>&</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <a class="code" href="a08003.html#a9e17536caf4f009c1a337cbdc65b10e4">operator=</a>(<span class="keyword">const</span> <a class="code" href="a08003.html">unordered_multiset</a>&) = <span class="keywordflow">default</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"> /// Move assignment operator.</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="comment"></span> <a class="code" href="a08003.html">unordered_multiset</a>&</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <a class="code" href="a08003.html#a9e17536caf4f009c1a337cbdc65b10e4">operator=</a>(<a class="code" href="a08003.html">unordered_multiset</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> <span class="comment"></span></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"> * @brief Creates an %unordered_multiset with no elements.</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="comment"> */</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l01009"></a><span class="lineno"><a class="line" href="a08003.html#a34d367c806730baf9a10261d5c2ce3b7"> 1009</a></span>  <a class="code" href="a08003.html#a34d367c806730baf9a10261d5c2ce3b7">unordered_multiset</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  : _M_h(__a)</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  { }</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> </div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="comment">/*</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> <span class="comment"> * @brief Copy constructor with allocator argument.</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> <span class="comment"> * @param __uset Input %unordered_multiset to copy.</span></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> <span class="comment"> */</span></div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(<span class="keyword">const</span> <a class="code" href="a08003.html">unordered_multiset</a>& __umset,</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  : _M_h(__umset._M_h, __a)</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  { }</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </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> <span class="comment"> * @brief Move constructor with allocator argument.</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="comment"> * @param __umset Input %unordered_multiset to move.</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="comment"> * @param __a An allocator object.</span></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>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(<a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>&& __umset,</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  : _M_h(<a class="code" href="a01541.html">std</a>::move(__umset._M_h), __a)</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  { }</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> </div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  : <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(__n, <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>(), <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(), __a)</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  { }</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> </div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>& __hf,</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  : <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(__n, __hf, <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(), __a)</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  { }</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> </div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n,</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  : <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(__first, __last, __n, <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>(), <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(), __a)</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  { }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>& __hf,</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  : <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(__first, __last, __n, __hf, <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(), __a)</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  { }</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> </div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n,</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  : <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(__l, __n, <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>(), <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(), __a)</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  { }</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> </div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(initializer_list<value_type> __l,</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n, <span class="keyword">const</span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a>& __hf,</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keyword">const</span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a>& __a)</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  : <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>(__l, __n, __hf, <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a>(), __a)</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  { }</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="comment"></span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="comment"> /**</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> <span class="comment"> * @brief %Unordered_multiset list assignment operator.</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> <span class="comment"> *</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> <span class="comment"> * This function fills an %unordered_multiset with copies of the elements</span></div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="comment"> * in the initializer list @a __l.</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> <span class="comment"> *</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> <span class="comment"> * Note that the assignment completely changes the %unordered_multiset</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> <span class="comment"> * and that the resulting %unordered_multiset's size is the same as the</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> <span class="comment"> * number of elements assigned.</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>  <a class="code" href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">unordered_multiset</a>&</div><div class="line"><a name="l01080"></a><span class="lineno"><a class="line" href="a08003.html#adfc21fb29e21a666c726325bdbab7fd8"> 1080</a></span>  <a class="code" href="a08003.html#adfc21fb29e21a666c726325bdbab7fd8">operator=</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  {</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  _M_h = __l;</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> <span class="comment"></span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> <span class="comment"> /// Returns the allocator object used by the %unordered_multiset.</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> <span class="comment"></span> <a class="code" href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">allocator_type</a></div><div class="line"><a name="l01088"></a><span class="lineno"><a class="line" href="a08003.html#afa9b2af271d4a9c43401403d4b21a22f"> 1088</a></span>  <a class="code" href="a08003.html#afa9b2af271d4a9c43401403d4b21a22f">get_allocator</a>() const noexcept</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  { <span class="keywordflow">return</span> _M_h.get_allocator(); }</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> </div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="comment">// size and capacity:</span></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"> /// Returns true if the %unordered_multiset is empty.</span></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <span class="comment"></span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01095"></a><span class="lineno"><a class="line" href="a08003.html#a207a38bb9677cfdae227e04467e71601"> 1095</a></span>  <a class="code" href="a08003.html#a207a38bb9677cfdae227e04467e71601">empty</a>() const noexcept</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  { <span class="keywordflow">return</span> _M_h.empty(); }</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span> <span class="comment"></span></div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> <span class="comment"> /// Returns the size of the %unordered_multiset.</span></div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span> <span class="comment"></span> <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01100"></a><span class="lineno"><a class="line" href="a08003.html#acd836983ff93b793bf5404002ceac468"> 1100</a></span>  <a class="code" href="a08003.html#acd836983ff93b793bf5404002ceac468">size</a>() const noexcept</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  { <span class="keywordflow">return</span> _M_h.size(); }</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> <span class="comment"></span></div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> <span class="comment"> /// Returns the maximum size of the %unordered_multiset.</span></div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="comment"></span> <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01105"></a><span class="lineno"><a class="line" href="a08003.html#af0cbbd14540e7875dd507533a959bf77"> 1105</a></span>  <a class="code" href="a08003.html#af0cbbd14540e7875dd507533a959bf77">max_size</a>() const noexcept</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  { <span class="keywordflow">return</span> _M_h.max_size(); }</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> </div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">// iterators.</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> <span class="comment"></span></div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> <span class="comment"> * element in the %unordered_multiset.</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="comment"> */</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01116"></a><span class="lineno"><a class="line" href="a08003.html#a06fc4f0351ccd36daf6b1595752c2e79"> 1116</a></span>  <a class="code" href="a08003.html#a06fc4f0351ccd36daf6b1595752c2e79">begin</a>() noexcept</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> </div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a></div><div class="line"><a name="l01120"></a><span class="lineno"><a class="line" href="a08003.html#a8c5aa4088fd624fca11155a1a525c91a"> 1120</a></span>  <a class="code" href="a08003.html#a8c5aa4088fd624fca11155a1a525c91a">begin</a>() const noexcept</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  { <span class="keywordflow">return</span> _M_h.begin(); }<span class="comment"></span></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> <span class="comment"> * element in the %unordered_multiset.</span></div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="comment"> */</span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01130"></a><span class="lineno"><a class="line" href="a08003.html#a8158b25dee0140da6e109a2592cec0eb"> 1130</a></span>  <a class="code" href="a08003.html#a8158b25dee0140da6e109a2592cec0eb">end</a>() noexcept</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  { <span class="keywordflow">return</span> _M_h.end(); }</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> </div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a></div><div class="line"><a name="l01134"></a><span class="lineno"><a class="line" href="a08003.html#aaa3754e88e7218cbd97bad8024a9a20a"> 1134</a></span>  <a class="code" href="a08003.html#aaa3754e88e7218cbd97bad8024a9a20a">end</a>() const noexcept</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  { <span class="keywordflow">return</span> _M_h.end(); }<span class="comment"></span></div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span> <span class="comment"> /**</span></div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span> <span class="comment"> * element in the %unordered_multiset.</span></div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> <span class="comment"> */</span></div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a></div><div class="line"><a name="l01143"></a><span class="lineno"><a class="line" href="a08003.html#a8fefcc1326d2d85a00bf958f7086d4a1"> 1143</a></span>  <a class="code" href="a08003.html#a8fefcc1326d2d85a00bf958f7086d4a1">cbegin</a>() const noexcept</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  { <span class="keywordflow">return</span> _M_h.begin(); }</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> <span class="comment"></span></div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="comment"> /**</span></div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="comment"> * element in the %unordered_multiset.</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> <span class="comment"> */</span></div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a></div><div class="line"><a name="l01151"></a><span class="lineno"><a class="line" href="a08003.html#a2a6edd3b4b891c1c260d3001a6b1ffcb"> 1151</a></span>  <a class="code" href="a08003.html#a2a6edd3b4b891c1c260d3001a6b1ffcb">cend</a>() const noexcept</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  { <span class="keywordflow">return</span> _M_h.end(); }</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="comment">// modifiers.</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="comment"></span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="comment"> /**</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> <span class="comment"> * @brief Builds and insert an element into the %unordered_multiset.</span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="comment"> * @param __args Arguments used to generate an element.</span></div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> <span class="comment"> *</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> <span class="comment"> */</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01165"></a><span class="lineno"><a class="line" href="a08003.html#a31747dab6f248961de2668f292a18565"> 1165</a></span>  <a class="code" href="a08003.html#a31747dab6f248961de2668f292a18565">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  { <span class="keywordflow">return</span> _M_h.emplace(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> <span class="comment"></span></div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> <span class="comment"> /**</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span> <span class="comment"> * @brief Inserts an element into the %unordered_multiset.</span></div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="comment"> * @param __args Arguments used to generate the element to be</span></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> <span class="comment"> *</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> <span class="comment"> *</span></div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> <span class="comment"> * For more on @a hinting, see:</span></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> <span class="comment"> *</span></div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> <span class="comment"> */</span></div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01187"></a><span class="lineno"><a class="line" href="a08003.html#a81c1d4a9ff7f0173466deb652ab4f10b"> 1187</a></span>  <a class="code" href="a08003.html#a81c1d4a9ff7f0173466deb652ab4f10b">emplace_hint</a>(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __pos, _Args&&... __args)</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  { <span class="keywordflow">return</span> _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span> <span class="comment"></span></div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span> <span class="comment"> * @brief Inserts an element into the %unordered_multiset.</span></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> <span class="comment"> *</span></div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> <span class="comment"> * Insertion requires amortized constant time.</span></div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> <span class="comment"> */</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01199"></a><span class="lineno"><a class="line" href="a08003.html#aa8ed787cbd107c6e469d92d0ab4d2836"> 1199</a></span>  <a class="code" href="a08003.html#aa8ed787cbd107c6e469d92d0ab4d2836">insert</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">value_type</a>& __x)</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  { <span class="keywordflow">return</span> _M_h.insert(__x); }</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span> </div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01203"></a><span class="lineno"><a class="line" href="a08003.html#aa888dc9e6ebd2d05342de7efac99e55c"> 1203</a></span>  <a class="code" href="a08003.html#aa888dc9e6ebd2d05342de7efac99e55c">insert</a>(<a class="code" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">value_type</a>&& __x)</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  { <span class="keywordflow">return</span> _M_h.insert(std::move(__x)); }<span class="comment"></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><span class="comment"></span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="comment"> * @brief Inserts an element into the %unordered_multiset.</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> <span class="comment"> * @param __hint An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> <span class="comment"> *</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="comment"> *</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span> <span class="comment"> * For more on @a hinting, see:</span></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> <span class="comment"> *</span></div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span> <span class="comment"> * Insertion requires amortized constant.</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>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01225"></a><span class="lineno"><a class="line" href="a08003.html#a0a7ead2d0db3cfaf291968f0967cf242"> 1225</a></span>  <a class="code" href="a08003.html#a0a7ead2d0db3cfaf291968f0967cf242">insert</a>(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __hint, <span class="keyword">const</span> <a class="code" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">value_type</a>& __x)</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, __x); }</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> </div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01229"></a><span class="lineno"><a class="line" href="a08003.html#aadc4a113c0ce8991df621858a74e063b"> 1229</a></span>  <a class="code" href="a08003.html#aadc4a113c0ce8991df621858a74e063b">insert</a>(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __hint, <a class="code" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">value_type</a>&& __x)</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  { <span class="keywordflow">return</span> _M_h.insert(__hint, std::move(__x)); }<span class="comment"></span></div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span> <span class="comment"> /**</span></div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span> <span class="comment"> * @brief A template function that inserts a range of elements.</span></div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> <span class="comment"> *</span></div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span> <span class="comment"> * Complexity similar to that of the range constructor.</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="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01243"></a><span class="lineno"><a class="line" href="a08003.html#a914954becc1ec4a1bec63eafe11065e1"> 1243</a></span>  <a class="code" href="a08003.html#a914954becc1ec4a1bec63eafe11065e1">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  { _M_h.insert(__first, __last); }</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> <span class="comment"></span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span> <span class="comment"> /**</span></div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span> <span class="comment"> * @brief Inserts a list of elements into the %unordered_multiset.</span></div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements to be</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"> * inserted.</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"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> <span class="comment"> */</span></div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01254"></a><span class="lineno"><a class="line" href="a08003.html#a0e45e9fa99b643fb6a79c4154c00dcb4"> 1254</a></span>  <a class="code" href="a08003.html#a0e45e9fa99b643fb6a79c4154c00dcb4">insert</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  { _M_h.insert(__l); }</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> </div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> <span class="comment"></span> node_type</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  extract(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __pos)</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  {</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  __glibcxx_assert(__pos != <a class="code" href="a08003.html#a8158b25dee0140da6e109a2592cec0eb">end</a>());</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordflow">return</span> _M_h.extract(__pos);</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span> <span class="comment"></span></div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> <span class="comment"></span> node_type</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  extract(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __key)</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  { <span class="keywordflow">return</span> _M_h.extract(__key); }</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> <span class="comment"></span></div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> <span class="comment"></span> <a class="code" href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0">iterator</a></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <a class="code" href="a08003.html#aa8ed787cbd107c6e469d92d0ab4d2836">insert</a>(node_type&& __nh)</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node_multi(<a class="code" href="a08003.html#a2a6edd3b4b891c1c260d3001a6b1ffcb">cend</a>(), std::move(__nh)); }</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> <span class="comment"></span></div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="comment"></span> <a class="code" href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0">iterator</a></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <a class="code" href="a08003.html#aa8ed787cbd107c6e469d92d0ab4d2836">insert</a>(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __hint, node_type&& __nh)</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  { <span class="keywordflow">return</span> _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> <span class="comment"></span></div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> <span class="comment"> * @brief Erases an element from an %unordered_multiset.</span></div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="comment"> * @a __position prior to the element being erased. If no such</span></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> <span class="comment"> *</span></div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> <span class="comment"> * from an %unordered_multiset.</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> <span class="comment"> *</span></div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> <span class="comment"> * Note that this function only erases the element, and that if the</span></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> <span class="comment"> * element is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</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>  <a class="code" href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0">iterator</a></div><div class="line"><a name="l01298"></a><span class="lineno"><a class="line" href="a08003.html#a7f56a12c1ac7a74ad413f075b58ddf09"> 1298</a></span>  <a class="code" href="a08003.html#a7f56a12c1ac7a74ad413f075b58ddf09">erase</a>(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __position)</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span> </div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="comment">// LWG 2059.</span></div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01303"></a><span class="lineno"><a class="line" href="a08003.html#ab3d07df2db9b602425527841d3e0e876"> 1303</a></span>  <a class="code" href="a08003.html#ab3d07df2db9b602425527841d3e0e876">erase</a>(<a class="code" href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0">iterator</a> __position)</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  { <span class="keywordflow">return</span> _M_h.erase(__position); }<span class="comment"></span></div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> <span class="comment"></span></div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> <span class="comment"></span></div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span> <span class="comment"> /**</span></div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> <span class="comment"> * @param __x Key of element to be erased.</span></div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span> <span class="comment"> * @return The number of elements erased.</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"> * This function erases all the elements located by the given key from</span></div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="comment"> * an %unordered_multiset.</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"> * Note that this function only erases the element, and that if the</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> <span class="comment"> * element is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</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>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01321"></a><span class="lineno"><a class="line" href="a08003.html#af75d57a40e15b929ee8931d5894164fc"> 1321</a></span>  <a class="code" href="a08003.html#af75d57a40e15b929ee8931d5894164fc">erase</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __x)</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  { <span class="keywordflow">return</span> _M_h.erase(__x); }</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> <span class="comment"></span></div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> <span class="comment"> /**</span></div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from an</span></div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> <span class="comment"> * %unordered_multiset.</span></div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> <span class="comment"> * @return The iterator @a __last.</span></div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span> <span class="comment"> *</span></div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> <span class="comment"> * This function erases a sequence of elements from an</span></div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span> <span class="comment"> * %unordered_multiset.</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"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</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="a07675.html">iterator</a></div><div class="line"><a name="l01341"></a><span class="lineno"><a class="line" href="a08003.html#a8d9f85005b81ca530aeeb413a38824ab"> 1341</a></span>  <a class="code" href="a08003.html#a8d9f85005b81ca530aeeb413a38824ab">erase</a>(<a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __first, <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a> __last)</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  { <span class="keywordflow">return</span> _M_h.erase(__first, __last); }</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span> <span class="comment"></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"> * Erases all elements in an %unordered_multiset.</span></div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> <span class="comment"> *</span></div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> <span class="comment"> * Note that this function only erases the elements, and that if the</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span> <span class="comment"> * elements themselves are pointers, the pointed-to memory is not touched</span></div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> <span class="comment"> */</span></div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01352"></a><span class="lineno"><a class="line" href="a08003.html#a18e69290f6407ee6a2de58b005f4309e"> 1352</a></span>  <a class="code" href="a08003.html#a18e69290f6407ee6a2de58b005f4309e">clear</a>() noexcept</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  { _M_h.clear(); }</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> <span class="comment"></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"> 1356</span> <span class="comment"> * @brief Swaps data with another %unordered_multiset.</span></div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span> <span class="comment"> * @param __x An %unordered_multiset of the same element and allocator</span></div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> <span class="comment"> * types.</span></div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> <span class="comment"> *</span></div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="comment"> * This exchanges the elements between two sets in constant time.</span></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> <span class="comment"> * std::swap(s1,s2) will feed to this function.</span></div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> <span class="comment"> */</span></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01365"></a><span class="lineno"><a class="line" href="a08003.html#a87b28725f19b4afc7e58d052bf07be2f"> 1365</a></span>  <a class="code" href="a08003.html#a87b28725f19b4afc7e58d052bf07be2f">swap</a>(<a class="code" href="a08003.html">unordered_multiset</a>& __x)</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  noexcept( noexcept(_M_h.swap(__x._M_h)) )</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  { _M_h.swap(__x._M_h); }</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span> </div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</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="l01371"></a><span class="lineno"> 1371</span>  <span class="keyword">friend</span> <span class="keyword">class </span>std::_Hash_merge_helper;</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> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  merge(<a class="code" href="a08003.html">unordered_multiset<_Value, _H2, _P2, _Alloc></a>& __source)</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  {</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="keyword">using</span> _Merge_helper</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  = _Hash_merge_helper<unordered_multiset, _H2, _P2>;</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  }</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> </div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  merge(unordered_multiset<_Value, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  { merge(__source); }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  merge(unordered_set<_Value, _H2, _P2, _Alloc>& __source)</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  {</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="keyword">using</span> _Merge_helper</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  = _Hash_merge_helper<unordered_multiset, _H2, _P2>;</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  }</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> </div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _P2></div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  merge(unordered_set<_Value, _H2, _P2, _Alloc>&& __source)</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  { merge(__source); }</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> </div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="comment">// observers.</span></div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> <span class="comment"></span></div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="comment"> /// Returns the hash functor object with which the %unordered_multiset</span></div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span> <span class="comment"> /// was constructed.</span></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> <span class="comment"></span> <a class="code" href="a08003.html#ac241bbf11679cbce9942578ecc48d776">hasher</a></div><div class="line"><a name="l01407"></a><span class="lineno"><a class="line" href="a08003.html#a5d32e359f0a827adb05fd1c5e29362b3"> 1407</a></span>  <a class="code" href="a08003.html#a5d32e359f0a827adb05fd1c5e29362b3">hash_function</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.hash_function(); }</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> <span class="comment"></span></div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="comment"> /// Returns the key comparison object with which the %unordered_multiset</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <span class="comment"> /// was constructed.</span></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span> <span class="comment"></span> <a class="code" href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">key_equal</a></div><div class="line"><a name="l01413"></a><span class="lineno"><a class="line" href="a08003.html#a9dfa97d099b1d96e80a72a94058ecc68"> 1413</a></span>  <a class="code" href="a08003.html#a9dfa97d099b1d96e80a72a94058ecc68">key_eq</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.key_eq(); }</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span> </div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="comment">// lookup.</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> <span class="comment"> //@{</span></div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> <span class="comment"> * @brief Tries to locate an element in an %unordered_multiset.</span></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> <span class="comment"> * @param __x Element to be located.</span></div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span> <span class="comment"> * found.</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"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</span></div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span> <span class="comment"> */</span></div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01431"></a><span class="lineno"><a class="line" href="a08003.html#a3abb4ae4616bf85eb3201d4488007420"> 1431</a></span>  <a class="code" href="a08003.html#a3abb4ae4616bf85eb3201d4488007420">find</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __x)</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  { <span class="keywordflow">return</span> _M_h.find(__x); }</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> </div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <a class="code" href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">const_iterator</a></div><div class="line"><a name="l01435"></a><span class="lineno"><a class="line" href="a08003.html#af99eeb8286c1266dba2e9155f8efe0b6"> 1435</a></span>  <a class="code" href="a08003.html#af99eeb8286c1266dba2e9155f8efe0b6">find</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.find(__x); }<span class="comment"></span></div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span> <span class="comment"> /**</span></div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span> <span class="comment"> * @brief Finds the number of elements.</span></div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> <span class="comment"> * @param __x Element to located.</span></div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="comment"> * @return Number of elements with specified key.</span></div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> <span class="comment"> */</span></div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01445"></a><span class="lineno"><a class="line" href="a08003.html#a758853e33d8b9dae33851ee71b42b0c8"> 1445</a></span>  <a class="code" href="a08003.html#a758853e33d8b9dae33851ee71b42b0c8">count</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.count(__x); }</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> <span class="comment"></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><span class="comment"> /**</span></div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span> <span class="comment"> */</span></div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <a class="code" href="a07767.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l01456"></a><span class="lineno"><a class="line" href="a08003.html#a14673553f519f4299e97892aaff3becf"> 1456</a></span>  <a class="code" href="a08003.html#a14673553f519f4299e97892aaff3becf">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __x)</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  { <span class="keywordflow">return</span> _M_h.equal_range(__x); }</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> </div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <a class="code" href="a07767.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l01460"></a><span class="lineno"><a class="line" href="a08003.html#a5c639624ebbe3e667dafad278f21ce05"> 1460</a></span>  <a class="code" href="a08003.html#a5c639624ebbe3e667dafad278f21ce05">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</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="l01462"></a><span class="lineno"> 1462</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span> <span class="comment"></span></div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="comment">// bucket interface.</span></div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> <span class="comment"></span></div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span> <span class="comment"> /// Returns the number of buckets of the %unordered_multiset.</span></div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span> <span class="comment"></span> <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01468"></a><span class="lineno"><a class="line" href="a08003.html#a151a3546cd927736e1b7741fefd84387"> 1468</a></span>  <a class="code" href="a08003.html#a151a3546cd927736e1b7741fefd84387">bucket_count</a>() const noexcept</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  { <span class="keywordflow">return</span> _M_h.bucket_count(); }</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span> <span class="comment"></span></div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> <span class="comment"> /// Returns the maximum number of buckets of the %unordered_multiset.</span></div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span> <span class="comment"></span> <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01473"></a><span class="lineno"><a class="line" href="a08003.html#abc4c192168d4217376439dce87cf12a2"> 1473</a></span>  <a class="code" href="a08003.html#abc4c192168d4217376439dce87cf12a2">max_bucket_count</a>() const noexcept</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  { <span class="keywordflow">return</span> _M_h.max_bucket_count(); }</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span> </div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="comment">/*</span></div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span> <span class="comment"> * @brief Returns the number of elements in a given bucket.</span></div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> <span class="comment"> * @param __n A bucket index.</span></div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> <span class="comment"> * @return The number of elements in the bucket.</span></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="comment"> */</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  bucket_size(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket_size(__n); }</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span> </div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="comment">/*</span></div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span> <span class="comment"> * @brief Returns the bucket index of a given element.</span></div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> <span class="comment"> * @param __key A key instance.</span></div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span> <span class="comment"> * @return The key bucket index.</span></div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> <span class="comment"> */</span></div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a></div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  bucket(<span class="keyword">const</span> <a class="code" href="a08003.html#a5728c1ad04495272ee1ee21fac011010">key_type</a>& __key)<span class="keyword"> const</span></div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.bucket(__key); }</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span> <span class="comment"></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><span class="comment"> /**</span></div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to the first</span></div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> <span class="comment"> * bucket element.</span></div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="comment"> */</span></div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <a class="code" href="a08003.html#a2b13af1127b00c668e4e277c0053c2c3">local_iterator</a></div><div class="line"><a name="l01502"></a><span class="lineno"><a class="line" href="a08003.html#a145287d1f05692134d098be7d75be1e5"> 1502</a></span>  <a class="code" href="a08003.html#a145287d1f05692134d098be7d75be1e5">begin</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  { <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span> </div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <a class="code" href="a08003.html#af3443472eeb3187e370e7c523c5df91e">const_local_iterator</a></div><div class="line"><a name="l01506"></a><span class="lineno"><a class="line" href="a08003.html#a317053819028a239c2a7611489bede4f"> 1506</a></span>  <a class="code" href="a08003.html#a317053819028a239c2a7611489bede4f">begin</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.begin(__n); }</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span> </div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <a class="code" href="a08003.html#af3443472eeb3187e370e7c523c5df91e">const_local_iterator</a></div><div class="line"><a name="l01510"></a><span class="lineno"><a class="line" href="a08003.html#af211aacc4102c0ceb0814dd6c518e8ed"> 1510</a></span>  <a class="code" href="a08003.html#af211aacc4102c0ceb0814dd6c518e8ed">cbegin</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cbegin(__n); }<span class="comment"></span></div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span> <span class="comment"></span><span class="comment"></span></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><span class="comment"> /**</span></div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> <span class="comment"> * @brief Returns a read-only (constant) iterator pointing to one past</span></div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span> <span class="comment"> * the last bucket elements.</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> <span class="comment"> * @param __n The bucket index.</span></div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> <span class="comment"> * @return A read-only local iterator.</span></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> <span class="comment"> */</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <a class="code" href="a08003.html#a2b13af1127b00c668e4e277c0053c2c3">local_iterator</a></div><div class="line"><a name="l01522"></a><span class="lineno"><a class="line" href="a08003.html#adecae97e8a67ad9111c148bc6a85bde5"> 1522</a></span>  <a class="code" href="a08003.html#adecae97e8a67ad9111c148bc6a85bde5">end</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)</div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  { <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> </div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <a class="code" href="a08003.html#af3443472eeb3187e370e7c523c5df91e">const_local_iterator</a></div><div class="line"><a name="l01526"></a><span class="lineno"><a class="line" href="a08003.html#a38af28f07b44fa8ef5ee3ee4d5886762"> 1526</a></span>  <a class="code" href="a08003.html#a38af28f07b44fa8ef5ee3ee4d5886762">end</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.end(__n); }</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> </div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <a class="code" href="a08003.html#af3443472eeb3187e370e7c523c5df91e">const_local_iterator</a></div><div class="line"><a name="l01530"></a><span class="lineno"><a class="line" href="a08003.html#abae4214954f75b08215d74344bc81562"> 1530</a></span>  <a class="code" href="a08003.html#abae4214954f75b08215d74344bc81562">cend</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)<span class="keyword"> const</span></div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h.cend(__n); }<span class="comment"></span></div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span> <span class="comment"></span></div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="comment">// hash policy.</span></div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span> <span class="comment"></span></div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span> <span class="comment"> /// Returns the average number of elements per bucket.</span></div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l01538"></a><span class="lineno"><a class="line" href="a08003.html#a4105eeac8ec00dc431b408e8d046dd5e"> 1538</a></span>  <a class="code" href="a08003.html#a4105eeac8ec00dc431b408e8d046dd5e">load_factor</a>() const noexcept</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  { <span class="keywordflow">return</span> _M_h.load_factor(); }</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span> <span class="comment"></span></div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span> <span class="comment"> /// Returns a positive number that the %unordered_multiset tries to keep the</span></div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span> <span class="comment"> /// load factor less than or equal to.</span></div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> <span class="comment"></span> <span class="keywordtype">float</span></div><div class="line"><a name="l01544"></a><span class="lineno"><a class="line" href="a08003.html#a1d6af6a14a53c2709b072d6722ecf039"> 1544</a></span>  <a class="code" href="a08003.html#a1d6af6a14a53c2709b072d6722ecf039">max_load_factor</a>() const noexcept</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  { <span class="keywordflow">return</span> _M_h.max_load_factor(); }</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> <span class="comment"></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"> * @brief Change the %unordered_multiset maximum load factor.</span></div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> <span class="comment"> * @param __z The new maximum load factor.</span></div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> <span class="comment"> */</span></div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01552"></a><span class="lineno"><a class="line" href="a08003.html#aff0cd0917d69025d995dd401c1ec63a6"> 1552</a></span>  <a class="code" href="a08003.html#aff0cd0917d69025d995dd401c1ec63a6">max_load_factor</a>(<span class="keywordtype">float</span> __z)</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  { _M_h.max_load_factor(__z); }</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span> <span class="comment"></span></div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> <span class="comment"> /**</span></div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> <span class="comment"> * @brief May rehash the %unordered_multiset.</span></div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span> <span class="comment"> * @param __n The new number of buckets.</span></div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span> <span class="comment"> *</span></div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span> <span class="comment"> * Rehash will occur only if the new number of buckets respect the</span></div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span> <span class="comment"> * %unordered_multiset maximum load factor.</span></div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span> <span class="comment"> */</span></div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01563"></a><span class="lineno"><a class="line" href="a08003.html#a12c1bfb9feb07236289dcf324b841d58"> 1563</a></span>  <a class="code" href="a08003.html#a12c1bfb9feb07236289dcf324b841d58">rehash</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  { _M_h.rehash(__n); }</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</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"> * @brief Prepare the %unordered_multiset for a specified number of</span></div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> <span class="comment"> * @param __n Number of elements required.</span></div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span> <span class="comment"> *</span></div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span> <span class="comment"> * Same as rehash(ceil(n / max_load_factor())).</span></div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span> <span class="comment"> */</span></div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01574"></a><span class="lineno"><a class="line" href="a08003.html#aad33b09815e29fc00dba2408e91e3ed6"> 1574</a></span>  <a class="code" href="a08003.html#aad33b09815e29fc00dba2408e91e3ed6">reserve</a>(<a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">size_type</a> __n)</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  { _M_h.reserve(__n); }</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span> </div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Value1, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Pred1,</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keyword">typename</span> _Alloc1></div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  operator==(<span class="keyword">const</span> <a class="code" href="a08003.html">unordered_multiset<_Value1, _Hash1, _Pred1, _Alloc1></a>&,</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keyword">const</span> <a class="code" href="a08003.html">unordered_multiset<_Value1, _Hash1, _Pred1, _Alloc1></a>&);</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  };</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> </div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span> </div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> </div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="keyword">typename</span> _Hash =</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  hash<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  <span class="keyword">typename</span> _Pred =</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  equal_to<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="keyword">typename</span> _Allocator =</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  allocator<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  unordered_multiset(_InputIterator, _InputIterator,</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">unordered_multiset<int>::size_type</a> = {},</div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  _Hash = _Hash(), _Pred = _Pred(),</div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  _Allocator = _Allocator())</div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  -> unordered_multiset<<span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type,</div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> </div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash = hash<_Tp>,</div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keyword">typename</span> _Pred = equal_to<_Tp>,</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keyword">typename</span> _Allocator = allocator<_Tp>,</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  unordered_multiset(initializer_list<_Tp>,</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">unordered_multiset<int>::size_type</a> = {},</div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  _Hash = _Hash(), _Pred = _Pred(),</div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  _Allocator = _Allocator())</div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;</div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span> </div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  unordered_multiset(_InputIterator, _InputIterator,</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">unordered_multiset<int>::size_type</a>, _Allocator)</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  -> <a class="code" href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">unordered_multiset<typename iterator_traits<_InputIterator>::value_type</a>,</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  hash<<span class="keyword">typename</span></div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  equal_to<<span class="keyword">typename</span></div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  _Allocator>;</div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span> </div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</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="l01626"></a><span class="lineno"> 1626</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  unordered_multiset(_InputIterator, _InputIterator,</div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">unordered_multiset<int>::size_type</a>,</div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  _Hash, _Allocator)</div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  -> unordered_multiset<<span class="keyword">typename</span></div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  iterator_traits<_InputIterator>::value_type,</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  _Hash,</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  equal_to<</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keyword">typename</span></div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  _Allocator>;</div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span> </div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  unordered_multiset(initializer_list<_Tp>,</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">unordered_multiset<int>::size_type</a>, _Allocator)</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;</div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span> </div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Hash, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  unordered_multiset(initializer_list<_Tp>,</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <a class="code" href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">unordered_multiset<int>::size_type</a>, _Hash, _Allocator)</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span> </div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span> </div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  { __x.swap(__y); }</div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span> </div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  { __x.swap(__y); }</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> </div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  operator==(<span class="keyword">const</span> unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  <span class="keyword">const</span> unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  { <span class="keywordflow">return</span> __x._M_h._M_equal(__y._M_h); }</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span> </div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  operator!=(<span class="keyword">const</span> unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <span class="keyword">const</span> unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span> </div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  operator==(<span class="keyword">const</span> unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  <span class="keyword">const</span> unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  { <span class="keywordflow">return</span> __x._M_h._M_equal(__y._M_h); }</div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> </div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Value, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  operator!=(<span class="keyword">const</span> unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,</div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="keyword">const</span> unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span> </div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span> </div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  <span class="comment">// Allow std::unordered_set access to internals of compatible sets.</span></div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Eq1, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="keyword">typename</span> _Hash2, <span class="keyword">typename</span> _Eq2></div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="keyword">struct </span>_Hash_merge_helper<</div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  _GLIBCXX_STD_C::unordered_set<_Val, _Hash1, _Eq1, _Alloc>, _Hash2, _Eq2></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  {</div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <span class="keyword">using</span> unordered_set = _GLIBCXX_STD_C::unordered_set<_Tp...>;</div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="keyword">using</span> unordered_multiset = _GLIBCXX_STD_C::unordered_multiset<_Tp...>;</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span> </div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  <span class="keyword">friend</span> unordered_set<_Val, _Hash1, _Eq1, _Alloc>;</div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span> </div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  _S_get_table(unordered_set<_Val, _Hash2, _Eq2, _Alloc>& __set)</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  { <span class="keywordflow">return</span> __set._M_h; }</div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span> </div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  _S_get_table(unordered_multiset<_Val, _Hash2, _Eq2, _Alloc>& __set)</div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  { <span class="keywordflow">return</span> __set._M_h; }</div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  };</div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span> </div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="comment">// Allow std::unordered_multiset access to internals of compatible sets.</span></div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _Hash1, <span class="keyword">typename</span> _Eq1, <span class="keyword">typename</span> _Alloc,</div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  <span class="keyword">typename</span> _Hash2, <span class="keyword">typename</span> _Eq2></div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  <span class="keyword">struct </span>_Hash_merge_helper<</div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  _GLIBCXX_STD_C::unordered_multiset<_Val, _Hash1, _Eq1, _Alloc>,</div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  _Hash2, _Eq2></div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  {</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="keyword">using</span> unordered_set = _GLIBCXX_STD_C::unordered_set<_Tp...>;</div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Tp></div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="keyword">using</span> unordered_multiset = _GLIBCXX_STD_C::unordered_multiset<_Tp...>;</div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> </div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  <span class="keyword">friend</span> unordered_multiset<_Val, _Hash1, _Eq1, _Alloc>;</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span> </div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  _S_get_table(unordered_set<_Val, _Hash2, _Eq2, _Alloc>& __set)</div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  { <span class="keywordflow">return</span> __set._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="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  _S_get_table(unordered_multiset<_Val, _Hash2, _Eq2, _Alloc>& __set)</div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  { <span class="keywordflow">return</span> __set._M_h; }</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="preprocessor">#endif // C++17</span></div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span> </div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span> </div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span> <span class="preprocessor">#endif </span><span class="comment">/* _UNORDERED_SET_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a08003_html_adecae97e8a67ad9111c148bc6a85bde5"><div class="ttname"><a href="a08003.html#adecae97e8a67ad9111c148bc6a85bde5">std::unordered_multiset::end</a></div><div class="ttdeci">local_iterator end(size_type __n)</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="a00626_source.html#l01522">unordered_set.h:1522</a></div></div>
<div class="ttc" id="a08003_html_aad33b09815e29fc00dba2408e91e3ed6"><div class="ttname"><a href="a08003.html#aad33b09815e29fc00dba2408e91e3ed6">std::unordered_multiset::reserve</a></div><div class="ttdeci">void reserve(size_type __n)</div><div class="ttdoc">Prepare the unordered_multiset for a specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01574">unordered_set.h:1574</a></div></div>
<div class="ttc" id="a08003_html_a151a3546cd927736e1b7741fefd84387"><div class="ttname"><a href="a08003.html#a151a3546cd927736e1b7741fefd84387">std::unordered_multiset::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_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01468">unordered_set.h:1468</a></div></div>
<div class="ttc" id="a08003_html_a8fefcc1326d2d85a00bf958f7086d4a1"><div class="ttname"><a href="a08003.html#a8fefcc1326d2d85a00bf958f7086d4a1">std::unordered_multiset::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01143">unordered_set.h:1143</a></div></div>
<div class="ttc" id="a08007_html_acef2fe55c494314acad1104ba1488cf6"><div class="ttname"><a href="a08007.html#acef2fe55c494314acad1104ba1488cf6">std::unordered_set::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from an unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00522">unordered_set.h:522</a></div></div>
<div class="ttc" id="a08003_html_af211aacc4102c0ceb0814dd6c518e8ed"><div class="ttname"><a href="a08003.html#af211aacc4102c0ceb0814dd6c518e8ed">std::unordered_multiset::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="a00626_source.html#l01510">unordered_set.h:1510</a></div></div>
<div class="ttc" id="a08003_html_aadc4a113c0ce8991df621858a74e063b"><div class="ttname"><a href="a08003.html#aadc4a113c0ce8991df621858a74e063b">std::unordered_multiset::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, value_type &&__x)</div><div class="ttdoc">Inserts an element into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01229">unordered_set.h:1229</a></div></div>
<div class="ttc" id="a08003_html_abae4214954f75b08215d74344bc81562"><div class="ttname"><a href="a08003.html#abae4214954f75b08215d74344bc81562">std::unordered_multiset::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="a00626_source.html#l01530">unordered_set.h:1530</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="a08003_html_aa107c9adeffdf499edd13a0a88ed8cbc"><div class="ttname"><a href="a08003.html#aa107c9adeffdf499edd13a0a88ed8cbc">std::unordered_multiset::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="a00626_source.html#l00914">unordered_set.h:914</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="a08007_html_a155f3d6e9b8a3a59bb03969355ae5f73"><div class="ttname"><a href="a08007.html#a155f3d6e9b8a3a59bb03969355ae5f73">std::unordered_set::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00354">unordered_set.h:354</a></div></div>
<div class="ttc" id="a08007_html_ae91bd4ef581ac83337d7cced559349e2"><div class="ttname"><a href="a08007.html#ae91bd4ef581ac83337d7cced559349e2">std::unordered_set::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="a00626_source.html#l00680">unordered_set.h:680</a></div></div>
<div class="ttc" id="a08003_html_ab16debc24d07c39201f4aaa943b8ba6d"><div class="ttname"><a href="a08003.html#ab16debc24d07c39201f4aaa943b8ba6d">std::unordered_multiset::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="a00626_source.html#l00916">unordered_set.h:916</a></div></div>
<div class="ttc" id="a08003_html_ad30c938c0f7a7d7d78471da27420efc0"><div class="ttname"><a href="a08003.html#ad30c938c0f7a7d7d78471da27420efc0">std::unordered_multiset::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="a00626_source.html#l00917">unordered_set.h:917</a></div></div>
<div class="ttc" id="a08007_html_aab994b1b759354f0bdd30f6e04b86b68"><div class="ttname"><a href="a08007.html#aab994b1b759354f0bdd30f6e04b86b68">std::unordered_set::begin</a></div><div class="ttdeci">local_iterator begin(size_type __n)</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="a00626_source.html#l00726">unordered_set.h:726</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="a08007_html_a28b4eb4e12733c87d05ecd05c23e4269"><div class="ttname"><a href="a08007.html#a28b4eb4e12733c87d05ecd05c23e4269">std::unordered_set::operator=</a></div><div class="ttdeci">unordered_set & operator=(const unordered_set &)=default</div><div class="ttdoc">Copy assignment operator.</div></div>
<div class="ttc" id="a08003_html_a0fd1cffa71f49d5bcea5c9fa1cb36312"><div class="ttname"><a href="a08003.html#a0fd1cffa71f49d5bcea5c9fa1cb36312">std::unordered_multiset::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="a00626_source.html#l00913">unordered_set.h:913</a></div></div>
<div class="ttc" id="a08003_html_adfc21fb29e21a666c726325bdbab7fd8"><div class="ttname"><a href="a08003.html#adfc21fb29e21a666c726325bdbab7fd8">std::unordered_multiset::operator=</a></div><div class="ttdeci">unordered_multiset & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Unordered_multiset list assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01080">unordered_set.h:1080</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="a08007_html_ac9fa0bc82f5e6fae38a8d225f468608d"><div class="ttname"><a href="a08007.html#ac9fa0bc82f5e6fae38a8d225f468608d">std::unordered_set::insert</a></div><div class="ttdeci">std::pair< iterator, bool > insert(const value_type &__x)</div><div class="ttdoc">Attempts to insert an element into the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00420">unordered_set.h:420</a></div></div>
<div class="ttc" id="a08003_html_a317053819028a239c2a7611489bede4f"><div class="ttname"><a href="a08003.html#a317053819028a239c2a7611489bede4f">std::unordered_multiset::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="a00626_source.html#l01506">unordered_set.h:1506</a></div></div>
<div class="ttc" id="a08007_html_ac182f2597af135950bfc3b1cd09575ec"><div class="ttname"><a href="a08007.html#ac182f2597af135950bfc3b1cd09575ec">std::unordered_set::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_set tries to keep the load factor less than or equal to.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00768">unordered_set.h:768</a></div></div>
<div class="ttc" id="a08003_html_a9dfa97d099b1d96e80a72a94058ecc68"><div class="ttname"><a href="a08003.html#a9dfa97d099b1d96e80a72a94058ecc68">std::unordered_multiset::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_multiset was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01413">unordered_set.h:1413</a></div></div>
<div class="ttc" id="a08007_html_ae5f593da6d71d91fb83d2e6023ad8d87"><div class="ttname"><a href="a08007.html#ae5f593da6d71d91fb83d2e6023ad8d87">std::unordered_set::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="a00626_source.html#l00684">unordered_set.h:684</a></div></div>
<div class="ttc" id="a08007_html_a9bba281b4f65b14513a532e398d37642"><div class="ttname"><a href="a08007.html#a9bba281b4f65b14513a532e398d37642">std::unordered_set::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="a00626_source.html#l00110">unordered_set.h:110</a></div></div>
<div class="ttc" id="a08007_html_a1f89dfe5f4807151e3829f060b103efc"><div class="ttname"><a href="a08007.html#a1f89dfe5f4807151e3829f060b103efc">std::unordered_set::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="a00626_source.html#l00667">unordered_set.h:667</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="a08003_html_aff0cd0917d69025d995dd401c1ec63a6"><div class="ttname"><a href="a08003.html#aff0cd0917d69025d995dd401c1ec63a6">std::unordered_multiset::max_load_factor</a></div><div class="ttdeci">void max_load_factor(float __z)</div><div class="ttdoc">Change the unordered_multiset maximum load factor.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01552">unordered_set.h:1552</a></div></div>
<div class="ttc" id="a08007_html_a78081fffb25f4c7c28a59c7cf4218c51"><div class="ttname"><a href="a08007.html#a78081fffb25f4c7c28a59c7cf4218c51">std::unordered_set::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="a00626_source.html#l00124">unordered_set.h:124</a></div></div>
<div class="ttc" id="a08007_html_a28389b5527a3ee6a52adc2ee72e67029"><div class="ttname"><a href="a08007.html#a28389b5527a3ee6a52adc2ee72e67029">std::unordered_set::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="a00626_source.html#l00730">unordered_set.h:730</a></div></div>
<div class="ttc" id="a08007_html_afc90e16afa79bd929b49590dc8637b00"><div class="ttname"><a href="a08007.html#afc90e16afa79bd929b49590dc8637b00">std::unordered_set::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_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00697">unordered_set.h:697</a></div></div>
<div class="ttc" id="a08003_html_a18e69290f6407ee6a2de58b005f4309e"><div class="ttname"><a href="a08003.html#a18e69290f6407ee6a2de58b005f4309e">std::unordered_multiset::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01352">unordered_set.h:1352</a></div></div>
<div class="ttc" id="a08007_html_a5475af91b7b075f1315091b522eacd3e"><div class="ttname"><a href="a08007.html#a5475af91b7b075f1315091b522eacd3e">std::unordered_set::erase</a></div><div class="ttdeci">iterator erase(iterator __position)</div><div class="ttdoc">Erases an element from an unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00527">unordered_set.h:527</a></div></div>
<div class="ttc" id="a08007_html_acd7b3eed2fde01c393da9d14f1aa03b9"><div class="ttname"><a href="a08007.html#acd7b3eed2fde01c393da9d14f1aa03b9">std::unordered_set::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_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00562">unordered_set.h:562</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="a08007_html_a124d7201aeadabc2a92e74fde00ec347"><div class="ttname"><a href="a08007.html#a124d7201aeadabc2a92e74fde00ec347">std::unordered_set::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="a00626_source.html#l00750">unordered_set.h:750</a></div></div>
<div class="ttc" id="a08007_html_ac935f6a3b65fe0e5629ada1699c86868"><div class="ttname"><a href="a08007.html#ac935f6a3b65fe0e5629ada1699c86868">std::unordered_set::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="a00626_source.html#l00544">unordered_set.h:544</a></div></div>
<div class="ttc" id="a08003_html_a4105eeac8ec00dc431b408e8d046dd5e"><div class="ttname"><a href="a08003.html#a4105eeac8ec00dc431b408e8d046dd5e">std::unordered_multiset::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="a00626_source.html#l01538">unordered_set.h:1538</a></div></div>
<div class="ttc" id="a08003_html_a14673553f519f4299e97892aaff3becf"><div class="ttname"><a href="a08003.html#a14673553f519f4299e97892aaff3becf">std::unordered_multiset::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="a00626_source.html#l01456">unordered_set.h:1456</a></div></div>
<div class="ttc" id="a08003_html_a06fc4f0351ccd36daf6b1595752c2e79"><div class="ttname"><a href="a08003.html#a06fc4f0351ccd36daf6b1595752c2e79">std::unordered_multiset::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01116">unordered_set.h:1116</a></div></div>
<div class="ttc" id="a08007_html_a1f83ff00c35e85978dced4fb3ff6772e"><div class="ttname"><a href="a08007.html#a1f83ff00c35e85978dced4fb3ff6772e">std::unordered_set::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="a00626_source.html#l00106">unordered_set.h:106</a></div></div>
<div class="ttc" id="a08007_html_ad71108e3e7466e69cf84def961574aec"><div class="ttname"><a href="a08007.html#ad71108e3e7466e69cf84def961574aec">std::unordered_set::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="a00626_source.html#l00122">unordered_set.h:122</a></div></div>
<div class="ttc" id="a08007_html_a3c34d8e0d4bfc8c91c4b54b5199edc04"><div class="ttname"><a href="a08007.html#a3c34d8e0d4bfc8c91c4b54b5199edc04">std::unordered_set::operator=</a></div><div class="ttdeci">unordered_set & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Unordered_set list assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00283">unordered_set.h:283</a></div></div>
<div class="ttc" id="a08003_html_aa888dc9e6ebd2d05342de7efac99e55c"><div class="ttname"><a href="a08003.html#aa888dc9e6ebd2d05342de7efac99e55c">std::unordered_multiset::insert</a></div><div class="ttdeci">iterator insert(value_type &&__x)</div><div class="ttdoc">Inserts an element into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01203">unordered_set.h:1203</a></div></div>
<div class="ttc" id="a08003_html_a758853e33d8b9dae33851ee71b42b0c8"><div class="ttname"><a href="a08003.html#a758853e33d8b9dae33851ee71b42b0c8">std::unordered_multiset::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="a00626_source.html#l01445">unordered_set.h:1445</a></div></div>
<div class="ttc" id="a08003_html_a7f56a12c1ac7a74ad413f075b58ddf09"><div class="ttname"><a href="a08003.html#a7f56a12c1ac7a74ad413f075b58ddf09">std::unordered_multiset::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from an unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01298">unordered_set.h:1298</a></div></div>
<div class="ttc" id="a08003_html_afa9b2af271d4a9c43401403d4b21a22f"><div class="ttname"><a href="a08003.html#afa9b2af271d4a9c43401403d4b21a22f">std::unordered_multiset::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_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01088">unordered_set.h:1088</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="a08007_html_a6f3606a68d349ec1e1e5de56116a39fd"><div class="ttname"><a href="a08007.html#a6f3606a68d349ec1e1e5de56116a39fd">std::unordered_set::rehash</a></div><div class="ttdeci">void rehash(size_type __n)</div><div class="ttdoc">May rehash the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00787">unordered_set.h:787</a></div></div>
<div class="ttc" id="a08003_html_a1d6af6a14a53c2709b072d6722ecf039"><div class="ttname"><a href="a08003.html#a1d6af6a14a53c2709b072d6722ecf039">std::unordered_multiset::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_multiset tries to keep the load factor less than or equa...</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01544">unordered_set.h:1544</a></div></div>
<div class="ttc" id="a08007_html_a9ead8905955f0942591a17d70f8405c8"><div class="ttname"><a href="a08007.html#a9ead8905955f0942591a17d70f8405c8">std::unordered_set::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00337">unordered_set.h:337</a></div></div>
<div class="ttc" id="a08007_html_a795d0f609bd9032858d61acc386ee11a"><div class="ttname"><a href="a08007.html#a795d0f609bd9032858d61acc386ee11a">std::unordered_set::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="a00626_source.html#l00118">unordered_set.h:118</a></div></div>
<div class="ttc" id="a08007_html_a489606b8c31cc86a461912f292dac389"><div class="ttname"><a href="a08007.html#a489606b8c31cc86a461912f292dac389">std::unordered_set::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="a00626_source.html#l00123">unordered_set.h:123</a></div></div>
<div class="ttc" id="a08003_html_a0a7ead2d0db3cfaf291968f0967cf242"><div class="ttname"><a href="a08003.html#a0a7ead2d0db3cfaf291968f0967cf242">std::unordered_multiset::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, const value_type &__x)</div><div class="ttdoc">Inserts an element into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01225">unordered_set.h:1225</a></div></div>
<div class="ttc" id="a08007_html_ab8d7bdf04f958f040cfd842c6e2d7b6b"><div class="ttname"><a href="a08007.html#ab8d7bdf04f958f040cfd842c6e2d7b6b">std::unordered_set::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="a00626_source.html#l00468">unordered_set.h:468</a></div></div>
<div class="ttc" id="a08007_html_a64c2420ac682e15e195863aecf2bcb8b"><div class="ttname"><a href="a08007.html#a64c2420ac682e15e195863aecf2bcb8b">std::unordered_set::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="a00626_source.html#l00116">unordered_set.h:116</a></div></div>
<div class="ttc" id="a08007_html_a086929d624211470ff2b20a0ba23a86d"><div class="ttname"><a href="a08007.html#a086929d624211470ff2b20a0ba23a86d">std::unordered_set::max_load_factor</a></div><div class="ttdeci">void max_load_factor(float __z)</div><div class="ttdoc">Change the unordered_set maximum load factor.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00776">unordered_set.h:776</a></div></div>
<div class="ttc" id="a08007_html_aa28c45008761a27eecdaeefaab68fa0e"><div class="ttname"><a href="a08007.html#aa28c45008761a27eecdaeefaab68fa0e">std::unordered_set::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00333">unordered_set.h:333</a></div></div>
<div class="ttc" id="a08003_html_af75d57a40e15b929ee8931d5894164fc"><div class="ttname"><a href="a08003.html#af75d57a40e15b929ee8931d5894164fc">std::unordered_multiset::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="a00626_source.html#l01321">unordered_set.h:1321</a></div></div>
<div class="ttc" id="a08007_html_acf6e31142497379c81e5853765ffd9a4"><div class="ttname"><a href="a08007.html#acf6e31142497379c81e5853765ffd9a4">std::unordered_set::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_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00291">unordered_set.h:291</a></div></div>
<div class="ttc" id="a08003_html_a3abb4ae4616bf85eb3201d4488007420"><div class="ttname"><a href="a08003.html#a3abb4ae4616bf85eb3201d4488007420">std::unordered_multiset::find</a></div><div class="ttdeci">iterator find(const key_type &__x)</div><div class="ttdoc">Tries to locate an element in an unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01431">unordered_set.h:1431</a></div></div>
<div class="ttc" id="a08003_html_a67d09e2826cd252504705969c1cbad8b"><div class="ttname"><a href="a08003.html#a67d09e2826cd252504705969c1cbad8b">std::unordered_multiset::unordered_multiset</a></div><div class="ttdeci">unordered_multiset(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_multiset from an initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00988">unordered_set.h:988</a></div></div>
<div class="ttc" id="a08007_html_a70a807c039d620efcfd2b96048c3471a"><div class="ttname"><a href="a08007.html#a70a807c039d620efcfd2b96048c3471a">std::unordered_set::end</a></div><div class="ttdeci">local_iterator end(size_type __n)</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="a00626_source.html#l00746">unordered_set.h:746</a></div></div>
<div class="ttc" id="a08007_html_ae5b2e99866a8b463ab6f9fe577f08297"><div class="ttname"><a href="a08007.html#ae5b2e99866a8b463ab6f9fe577f08297">std::unordered_set::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_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00692">unordered_set.h:692</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="a08003_html_a31747dab6f248961de2668f292a18565"><div class="ttname"><a href="a08003.html#a31747dab6f248961de2668f292a18565">std::unordered_multiset::emplace</a></div><div class="ttdeci">iterator emplace(_Args &&... __args)</div><div class="ttdoc">Builds and insert an element into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01165">unordered_set.h:1165</a></div></div>
<div class="ttc" id="a08007_html_ad8049c5e823b2e158de097c48b4bcb0d"><div class="ttname"><a href="a08007.html#ad8049c5e823b2e158de097c48b4bcb0d">std::unordered_set::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00572">unordered_set.h:572</a></div></div>
<div class="ttc" id="a08003_html_a348726f7f2783583fee4bccee78e6ff4"><div class="ttname"><a href="a08003.html#a348726f7f2783583fee4bccee78e6ff4">std::unordered_multiset::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="a00626_source.html#l00918">unordered_set.h:918</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="a08003_html_af0cbbd14540e7875dd507533a959bf77"><div class="ttname"><a href="a08003.html#af0cbbd14540e7875dd507533a959bf77">std::unordered_multiset::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdoc">Returns the maximum size of the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01105">unordered_set.h:1105</a></div></div>
<div class="ttc" id="a08003_html_afc4a4d64411a584ccf011a942a261bbe"><div class="ttname"><a href="a08003.html#afc4a4d64411a584ccf011a942a261bbe">std::unordered_multiset::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="a00626_source.html#l00907">unordered_set.h:907</a></div></div>
<div class="ttc" id="a08007_html_a73ec5052e45a7a980d1968a0805a32dd"><div class="ttname"><a href="a08007.html#a73ec5052e45a7a980d1968a0805a32dd">std::unordered_set::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdoc">Returns the size of the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00303">unordered_set.h:303</a></div></div>
<div class="ttc" id="a08007_html_adbea625ce309dd45648ae7d2d2fae5ad"><div class="ttname"><a href="a08007.html#adbea625ce309dd45648ae7d2d2fae5ad">std::unordered_set::unordered_set</a></div><div class="ttdeci">unordered_set(_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_set from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00166">unordered_set.h:166</a></div></div>
<div class="ttc" id="a08007_html_a91423e12bcd7c66a7b92c919af9e61a2"><div class="ttname"><a href="a08007.html#a91423e12bcd7c66a7b92c919af9e61a2">std::unordered_set::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_set was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00631">unordered_set.h:631</a></div></div>
<div class="ttc" id="a08003_html_a8158b25dee0140da6e109a2592cec0eb"><div class="ttname"><a href="a08003.html#a8158b25dee0140da6e109a2592cec0eb">std::unordered_multiset::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01130">unordered_set.h:1130</a></div></div>
<div class="ttc" id="a08003_html_a2b13af1127b00c668e4e277c0053c2c3"><div class="ttname"><a href="a08003.html#a2b13af1127b00c668e4e277c0053c2c3">std::unordered_multiset::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="a00626_source.html#l00919">unordered_set.h:919</a></div></div>
<div class="ttc" id="a08003_html_ac6084dcccef761538983acc055a3d106"><div class="ttname"><a href="a08003.html#ac6084dcccef761538983acc055a3d106">std::unordered_multiset::unordered_multiset</a></div><div class="ttdeci">unordered_multiset(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="a00626_source.html#l00942">unordered_set.h:942</a></div></div>
<div class="ttc" id="a08003_html_af3443472eeb3187e370e7c523c5df91e"><div class="ttname"><a href="a08003.html#af3443472eeb3187e370e7c523c5df91e">std::unordered_multiset::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="a00626_source.html#l00920">unordered_set.h:920</a></div></div>
<div class="ttc" id="a08007_html_afbad50ec9cd24208c2b33f35aa50f371"><div class="ttname"><a href="a08007.html#afbad50ec9cd24208c2b33f35aa50f371">std::unordered_set::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdoc">Returns the maximum size of the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00308">unordered_set.h:308</a></div></div>
<div class="ttc" id="a08003_html_a145287d1f05692134d098be7d75be1e5"><div class="ttname"><a href="a08003.html#a145287d1f05692134d098be7d75be1e5">std::unordered_multiset::begin</a></div><div class="ttdeci">local_iterator begin(size_type __n)</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="a00626_source.html#l01502">unordered_set.h:1502</a></div></div>
<div class="ttc" id="a08003_html_aaa3754e88e7218cbd97bad8024a9a20a"><div class="ttname"><a href="a08003.html#aaa3754e88e7218cbd97bad8024a9a20a">std::unordered_multiset::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01134">unordered_set.h:1134</a></div></div>
<div class="ttc" id="a08007_html_a5f19f51483e14e3006bf1d6c0c7ec00a"><div class="ttname"><a href="a08007.html#a5f19f51483e14e3006bf1d6c0c7ec00a">std::unordered_set::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="a00626_source.html#l00754">unordered_set.h:754</a></div></div>
<div class="ttc" id="a08003_html_a81c1d4a9ff7f0173466deb652ab4f10b"><div class="ttname"><a href="a08003.html#a81c1d4a9ff7f0173466deb652ab4f10b">std::unordered_multiset::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Inserts an element into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01187">unordered_set.h:1187</a></div></div>
<div class="ttc" id="a08007_html_a060e030a56e63250f388344e5888702a"><div class="ttname"><a href="a08007.html#a060e030a56e63250f388344e5888702a">std::unordered_set::unordered_set</a></div><div class="ttdeci">unordered_set(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_set from an initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00220">unordered_set.h:220</a></div></div>
<div class="ttc" id="a08003_html_a5c639624ebbe3e667dafad278f21ce05"><div class="ttname"><a href="a08003.html#a5c639624ebbe3e667dafad278f21ce05">std::unordered_multiset::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="a00626_source.html#l01460">unordered_set.h:1460</a></div></div>
<div class="ttc" id="a08007_html_a14e45fe3da6c5bb759688d5aed9183ff"><div class="ttname"><a href="a08007.html#a14e45fe3da6c5bb759688d5aed9183ff">std::unordered_set::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="a00626_source.html#l00107">unordered_set.h:107</a></div></div>
<div class="ttc" id="a08003_html_a37fd3cf11429a513cea1f132c06e87df"><div class="ttname"><a href="a08003.html#a37fd3cf11429a513cea1f132c06e87df">std::unordered_multiset::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="a00626_source.html#l00908">unordered_set.h:908</a></div></div>
<div class="ttc" id="a08007_html_a3d563863f9fd94aa7573fecb9c027c23"><div class="ttname"><a href="a08007.html#a3d563863f9fd94aa7573fecb9c027c23">std::unordered_set::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00323">unordered_set.h:323</a></div></div>
<div class="ttc" id="a08007_html_aace23136ea294ea67dcfe292b896b110"><div class="ttname"><a href="a08007.html#aace23136ea294ea67dcfe292b896b110">std::unordered_set::unordered_set</a></div><div class="ttdeci">unordered_set()=default</div><div class="ttdoc">Default constructor.</div></div>
<div class="ttc" id="a08003_html_ab3d07df2db9b602425527841d3e0e876"><div class="ttname"><a href="a08003.html#ab3d07df2db9b602425527841d3e0e876">std::unordered_multiset::erase</a></div><div class="ttdeci">iterator erase(iterator __position)</div><div class="ttdoc">Erases an element from an unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01303">unordered_set.h:1303</a></div></div>
<div class="ttc" id="a08003_html_a342b7c9edfa273379f949beb9a00fd4a"><div class="ttname"><a href="a08003.html#a342b7c9edfa273379f949beb9a00fd4a">std::unordered_multiset::unordered_multiset</a></div><div class="ttdeci">unordered_multiset(_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_multiset from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00963">unordered_set.h:963</a></div></div>
<div class="ttc" id="a08003_html_a9e17536caf4f009c1a337cbdc65b10e4"><div class="ttname"><a href="a08003.html#a9e17536caf4f009c1a337cbdc65b10e4">std::unordered_multiset::operator=</a></div><div class="ttdeci">unordered_multiset & operator=(const unordered_multiset &)=default</div><div class="ttdoc">Copy assignment operator.</div></div>
<div class="ttc" id="a08003_html_a530f5c88d1e5082a61c5b38948e1cfdb"><div class="ttname"><a href="a08003.html#a530f5c88d1e5082a61c5b38948e1cfdb">std::unordered_multiset::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="a00626_source.html#l00921">unordered_set.h:921</a></div></div>
<div class="ttc" id="a08003_html_a8c5aa4088fd624fca11155a1a525c91a"><div class="ttname"><a href="a08003.html#a8c5aa4088fd624fca11155a1a525c91a">std::unordered_multiset::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01120">unordered_set.h:1120</a></div></div>
<div class="ttc" id="a08007_html_a111a313624cf9219526288500218d406"><div class="ttname"><a href="a08007.html#a111a313624cf9219526288500218d406">std::unordered_set::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="a00626_source.html#l00117">unordered_set.h:117</a></div></div>
<div class="ttc" id="a08003_html_a5d32e359f0a827adb05fd1c5e29362b3"><div class="ttname"><a href="a08003.html#a5d32e359f0a827adb05fd1c5e29362b3">std::unordered_multiset::hash_function</a></div><div class="ttdeci">hasher hash_function() const</div><div class="ttdoc">Returns the hash functor object with which the unordered_multiset was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01407">unordered_set.h:1407</a></div></div>
<div class="ttc" id="a08003_html_a0dfc41e4c0a1ec68c0e4ee0fba4783ee"><div class="ttname"><a href="a08003.html#a0dfc41e4c0a1ec68c0e4ee0fba4783ee">std::unordered_multiset::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="a00626_source.html#l00922">unordered_set.h:922</a></div></div>
<div class="ttc" id="a08003_html_a5728c1ad04495272ee1ee21fac011010"><div class="ttname"><a href="a08003.html#a5728c1ad04495272ee1ee21fac011010">std::unordered_multiset::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="a00626_source.html#l00904">unordered_set.h:904</a></div></div>
<div class="ttc" id="a08007_html_af18aca91916dd9537f3c33cd7746b0f4"><div class="ttname"><a href="a08007.html#af18aca91916dd9537f3c33cd7746b0f4">std::unordered_set::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="a00626_source.html#l00115">unordered_set.h:115</a></div></div>
<div class="ttc" id="a08007_html_aca41292a5bd6091c80f15eb124d35b05"><div class="ttname"><a href="a08007.html#aca41292a5bd6091c80f15eb124d35b05">std::unordered_set::unordered_set</a></div><div class="ttdeci">unordered_set(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="a00626_source.html#l00145">unordered_set.h:145</a></div></div>
<div class="ttc" id="a08003_html_aa8ed787cbd107c6e469d92d0ab4d2836"><div class="ttname"><a href="a08003.html#aa8ed787cbd107c6e469d92d0ab4d2836">std::unordered_multiset::insert</a></div><div class="ttdeci">iterator insert(const value_type &__x)</div><div class="ttdoc">Inserts an element into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01199">unordered_set.h:1199</a></div></div>
<div class="ttc" id="a08003_html_a12c1bfb9feb07236289dcf324b841d58"><div class="ttname"><a href="a08003.html#a12c1bfb9feb07236289dcf324b841d58">std::unordered_multiset::rehash</a></div><div class="ttdeci">void rehash(size_type __n)</div><div class="ttdoc">May rehash the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01563">unordered_set.h:1563</a></div></div>
<div class="ttc" id="a08007_html_a9e27a7160d0253be3bc02bf9c2fd4d62"><div class="ttname"><a href="a08007.html#a9e27a7160d0253be3bc02bf9c2fd4d62">std::unordered_set::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, value_type &&__x)</div><div class="ttdoc">Attempts to insert an element into the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00453">unordered_set.h:453</a></div></div>
<div class="ttc" id="a08003_html_a3b9af18ceb55369b7be262668119ff8c"><div class="ttname"><a href="a08003.html#a3b9af18ceb55369b7be262668119ff8c">std::unordered_multiset::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="a00626_source.html#l00905">unordered_set.h:905</a></div></div>
<div class="ttc" id="a08003_html_ac241bbf11679cbce9942578ecc48d776"><div class="ttname"><a href="a08003.html#ac241bbf11679cbce9942578ecc48d776">std::unordered_multiset::hasher</a></div><div class="ttdeci">_Hashtable::hasher hasher</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00906">unordered_set.h:906</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="a08003_html_abc4c192168d4217376439dce87cf12a2"><div class="ttname"><a href="a08003.html#abc4c192168d4217376439dce87cf12a2">std::unordered_multiset::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_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01473">unordered_set.h:1473</a></div></div>
<div class="ttc" id="a08007_html_a4e8d8d725e5ce055255edf7f58bbf726"><div class="ttname"><a href="a08007.html#a4e8d8d725e5ce055255edf7f58bbf726">std::unordered_set::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdoc">Returns true if the unordered_set is empty.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00298">unordered_set.h:298</a></div></div>
<div class="ttc" id="a08007_html_a41daefac0150734553a1b8ae994520e6"><div class="ttname"><a href="a08007.html#a41daefac0150734553a1b8ae994520e6">std::unordered_set::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="a00626_source.html#l00121">unordered_set.h:121</a></div></div>
<div class="ttc" id="a08007_html_af673d30d52e825e4f8da4c8770f0589b"><div class="ttname"><a href="a08007.html#af673d30d52e825e4f8da4c8770f0589b">std::unordered_set::find</a></div><div class="ttdeci">iterator find(const key_type &__x)</div><div class="ttdoc">Tries to locate an element in an unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00649">unordered_set.h:649</a></div></div>
<div class="ttc" id="a08007_html_a4bc73af25660f155f196c73298073f27"><div class="ttname"><a href="a08007.html#a4bc73af25660f155f196c73298073f27">std::unordered_set::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00346">unordered_set.h:346</a></div></div>
<div class="ttc" id="a08007_html_a688f24d7010519e2bfa001db6fe180e7"><div class="ttname"><a href="a08007.html#a688f24d7010519e2bfa001db6fe180e7">std::unordered_set::swap</a></div><div class="ttdeci">void swap(unordered_set &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))</div><div class="ttdoc">Swaps data with another unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00585">unordered_set.h:585</a></div></div>
<div class="ttc" id="a08007_html_a5d4ca5472cfe1e526ea39765ef1eba0c"><div class="ttname"><a href="a08007.html#a5d4ca5472cfe1e526ea39765ef1eba0c">std::unordered_set::unordered_set</a></div><div class="ttdeci">unordered_set(const allocator_type &__a)</div><div class="ttdoc">Creates an unordered_set with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00185">unordered_set.h:185</a></div></div>
<div class="ttc" id="a08007_html"><div class="ttname"><a href="a08007.html">std::unordered_set</a></div><div class="ttdoc">A standard container composed of unique keys (containing at most one of each key value) in which the ...</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00097">unordered_set.h:97</a></div></div>
<div class="ttc" id="a08007_html_a6e7300347a4173c3ad35217600d28f50"><div class="ttname"><a href="a08007.html#a6e7300347a4173c3ad35217600d28f50">std::unordered_set::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="a00626_source.html#l00762">unordered_set.h:762</a></div></div>
<div class="ttc" id="a08007_html_ae5af2f1d8d0746c3db3357561a73c6f7"><div class="ttname"><a href="a08007.html#ae5af2f1d8d0746c3db3357561a73c6f7">std::unordered_set::emplace</a></div><div class="ttdeci">std::pair< iterator, bool > emplace(_Args &&... __args)</div><div class="ttdoc">Attempts to build and insert an element into the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00376">unordered_set.h:376</a></div></div>
<div class="ttc" id="a08007_html_a721448c1c7b74465ccfcd51d86a9400c"><div class="ttname"><a href="a08007.html#a721448c1c7b74465ccfcd51d86a9400c">std::unordered_set::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="a00626_source.html#l00109">unordered_set.h:109</a></div></div>
<div class="ttc" id="a08007_html_a8d66aca929c29059391648628f2e250b"><div class="ttname"><a href="a08007.html#a8d66aca929c29059391648628f2e250b">std::unordered_set::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Attempts to insert an element into the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00402">unordered_set.h:402</a></div></div>
<div class="ttc" id="a08007_html_a02fe876578c29d71f3b0e63ae959fc9e"><div class="ttname"><a href="a08007.html#a02fe876578c29d71f3b0e63ae959fc9e">std::unordered_set::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="a00626_source.html#l00119">unordered_set.h:119</a></div></div>
<div class="ttc" id="a08003_html_a4a39eee2d0bdbeae8749868e6ca60bd7"><div class="ttname"><a href="a08003.html#a4a39eee2d0bdbeae8749868e6ca60bd7">std::unordered_multiset::unordered_multiset</a></div><div class="ttdeci">unordered_multiset()=default</div><div class="ttdoc">Default constructor.</div></div>
<div class="ttc" id="a08007_html_a77ac106cb24d3c809aa1dac59b508f46"><div class="ttname"><a href="a08007.html#a77ac106cb24d3c809aa1dac59b508f46">std::unordered_set::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="a00626_source.html#l00120">unordered_set.h:120</a></div></div>
<div class="ttc" id="a08003_html_acd836983ff93b793bf5404002ceac468"><div class="ttname"><a href="a08003.html#acd836983ff93b793bf5404002ceac468">std::unordered_multiset::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdoc">Returns the size of the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01100">unordered_set.h:1100</a></div></div>
<div class="ttc" id="a08003_html_a0e45e9fa99b643fb6a79c4154c00dcb4"><div class="ttname"><a href="a08003.html#a0e45e9fa99b643fb6a79c4154c00dcb4">std::unordered_multiset::insert</a></div><div class="ttdeci">void insert(initializer_list< value_type > __l)</div><div class="ttdoc">Inserts a list of elements into the unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01254">unordered_set.h:1254</a></div></div>
<div class="ttc" id="a08007_html_af200bc1dbcbedeabebd796791807ae31"><div class="ttname"><a href="a08007.html#af200bc1dbcbedeabebd796791807ae31">std::unordered_set::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00319">unordered_set.h:319</a></div></div>
<div class="ttc" id="a08003_html_a81000aff43253d8859a4c59d35a89029"><div class="ttname"><a href="a08003.html#a81000aff43253d8859a4c59d35a89029">std::unordered_multiset::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="a00626_source.html#l00915">unordered_set.h:915</a></div></div>
<div class="ttc" id="a08003_html_a87b28725f19b4afc7e58d052bf07be2f"><div class="ttname"><a href="a08003.html#a87b28725f19b4afc7e58d052bf07be2f">std::unordered_multiset::swap</a></div><div class="ttdeci">void swap(unordered_multiset &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))</div><div class="ttdoc">Swaps data with another unordered_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01365">unordered_set.h:1365</a></div></div>
<div class="ttc" id="a08007_html_a7e199daf0d314f4d3e72f1e694571a8b"><div class="ttname"><a href="a08007.html#a7e199daf0d314f4d3e72f1e694571a8b">std::unordered_set::hash_function</a></div><div class="ttdeci">hasher hash_function() const</div><div class="ttdoc">Returns the hash functor object with which the unordered_set was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00625">unordered_set.h:625</a></div></div>
<div class="ttc" id="a08003_html_a207a38bb9677cfdae227e04467e71601"><div class="ttname"><a href="a08003.html#a207a38bb9677cfdae227e04467e71601">std::unordered_multiset::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdoc">Returns true if the unordered_multiset is empty.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01095">unordered_set.h:1095</a></div></div>
<div class="ttc" id="a08007_html_a1f05b3fd1a72e6b246b0e5ce8d0937cf"><div class="ttname"><a href="a08007.html#a1f05b3fd1a72e6b246b0e5ce8d0937cf">std::unordered_set::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_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00653">unordered_set.h:653</a></div></div>
<div class="ttc" id="a08007_html_a3dcd37e44a7c63ca0b0b1a61d3d074d7"><div class="ttname"><a href="a08007.html#a3dcd37e44a7c63ca0b0b1a61d3d074d7">std::unordered_set::hasher</a></div><div class="ttdeci">_Hashtable::hasher hasher</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00108">unordered_set.h:108</a></div></div>
<div class="ttc" id="a08007_html_aeb44171c81ee124bbb21a113ff318530"><div class="ttname"><a href="a08007.html#aeb44171c81ee124bbb21a113ff318530">std::unordered_set::reserve</a></div><div class="ttdeci">void reserve(size_type __n)</div><div class="ttdoc">Prepare the unordered_set for a specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00798">unordered_set.h:798</a></div></div>
<div class="ttc" id="a08003_html"><div class="ttname"><a href="a08003.html">std::unordered_multiset</a></div><div class="ttdoc">A standard container composed of equivalent keys (possibly containing multiple of each key value) in ...</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00070">unordered_set.h:70</a></div></div>
<div class="ttc" id="a08003_html_a914954becc1ec4a1bec63eafe11065e1"><div class="ttname"><a href="a08003.html#a914954becc1ec4a1bec63eafe11065e1">std::unordered_multiset::insert</a></div><div class="ttdeci">void insert(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A template function that inserts a range of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01243">unordered_set.h:1243</a></div></div>
<div class="ttc" id="a08007_html_a30a15b1c31e75c9cfd56a4b3f24fe1ce"><div class="ttname"><a href="a08007.html#a30a15b1c31e75c9cfd56a4b3f24fe1ce">std::unordered_set::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="a00626_source.html#l00734">unordered_set.h:734</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="a08007_html_a6b211cbe01ddf94104caf45b393ae933"><div class="ttname"><a href="a08007.html#a6b211cbe01ddf94104caf45b393ae933">std::unordered_set::insert</a></div><div class="ttdeci">iterator insert(const_iterator __hint, const value_type &__x)</div><div class="ttdoc">Attempts to insert an element into the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00449">unordered_set.h:449</a></div></div>
<div class="ttc" id="a08003_html_a34d367c806730baf9a10261d5c2ce3b7"><div class="ttname"><a href="a08003.html#a34d367c806730baf9a10261d5c2ce3b7">std::unordered_multiset::unordered_multiset</a></div><div class="ttdeci">unordered_multiset(const allocator_type &__a)</div><div class="ttdoc">Creates an unordered_multiset with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01009">unordered_set.h:1009</a></div></div>
<div class="ttc" id="a08007_html_abc0147e25845cc780f71f1b14cd41cce"><div class="ttname"><a href="a08007.html#abc0147e25845cc780f71f1b14cd41cce">std::unordered_set::insert</a></div><div class="ttdeci">std::pair< iterator, bool > insert(value_type &&__x)</div><div class="ttdoc">Attempts to insert an element into the unordered_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00424">unordered_set.h:424</a></div></div>
<div class="ttc" id="a08007_html_adaa06dc3ca7393564cf03ce38cbe5d74"><div class="ttname"><a href="a08007.html#adaa06dc3ca7393564cf03ce38cbe5d74">std::unordered_set::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_set.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l00479">unordered_set.h:479</a></div></div>
<div class="ttc" id="a08003_html_a2a6edd3b4b891c1c260d3001a6b1ffcb"><div class="ttname"><a href="a08003.html#a2a6edd3b4b891c1c260d3001a6b1ffcb">std::unordered_multiset::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01151">unordered_set.h:1151</a></div></div>
<div class="ttc" id="a08003_html_a38af28f07b44fa8ef5ee3ee4d5886762"><div class="ttname"><a href="a08003.html#a38af28f07b44fa8ef5ee3ee4d5886762">std::unordered_multiset::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="a00626_source.html#l01526">unordered_set.h:1526</a></div></div>
<div class="ttc" id="a08003_html_af99eeb8286c1266dba2e9155f8efe0b6"><div class="ttname"><a href="a08003.html#af99eeb8286c1266dba2e9155f8efe0b6">std::unordered_multiset::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_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01435">unordered_set.h:1435</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 class="ttc" id="a08003_html_a8d9f85005b81ca530aeeb413a38824ab"><div class="ttname"><a href="a08003.html#a8d9f85005b81ca530aeeb413a38824ab">std::unordered_multiset::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_multiset.</div><div class="ttdef"><b>Definition:</b> <a href="a00626_source.html#l01341">unordered_set.h:1341</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="a00626.html">unordered_set.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
>
574
