<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: stl_multiset.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">
$(document).ready(initResizable);
</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.13 -->
</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">
$(document).ready(function(){initNavTree('a00521_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_multiset.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00521.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">// Multiset 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) 2001-2015 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> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></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"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** @file bits/stl_multiset.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{set}</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef _STL_MULTISET_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_MULTISET_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00302.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a00023.html">initializer_list</a>></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">namespace </span><a class="code" href="a01487.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"></span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> /**</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * @brief A standard container made up of elements, which can be retrieved</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * in logarithmic time.</span></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"> * @ingroup associative_containers</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> *</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> *</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * @tparam _Key Type of key objects.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @tparam _Compare Comparison function object type, defaults to less<_Key>.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Key>.</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"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and an</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * <a href="tables.html#69">associative container</a> (using equivalent</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * keys). For a @c multiset<Key> the key_type and value_type are Key.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> *</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * Multisets support bidirectional iterators.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> *</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * The private tree data is declared exactly the same way for set and</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * multiset; the distinction is made entirely in how the tree functions are</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * called (*_unique versus *_equal, same as the standard).</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="keyword">template</span> <<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare = std::less<_Key>,</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">typename</span> _Alloc = std::allocator<_Key> ></div><div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="a06681.html"> 92</a></span>  <span class="keyword">class </span><a class="code" href="a06681.html">multiset</a></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  __glibcxx_class_requires(_Key, _SGIAssignableConcept)</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  __glibcxx_class_requires4(_Compare, <span class="keywordtype">bool</span>, _Key, _Key,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  _BinaryFunctionConcept)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// typedefs:</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> _Key key_type;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">typedef</span> _Key value_type;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">typedef</span> _Compare key_compare;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">typedef</span> _Compare value_compare;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">private</span>:<span class="comment"></span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> /// This turns a red-black tree into a [multi]set.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Alloc>::template</a></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  rebind<_Key>::other _Key_alloc_type;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typedef</span> _Rb_tree<key_type, value_type, _Identity<value_type>,</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  key_compare, _Key_alloc_type> _Rep_type;<span class="comment"></span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> /// The actual tree structure.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span> _Rep_type _M_t;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">typedef</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Key_alloc_type></a> <a class="code" href="a08925.html">_Alloc_traits</a>;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::pointer pointer;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_pointer const_pointer;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::reference reference;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_reference const_reference;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// DR 103. set::iterator is required to be modifiable,</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// but this allows modification of keys.</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator iterator;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator const_iterator;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a06569.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a06569.html">reverse_iterator</a>;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a06569.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a06569.html">const_reverse_iterator</a>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::size_type size_type;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::difference_type difference_type;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// allocation/deallocation</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"> */</span></div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="a06681.html#a8e049d59cecc0098bf1622582fedc42a"> 140</a></span>  <a class="code" href="a06681.html#a8e049d59cecc0098bf1622582fedc42a">multiset</a>()</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  noexcept(is_nothrow_default_constructible<allocator_type>::value</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  && is_nothrow_default_constructible<key_compare>::value)</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  : _M_t() { }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"></span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> /**</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"> * @brief Creates a %multiset with no elements.</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> * @param __comp Comparator to use.</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> * @param __a An allocator object.</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="keyword">explicit</span></div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="a06681.html#a38e27d171934c562e8f5fc48fba81564"> 153</a></span>  <a class="code" href="a06681.html#a38e27d171934c562e8f5fc48fba81564">multiset</a>(<span class="keyword">const</span> _Compare& __comp,</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  : _M_t(__comp, _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"></span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> /**</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * @brief Builds a %multiset from a range.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> *</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * Create a %multiset consisting of copies of the elements from</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * [first,last). This is linear in N if the range is already sorted,</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> * and NlogN otherwise (where N is distance(__first,__last)).</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> */</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="a06681.html#ac561d1612797aaf6022b371cce116035"> 167</a></span>  <a class="code" href="a06681.html#ac561d1612797aaf6022b371cce116035">multiset</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  : _M_t()</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  { _M_t._M_insert_equal(__first, __last); }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"></span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> /**</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> * @brief Builds a %multiset from a range.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"> * @param __comp A comparison functor.</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> *</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> * Create a %multiset consisting of copies of the elements from</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> * [__first,__last). This is linear in N if the range is already sorted,</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * and NlogN otherwise (where N is distance(__first,__last)).</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> */</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="a06681.html#ae6acd6b5095c21d2a04c7d9afa6b02ab"> 183</a></span>  <a class="code" href="a06681.html#ae6acd6b5095c21d2a04c7d9afa6b02ab">multiset</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> _Compare& __comp,</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  : _M_t(__comp, _Key_alloc_type(__a))</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  { _M_t._M_insert_equal(__first, __last); }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"></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 %Multiset copy constructor.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * @param __x A %multiset of identical element and allocator types.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> *</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * The newly-created %multiset uses a copy of the allocation object used</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * by @a __x.</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> */</span></div><div class="line"><a name="l00196"></a><span class="lineno"><a class="line" href="a06681.html#a18b8e4cb637b0368ca3e4601adb9c122"> 196</a></span>  <a class="code" href="a06681.html#a18b8e4cb637b0368ca3e4601adb9c122">multiset</a>(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset</a>& __x)</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  : _M_t(__x._M_t) { }</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> /**</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> * @brief %Multiset move constructor.</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * @param __x A %multiset of identical element and allocator types.</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> <span class="comment"> * The newly-created %multiset contains the exact contents of @a __x.</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> * The contents of @a __x are a valid, but unspecified %multiset.</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> */</span></div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="a06681.html#a86f3d174f7fcdbe85fabdc7db19eb37c"> 207</a></span>  <a class="code" href="a06681.html#a86f3d174f7fcdbe85fabdc7db19eb37c">multiset</a>(<a class="code" href="a06681.html">multiset</a>&& __x)</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  noexcept(is_nothrow_copy_constructible<_Compare>::value)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  : _M_t(<a class="code" href="a01487.html">std</a>::move(__x._M_t)) { }</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"></span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> /**</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> * @brief Builds a %multiset from an initializer_list.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> * @param __comp A comparison 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 a %multiset consisting of copies of the elements from</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> * the list. This is linear in N if the list is already sorted,</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> * and NlogN otherwise (where N is @a __l.size()).</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> */</span></div><div class="line"><a name="l00221"></a><span class="lineno"><a class="line" href="a06681.html#adad316ede7ac22b3eff955eb6d9ab327"> 221</a></span>  <a class="code" href="a06681.html#adad316ede7ac22b3eff955eb6d9ab327">multiset</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">const</span> _Compare& __comp = _Compare(),</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  : _M_t(__comp, _Key_alloc_type(__a))</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  { _M_t._M_insert_equal(__l.begin(), __l.end()); }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"></span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> /// Allocator-extended default constructor.</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"></span> <span class="keyword">explicit</span></div><div class="line"><a name="l00229"></a><span class="lineno"><a class="line" href="a06681.html#ae8a1847b51c056d1abbc01fb76742632"> 229</a></span>  <a class="code" href="a06681.html#ae8a1847b51c056d1abbc01fb76742632">multiset</a>(<span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  : _M_t(_Compare(), _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"></span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> /// Allocator-extended copy constructor.</span></div><div class="line"><a name="l00233"></a><span class="lineno"><a class="line" href="a06681.html#a3ada945ca3237945e666bdc541accba1"> 233</a></span> <span class="comment"></span> <a class="code" href="a06681.html#a3ada945ca3237945e666bdc541accba1">multiset</a>(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset</a>& __m, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  : _M_t(__m._M_t, _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"></span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> /// Allocator-extended move constructor.</span></div><div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="a06681.html#a0bf2a4cf104ce19a863ac0438e1d3070"> 237</a></span> <span class="comment"></span> <a class="code" href="a06681.html#a0bf2a4cf104ce19a863ac0438e1d3070">multiset</a>(<a class="code" href="a06681.html">multiset</a>&& __m, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  noexcept(is_nothrow_copy_constructible<_Compare>::value</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  && _Alloc_traits::_S_always_equal())</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  : _M_t(<a class="code" href="a01487.html">std</a>::move(__m._M_t), _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"></span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> /// Allocator-extended initialier-list constructor.</span></div><div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="a06681.html#a4bd596fbcfa91841dc0bfe442177c5ac"> 243</a></span> <span class="comment"></span> <a class="code" href="a06681.html#a4bd596fbcfa91841dc0bfe442177c5ac">multiset</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  : _M_t(_Compare(), _Key_alloc_type(__a))</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  { _M_t._M_insert_equal(__l.begin(), __l.end()); }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"></span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> /// Allocator-extended range constructor.</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00249"></a><span class="lineno"><a class="line" href="a06681.html#a15b3f5d46a91d60ee98c0ac7f278476a"> 249</a></span>  <a class="code" href="a06681.html#a15b3f5d46a91d60ee98c0ac7f278476a">multiset</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  : _M_t(_Compare(), _Key_alloc_type(__a))</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  { _M_t._M_insert_equal(__first, __last); }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"></span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> /**</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> * @brief %Multiset assignment operator.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"> * @param __x A %multiset of identical element and allocator types.</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> *</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> * All the elements of @a __x are copied, but unlike the copy</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * constructor, the allocator object is not copied.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> */</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="a06681.html">multiset</a>&</div><div class="line"><a name="l00263"></a><span class="lineno"><a class="line" href="a06681.html#a816dd01e099e23f3b4dd32eb5a6ec308"> 263</a></span>  <a class="code" href="a06681.html#a816dd01e099e23f3b4dd32eb5a6ec308">operator=</a>(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset</a>& __x)</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  {</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  _M_t = __x._M_t;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"> /// Move assignment operator.</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"></span> <a class="code" href="a06681.html">multiset</a>&</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="code" href="a06681.html#a816dd01e099e23f3b4dd32eb5a6ec308">operator=</a>(<a class="code" href="a06681.html">multiset</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"></span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> /**</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> * @brief %Multiset list assignment operator.</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> * @param __l An initializer_list.</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"> * This function fills a %multiset with copies of the elements in the</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> * initializer list @a __l.</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> *</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> * Note that the assignment completely changes the %multiset and</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"> * that the resulting %multiset's size is the same as the number</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"> * of elements assigned. Old data may be lost.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"> */</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="a06681.html">multiset</a>&</div><div class="line"><a name="l00286"></a><span class="lineno"><a class="line" href="a06681.html#a92ec8ff818ef21f8d170842d4732299c"> 286</a></span>  <a class="code" href="a06681.html#a92ec8ff818ef21f8d170842d4732299c">operator=</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l)</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>  _M_t._M_assign_equal(__l.begin(), __l.end());</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// accessors:</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"></span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> /// Returns the comparison object.</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"></span> key_compare</div><div class="line"><a name="l00297"></a><span class="lineno"><a class="line" href="a06681.html#ac4b6516f21a29e3621488503744b2d11"> 297</a></span>  <a class="code" href="a06681.html#ac4b6516f21a29e3621488503744b2d11">key_comp</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }<span class="comment"></span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"> /// Returns the comparison object.</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"></span> value_compare</div><div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="a06681.html#a4bb5cd2cb86e5c9867122556be6f850a"> 301</a></span>  <a class="code" href="a06681.html#a4bb5cd2cb86e5c9867122556be6f850a">value_comp</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }<span class="comment"></span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> /// Returns the memory allocation object.</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"></span> allocator_type</div><div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="a06681.html#ab40d34e43d53af099a124798fdc3d2f4"> 305</a></span>  <a class="code" href="a06681.html#ab40d34e43d53af099a124798fdc3d2f4">get_allocator</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  { <span class="keywordflow">return</span> allocator_type(_M_t.get_allocator()); }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"></span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> /**</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> * element in the %multiset. Iteration is done in ascending order</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> * according to the keys.</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>  iterator</div><div class="line"><a name="l00314"></a><span class="lineno"><a class="line" href="a06681.html#ad12c2a19de2da96ee5d3f5011073e126"> 314</a></span>  <a class="code" href="a06681.html#ad12c2a19de2da96ee5d3f5011073e126">begin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"></span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> /**</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"> * element in the %multiset. Iteration is done in ascending order</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> */</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  iterator</div><div class="line"><a name="l00323"></a><span class="lineno"><a class="line" href="a06681.html#aff68f6029ff179bafdadc89212fe1ee0"> 323</a></span>  <a class="code" href="a06681.html#aff68f6029ff179bafdadc89212fe1ee0">end</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  { <span class="keywordflow">return</span> _M_t.end(); }</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></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"> * last element in the %multiset. Iteration is done in descending order</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"> */</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  reverse_iterator</div><div class="line"><a name="l00332"></a><span class="lineno"><a class="line" href="a06681.html#a6b0cbc71ad54db5d009609ec077bc13f"> 332</a></span>  <a class="code" href="a06681.html#a6b0cbc71ad54db5d009609ec077bc13f">rbegin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"></span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment"> /**</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"> * last element in the %multiset. Iteration is done in descending order</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> * according to the keys.</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>  reverse_iterator</div><div class="line"><a name="l00341"></a><span class="lineno"><a class="line" href="a06681.html#a6ffe97a245a1f046e9b536c6d5511ac9"> 341</a></span>  <a class="code" href="a06681.html#a6ffe97a245a1f046e9b536c6d5511ac9">rend</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> /**</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment"> * element in the %multiset. Iteration is done in ascending order</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"> * according to the keys.</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>  iterator</div><div class="line"><a name="l00351"></a><span class="lineno"><a class="line" href="a06681.html#a47de6fecee69e70e8e20f69e31774708"> 351</a></span>  <a class="code" href="a06681.html#a47de6fecee69e70e8e20f69e31774708">cbegin</a>() const noexcept</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"></span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"> /**</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"> * element in the %multiset. Iteration is done in ascending order</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment"> * according to the keys.</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>  iterator</div><div class="line"><a name="l00360"></a><span class="lineno"><a class="line" href="a06681.html#aa61090fd58e3795f2f87e341b27c1469"> 360</a></span>  <a class="code" href="a06681.html#aa61090fd58e3795f2f87e341b27c1469">cend</a>() const noexcept</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  { <span class="keywordflow">return</span> _M_t.end(); }</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"></span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> /**</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"> * last element in the %multiset. Iteration is done in descending order</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> */</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  reverse_iterator</div><div class="line"><a name="l00369"></a><span class="lineno"><a class="line" href="a06681.html#a367f51af8d4d16af56b3c669808a80e9"> 369</a></span>  <a class="code" href="a06681.html#a367f51af8d4d16af56b3c669808a80e9">crbegin</a>() const noexcept</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</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"> /**</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment"> * last element in the %multiset. Iteration is done in descending order</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> */</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  reverse_iterator</div><div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="a06681.html#a23f0dc41c6813e1628a1acf9c1966c8b"> 378</a></span>  <a class="code" href="a06681.html#a23f0dc41c6813e1628a1acf9c1966c8b">crend</a>() const noexcept</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"></span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> /// Returns true if the %set is empty.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"></span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00384"></a><span class="lineno"><a class="line" href="a06681.html#a5a7249221b9d058e801cb0d29dc8542a"> 384</a></span>  <a class="code" href="a06681.html#a5a7249221b9d058e801cb0d29dc8542a">empty</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  { <span class="keywordflow">return</span> _M_t.empty(); }</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"></span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> /// Returns the size of the %set.</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"></span> size_type</div><div class="line"><a name="l00389"></a><span class="lineno"><a class="line" href="a06681.html#aa0d42b46c75769cbce93494ac80c8c34"> 389</a></span>  <a class="code" href="a06681.html#aa0d42b46c75769cbce93494ac80c8c34">size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  { <span class="keywordflow">return</span> _M_t.size(); }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"></span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> /// Returns the maximum size of the %set.</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"></span> size_type</div><div class="line"><a name="l00394"></a><span class="lineno"><a class="line" href="a06681.html#aec68936b69a9391df7ea268a7c44fb13"> 394</a></span>  <a class="code" href="a06681.html#aec68936b69a9391df7ea268a7c44fb13">max_size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  { <span class="keywordflow">return</span> _M_t.max_size(); }</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"></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"> * @brief Swaps data with another %multiset.</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * @param __x A %multiset of the same element and allocator types.</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> *</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"> * This exchanges the elements between two multisets in constant time.</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> * (It is only swapping a pointer, an integer, and an instance of the @c</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> * Compare type (which itself is often stateless and empty), so it should</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> * be quite fast.)</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> * std::swap(s1,s2) will feed to this function.</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> */</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00409"></a><span class="lineno"><a class="line" href="a06681.html#a2e33077a80a2e3b4ff2a904c883c372c"> 409</a></span>  <a class="code" href="a06681.html#a2e33077a80a2e3b4ff2a904c883c372c">swap</a>(<a class="code" href="a06681.html">multiset</a>& __x)</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  noexcept(_Alloc_traits::_S_nothrow_swap())</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  { _M_t.swap(__x._M_t); }</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="comment">// insert/erase</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> /**</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> * @brief Builds and inserts an element into the %multiset.</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> * @param __args Arguments used to generate the element instance to be</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"> *</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"> * This function inserts an element into the %multiset. Contrary</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"> * to a std::set the %multiset does not rely on unique keys and thus</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> * multiple copies of the same element can be inserted.</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"> * Insertion requires logarithmic time.</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="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  iterator</div><div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="a06681.html#a12431fd574451b7c1e677d09f6d2ef46"> 431</a></span>  <a class="code" href="a06681.html#a12431fd574451b7c1e677d09f6d2ef46">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  { <span class="keywordflow">return</span> _M_t._M_emplace_equal(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"></span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> /**</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> * @brief Builds and inserts an element into the %multiset.</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> * @param __args Arguments used to generate the element instance to be</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> *</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> * This function inserts an element into the %multiset. Contrary</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"> * to a std::set the %multiset does not rely on unique keys and thus</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> * multiple copies of the same element can be inserted.</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"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment"> *</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment"> * See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"> *</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> */</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  iterator</div><div class="line"><a name="l00457"></a><span class="lineno"><a class="line" href="a06681.html#a18406be2849c2b0f4786452e6bd860f5"> 457</a></span>  <a class="code" href="a06681.html#a18406be2849c2b0f4786452e6bd860f5">emplace_hint</a>(const_iterator __pos, _Args&&... __args)</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  {</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span> _M_t._M_emplace_hint_equal(__pos,</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="preprocessor">#endif</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"> /**</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> * @brief Inserts an element into the %multiset.</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment"> *</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="comment"> * This function inserts an element into the %multiset. Contrary</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"> * to a std::set the %multiset does not rely on unique keys and thus</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> * multiple copies of the same element can be inserted.</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> *</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> * Insertion requires logarithmic time.</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> */</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  iterator</div><div class="line"><a name="l00476"></a><span class="lineno"><a class="line" href="a06681.html#a6a95194c5c1aa0caf2d2f852def99bfc"> 476</a></span>  <a class="code" href="a06681.html#a6a95194c5c1aa0caf2d2f852def99bfc">insert</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  { <span class="keywordflow">return</span> _M_t._M_insert_equal(__x); }</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> </div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  iterator</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <a class="code" href="a06681.html#a6a95194c5c1aa0caf2d2f852def99bfc">insert</a>(value_type&& __x)</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  { <span class="keywordflow">return</span> _M_t._M_insert_equal(std::move(__x)); }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment"></span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="comment"> /**</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment"> * @brief Inserts an element into the %multiset.</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment"> * @param __position An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment"> * @return An iterator that points to the inserted element.</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"> *</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"> * This function inserts an element into the %multiset. Contrary</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"> * to a std::set the %multiset does not rely on unique keys and thus</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"> * multiple copies of the same element can be inserted.</span></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"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment"> *</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> * See https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"> *</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="comment"> */</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  iterator</div><div class="line"><a name="l00506"></a><span class="lineno"><a class="line" href="a06681.html#ad039dc1cb5c117a62ab8ff56fef14a22"> 506</a></span>  <a class="code" href="a06681.html#ad039dc1cb5c117a62ab8ff56fef14a22">insert</a>(const_iterator __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  { <span class="keywordflow">return</span> _M_t._M_insert_equal_(__position, __x); }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  iterator</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <a class="code" href="a06681.html#a6a95194c5c1aa0caf2d2f852def99bfc">insert</a>(const_iterator __position, value_type&& __x)</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  { <span class="keywordflow">return</span> _M_t._M_insert_equal_(__position, std::move(__x)); }</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="preprocessor">#endif</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"> /**</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"> * @brief A template function that tries to insert a range of elements.</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</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> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment"> */</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00525"></a><span class="lineno"><a class="line" href="a06681.html#a7229e1145054a27d23f88a185085f7ec"> 525</a></span>  <a class="code" href="a06681.html#a7229e1145054a27d23f88a185085f7ec">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  { _M_t._M_insert_equal(__first, __last); }</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> </div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="preprocessor">#if __cplusplus >= 201103L</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"> * @brief Attempts to insert a list of elements into the %multiset.</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> * to be inserted.</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment"> *</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> * Complexity similar to that of the range constructor.</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="keywordtype">void</span></div><div class="line"><a name="l00537"></a><span class="lineno"><a class="line" href="a06681.html#a70689e1641f42b649d8237b0c6ba6592"> 537</a></span>  <a class="code" href="a06681.html#a70689e1641f42b649d8237b0c6ba6592">insert</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  { this-><a class="code" href="a06681.html#a6a95194c5c1aa0caf2d2f852def99bfc">insert</a>(__l.begin(), __l.end()); }</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment"> /**</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment"> * @brief Erases an element from a %multiset.</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment"> * @a position prior to the element being erased. If no such </span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> *</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> * from a %multiset. Note that this function only erases the element,</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment"> * and that if the element is itself a pointer, the pointed-to memory is</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"> * not touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment"> */</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  _GLIBCXX_ABI_TAG_CXX11</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  iterator</div><div class="line"><a name="l00559"></a><span class="lineno"><a class="line" href="a06681.html#aa51df64436f0118f064c49d49c8138f4"> 559</a></span>  <a class="code" href="a06681.html#aa51df64436f0118f064c49d49c8138f4">erase</a>(const_iterator __position)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  { <span class="keywordflow">return</span> _M_t.erase(__position); }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> /**</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> * @brief Erases an element from a %multiset.</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</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"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> * from a %multiset. Note that this function only erases the element,</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> * and that if the element is itself a pointer, the pointed-to memory is</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * not touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> */</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <a class="code" href="a06681.html#aa51df64436f0118f064c49d49c8138f4">erase</a>(iterator __position)</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  { _M_t.erase(__position); }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment"></span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> /**</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment"> * @param __x Key of element to be erased.</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment"> * @return The number of elements erased.</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment"> *</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="comment"> * This function erases all elements located by the given key from a</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment"> * %multiset.</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="comment"> */</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  size_type</div><div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="a06681.html#ab9fe5fb5a5638e620268e30e640b104c"> 589</a></span>  <a class="code" href="a06681.html#ab9fe5fb5a5638e620268e30e640b104c">erase</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  { <span class="keywordflow">return</span> _M_t.erase(__x); }</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"> /**</span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"> * @brief Erases a [first,last) range of elements from a %multiset.</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> * @return The iterator @a last.</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> *</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * This function erases a sequence of elements from a %multiset.</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * Note that this function only erases the elements, and that if</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> * the elements themselves are pointers, the pointed-to memory is not</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> */</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  _GLIBCXX_ABI_TAG_CXX11</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  iterator</div><div class="line"><a name="l00611"></a><span class="lineno"><a class="line" href="a06681.html#a2fcf6dd3ed37a1bac19ba5e55239d77e"> 611</a></span>  <a class="code" href="a06681.html#a2fcf6dd3ed37a1bac19ba5e55239d77e">erase</a>(const_iterator __first, const_iterator __last)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  { <span class="keywordflow">return</span> _M_t.erase(__first, __last); }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> /**</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment"> * @brief Erases a [first,last) range of elements from a %multiset.</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment"> * @param first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment"> * @param last Iterator pointing to the end of the range to be erased.</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment"> *</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> <span class="comment"> * This function erases a sequence of elements from a %multiset.</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <span class="comment"> * Note that this function only erases the elements, and that if</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment"> * the elements themselves are pointers, the pointed-to memory is not</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment"> */</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="a06681.html#aa51df64436f0118f064c49d49c8138f4">erase</a>(iterator __first, iterator __last)</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  { _M_t.erase(__first, __last); }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment"></span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment"> /**</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment"> * Erases all elements in a %multiset. Note that this function only</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment"> * erases the elements, and that if the elements themselves are pointers,</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment"> * the pointed-to memory is not touched in any way. Managing the pointer</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"> * is the user's responsibility.</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="keywordtype">void</span></div><div class="line"><a name="l00638"></a><span class="lineno"><a class="line" href="a06681.html#ace71f2e5ccf1cf04f7684fe40490f9d6"> 638</a></span>  <a class="code" href="a06681.html#ace71f2e5ccf1cf04f7684fe40490f9d6">clear</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  { _M_t.clear(); }</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> </div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">// multiset operations:</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"> //@{</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> * @brief Finds the number of elements with given key.</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> * @param __x Key of elements to be located.</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"> * @return Number of elements with specified key.</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment"> */</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  size_type</div><div class="line"><a name="l00650"></a><span class="lineno"><a class="line" href="a06681.html#a9f81b59c35ee0ef55f8a49aa63c7ed66"> 650</a></span>  <a class="code" href="a06681.html#a9f81b59c35ee0ef55f8a49aa63c7ed66">count</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.count(__x); }</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> </div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00656"></a><span class="lineno"><a class="line" href="a06681.html#a4003ef6187ecbbdce62b861222c09802"> 656</a></span>  <a class="code" href="a06681.html#a4003ef6187ecbbdce62b861222c09802">count</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span> -> decltype(_M_t._M_count_tr(__x))</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  { <span class="keywordflow">return</span> _M_t._M_count_tr(__x); }</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="comment"></span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// 214. set::find() missing const overload</span><span class="comment"></span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> * @brief Tries to locate an element in a %set.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="comment"> * @param __x Element to be located.</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="comment"> * found.</span></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"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment"> */</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  iterator</div><div class="line"><a name="l00676"></a><span class="lineno"><a class="line" href="a06681.html#a88ae213f5272a4de1e360e1e69335d8b"> 676</a></span>  <a class="code" href="a06681.html#a88ae213f5272a4de1e360e1e69335d8b">find</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  { <span class="keywordflow">return</span> _M_t.find(__x); }</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> </div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  const_iterator</div><div class="line"><a name="l00680"></a><span class="lineno"><a class="line" href="a06681.html#ae1bc7a281212bde2b7b49e3a7589c0cc"> 680</a></span>  <a class="code" href="a06681.html#ae1bc7a281212bde2b7b49e3a7589c0cc">find</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__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> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00686"></a><span class="lineno"><a class="line" href="a06681.html#ad558199cc94a4197f0623861bc955f1a"> 686</a></span>  <a class="code" href="a06681.html#ad558199cc94a4197f0623861bc955f1a">find</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  -> decltype(iterator{_M_t._M_find_tr(__x)})</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  { <span class="keywordflow">return</span> iterator{_M_t._M_find_tr(__x)}; }</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> </div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00692"></a><span class="lineno"><a class="line" href="a06681.html#ae3d52c5bfb2c4ae04923e6bd96a01ae7"> 692</a></span>  <a class="code" href="a06681.html#ae3d52c5bfb2c4ae04923e6bd96a01ae7">find</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  -> decltype(const_iterator{_M_t._M_find_tr(__x)})</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  { <span class="keywordflow">return</span> const_iterator{_M_t._M_find_tr(__x)}; }</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"> * @return Iterator pointing to first element equal to or greater</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> * than key, or end().</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> <span class="comment"> * This function returns the first element of a subsequence of elements</span></div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="comment"> * pointing to the first element that has a greater value than given key</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="comment"> * or end() if no such element exists.</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>  iterator</div><div class="line"><a name="l00711"></a><span class="lineno"><a class="line" href="a06681.html#ac76a54ed49d2633b97a71e940461def3"> 711</a></span>  <a class="code" href="a06681.html#ac76a54ed49d2633b97a71e940461def3">lower_bound</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  { <span class="keywordflow">return</span> _M_t.lower_bound(__x); }</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> </div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  const_iterator</div><div class="line"><a name="l00715"></a><span class="lineno"><a class="line" href="a06681.html#aa1b1b9236aecf15614ac2f4659edd279"> 715</a></span>  <a class="code" href="a06681.html#aa1b1b9236aecf15614ac2f4659edd279">lower_bound</a>(<span class="keyword">const</span> key_type& __x)<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_t.lower_bound(__x); }</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> </div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00721"></a><span class="lineno"><a class="line" href="a06681.html#ae1fcdebc244b6b7c006abcc3cb3c63d7"> 721</a></span>  <a class="code" href="a06681.html#ae1fcdebc244b6b7c006abcc3cb3c63d7">lower_bound</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  { <span class="keywordflow">return</span> iterator(_M_t._M_lower_bound_tr(__x)); }</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> </div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00727"></a><span class="lineno"><a class="line" href="a06681.html#a9c254b02eb2bdec6f38b12170102b9fd"> 727</a></span>  <a class="code" href="a06681.html#a9c254b02eb2bdec6f38b12170102b9fd">lower_bound</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  { <span class="keywordflow">return</span> iterator(_M_t._M_lower_bound_tr(__x)); }</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"> * @return Iterator pointing to the first element</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> * greater than key, or end().</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"> */</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  iterator</div><div class="line"><a name="l00741"></a><span class="lineno"><a class="line" href="a06681.html#ab58f3d8e73705b00b8e0323d43c32d34"> 741</a></span>  <a class="code" href="a06681.html#ab58f3d8e73705b00b8e0323d43c32d34">upper_bound</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  { <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> </div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  const_iterator</div><div class="line"><a name="l00745"></a><span class="lineno"><a class="line" href="a06681.html#a6350cda1b237d8a34a63a1309c12ced3"> 745</a></span>  <a class="code" href="a06681.html#a6350cda1b237d8a34a63a1309c12ced3">upper_bound</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00751"></a><span class="lineno"><a class="line" href="a06681.html#a860e4d18239957e13d509286aa2e466f"> 751</a></span>  <a class="code" href="a06681.html#a860e4d18239957e13d509286aa2e466f">upper_bound</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  { <span class="keywordflow">return</span> iterator(_M_t._M_upper_bound_tr(__x)); }</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> </div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00757"></a><span class="lineno"><a class="line" href="a06681.html#a5477133d89691e608c82be49314cf0b2"> 757</a></span>  <a class="code" href="a06681.html#a5477133d89691e608c82be49314cf0b2">upper_bound</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  { <span class="keywordflow">return</span> iterator(_M_t._M_upper_bound_tr(__x)); }</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment"> *</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"> * This function is equivalent to</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> * @code</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> * std::make_pair(c.lower_bound(val),</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * c.upper_bound(val))</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> * @endcode</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> <span class="comment"> * (but is faster than making the calls separately).</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="comment"> *</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="comment"> * This function probably only makes sense for multisets.</span></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>  <a class="code" href="a06689.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l00780"></a><span class="lineno"><a class="line" href="a06681.html#af02e09bba88000ac8487f66c9d5f0bdb"> 780</a></span>  <a class="code" href="a06681.html#af02e09bba88000ac8487f66c9d5f0bdb">equal_range</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  { <span class="keywordflow">return</span> _M_t.equal_range(__x); }</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> </div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <a class="code" href="a06689.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l00784"></a><span class="lineno"><a class="line" href="a06681.html#aabff907f910392ba764de55f420727cf"> 784</a></span>  <a class="code" href="a06681.html#aabff907f910392ba764de55f420727cf">equal_range</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.equal_range(__x); }</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> </div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00790"></a><span class="lineno"><a class="line" href="a06681.html#add69a9f99e1c6f68636c6c0c9cf57ef6"> 790</a></span>  <a class="code" href="a06681.html#add69a9f99e1c6f68636c6c0c9cf57ef6">equal_range</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  -> decltype(<a class="code" href="a06689.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)))</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  { <span class="keywordflow">return</span> <a class="code" href="a06689.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)); }</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> </div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00796"></a><span class="lineno"><a class="line" href="a06681.html#ab6135bf8d9a5d292c335e2ca40cdf083"> 796</a></span>  <a class="code" href="a06681.html#ab6135bf8d9a5d292c335e2ca40cdf083">equal_range</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  -> decltype(<a class="code" href="a06689.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)))</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  { <span class="keywordflow">return</span> <a class="code" href="a06689.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)); }</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="comment"></span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _K1, <span class="keyword">typename</span> _C1, <span class="keyword">typename</span> _A1></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="a06681.html">multiset<_K1, _C1, _A1></a>&,</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_K1, _C1, _A1></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>  <span class="keyword">template</span><<span class="keyword">typename</span> _K1, <span class="keyword">typename</span> _C1, <span class="keyword">typename</span> _A1></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  operator< (const multiset<_K1, _C1, _A1>&,</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_K1, _C1, _A1></a>&);</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  };</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> <span class="comment"></span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> <span class="comment"> /**</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment"> * @brief Multiset equality comparison.</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="comment"> * @param __x A %multiset.</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment"> * @param __y A %multiset of the same type as @a __x.</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment"> * @return True iff the size and elements of the multisets are equal.</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <span class="comment"> *</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> <span class="comment"> * This is an equivalence relation. It is linear in the size of the</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="comment"> * multisets.</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> <span class="comment"> * Multisets are considered equivalent if their sizes are equal, and if</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment"> * corresponding elements compare equal.</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment"> */</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00826"></a><span class="lineno"><a class="line" href="a01487.html#ada60c841e9fe08814304ae79d35267de"> 826</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  { <span class="keywordflow">return</span> __x._M_t == __y._M_t; }</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment"></span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment"> /**</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span> <span class="comment"> * @brief Multiset ordering relation.</span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="comment"> * @param __x A %multiset.</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment"> * @param __y A %multiset of the same type as @a __x.</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"> * @return True iff @a __x is lexicographically less than @a __y.</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> <span class="comment"> *</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment"> * sets. The elements must be comparable with @c <.</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> <span class="comment"> *</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> <span class="comment"> */</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00843"></a><span class="lineno"><a class="line" href="a01487.html#a203ef17a8b706e78acfa3d05f30e20ca"> 843</a></span>  operator<(const multiset<_Key, _Compare, _Alloc>& __x,</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  { <span class="keywordflow">return</span> __x._M_t < __y._M_t; }</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="comment"></span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span> <span class="comment"> /// Returns !(x == y).</span></div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00850"></a><span class="lineno"><a class="line" href="a01487.html#a20729b0ed4cf42aa7dba9c24e71243f0"> 850</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="comment"></span></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="comment"> /// Returns y < x.</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00857"></a><span class="lineno"><a class="line" href="a01487.html#afd4ebca607a5d77bce0ce62ed7c86fb9"> 857</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key,_Compare,_Alloc></a>& __x,</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key,_Compare,_Alloc></a>& __y)</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span> <span class="comment"></span></div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span> <span class="comment"> /// Returns !(y < x)</span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00864"></a><span class="lineno"><a class="line" href="a01487.html#adb3e9ff06db8a5cc1105aaea9e01abd2"> 864</a></span>  operator<=(const multiset<_Key, _Compare, _Alloc>& __x,</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span> <span class="comment"></span></div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span> <span class="comment"> /// Returns !(x < y)</span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00871"></a><span class="lineno"><a class="line" href="a01487.html#acddc46a5f1205d53f5f682a89259c38e"> 871</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keyword">const</span> <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="comment"></span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span> <span class="comment"> /// See std::multiset::swap().</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00878"></a><span class="lineno"><a class="line" href="a01487.html#addce7b5483c7a501cb63dc09f1406025"> 878</a></span>  <a class="code" href="a06681.html#a2e33077a80a2e3b4ff2a904c883c372c">swap</a>(<a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <a class="code" href="a06681.html">multiset<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  { __x.<a class="code" href="a06681.html#a2e33077a80a2e3b4ff2a904c883c372c">swap</a>(__y); }</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span> </div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> </div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_MULTISET_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a06681_html_ae6acd6b5095c21d2a04c7d9afa6b02ab"><div class="ttname"><a href="a06681.html#ae6acd6b5095c21d2a04c7d9afa6b02ab">std::multiset::multiset</a></div><div class="ttdeci">multiset(_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a multiset from a range. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00183">stl_multiset.h:183</a></div></div>
<div class="ttc" id="a06681_html_a18406be2849c2b0f4786452e6bd860f5"><div class="ttname"><a href="a06681.html#a18406be2849c2b0f4786452e6bd860f5">std::multiset::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Builds and inserts an element into the multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00457">stl_multiset.h:457</a></div></div>
<div class="ttc" id="a06681_html_a9c254b02eb2bdec6f38b12170102b9fd"><div class="ttname"><a href="a06681.html#a9c254b02eb2bdec6f38b12170102b9fd">std::multiset::lower_bound</a></div><div class="ttdeci">auto lower_bound(const _Kt &__x) const -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00727">stl_multiset.h:727</a></div></div>
<div class="ttc" id="a06681_html_ad558199cc94a4197f0623861bc955f1a"><div class="ttname"><a href="a06681.html#ad558199cc94a4197f0623861bc955f1a">std::multiset::find</a></div><div class="ttdeci">auto find(const _Kt &__x) -> decltype(iterator</div><div class="ttdoc">Tries to locate an element in a set. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00686">stl_multiset.h:686</a></div></div>
<div class="ttc" id="a06681_html_aa0d42b46c75769cbce93494ac80c8c34"><div class="ttname"><a href="a06681.html#aa0d42b46c75769cbce93494ac80c8c34">std::multiset::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdoc">Returns the size of the set. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00389">stl_multiset.h:389</a></div></div>
<div class="ttc" id="a06681_html_a86f3d174f7fcdbe85fabdc7db19eb37c"><div class="ttname"><a href="a06681.html#a86f3d174f7fcdbe85fabdc7db19eb37c">std::multiset::multiset</a></div><div class="ttdeci">multiset(multiset &&__x) noexcept(is_nothrow_copy_constructible< _Compare >::value)</div><div class="ttdoc">Multiset move constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00207">stl_multiset.h:207</a></div></div>
<div class="ttc" id="a06681_html_a8e049d59cecc0098bf1622582fedc42a"><div class="ttname"><a href="a06681.html#a8e049d59cecc0098bf1622582fedc42a">std::multiset::multiset</a></div><div class="ttdeci">multiset() noexcept(is_nothrow_default_constructible< allocator_type >::value &&is_nothrow_default_constructible< key_compare >::value)</div><div class="ttdoc">Default constructor creates no elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00140">stl_multiset.h:140</a></div></div>
<div class="ttc" id="a06681_html_a92ec8ff818ef21f8d170842d4732299c"><div class="ttname"><a href="a06681.html#a92ec8ff818ef21f8d170842d4732299c">std::multiset::operator=</a></div><div class="ttdeci">multiset & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Multiset list assignment operator. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00286">stl_multiset.h:286</a></div></div>
<div class="ttc" id="a06681_html_aec68936b69a9391df7ea268a7c44fb13"><div class="ttname"><a href="a06681.html#aec68936b69a9391df7ea268a7c44fb13">std::multiset::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdoc">Returns the maximum size of the set. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00394">stl_multiset.h:394</a></div></div>
<div class="ttc" id="a06681_html_a70689e1641f42b649d8237b0c6ba6592"><div class="ttname"><a href="a06681.html#a70689e1641f42b649d8237b0c6ba6592">std::multiset::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 multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00537">stl_multiset.h:537</a></div></div>
<div class="ttc" id="a06681_html_ac4b6516f21a29e3621488503744b2d11"><div class="ttname"><a href="a06681.html#ac4b6516f21a29e3621488503744b2d11">std::multiset::key_comp</a></div><div class="ttdeci">key_compare key_comp() const</div><div class="ttdoc">Returns the comparison object. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00297">stl_multiset.h:297</a></div></div>
<div class="ttc" id="a06681_html_a18b8e4cb637b0368ca3e4601adb9c122"><div class="ttname"><a href="a06681.html#a18b8e4cb637b0368ca3e4601adb9c122">std::multiset::multiset</a></div><div class="ttdeci">multiset(const multiset &__x)</div><div class="ttdoc">Multiset copy constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00196">stl_multiset.h:196</a></div></div>
<div class="ttc" id="a06681_html_a367f51af8d4d16af56b3c669808a80e9"><div class="ttname"><a href="a06681.html#a367f51af8d4d16af56b3c669808a80e9">std::multiset::crbegin</a></div><div class="ttdeci">reverse_iterator crbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00369">stl_multiset.h:369</a></div></div>
<div class="ttc" id="a06681_html_a6a95194c5c1aa0caf2d2f852def99bfc"><div class="ttname"><a href="a06681.html#a6a95194c5c1aa0caf2d2f852def99bfc">std::multiset::insert</a></div><div class="ttdeci">iterator insert(const value_type &__x)</div><div class="ttdoc">Inserts an element into the multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00476">stl_multiset.h:476</a></div></div>
<div class="ttc" id="a06681_html_a4bd596fbcfa91841dc0bfe442177c5ac"><div class="ttname"><a href="a06681.html#a4bd596fbcfa91841dc0bfe442177c5ac">std::multiset::multiset</a></div><div class="ttdeci">multiset(initializer_list< value_type > __l, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended initialier-list constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00243">stl_multiset.h:243</a></div></div>
<div class="ttc" id="a06681_html_a0bf2a4cf104ce19a863ac0438e1d3070"><div class="ttname"><a href="a06681.html#a0bf2a4cf104ce19a863ac0438e1d3070">std::multiset::multiset</a></div><div class="ttdeci">multiset(multiset &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())</div><div class="ttdoc">Allocator-extended move constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00237">stl_multiset.h:237</a></div></div>
<div class="ttc" id="a06681_html_a38e27d171934c562e8f5fc48fba81564"><div class="ttname"><a href="a06681.html#a38e27d171934c562e8f5fc48fba81564">std::multiset::multiset</a></div><div class="ttdeci">multiset(const _Compare &__comp, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a multiset with no elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00153">stl_multiset.h:153</a></div></div>
<div class="ttc" id="a00023_html"><div class="ttname"><a href="a00023.html">initializer_list</a></div></div>
<div class="ttc" id="a06681_html_ae1fcdebc244b6b7c006abcc3cb3c63d7"><div class="ttname"><a href="a06681.html#ae1fcdebc244b6b7c006abcc3cb3c63d7">std::multiset::lower_bound</a></div><div class="ttdeci">auto lower_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00721">stl_multiset.h:721</a></div></div>
<div class="ttc" id="a06681_html_ace71f2e5ccf1cf04f7684fe40490f9d6"><div class="ttname"><a href="a06681.html#ace71f2e5ccf1cf04f7684fe40490f9d6">std::multiset::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00638">stl_multiset.h:638</a></div></div>
<div class="ttc" id="a06681_html_a15b3f5d46a91d60ee98c0ac7f278476a"><div class="ttname"><a href="a06681.html#a15b3f5d46a91d60ee98c0ac7f278476a">std::multiset::multiset</a></div><div class="ttdeci">multiset(_InputIterator __first, _InputIterator __last, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended range constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00249">stl_multiset.h:249</a></div></div>
<div class="ttc" id="a06681_html_aff68f6029ff179bafdadc89212fe1ee0"><div class="ttname"><a href="a06681.html#aff68f6029ff179bafdadc89212fe1ee0">std::multiset::end</a></div><div class="ttdeci">iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00323">stl_multiset.h:323</a></div></div>
<div class="ttc" id="a06681_html_a816dd01e099e23f3b4dd32eb5a6ec308"><div class="ttname"><a href="a06681.html#a816dd01e099e23f3b4dd32eb5a6ec308">std::multiset::operator=</a></div><div class="ttdeci">multiset & operator=(const multiset &__x)</div><div class="ttdoc">Multiset assignment operator. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00263">stl_multiset.h:263</a></div></div>
<div class="ttc" id="a06681_html_a7229e1145054a27d23f88a185085f7ec"><div class="ttname"><a href="a06681.html#a7229e1145054a27d23f88a185085f7ec">std::multiset::insert</a></div><div class="ttdeci">void insert(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A template function that tries to insert a range of elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00525">stl_multiset.h:525</a></div></div>
<div class="ttc" id="a01601_html"><div class="ttname"><a href="a01601.html">std::initializer_list</a></div><div class="ttdoc">initializer_list </div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00047">initializer_list:47</a></div></div>
<div class="ttc" id="a06681_html_af02e09bba88000ac8487f66c9d5f0bdb"><div class="ttname"><a href="a06681.html#af02e09bba88000ac8487f66c9d5f0bdb">std::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="a00521_source.html#l00780">stl_multiset.h:780</a></div></div>
<div class="ttc" id="a06681_html_a3ada945ca3237945e666bdc541accba1"><div class="ttname"><a href="a06681.html#a3ada945ca3237945e666bdc541accba1">std::multiset::multiset</a></div><div class="ttdeci">multiset(const multiset &__m, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended copy constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00233">stl_multiset.h:233</a></div></div>
<div class="ttc" id="a06681_html_a47de6fecee69e70e8e20f69e31774708"><div class="ttname"><a href="a06681.html#a47de6fecee69e70e8e20f69e31774708">std::multiset::cbegin</a></div><div class="ttdeci">iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00351">stl_multiset.h:351</a></div></div>
<div class="ttc" id="a06681_html_a23f0dc41c6813e1628a1acf9c1966c8b"><div class="ttname"><a href="a06681.html#a23f0dc41c6813e1628a1acf9c1966c8b">std::multiset::crend</a></div><div class="ttdeci">reverse_iterator crend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00378">stl_multiset.h:378</a></div></div>
<div class="ttc" id="a06681_html"><div class="ttname"><a href="a06681.html">std::multiset</a></div><div class="ttdoc">A standard container made up of elements, which can be retrieved in logarithmic time. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00092">stl_multiset.h:92</a></div></div>
<div class="ttc" id="a08925_html"><div class="ttname"><a href="a08925.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++0x allocators. </div><div class="ttdef"><b>Definition:</b> <a href="a14749_source.html#l00095">ext/alloc_traits.h:95</a></div></div>
<div class="ttc" id="a06681_html_a860e4d18239957e13d509286aa2e466f"><div class="ttname"><a href="a06681.html#a860e4d18239957e13d509286aa2e466f">std::multiset::upper_bound</a></div><div class="ttdeci">auto upper_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00751">stl_multiset.h:751</a></div></div>
<div class="ttc" id="a06681_html_ad039dc1cb5c117a62ab8ff56fef14a22"><div class="ttname"><a href="a06681.html#ad039dc1cb5c117a62ab8ff56fef14a22">std::multiset::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, const value_type &__x)</div><div class="ttdoc">Inserts an element into the multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00506">stl_multiset.h:506</a></div></div>
<div class="ttc" id="a06681_html_aa51df64436f0118f064c49d49c8138f4"><div class="ttname"><a href="a06681.html#aa51df64436f0118f064c49d49c8138f4">std::multiset::erase</a></div><div class="ttdeci">_GLIBCXX_ABI_TAG_CXX11 iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from a multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00559">stl_multiset.h:559</a></div></div>
<div class="ttc" id="a01487_html"><div class="ttname"><a href="a01487.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std. </div></div>
<div class="ttc" id="a06681_html_ab58f3d8e73705b00b8e0323d43c32d34"><div class="ttname"><a href="a06681.html#ab58f3d8e73705b00b8e0323d43c32d34">std::multiset::upper_bound</a></div><div class="ttdeci">iterator upper_bound(const key_type &__x)</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00741">stl_multiset.h:741</a></div></div>
<div class="ttc" id="a06569_html"><div class="ttname"><a href="a06569.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a00503_source.html#l00097">stl_iterator.h:97</a></div></div>
<div class="ttc" id="a06681_html_ae1bc7a281212bde2b7b49e3a7589c0cc"><div class="ttname"><a href="a06681.html#ae1bc7a281212bde2b7b49e3a7589c0cc">std::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 a set. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00680">stl_multiset.h:680</a></div></div>
<div class="ttc" id="a06681_html_ae3d52c5bfb2c4ae04923e6bd96a01ae7"><div class="ttname"><a href="a06681.html#ae3d52c5bfb2c4ae04923e6bd96a01ae7">std::multiset::find</a></div><div class="ttdeci">auto find(const _Kt &__x) const -> decltype(const_iterator</div><div class="ttdoc">Tries to locate an element in a set. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00692">stl_multiset.h:692</a></div></div>
<div class="ttc" id="a06681_html_a5a7249221b9d058e801cb0d29dc8542a"><div class="ttname"><a href="a06681.html#a5a7249221b9d058e801cb0d29dc8542a">std::multiset::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdoc">Returns true if the set is empty. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00384">stl_multiset.h:384</a></div></div>
<div class="ttc" id="a06681_html_a6ffe97a245a1f046e9b536c6d5511ac9"><div class="ttname"><a href="a06681.html#a6ffe97a245a1f046e9b536c6d5511ac9">std::multiset::rend</a></div><div class="ttdeci">reverse_iterator rend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00341">stl_multiset.h:341</a></div></div>
<div class="ttc" id="a06681_html_a2fcf6dd3ed37a1bac19ba5e55239d77e"><div class="ttname"><a href="a06681.html#a2fcf6dd3ed37a1bac19ba5e55239d77e">std::multiset::erase</a></div><div class="ttdeci">_GLIBCXX_ABI_TAG_CXX11 iterator erase(const_iterator __first, const_iterator __last)</div><div class="ttdoc">Erases a [first,last) range of elements from a multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00611">stl_multiset.h:611</a></div></div>
<div class="ttc" id="a06689_html"><div class="ttname"><a href="a06689.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type. </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00096">stl_pair.h:96</a></div></div>
<div class="ttc" id="a06681_html_ac76a54ed49d2633b97a71e940461def3"><div class="ttname"><a href="a06681.html#ac76a54ed49d2633b97a71e940461def3">std::multiset::lower_bound</a></div><div class="ttdeci">iterator lower_bound(const key_type &__x)</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00711">stl_multiset.h:711</a></div></div>
<div class="ttc" id="a06681_html_a4003ef6187ecbbdce62b861222c09802"><div class="ttname"><a href="a06681.html#a4003ef6187ecbbdce62b861222c09802">std::multiset::count</a></div><div class="ttdeci">auto count(const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))</div><div class="ttdoc">Finds the number of elements with given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00656">stl_multiset.h:656</a></div></div>
<div class="ttc" id="a06681_html_ab9fe5fb5a5638e620268e30e640b104c"><div class="ttname"><a href="a06681.html#ab9fe5fb5a5638e620268e30e640b104c">std::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="a00521_source.html#l00589">stl_multiset.h:589</a></div></div>
<div class="ttc" id="a06681_html_a5477133d89691e608c82be49314cf0b2"><div class="ttname"><a href="a06681.html#a5477133d89691e608c82be49314cf0b2">std::multiset::upper_bound</a></div><div class="ttdeci">auto upper_bound(const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00757">stl_multiset.h:757</a></div></div>
<div class="ttc" id="a06681_html_ab6135bf8d9a5d292c335e2ca40cdf083"><div class="ttname"><a href="a06681.html#ab6135bf8d9a5d292c335e2ca40cdf083">std::multiset::equal_range</a></div><div class="ttdeci">auto equal_range(const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))</div><div class="ttdoc">Finds a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00796">stl_multiset.h:796</a></div></div>
<div class="ttc" id="a06681_html_a6b0cbc71ad54db5d009609ec077bc13f"><div class="ttname"><a href="a06681.html#a6b0cbc71ad54db5d009609ec077bc13f">std::multiset::rbegin</a></div><div class="ttdeci">reverse_iterator rbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00332">stl_multiset.h:332</a></div></div>
<div class="ttc" id="a06681_html_add69a9f99e1c6f68636c6c0c9cf57ef6"><div class="ttname"><a href="a06681.html#add69a9f99e1c6f68636c6c0c9cf57ef6">std::multiset::equal_range</a></div><div class="ttdeci">auto equal_range(const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))</div><div class="ttdoc">Finds a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00790">stl_multiset.h:790</a></div></div>
<div class="ttc" id="a06681_html_a12431fd574451b7c1e677d09f6d2ef46"><div class="ttname"><a href="a06681.html#a12431fd574451b7c1e677d09f6d2ef46">std::multiset::emplace</a></div><div class="ttdeci">iterator emplace(_Args &&... __args)</div><div class="ttdoc">Builds and inserts an element into the multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00431">stl_multiset.h:431</a></div></div>
<div class="ttc" id="a06681_html_a4bb5cd2cb86e5c9867122556be6f850a"><div class="ttname"><a href="a06681.html#a4bb5cd2cb86e5c9867122556be6f850a">std::multiset::value_comp</a></div><div class="ttdeci">value_compare value_comp() const</div><div class="ttdoc">Returns the comparison object. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00301">stl_multiset.h:301</a></div></div>
<div class="ttc" id="a06681_html_ad12c2a19de2da96ee5d3f5011073e126"><div class="ttname"><a href="a06681.html#ad12c2a19de2da96ee5d3f5011073e126">std::multiset::begin</a></div><div class="ttdeci">iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00314">stl_multiset.h:314</a></div></div>
<div class="ttc" id="a06681_html_adad316ede7ac22b3eff955eb6d9ab327"><div class="ttname"><a href="a06681.html#adad316ede7ac22b3eff955eb6d9ab327">std::multiset::multiset</a></div><div class="ttdeci">multiset(initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a multiset from an initializer_list. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00221">stl_multiset.h:221</a></div></div>
<div class="ttc" id="a06681_html_aa1b1b9236aecf15614ac2f4659edd279"><div class="ttname"><a href="a06681.html#aa1b1b9236aecf15614ac2f4659edd279">std::multiset::lower_bound</a></div><div class="ttdeci">const_iterator lower_bound(const key_type &__x) const</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00715">stl_multiset.h:715</a></div></div>
<div class="ttc" id="a06681_html_aa61090fd58e3795f2f87e341b27c1469"><div class="ttname"><a href="a06681.html#aa61090fd58e3795f2f87e341b27c1469">std::multiset::cend</a></div><div class="ttdeci">iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00360">stl_multiset.h:360</a></div></div>
<div class="ttc" id="a06681_html_a2e33077a80a2e3b4ff2a904c883c372c"><div class="ttname"><a href="a06681.html#a2e33077a80a2e3b4ff2a904c883c372c">std::multiset::swap</a></div><div class="ttdeci">void swap(multiset &__x) noexcept(_Alloc_traits::_S_nothrow_swap())</div><div class="ttdoc">Swaps data with another multiset. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00409">stl_multiset.h:409</a></div></div>
<div class="ttc" id="a06681_html_ac561d1612797aaf6022b371cce116035"><div class="ttname"><a href="a06681.html#ac561d1612797aaf6022b371cce116035">std::multiset::multiset</a></div><div class="ttdeci">multiset(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Builds a multiset from a range. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00167">stl_multiset.h:167</a></div></div>
<div class="ttc" id="a06681_html_aabff907f910392ba764de55f420727cf"><div class="ttname"><a href="a06681.html#aabff907f910392ba764de55f420727cf">std::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="a00521_source.html#l00784">stl_multiset.h:784</a></div></div>
<div class="ttc" id="a06681_html_ae8a1847b51c056d1abbc01fb76742632"><div class="ttname"><a href="a06681.html#ae8a1847b51c056d1abbc01fb76742632">std::multiset::multiset</a></div><div class="ttdeci">multiset(const allocator_type &__a)</div><div class="ttdoc">Allocator-extended default constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00229">stl_multiset.h:229</a></div></div>
<div class="ttc" id="a06681_html_ab40d34e43d53af099a124798fdc3d2f4"><div class="ttname"><a href="a06681.html#ab40d34e43d53af099a124798fdc3d2f4">std::multiset::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Returns the memory allocation object. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00305">stl_multiset.h:305</a></div></div>
<div class="ttc" id="a06681_html_a88ae213f5272a4de1e360e1e69335d8b"><div class="ttname"><a href="a06681.html#a88ae213f5272a4de1e360e1e69335d8b">std::multiset::find</a></div><div class="ttdeci">iterator find(const key_type &__x)</div><div class="ttdoc">Tries to locate an element in a set. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00676">stl_multiset.h:676</a></div></div>
<div class="ttc" id="a00302_html"><div class="ttname"><a href="a00302.html">concept_check.h</a></div></div>
<div class="ttc" id="a06681_html_a9f81b59c35ee0ef55f8a49aa63c7ed66"><div class="ttname"><a href="a06681.html#a9f81b59c35ee0ef55f8a49aa63c7ed66">std::multiset::count</a></div><div class="ttdeci">size_type count(const key_type &__x) const</div><div class="ttdoc">Finds the number of elements with given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00650">stl_multiset.h:650</a></div></div>
<div class="ttc" id="a06681_html_a6350cda1b237d8a34a63a1309c12ced3"><div class="ttname"><a href="a06681.html#a6350cda1b237d8a34a63a1309c12ced3">std::multiset::upper_bound</a></div><div class="ttdeci">const_iterator upper_bound(const key_type &__x) const</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00521_source.html#l00745">stl_multiset.h:745</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_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_599c955538774c0249d4ddd97c0a9ae8.html">bits</a></li><li class="navelem"><a class="el" href="a00521.html">stl_multiset.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.13 </li>
</ul>
</div>
</body>
</html>
