<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: stl_set.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00584_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_set.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00584.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">// Set implementation -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2001-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </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,1997</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_set.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_SET_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_SET_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="a00308.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="a00029.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="a01538.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_VERSION</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">class </span>multiset;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"></span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> /**</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * @brief A standard container made up of unique keys, which can be</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * retrieved in logarithmic time.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> *</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @ingroup associative_containers</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> *</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * @tparam _Key Type of key objects.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * @tparam _Compare Comparison function object type, defaults to less<_Key>.</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Key>.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> *</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and an</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * <a href="tables.html#69">associative container</a> (using unique keys).</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"> * Sets support bidirectional iterators.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> *</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * The private tree data is declared exactly the same way for set and</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * multiset; the distinction is made entirely in how the tree functions are</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * called (*_unique versus *_equal, same as the standard).</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> */</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</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="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">typename</span> _Alloc = std::allocator<_Key> ></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">class </span>set</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor"># if __cplusplus < 201103L</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  __glibcxx_class_requires(_Key, _SGIAssignableConcept)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  __glibcxx_class_requires4(_Compare, <span class="keywordtype">bool</span>, _Key, _Key,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _BinaryFunctionConcept)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  static_assert(is_same<<span class="keyword">typename</span> remove_cv<_Key>::type, _Key>::value,</div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="a07736.html#a8629917347e6dc60f7b778017591ac89"> 109</a></span>  <span class="stringliteral">"std::set must have a non-const, non-volatile value_type"</span>);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor"># ifdef __STRICT_ANSI__</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  static_assert(<a class="code" href="a03880.html">is_same<typename _Alloc::value_type, _Key>::value</a>,</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="stringliteral">"std::set must have the same value_type as its allocator"</span>);</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// typedefs:</span><span class="comment"></span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"></span><span class="comment"> /// Public typedefs.</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"></span> <span class="keyword">typedef</span> _Key <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>;</div><div class="line"><a name="l00121"></a><span class="lineno"><a class="line" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b"> 121</a></span>  <span class="keyword">typedef</span> _Key <a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">value_type</a>;</div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="a07736.html#a7ef2f84268354d05e7213606d2f364c9"> 122</a></span>  <span class="keyword">typedef</span> _Compare <a class="code" href="a07736.html#a7ef2f84268354d05e7213606d2f364c9">key_compare</a>;</div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="a07736.html#a2d638b35695b151f99f992e5048cb58d"> 123</a></span>  <span class="keyword">typedef</span> _Compare <a class="code" href="a07736.html#a2d638b35695b151f99f992e5048cb58d">value_compare</a>;</div><div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7"> 124</a></span>  <span class="keyword">typedef</span> _Alloc <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>;<span class="comment"></span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"></span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10156.html">__gnu_cxx::__alloc_traits<_Alloc>::template</a></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  rebind<_Key>::other _Key_alloc_type;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">typedef</span> _Rb_tree<key_type, value_type, _Identity<value_type>,</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="a07736.html#a7ef2f84268354d05e7213606d2f364c9">key_compare</a>, _Key_alloc_type> _Rep_type;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  _Rep_type _M_t; <span class="comment">// Red-black tree representing set.</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">typedef</span> <a class="code" href="a10156.html">__gnu_cxx::__alloc_traits<_Key_alloc_type></a> <a class="code" href="a10156.html">_Alloc_traits</a>;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"></span><span class="comment"> /// Iterator-related typedefs.</span></div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="a07736.html#ab09384f7a9772d0e8c6175b572db898d"> 140</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::pointer <a class="code" href="a07736.html#ab09384f7a9772d0e8c6175b572db898d">pointer</a>;</div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="a07736.html#a3d7226decb850440d394df1dafae0984"> 141</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_pointer <a class="code" href="a07736.html#a3d7226decb850440d394df1dafae0984">const_pointer</a>;</div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="a07736.html#a9e362ba78518dfe70c4ea6159cae235a"> 142</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::reference <a class="code" href="a07736.html#a9e362ba78518dfe70c4ea6159cae235a">reference</a>;</div><div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="a07736.html#a8d75c5991f7b0318f9390ed0a960a805"> 143</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_reference <a class="code" href="a07736.html#a8d75c5991f7b0318f9390ed0a960a805">const_reference</a>;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// DR 103. set::iterator is required to be modifiable,</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// but this allows modification of keys.</span></div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a"> 147</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>;</div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57"> 148</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a>;</div><div class="line"><a name="l00149"></a><span class="lineno"><a class="line" href="a07736.html#ab7b54ee87cf04d32f163e87e1bd0b5c5"> 149</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07612.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a07736.html#ab7b54ee87cf04d32f163e87e1bd0b5c5">reverse_iterator</a>;</div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="a07736.html#ab28676718c0dc84a292b8998fa943c83"> 150</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07612.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a07736.html#ab28676718c0dc84a292b8998fa943c83">const_reverse_iterator</a>;</div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="a07736.html#ad9837325cd001566e32eb95539a8ded5"> 151</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::size_type <a class="code" href="a07736.html#ad9837325cd001566e32eb95539a8ded5">size_type</a>;</div><div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="a07736.html#a1209ccfa7ee8ec775e03282e07a4d3ab"> 152</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::difference_type <a class="code" href="a07736.html#a1209ccfa7ee8ec775e03282e07a4d3ab">difference_type</a>;<span class="comment"></span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"></span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">using</span> node_type = <span class="keyword">typename</span> _Rep_type::node_type;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">using</span> insert_return_type = <span class="keyword">typename</span> _Rep_type::insert_return_type;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// allocation/deallocation</span><span class="comment"></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"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> */</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>() : _M_t() { }</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"></span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> /**</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> * @brief Creates a %set with no elements.</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> * @param __comp Comparator to use.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> */</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="a07736.html#aed34d26628e845f2b7e0eb45959ef0fc"> 176</a></span>  <a class="code" href="a07736.html#aed34d26628e845f2b7e0eb45959ef0fc">set</a>(<span class="keyword">const</span> _Compare& __comp,</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a = <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>())</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  : _M_t(__comp, _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"></span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> /**</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * @brief Builds a %set from a range.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> *</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> * Create a %set consisting of copies of the elements from</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * [__first,__last). This is linear in N if the range is</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> * already sorted, and NlogN otherwise (where N is</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> */</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00191"></a><span class="lineno"><a class="line" href="a07736.html#a5c24e6efdb6526f5a28e7c54af8e3e15"> 191</a></span>  <a class="code" href="a07736.html#a5c24e6efdb6526f5a28e7c54af8e3e15">set</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  : _M_t()</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"></span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> /**</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * @brief Builds a %set from a range.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * @param __comp A comparison functor.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> *</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * Create a %set consisting of copies of the elements from</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> * [__first,__last). This is linear in N if the range is</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> * already sorted, and NlogN otherwise (where N is</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> */</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00208"></a><span class="lineno"><a class="line" href="a07736.html#a0b099bbbac6aef91b91c671c3e231979"> 208</a></span>  <a class="code" href="a07736.html#a0b099bbbac6aef91b91c671c3e231979">set</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">const</span> _Compare& __comp,</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a = <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>())</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  : _M_t(__comp, _Key_alloc_type(__a))</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"></span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> /**</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> * @brief %Set copy constructor.</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"> * Whether the allocator is copied depends on the allocator traits.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> */</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>(<span class="keyword">const</span> <a class="code" href="a07736.html">set</a>& __x)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  : _M_t(__x._M_t) { }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"></span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment"> /**</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> * @brief %Set move constructor</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> *</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> * The newly-created %set contains the exact contents of the moved</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> * instance. The moved instance is a valid, but unspecified, %set.</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> */</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>(<a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"></span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> /**</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> * @brief Builds a %set from an initializer_list.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> * @param __comp A comparison functor.</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> *</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> * Create a %set consisting of copies of the elements in the list.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"> * This is linear in N if the list is already sorted, and NlogN</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> * otherwise (where N is @a __l.size()).</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> */</span></div><div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="a07736.html#acdf4b44f5a2f222c735237d763b89eaa"> 243</a></span>  <a class="code" href="a07736.html#acdf4b44f5a2f222c735237d763b89eaa">set</a>(<a class="code" href="a01652.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> _Compare& __comp = _Compare(),</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a = <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>())</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  : _M_t(__comp, _Key_alloc_type(__a))</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  { _M_t._M_insert_unique(__l.begin(), __l.end()); }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"></span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> /// Allocator-extended default constructor.</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"></span> <span class="keyword">explicit</span></div><div class="line"><a name="l00251"></a><span class="lineno"><a class="line" href="a07736.html#a943aa95cb4e637b9b3199cb63cd247b0"> 251</a></span>  <a class="code" href="a07736.html#a943aa95cb4e637b9b3199cb63cd247b0">set</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a)</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  : _M_t(_Compare(), _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"></span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> /// Allocator-extended copy constructor.</span></div><div class="line"><a name="l00255"></a><span class="lineno"><a class="line" href="a07736.html#a06c8c1519399c9811fd0bfe2702f5c3b"> 255</a></span> <span class="comment"></span> <a class="code" href="a07736.html#a06c8c1519399c9811fd0bfe2702f5c3b">set</a>(<span class="keyword">const</span> <a class="code" href="a07736.html">set</a>& __x, <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  : _M_t(__x._M_t, _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"></span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> /// Allocator-extended move constructor.</span></div><div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="a07736.html#a5ef0930efbfe6211c06de5d4e4e7a253"> 259</a></span> <span class="comment"></span> <a class="code" href="a07736.html#a5ef0930efbfe6211c06de5d4e4e7a253">set</a>(<a class="code" href="a07736.html">set</a>&& __x, <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a)</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  noexcept(<a class="code" href="a03660.html">is_nothrow_copy_constructible<_Compare>::value</a></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  && _Alloc_traits::_S_always_equal())</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  : _M_t(<a class="code" href="a01538.html">std</a>::move(__x._M_t), _Key_alloc_type(__a)) { }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"></span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> /// Allocator-extended initialier-list constructor.</span></div><div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="a07736.html#aaf9732d21b9343b12f3117fe3b87a6f3"> 265</a></span> <span class="comment"></span> <a class="code" href="a07736.html#aaf9732d21b9343b12f3117fe3b87a6f3">set</a>(<a class="code" href="a01652.html">initializer_list<value_type></a> __l, <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a)</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  : _M_t(_Compare(), _Key_alloc_type(__a))</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  { _M_t._M_insert_unique(__l.begin(), __l.end()); }</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"></span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> /// Allocator-extended range constructor.</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="a07736.html#ac33c85b1fbf245c21fe0965b7e7eca59"> 271</a></span>  <a class="code" href="a07736.html#ac33c85b1fbf245c21fe0965b7e7eca59">set</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">const</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>& __a)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  : _M_t(_Compare(), _Key_alloc_type(__a))</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"></span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> /**</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"> * The dtor only erases the elements, and note that if the elements</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> * themselves are pointers, the pointed-to memory is not touched in any</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> * way. Managing the pointer is the user's responsibility.</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>  <a class="code" href="a07736.html#aeef30db5984855d4fc426da2aa51562f">~set</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"></span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"> /**</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"> * @brief %Set assignment operator.</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> *</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> * Whether the allocator is copied depends on the allocator traits.</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"> */</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="code" href="a07736.html">set</a>&</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="a07736.html#a8ffd6bc39d7e301ec0f77568e4c531c2">operator=</a>(<span class="keyword">const</span> <a class="code" href="a07736.html">set</a>& __x)</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>  _M_t = __x._M_t;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <a class="code" href="a07736.html#a8ffd6bc39d7e301ec0f77568e4c531c2">operator=</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"></span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"> /// Move assignment operator.</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"></span> <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="a07736.html#a8ffd6bc39d7e301ec0f77568e4c531c2">operator=</a>(<a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"></span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> /**</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"> * @brief %Set list assignment operator.</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment"> * @param __l An initializer_list.</span></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"> * This function fills a %set with copies of the elements in the</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> * initializer list @a __l.</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> *</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> * Note that the assignment completely changes the %set and</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> * that the resulting %set's size is the same as the number</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> * of elements assigned.</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> */</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="a07736.html#a907d82d36716f9e488b991958f58f6aa">set</a>&</div><div class="line"><a name="l00316"></a><span class="lineno"><a class="line" href="a07736.html#a8e269a4d9e589df1ef1bc6df659e7a96"> 316</a></span>  <a class="code" href="a07736.html#a8e269a4d9e589df1ef1bc6df659e7a96">operator=</a>(<a class="code" href="a01652.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  _M_t._M_assign_unique(__l.begin(), __l.end());</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// accessors:</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"></span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> /// Returns the comparison object with which the %set was constructed.</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"></span> <a class="code" href="a07736.html#a7ef2f84268354d05e7213606d2f364c9">key_compare</a></div><div class="line"><a name="l00327"></a><span class="lineno"><a class="line" href="a07736.html#a9b148fa88cbd84df31e19b1d9e531724"> 327</a></span>  <a class="code" href="a07736.html#a9b148fa88cbd84df31e19b1d9e531724">key_comp</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }<span class="comment"></span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment"> /// Returns the comparison object with which the %set was constructed.</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"></span> <a class="code" href="a07736.html#a2d638b35695b151f99f992e5048cb58d">value_compare</a></div><div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="a07736.html#a2fbb062a8014c9444365d2bedd0ced48"> 331</a></span>  <a class="code" href="a07736.html#a2fbb062a8014c9444365d2bedd0ced48">value_comp</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }<span class="comment"></span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"> /// Returns the allocator object with which the %set was constructed.</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"></span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a></div><div class="line"><a name="l00335"></a><span class="lineno"><a class="line" href="a07736.html#ad6674974a5ecbd2df498227c9ed63ce2"> 335</a></span>  <a class="code" href="a07736.html#ad6674974a5ecbd2df498227c9ed63ce2">get_allocator</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  { <span class="keywordflow">return</span> <a class="code" href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">allocator_type</a>(_M_t.get_allocator()); }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"></span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> /**</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> * to the keys.</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> */</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00344"></a><span class="lineno"><a class="line" href="a07736.html#ae74861993e8ffc668813a1face48447b"> 344</a></span>  <a class="code" href="a07736.html#ae74861993e8ffc668813a1face48447b">begin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"></span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment"> /**</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> * to the keys.</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> */</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="a07736.html#a7a35e9e918f87c423c9f1f2362151b26"> 353</a></span>  <a class="code" href="a07736.html#a7a35e9e918f87c423c9f1f2362151b26">end</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  { <span class="keywordflow">return</span> _M_t.end(); }</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"></span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"> /**</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the last</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"> * element in the %set. Iteration is done in descending order according</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"> * to the keys.</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> */</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="a07612.html">reverse_iterator</a></div><div class="line"><a name="l00362"></a><span class="lineno"><a class="line" href="a07736.html#a9c6f4b02f2ed2c82963fce15fb3d24ee"> 362</a></span>  <a class="code" href="a07736.html#a9c6f4b02f2ed2c82963fce15fb3d24ee">rbegin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"></span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"> /**</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> * last pair in the %set. Iteration is done in descending order</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> */</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="a07612.html">reverse_iterator</a></div><div class="line"><a name="l00371"></a><span class="lineno"><a class="line" href="a07736.html#afaa0621475cc933cf5a668a4db9fd851"> 371</a></span>  <a class="code" href="a07736.html#afaa0621475cc933cf5a668a4db9fd851">rend</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment"> /**</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> * to the keys.</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> */</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00381"></a><span class="lineno"><a class="line" href="a07736.html#a39e7d303fb234db62a1faa6df63f4604"> 381</a></span>  <a class="code" href="a07736.html#a39e7d303fb234db62a1faa6df63f4604">cbegin</a>() const noexcept</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"></span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> /**</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> * to the keys.</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> */</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00390"></a><span class="lineno"><a class="line" href="a07736.html#a5d2030f67826e8bfea0b6dce51e792b7"> 390</a></span>  <a class="code" href="a07736.html#a5d2030f67826e8bfea0b6dce51e792b7">cend</a>() const noexcept</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  { <span class="keywordflow">return</span> _M_t.end(); }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"></span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> /**</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the last</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> * element in the %set. Iteration is done in descending order according</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> * to the keys.</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>  <a class="code" href="a07612.html">reverse_iterator</a></div><div class="line"><a name="l00399"></a><span class="lineno"><a class="line" href="a07736.html#aa748ce25c53c595cbb332058bf1841d3"> 399</a></span>  <a class="code" href="a07736.html#aa748ce25c53c595cbb332058bf1841d3">crbegin</a>() const noexcept</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"></span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> /**</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> * last pair in the %set. Iteration is done in descending order</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> */</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="a07612.html">reverse_iterator</a></div><div class="line"><a name="l00408"></a><span class="lineno"><a class="line" href="a07736.html#abb253be090c388adfba1f54046c0f416"> 408</a></span>  <a class="code" href="a07736.html#abb253be090c388adfba1f54046c0f416">crend</a>() const noexcept</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"></span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> /// Returns true if the %set is empty.</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"></span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00414"></a><span class="lineno"><a class="line" href="a07736.html#af5f37a9e0561eb1ae89988aaefc4476e"> 414</a></span>  <a class="code" href="a07736.html#af5f37a9e0561eb1ae89988aaefc4476e">empty</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  { <span class="keywordflow">return</span> _M_t.empty(); }</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"></span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> /// Returns the size of the %set.</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"></span> <a class="code" href="a07736.html#ad9837325cd001566e32eb95539a8ded5">size_type</a></div><div class="line"><a name="l00419"></a><span class="lineno"><a class="line" href="a07736.html#ab21409945167dfbfd999f005739cbc2a"> 419</a></span>  <a class="code" href="a07736.html#ab21409945167dfbfd999f005739cbc2a">size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  { <span class="keywordflow">return</span> _M_t.size(); }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment"></span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"> /// Returns the maximum size of the %set.</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"></span> <a class="code" href="a07736.html#ad9837325cd001566e32eb95539a8ded5">size_type</a></div><div class="line"><a name="l00424"></a><span class="lineno"><a class="line" href="a07736.html#a84c5ddf1dff1dbdb8583cfabe3605b86"> 424</a></span>  <a class="code" href="a07736.html#a84c5ddf1dff1dbdb8583cfabe3605b86">max_size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  { <span class="keywordflow">return</span> _M_t.max_size(); }</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"></span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> /**</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> * @brief Swaps data with another %set.</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> * @param __x A %set of the same element and allocator types.</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> *</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> * This exchanges the elements between two sets in constant</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> * time. (It is only swapping a pointer, an integer, and an</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> * instance of the @c Compare type (which itself is often</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> * stateless and empty), so it should be quite fast.) Note</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> * that the global std::swap() function is specialized such</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> * that std::swap(s1,s2) will feed to this function.</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> *</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> * Whether the allocators are swapped depends on the allocator traits.</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> */</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00441"></a><span class="lineno"><a class="line" href="a07736.html#a2ad1ef1062ee331c848605434d1d5ef6"> 441</a></span>  <a class="code" href="a07736.html#a2ad1ef1062ee331c848605434d1d5ef6">swap</a>(<a class="code" href="a07736.html">set</a>& __x)</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  { _M_t.swap(__x._M_t); }</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// insert/erase</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"> /**</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment"> * @brief Attempts to build and insert an element into the %set.</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment"> * @param __args Arguments used to generate an element.</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> * to the possibly inserted element, and the second is a bool</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"> * that is true if the element was actually inserted.</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> *</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> * This function attempts to build and insert an element into the %set.</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> * A %set relies on unique keys and thus an element is only inserted if</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> * it is not already present in the %set.</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"> *</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> * Insertion requires logarithmic time.</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> */</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <a class="code" href="a07764.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00462"></a><span class="lineno"><a class="line" href="a07736.html#af16da8812db504af3bbf8a682de754d6"> 462</a></span>  <a class="code" href="a07736.html#af16da8812db504af3bbf8a682de754d6">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  { <span class="keywordflow">return</span> _M_t._M_emplace_unique(std::forward<_Args>(__args)...); }</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"> /**</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> * @brief Attempts to insert an element into the %set.</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="comment"> * @param __args Arguments used to generate the element to be</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> * @return An iterator that points to the element with key equivalent to</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> * the one generated from @a __args (may or may not be the</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> * element itself).</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> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment"> * and thus does not return a boolean like the single-argument emplace()</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment"> * does. Note that the first parameter is only a hint and can</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="comment"> *</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="comment"> * For more on @a hinting, see:</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="comment"> *</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</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="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00488"></a><span class="lineno"><a class="line" href="a07736.html#ae4eb02463d17b44a49e6d916d05548fe"> 488</a></span>  <a class="code" href="a07736.html#ae4eb02463d17b44a49e6d916d05548fe">emplace_hint</a>(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __pos, _Args&&... __args)</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  {</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">return</span> _M_t._M_emplace_hint_unique(__pos,</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  }</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"></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"> * @brief Attempts to insert an element into the %set.</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment"> * to the possibly inserted element, and the second is a bool</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> * that is true if the element was actually inserted.</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"> *</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"> * This function attempts to insert an element into the %set. A %set</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="comment"> * relies on unique keys and thus an element is only inserted if it is</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="comment"> * not already present in the %set.</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="comment"> *</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="comment"> * Insertion requires logarithmic time.</span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment"> */</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <a class="code" href="a07764.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00509"></a><span class="lineno"><a class="line" href="a07736.html#af168dfb4d8e0515557884b2619117c78"> 509</a></span>  <a class="code" href="a07736.html#af168dfb4d8e0515557884b2619117c78">insert</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">value_type</a>& __x)</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  {</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <a class="code" href="a07764.html">std::pair<typename _Rep_type::iterator, bool></a> __p =</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  _M_t._M_insert_unique(__x);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">return</span> <a class="code" href="a07764.html">std::pair<iterator, bool></a>(__p.<a class="code" href="a07764.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __p.<a class="code" href="a07764.html#a91179413226db12e66346d3673b7835f">second</a>);</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  }</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span> </div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <a class="code" href="a07764.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="a07736.html#af168dfb4d8e0515557884b2619117c78">insert</a>(<a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">value_type</a>&& __x)</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  {</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <a class="code" href="a07764.html">std::pair<typename _Rep_type::iterator, bool></a> __p =</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  _M_t._M_insert_unique(std::move(__x));</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">return</span> <a class="code" href="a07764.html">std::pair<iterator, bool></a>(__p.<a class="code" href="a07764.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __p.<a class="code" href="a07764.html#a91179413226db12e66346d3673b7835f">second</a>);</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"></span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> /**</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> * @brief Attempts to insert an element into the %set.</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> * @param __position An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> * element should be inserted.</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> * @param __x Element to be inserted.</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> * @a __x (may or may not be the element passed in).</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"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> * and thus does not return a boolean like the single-argument insert()</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> * does. Note that the first parameter is only a hint and can</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> *</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * For more on @a hinting, see:</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> *</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</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>  <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a></div><div class="line"><a name="l00546"></a><span class="lineno"><a class="line" href="a07736.html#abe856758e09628d4ec26d1e77ceee152"> 546</a></span>  <a class="code" href="a07736.html#abe856758e09628d4ec26d1e77ceee152">insert</a>(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __position, <span class="keyword">const</span> <a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">value_type</a>& __x)</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position, __x); }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="a07736.html#af168dfb4d8e0515557884b2619117c78">insert</a>(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __position, <a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">value_type</a>&& __x)</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position, std::move(__x)); }</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"></span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment"> /**</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment"> * @brief A template function that attempts to insert a range</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment"> * of elements.</span></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"> *</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> */</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00566"></a><span class="lineno"><a class="line" href="a07736.html#aa383fd1111f8ced96c22eacf1e42c258"> 566</a></span>  <a class="code" href="a07736.html#aa383fd1111f8ced96c22eacf1e42c258">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> </div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> /**</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> * @brief Attempts to insert a list of elements into the %set.</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="comment"> * to be inserted.</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"> *</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="comment"> * Complexity similar to that of the range constructor.</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="keywordtype">void</span></div><div class="line"><a name="l00578"></a><span class="lineno"><a class="line" href="a07736.html#a555b9e2cf15a4d3aac095883904743a8"> 578</a></span>  <a class="code" href="a07736.html#a555b9e2cf15a4d3aac095883904743a8">insert</a>(<a class="code" href="a01652.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  { this-><a class="code" href="a07736.html#af168dfb4d8e0515557884b2619117c78">insert</a>(__l.begin(), __l.end()); }</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment"></span> node_type</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  extract(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __pos)</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  {</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  __glibcxx_assert(__pos != <a class="code" href="a07736.html#a7a35e9e918f87c423c9f1f2362151b26">end</a>());</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">return</span> _M_t.extract(__pos);</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment"></span></div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment"> /// Extract a node.</span></div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment"></span> node_type</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  extract(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  { <span class="keywordflow">return</span> _M_t.extract(__x); }</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"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"></span> insert_return_type</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <a class="code" href="a07736.html#af168dfb4d8e0515557884b2619117c78">insert</a>(node_type&& __nh)</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  { <span class="keywordflow">return</span> _M_t._M_reinsert_node_unique(std::move(__nh)); }</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"></span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> /// Re-insert an extracted node.</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"></span> <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <a class="code" href="a07736.html#af168dfb4d8e0515557884b2619117c78">insert</a>(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __hint, node_type&& __nh)</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  { <span class="keywordflow">return</span> _M_t._M_reinsert_node_hint_unique(__hint, std::move(__nh)); }</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keyword">friend</span> <span class="keyword">class </span>std::_Rb_tree_merge_helper;</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> </div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Compare1></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  merge(set<_Key, _Compare1, _Alloc>& __source)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keyword">using</span> _Merge_helper = _Rb_tree_merge_helper<set, _Compare1>;</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> </div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Compare1></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  merge(set<_Key, _Compare1, _Alloc>&& __source)</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  { merge(__source); }</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span> </div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Compare1></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  merge(multiset<_Key, _Compare1, _Alloc>& __source)</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keyword">using</span> _Merge_helper = _Rb_tree_merge_helper<set, _Compare1>;</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> </div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Compare1></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  merge(multiset<_Key, _Compare1, _Alloc>&& __source)</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  { merge(__source); }</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> </div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> /**</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> * @brief Erases an element from a %set.</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * @a __position prior to the element being erased. If no such</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> *</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"> * from a %set. Note that this function only erases the element, and</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment"> * that if the element is itself a pointer, the pointed-to memory is not</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment"> */</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  _GLIBCXX_ABI_TAG_CXX11</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a></div><div class="line"><a name="l00654"></a><span class="lineno"><a class="line" href="a07736.html#a2122b626db1a6a97c0bec69f4e766591"> 654</a></span>  <a class="code" href="a07736.html#a2122b626db1a6a97c0bec69f4e766591">erase</a>(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __position)</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  { <span class="keywordflow">return</span> _M_t.erase(__position); }</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="comment"> /**</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="comment"> * @brief Erases an element from a %set.</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment"> * @param position An iterator pointing to the element to be erased.</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"> * This function erases an element, pointed to by the given iterator,</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="comment"> * from a %set. Note that this function only erases the element, and</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"> * that if the element is itself a pointer, the pointed-to memory is not</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="comment"> */</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <a class="code" href="a07736.html#a2122b626db1a6a97c0bec69f4e766591">erase</a>(<a class="code" href="a07672.html">iterator</a> __position)</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  { _M_t.erase(__position); }</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"></span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment"> /**</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment"> * @param __x Key of element to be erased.</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="comment"> * @return The number of elements erased.</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="comment"> *</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> * This function erases all the elements located by the given key from</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> * a %set.</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment"> */</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="a07736.html#ad9837325cd001566e32eb95539a8ded5">size_type</a></div><div class="line"><a name="l00684"></a><span class="lineno"><a class="line" href="a07736.html#af75595c05a003b09225a0367cbe4d468"> 684</a></span>  <a class="code" href="a07736.html#af75595c05a003b09225a0367cbe4d468">erase</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  { <span class="keywordflow">return</span> _M_t.erase(__x); }</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="comment"> /**</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from a %set.</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> <span class="comment"></span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="comment"> * @return The iterator @a __last.</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"> * This function erases a sequence of elements from a %set.</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> */</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  _GLIBCXX_ABI_TAG_CXX11</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00706"></a><span class="lineno"><a class="line" href="a07736.html#aa73f253934bbb48e214bb21b89812cbb"> 706</a></span>  <a class="code" href="a07736.html#aa73f253934bbb48e214bb21b89812cbb">erase</a>(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __first, <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a> __last)</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  { <span class="keywordflow">return</span> _M_t.erase(__first, __last); }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment"> /**</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> * @brief Erases a [first,last) range of elements from a %set.</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment"> *</span></div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment"> * This function erases a sequence of elements from a %set.</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment"> */</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <a class="code" href="a07736.html#a2122b626db1a6a97c0bec69f4e766591">erase</a>(<a class="code" href="a07672.html">iterator</a> __first, <a class="code" href="a07672.html">iterator</a> __last)</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  { _M_t.erase(__first, __last); }</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="comment"></span></div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> <span class="comment"> /**</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment"> * Erases all elements in a %set. Note that this function only erases</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment"> * the elements, and that if the elements themselves are pointers, the</span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span> <span class="comment"> * pointed-to memory is not touched in any way. Managing the pointer is</span></div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> <span class="comment"> * the user's responsibility.</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="keywordtype">void</span></div><div class="line"><a name="l00733"></a><span class="lineno"><a class="line" href="a07736.html#ad06b71a81f86eca8862b0cbc0572622c"> 733</a></span>  <a class="code" href="a07736.html#ad06b71a81f86eca8862b0cbc0572622c">clear</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  { _M_t.clear(); }</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> </div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="comment">// set operations:</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"></span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> * @brief Finds the number of elements.</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> * @param __x Element to located.</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span> <span class="comment"> * @return Number of elements with specified key.</span></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> <span class="comment"> *</span></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> <span class="comment"> * This function only makes sense for multisets; for set the result will</span></div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="comment"> * either be 0 (not present) or 1 (present).</span></div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="comment"> */</span></div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <a class="code" href="a07736.html#ad9837325cd001566e32eb95539a8ded5">size_type</a></div><div class="line"><a name="l00748"></a><span class="lineno"><a class="line" href="a07736.html#a1164f8c8d8b92b1b4be8a313cede8abe"> 748</a></span>  <a class="code" href="a07736.html#a1164f8c8d8b92b1b4be8a313cede8abe">count</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x) == _M_t.end() ? 0 : 1; }</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00754"></a><span class="lineno"><a class="line" href="a07736.html#a659cf2314514a8cf2d6ecc68d08bf2ca"> 754</a></span>  <a class="code" href="a07736.html#a659cf2314514a8cf2d6ecc68d08bf2ca">count</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  -> decltype(_M_t._M_count_tr(__x))</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  { <span class="keywordflow">return</span> _M_t._M_count_tr(__x); }</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"></span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// 214. set::find() missing const overload</span><span class="comment"></span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"> * @brief Tries to locate an element in a %set.</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment"> * @param __x Element to be located.</span></div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment"> * found.</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment"> *</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> */</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00775"></a><span class="lineno"><a class="line" href="a07736.html#af20eddb69820079242b06871210f9b06"> 775</a></span>  <a class="code" href="a07736.html#af20eddb69820079242b06871210f9b06">find</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  { <span class="keywordflow">return</span> _M_t.find(__x); }</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a></div><div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="a07736.html#af9b85bc6147d2b93a7a470ab20baab1a"> 779</a></span>  <a class="code" href="a07736.html#af9b85bc6147d2b93a7a470ab20baab1a">find</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x); }</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> </div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00785"></a><span class="lineno"><a class="line" href="a07736.html#a70c1741d5e747b2b0a3ae6217fc5906d"> 785</a></span>  <a class="code" href="a07736.html#a70c1741d5e747b2b0a3ae6217fc5906d">find</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  -> decltype(<a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>{_M_t._M_find_tr(__x)})</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  { <span class="keywordflow">return</span> <a class="code" href="a07672.html">iterator</a>{_M_t._M_find_tr(__x)}; }</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00791"></a><span class="lineno"><a class="line" href="a07736.html#ac46165e1a88cdf7f318309c2c35f028d"> 791</a></span>  <a class="code" href="a07736.html#ac46165e1a88cdf7f318309c2c35f028d">find</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  -> decltype(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a>{_M_t._M_find_tr(__x)})</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  { <span class="keywordflow">return</span> <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a>{_M_t._M_find_tr(__x)}; }</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="comment"> * @return Iterator pointing to first element equal to or greater</span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="comment"> * than key, or end().</span></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> <span class="comment"> *</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="comment"> * This function returns the first element of a subsequence of elements</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="comment"> * pointing to the first element that has a greater value than given key</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="comment"> * or end() if no such element exists.</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="comment"> */</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a></div><div class="line"><a name="l00810"></a><span class="lineno"><a class="line" href="a07736.html#ae0623408c438fcbe7426deb496d3fd36"> 810</a></span>  <a class="code" href="a07736.html#ae0623408c438fcbe7426deb496d3fd36">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  { <span class="keywordflow">return</span> _M_t.lower_bound(__x); }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> </div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a></div><div class="line"><a name="l00814"></a><span class="lineno"><a class="line" href="a07736.html#abfcf2991ff3683e095dd11d089e7117c"> 814</a></span>  <a class="code" href="a07736.html#abfcf2991ff3683e095dd11d089e7117c">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.lower_bound(__x); }</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00820"></a><span class="lineno"><a class="line" href="a07736.html#a4ba764c0f23024700dfa99b600909b34"> 820</a></span>  <a class="code" href="a07736.html#a4ba764c0f23024700dfa99b600909b34">lower_bound</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  -> decltype(<a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>(_M_t._M_lower_bound_tr(__x)))</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  { <span class="keywordflow">return</span> <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>(_M_t._M_lower_bound_tr(__x)); }</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> </div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00826"></a><span class="lineno"><a class="line" href="a07736.html#a91a143d5a364b10a3a13f6502ef0c23e"> 826</a></span>  <a class="code" href="a07736.html#a91a143d5a364b10a3a13f6502ef0c23e">lower_bound</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  -> decltype(<a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a>(_M_t._M_lower_bound_tr(__x)))</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  { <span class="keywordflow">return</span> <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a>(_M_t._M_lower_bound_tr(__x)); }</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="preprocessor">#endif</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"></span><span class="comment"></span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="comment"> * @return Iterator pointing to the first element</span></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment"> * greater than key, or end().</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>  <a class="code" href="a07672.html">iterator</a></div><div class="line"><a name="l00840"></a><span class="lineno"><a class="line" href="a07736.html#ae03b8775010d8dc4709a4d34013964d7"> 840</a></span>  <a class="code" href="a07736.html#ae03b8775010d8dc4709a4d34013964d7">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  { <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> </div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a></div><div class="line"><a name="l00844"></a><span class="lineno"><a class="line" href="a07736.html#a53e2535b0fb16518b7ad89cd3d6088e8"> 844</a></span>  <a class="code" href="a07736.html#a53e2535b0fb16518b7ad89cd3d6088e8">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> </div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00850"></a><span class="lineno"><a class="line" href="a07736.html#ae1dc65477a3821784762efba7f606522"> 850</a></span>  <a class="code" href="a07736.html#ae1dc65477a3821784762efba7f606522">upper_bound</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  -> decltype(<a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>(_M_t._M_upper_bound_tr(__x)))</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  { <span class="keywordflow">return</span> <a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>(_M_t._M_upper_bound_tr(__x)); }</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> </div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00856"></a><span class="lineno"><a class="line" href="a07736.html#aaabacc65cbc611e1f48789de8da83919"> 856</a></span>  <a class="code" href="a07736.html#aaabacc65cbc611e1f48789de8da83919">upper_bound</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  -> decltype(<a class="code" href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">iterator</a>(_M_t._M_upper_bound_tr(__x)))</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  { <span class="keywordflow">return</span> <a class="code" href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">const_iterator</a>(_M_t._M_upper_bound_tr(__x)); }</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span> <span class="preprocessor">#endif</span></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"></span><span class="comment"></span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> <span class="comment"> * @param __x Key to be located.</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span> <span class="comment"> *</span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span> <span class="comment"> * This function is equivalent to</span></div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span> <span class="comment"> * @code</span></div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> <span class="comment"> * std::make_pair(c.lower_bound(val),</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="comment"> * c.upper_bound(val))</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> <span class="comment"> * @endcode</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="comment"> * (but is faster than making the calls separately).</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span> <span class="comment"> *</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span> <span class="comment"> * This function probably only makes sense for multisets.</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> <span class="comment"> */</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <a class="code" href="a07764.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l00879"></a><span class="lineno"><a class="line" href="a07736.html#af9f201350c153d3da65fe02191c0129f"> 879</a></span>  <a class="code" href="a07736.html#af9f201350c153d3da65fe02191c0129f">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  { <span class="keywordflow">return</span> _M_t.equal_range(__x); }</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>  <a class="code" href="a07764.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l00883"></a><span class="lineno"><a class="line" href="a07736.html#ae0872a3e56b0583c37aab5d20514b479"> 883</a></span>  <a class="code" href="a07736.html#ae0872a3e56b0583c37aab5d20514b479">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a07736.html#a8629917347e6dc60f7b778017591ac89">key_type</a>& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.equal_range(__x); }</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> </div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00889"></a><span class="lineno"><a class="line" href="a07736.html#aad7aaff6e514ff8b528c0d6138342198"> 889</a></span>  <a class="code" href="a07736.html#aad7aaff6e514ff8b528c0d6138342198">equal_range</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  -> decltype(<a class="code" href="a07764.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)))</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  { <span class="keywordflow">return</span> <a class="code" href="a07764.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)); }</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span> </div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00895"></a><span class="lineno"><a class="line" href="a07736.html#aae9750edc8da201383f8894b70bbda0b"> 895</a></span>  <a class="code" href="a07736.html#aae9750edc8da201383f8894b70bbda0b">equal_range</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  -> decltype(<a class="code" href="a07764.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)))</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  { <span class="keywordflow">return</span> <a class="code" href="a07764.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)); }</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> <span class="comment"></span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</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="l00902"></a><span class="lineno"> 902</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  operator==(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_K1, _C1, _A1></a>&, <span class="keyword">const</span> <a class="code" href="a07736.html">set<_K1, _C1, _A1></a>&);</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> </div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="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="l00906"></a><span class="lineno"> 906</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  operator<(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_K1, _C1, _A1></a>&, <span class="keyword">const</span> <a class="code" href="a07736.html">set<_K1, _C1, _A1></a>&);</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  };</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> </div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> </div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keyword">typename</span> _Compare =</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  less<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keyword">typename</span> _Allocator =</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  allocator<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  set(_InputIterator, _InputIterator,</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  _Compare = _Compare(), _Allocator = _Allocator())</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  -> <a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">set<typename iterator_traits<_InputIterator>::value_type</a>,</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  _Compare, _Allocator>;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> </div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Compare = less<_Key>,</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keyword">typename</span> _Allocator = allocator<_Key>,</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  set(initializer_list<_Key>,</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  _Compare = _Compare(), _Allocator = _Allocator())</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  -> set<_Key, _Compare, _Allocator>;</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> </div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  set(_InputIterator, _InputIterator, _Allocator)</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  -> <a class="code" href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">set<typename iterator_traits<_InputIterator>::value_type</a>,</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  less<typename iterator_traits<_InputIterator>::value_type>,</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  _Allocator>;</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> </div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  set(initializer_list<_Key>, _Allocator)</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  -> set<_Key, less<_Key>, _Allocator>;</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> </div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> <span class="comment"></span></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> <span class="comment"> /**</span></div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span> <span class="comment"> * @brief Set equality comparison.</span></div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="comment"> * @param __x A %set.</span></div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> <span class="comment"> * @param __y A %set of the same type as @a x.</span></div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> <span class="comment"> * @return True iff the size and elements of the sets are equal.</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> <span class="comment"> *</span></div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> <span class="comment"> * This is an equivalence relation. It is linear in the size of the sets.</span></div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> <span class="comment"> * Sets are considered equivalent if their sizes are equal, and if</span></div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="comment"> * corresponding elements compare equal.</span></div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="comment"> */</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</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="l00957"></a><span class="lineno"> 957</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00958"></a><span class="lineno"><a class="line" href="a01538.html#aeed20ec23d92debc5bd1a0c0ee6c1b52"> 958</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  { <span class="keywordflow">return</span> __x._M_t == __y._M_t; }</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span> <span class="comment"></span></div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> <span class="comment"> /**</span></div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span> <span class="comment"> * @brief Set ordering relation.</span></div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="comment"> * @param __x A %set.</span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="comment"> * @param __y A %set of the same type as @a x.</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="comment"> * @return True iff @a __x is lexicographically less than @a __y.</span></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="comment"> *</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</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="l00969"></a><span class="lineno"> 969</span> <span class="comment"> * sets. The elements must be comparable with @c <.</span></div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="comment"> *</span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="comment"> */</span></div><div class="line"><a name="l00973"></a><span class="lineno"> 973</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="l00974"></a><span class="lineno"> 974</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00975"></a><span class="lineno"><a class="line" href="a01538.html#a7f56f6da4d4f20444cbbab54a95e99e5"> 975</a></span>  operator<(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  { <span class="keywordflow">return</span> __x._M_t < __y._M_t; }</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"></span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"> /// Returns !(x == y).</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</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="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00982"></a><span class="lineno"><a class="line" href="a01538.html#a2855896e6ac169748344ed4e2f064ccb"> 982</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="comment"></span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment"> /// Returns y < x.</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</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="l00988"></a><span class="lineno"> 988</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00989"></a><span class="lineno"><a class="line" href="a01538.html#a76a6b1542f3e854da212df3a9046cd05"> 989</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> <span class="comment"></span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> <span class="comment"> /// Returns !(y < x)</span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</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="l00995"></a><span class="lineno"> 995</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00996"></a><span class="lineno"><a class="line" href="a01538.html#a5b152596ab130d1c97908b694e5fd761"> 996</a></span>  operator<=(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> <span class="comment"></span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> <span class="comment"> /// Returns !(x < y)</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</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="l01002"></a><span class="lineno"> 1002</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01003"></a><span class="lineno"><a class="line" href="a01538.html#abf5b635cc4dfc9f737e9a3933b6d7e06"> 1003</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keyword">const</span> <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> <span class="comment"></span></div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="comment"> /// See std::set::swap().</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</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="l01009"></a><span class="lineno"> 1009</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01010"></a><span class="lineno"><a class="line" href="a01538.html#a9bbb29387dfd4bfad2ef30fb555f649a"> 1010</a></span>  swap(<a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __x, <a class="code" href="a07736.html">set<_Key, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  { __x.swap(__y); }</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> </div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> </div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="comment">// Allow std::set access to internals of compatible sets.</span></div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _Cmp1, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Cmp2></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keyword">struct</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  _Rb_tree_merge_helper<_GLIBCXX_STD_C::set<_Val, _Cmp1, _Alloc>, _Cmp2></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  {</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keyword">friend</span> <span class="keyword">class </span>_GLIBCXX_STD_C::set<_Val, _Cmp1, _Alloc>;</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> </div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  _S_get_tree(_GLIBCXX_STD_C::set<_Val, _Cmp2, _Alloc>& __set)</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  { <span class="keywordflow">return</span> __set._M_t; }</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> </div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keyword">static</span> <span class="keyword">auto</span>&</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  _S_get_tree(_GLIBCXX_STD_C::multiset<_Val, _Cmp2, _Alloc>& __set)</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  { <span class="keywordflow">return</span> __set._M_t; }</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  };</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="preprocessor">#endif // C++17</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> </div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> } <span class="comment">//namespace std</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_SET_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07736_html_a0b099bbbac6aef91b91c671c3e231979"><div class="ttname"><a href="a07736.html#a0b099bbbac6aef91b91c671c3e231979">std::set::set</a></div><div class="ttdeci">set(_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a set from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00208">stl_set.h:208</a></div></div>
<div class="ttc" id="a07736_html_a907d82d36716f9e488b991958f58f6aa"><div class="ttname"><a href="a07736.html#a907d82d36716f9e488b991958f58f6aa">std::set::set</a></div><div class="ttdeci">set()=default</div><div class="ttdoc">Default constructor creates no elements.</div></div>
<div class="ttc" id="a07736_html_ad06b71a81f86eca8862b0cbc0572622c"><div class="ttname"><a href="a07736.html#ad06b71a81f86eca8862b0cbc0572622c">std::set::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00733">stl_set.h:733</a></div></div>
<div class="ttc" id="a07736_html_af5f37a9e0561eb1ae89988aaefc4476e"><div class="ttname"><a href="a07736.html#af5f37a9e0561eb1ae89988aaefc4476e">std::set::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="a00584_source.html#l00414">stl_set.h:414</a></div></div>
<div class="ttc" id="a07736_html_a9c6f4b02f2ed2c82963fce15fb3d24ee"><div class="ttname"><a href="a07736.html#a9c6f4b02f2ed2c82963fce15fb3d24ee">std::set::rbegin</a></div><div class="ttdeci">reverse_iterator rbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00362">stl_set.h:362</a></div></div>
<div class="ttc" id="a07736_html_a8e269a4d9e589df1ef1bc6df659e7a96"><div class="ttname"><a href="a07736.html#a8e269a4d9e589df1ef1bc6df659e7a96">std::set::operator=</a></div><div class="ttdeci">set & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Set list assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00316">stl_set.h:316</a></div></div>
<div class="ttc" id="a07736_html_a5d2030f67826e8bfea0b6dce51e792b7"><div class="ttname"><a href="a07736.html#a5d2030f67826e8bfea0b6dce51e792b7">std::set::cend</a></div><div class="ttdeci">iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00390">stl_set.h:390</a></div></div>
<div class="ttc" id="a07736_html_a2122b626db1a6a97c0bec69f4e766591"><div class="ttname"><a href="a07736.html#a2122b626db1a6a97c0bec69f4e766591">std::set::erase</a></div><div class="ttdeci">_GLIBCXX_ABI_TAG_CXX11 iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from a set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00654">stl_set.h:654</a></div></div>
<div class="ttc" id="a07736_html_a8ffd6bc39d7e301ec0f77568e4c531c2"><div class="ttname"><a href="a07736.html#a8ffd6bc39d7e301ec0f77568e4c531c2">std::set::operator=</a></div><div class="ttdeci">set & operator=(const set &)=default</div><div class="ttdoc">Set assignment operator.</div></div>
<div class="ttc" id="a07736_html_a9b148fa88cbd84df31e19b1d9e531724"><div class="ttname"><a href="a07736.html#a9b148fa88cbd84df31e19b1d9e531724">std::set::key_comp</a></div><div class="ttdeci">key_compare key_comp() const</div><div class="ttdoc">Returns the comparison object with which the set was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00327">stl_set.h:327</a></div></div>
<div class="ttc" id="a07736_html_a659cf2314514a8cf2d6ecc68d08bf2ca"><div class="ttname"><a href="a07736.html#a659cf2314514a8cf2d6ecc68d08bf2ca">std::set::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.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00754">stl_set.h:754</a></div></div>
<div class="ttc" id="a07736_html_ab21409945167dfbfd999f005739cbc2a"><div class="ttname"><a href="a07736.html#ab21409945167dfbfd999f005739cbc2a">std::set::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="a00584_source.html#l00419">stl_set.h:419</a></div></div>
<div class="ttc" id="a07736_html_af20eddb69820079242b06871210f9b06"><div class="ttname"><a href="a07736.html#af20eddb69820079242b06871210f9b06">std::set::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="a00584_source.html#l00775">stl_set.h:775</a></div></div>
<div class="ttc" id="a07736_html_abfcf2991ff3683e095dd11d089e7117c"><div class="ttname"><a href="a07736.html#abfcf2991ff3683e095dd11d089e7117c">std::set::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="a00584_source.html#l00814">stl_set.h:814</a></div></div>
<div class="ttc" id="a07736_html_ae0623408c438fcbe7426deb496d3fd36"><div class="ttname"><a href="a07736.html#ae0623408c438fcbe7426deb496d3fd36">std::set::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="a00584_source.html#l00810">stl_set.h:810</a></div></div>
<div class="ttc" id="a07736_html_a70c1741d5e747b2b0a3ae6217fc5906d"><div class="ttname"><a href="a07736.html#a70c1741d5e747b2b0a3ae6217fc5906d">std::set::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="a00584_source.html#l00785">stl_set.h:785</a></div></div>
<div class="ttc" id="a07736_html_a06c8c1519399c9811fd0bfe2702f5c3b"><div class="ttname"><a href="a07736.html#a06c8c1519399c9811fd0bfe2702f5c3b">std::set::set</a></div><div class="ttdeci">set(const set &__x, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended copy constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00255">stl_set.h:255</a></div></div>
<div class="ttc" id="a07736_html_a555b9e2cf15a4d3aac095883904743a8"><div class="ttname"><a href="a07736.html#a555b9e2cf15a4d3aac095883904743a8">std::set::insert</a></div><div class="ttdeci">void insert(initializer_list< value_type > __l)</div><div class="ttdoc">Attempts to insert a list of elements into the set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00578">stl_set.h:578</a></div></div>
<div class="ttc" id="a07612_html"><div class="ttname"><a href="a07612.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a17142_source.html#l00101">bits/stl_iterator.h:101</a></div></div>
<div class="ttc" id="a07736_html_a8d75c5991f7b0318f9390ed0a960a805"><div class="ttname"><a href="a07736.html#a8d75c5991f7b0318f9390ed0a960a805">std::set::const_reference</a></div><div class="ttdeci">_Alloc_traits::const_reference const_reference</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00143">stl_set.h:143</a></div></div>
<div class="ttc" id="a07736_html_a3e752147bbbb2d617e85d6a9f15cd57b"><div class="ttname"><a href="a07736.html#a3e752147bbbb2d617e85d6a9f15cd57b">std::set::value_type</a></div><div class="ttdeci">_Key value_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00121">stl_set.h:121</a></div></div>
<div class="ttc" id="a07736_html_abe856758e09628d4ec26d1e77ceee152"><div class="ttname"><a href="a07736.html#abe856758e09628d4ec26d1e77ceee152">std::set::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, const value_type &__x)</div><div class="ttdoc">Attempts to insert an element into the set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00546">stl_set.h:546</a></div></div>
<div class="ttc" id="a07736_html_af9f201350c153d3da65fe02191c0129f"><div class="ttname"><a href="a07736.html#af9f201350c153d3da65fe02191c0129f">std::set::equal_range</a></div><div class="ttdeci">std::pair< iterator, iterator > equal_range(const key_type &__x)</div><div class="ttdoc">Finds a subsequence matching given key.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00879">stl_set.h:879</a></div></div>
<div class="ttc" id="a07736_html_ab28676718c0dc84a292b8998fa943c83"><div class="ttname"><a href="a07736.html#ab28676718c0dc84a292b8998fa943c83">std::set::const_reverse_iterator</a></div><div class="ttdeci">_Rep_type::const_reverse_iterator const_reverse_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00150">stl_set.h:150</a></div></div>
<div class="ttc" id="a07736_html_a4ba764c0f23024700dfa99b600909b34"><div class="ttname"><a href="a07736.html#a4ba764c0f23024700dfa99b600909b34">std::set::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="a00584_source.html#l00820">stl_set.h:820</a></div></div>
<div class="ttc" id="a07736_html_abb253be090c388adfba1f54046c0f416"><div class="ttname"><a href="a07736.html#abb253be090c388adfba1f54046c0f416">std::set::crend</a></div><div class="ttdeci">reverse_iterator crend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00408">stl_set.h:408</a></div></div>
<div class="ttc" id="a07736_html_aae9750edc8da201383f8894b70bbda0b"><div class="ttname"><a href="a07736.html#aae9750edc8da201383f8894b70bbda0b">std::set::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="a00584_source.html#l00895">stl_set.h:895</a></div></div>
<div class="ttc" id="a07736_html_a3d51d0ac851fe6c1b5d59e3b5aacfe57"><div class="ttname"><a href="a07736.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57">std::set::const_iterator</a></div><div class="ttdeci">_Rep_type::const_iterator const_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00148">stl_set.h:148</a></div></div>
<div class="ttc" id="a07736_html_aeef30db5984855d4fc426da2aa51562f"><div class="ttname"><a href="a07736.html#aeef30db5984855d4fc426da2aa51562f">std::set::~set</a></div><div class="ttdeci">~set()=default</div></div>
<div class="ttc" id="a07736_html_a53e2535b0fb16518b7ad89cd3d6088e8"><div class="ttname"><a href="a07736.html#a53e2535b0fb16518b7ad89cd3d6088e8">std::set::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="a00584_source.html#l00844">stl_set.h:844</a></div></div>
<div class="ttc" id="a07736_html_ae1dc65477a3821784762efba7f606522"><div class="ttname"><a href="a07736.html#ae1dc65477a3821784762efba7f606522">std::set::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="a00584_source.html#l00850">stl_set.h:850</a></div></div>
<div class="ttc" id="a07736_html_a5c24e6efdb6526f5a28e7c54af8e3e15"><div class="ttname"><a href="a07736.html#a5c24e6efdb6526f5a28e7c54af8e3e15">std::set::set</a></div><div class="ttdeci">set(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Builds a set from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00191">stl_set.h:191</a></div></div>
<div class="ttc" id="a07736_html_aa73f253934bbb48e214bb21b89812cbb"><div class="ttname"><a href="a07736.html#aa73f253934bbb48e214bb21b89812cbb">std::set::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 set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00706">stl_set.h:706</a></div></div>
<div class="ttc" id="a07736_html_a8629917347e6dc60f7b778017591ac89"><div class="ttname"><a href="a07736.html#a8629917347e6dc60f7b778017591ac89">std::set::key_type</a></div><div class="ttdeci">_Key key_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00109">stl_set.h:109</a></div></div>
<div class="ttc" id="a07736_html_afaa0621475cc933cf5a668a4db9fd851"><div class="ttname"><a href="a07736.html#afaa0621475cc933cf5a668a4db9fd851">std::set::rend</a></div><div class="ttdeci">reverse_iterator rend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00371">stl_set.h:371</a></div></div>
<div class="ttc" id="a00029_html"><div class="ttname"><a href="a00029.html">initializer_list</a></div></div>
<div class="ttc" id="a07736_html_a7a35e9e918f87c423c9f1f2362151b26"><div class="ttname"><a href="a07736.html#a7a35e9e918f87c423c9f1f2362151b26">std::set::end</a></div><div class="ttdeci">iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00353">stl_set.h:353</a></div></div>
<div class="ttc" id="a07736_html_ae4eb02463d17b44a49e6d916d05548fe"><div class="ttname"><a href="a07736.html#ae4eb02463d17b44a49e6d916d05548fe">std::set::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Attempts to insert an element into the set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00488">stl_set.h:488</a></div></div>
<div class="ttc" id="a07736_html_af16da8812db504af3bbf8a682de754d6"><div class="ttname"><a href="a07736.html#af16da8812db504af3bbf8a682de754d6">std::set::emplace</a></div><div class="ttdeci">std::pair< iterator, bool > emplace(_Args &&... __args)</div><div class="ttdoc">Attempts to build and insert an element into the set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00462">stl_set.h:462</a></div></div>
<div class="ttc" id="a07736_html_aed34d26628e845f2b7e0eb45959ef0fc"><div class="ttname"><a href="a07736.html#aed34d26628e845f2b7e0eb45959ef0fc">std::set::set</a></div><div class="ttdeci">set(const _Compare &__comp, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a set with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00176">stl_set.h:176</a></div></div>
<div class="ttc" id="a07736_html_ad6674974a5ecbd2df498227c9ed63ce2"><div class="ttname"><a href="a07736.html#ad6674974a5ecbd2df498227c9ed63ce2">std::set::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Returns the allocator object with which the set was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00335">stl_set.h:335</a></div></div>
<div class="ttc" id="a07672_html"><div class="ttname"><a href="a07672.html">std::iterator</a></div><div class="ttdoc">Common iterator class.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00118">stl_iterator_base_types.h:118</a></div></div>
<div class="ttc" id="a01538_html"><div class="ttname"><a href="a01538.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a07736_html_aaf9732d21b9343b12f3117fe3b87a6f3"><div class="ttname"><a href="a07736.html#aaf9732d21b9343b12f3117fe3b87a6f3">std::set::set</a></div><div class="ttdeci">set(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="a00584_source.html#l00265">stl_set.h:265</a></div></div>
<div class="ttc" id="a07736_html_aa383fd1111f8ced96c22eacf1e42c258"><div class="ttname"><a href="a07736.html#aa383fd1111f8ced96c22eacf1e42c258">std::set::insert</a></div><div class="ttdeci">void insert(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A template function that attempts to insert a range of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00566">stl_set.h:566</a></div></div>
<div class="ttc" id="a07736_html_ae0872a3e56b0583c37aab5d20514b479"><div class="ttname"><a href="a07736.html#ae0872a3e56b0583c37aab5d20514b479">std::set::equal_range</a></div><div class="ttdeci">std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const</div><div class="ttdoc">Finds a subsequence matching given key.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00883">stl_set.h:883</a></div></div>
<div class="ttc" id="a07736_html_a2ad1ef1062ee331c848605434d1d5ef6"><div class="ttname"><a href="a07736.html#a2ad1ef1062ee331c848605434d1d5ef6">std::set::swap</a></div><div class="ttdeci">void swap(set &__x) noexcept(/*conditional */)</div><div class="ttdoc">Swaps data with another set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00441">stl_set.h:441</a></div></div>
<div class="ttc" id="a07736_html_aad7aaff6e514ff8b528c0d6138342198"><div class="ttname"><a href="a07736.html#aad7aaff6e514ff8b528c0d6138342198">std::set::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="a00584_source.html#l00889">stl_set.h:889</a></div></div>
<div class="ttc" id="a07736_html_a3d7226decb850440d394df1dafae0984"><div class="ttname"><a href="a07736.html#a3d7226decb850440d394df1dafae0984">std::set::const_pointer</a></div><div class="ttdeci">_Alloc_traits::const_pointer const_pointer</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00141">stl_set.h:141</a></div></div>
<div class="ttc" id="a07736_html_a39e7d303fb234db62a1faa6df63f4604"><div class="ttname"><a href="a07736.html#a39e7d303fb234db62a1faa6df63f4604">std::set::cbegin</a></div><div class="ttdeci">iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00381">stl_set.h:381</a></div></div>
<div class="ttc" id="a07736_html_a84c5ddf1dff1dbdb8583cfabe3605b86"><div class="ttname"><a href="a07736.html#a84c5ddf1dff1dbdb8583cfabe3605b86">std::set::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="a00584_source.html#l00424">stl_set.h:424</a></div></div>
<div class="ttc" id="a07736_html_ab7b54ee87cf04d32f163e87e1bd0b5c5"><div class="ttname"><a href="a07736.html#ab7b54ee87cf04d32f163e87e1bd0b5c5">std::set::reverse_iterator</a></div><div class="ttdeci">_Rep_type::const_reverse_iterator reverse_iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00149">stl_set.h:149</a></div></div>
<div class="ttc" id="a10156_html"><div class="ttname"><a href="a10156.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++11 allocators.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00050">ext/alloc_traits.h:50</a></div></div>
<div class="ttc" id="a07736_html_a2fbb062a8014c9444365d2bedd0ced48"><div class="ttname"><a href="a07736.html#a2fbb062a8014c9444365d2bedd0ced48">std::set::value_comp</a></div><div class="ttdeci">value_compare value_comp() const</div><div class="ttdoc">Returns the comparison object with which the set was constructed.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00331">stl_set.h:331</a></div></div>
<div class="ttc" id="a07736_html_a3cfe51976315c0c1fbe62ac14c98e1f7"><div class="ttname"><a href="a07736.html#a3cfe51976315c0c1fbe62ac14c98e1f7">std::set::allocator_type</a></div><div class="ttdeci">_Alloc allocator_type</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00124">stl_set.h:124</a></div></div>
<div class="ttc" id="a07736_html_af75595c05a003b09225a0367cbe4d468"><div class="ttname"><a href="a07736.html#af75595c05a003b09225a0367cbe4d468">std::set::erase</a></div><div class="ttdeci">size_type erase(const key_type &__x)</div><div class="ttdoc">Erases elements according to the provided key.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00684">stl_set.h:684</a></div></div>
<div class="ttc" id="a07736_html_aa748ce25c53c595cbb332058bf1841d3"><div class="ttname"><a href="a07736.html#aa748ce25c53c595cbb332058bf1841d3">std::set::crbegin</a></div><div class="ttdeci">reverse_iterator crbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00399">stl_set.h:399</a></div></div>
<div class="ttc" id="a07736_html_af168dfb4d8e0515557884b2619117c78"><div class="ttname"><a href="a07736.html#af168dfb4d8e0515557884b2619117c78">std::set::insert</a></div><div class="ttdeci">std::pair< iterator, bool > insert(const value_type &__x)</div><div class="ttdoc">Attempts to insert an element into the set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00509">stl_set.h:509</a></div></div>
<div class="ttc" id="a07736_html_ae74861993e8ffc668813a1face48447b"><div class="ttname"><a href="a07736.html#ae74861993e8ffc668813a1face48447b">std::set::begin</a></div><div class="ttdeci">iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00344">stl_set.h:344</a></div></div>
<div class="ttc" id="a07736_html_acdf4b44f5a2f222c735237d763b89eaa"><div class="ttname"><a href="a07736.html#acdf4b44f5a2f222c735237d763b89eaa">std::set::set</a></div><div class="ttdeci">set(initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a set from an initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00243">stl_set.h:243</a></div></div>
<div class="ttc" id="a07736_html_ab09384f7a9772d0e8c6175b572db898d"><div class="ttname"><a href="a07736.html#ab09384f7a9772d0e8c6175b572db898d">std::set::pointer</a></div><div class="ttdeci">_Alloc_traits::pointer pointer</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00140">stl_set.h:140</a></div></div>
<div class="ttc" id="a07736_html_a1209ccfa7ee8ec775e03282e07a4d3ab"><div class="ttname"><a href="a07736.html#a1209ccfa7ee8ec775e03282e07a4d3ab">std::set::difference_type</a></div><div class="ttdeci">_Rep_type::difference_type difference_type</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00152">stl_set.h:152</a></div></div>
<div class="ttc" id="a07736_html_ad9837325cd001566e32eb95539a8ded5"><div class="ttname"><a href="a07736.html#ad9837325cd001566e32eb95539a8ded5">std::set::size_type</a></div><div class="ttdeci">_Rep_type::size_type size_type</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00151">stl_set.h:151</a></div></div>
<div class="ttc" id="a07736_html_aaabacc65cbc611e1f48789de8da83919"><div class="ttname"><a href="a07736.html#aaabacc65cbc611e1f48789de8da83919">std::set::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="a00584_source.html#l00856">stl_set.h:856</a></div></div>
<div class="ttc" id="a07736_html"><div class="ttname"><a href="a07736.html">std::set</a></div><div class="ttdoc">A standard container made up of unique keys, which can be retrieved in logarithmic time.</div><div class="ttdef"><b>Definition:</b> <a href="a00566_source.html#l00070">stl_multiset.h:70</a></div></div>
<div class="ttc" id="a07736_html_a2d638b35695b151f99f992e5048cb58d"><div class="ttname"><a href="a07736.html#a2d638b35695b151f99f992e5048cb58d">std::set::value_compare</a></div><div class="ttdeci">_Compare value_compare</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00123">stl_set.h:123</a></div></div>
<div class="ttc" id="a00308_html"><div class="ttname"><a href="a00308.html">concept_check.h</a></div></div>
<div class="ttc" id="a01652_html"><div class="ttname"><a href="a01652.html">std::initializer_list</a></div><div class="ttdoc">initializer_list</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00047">initializer_list:47</a></div></div>
<div class="ttc" id="a07736_html_a943aa95cb4e637b9b3199cb63cd247b0"><div class="ttname"><a href="a07736.html#a943aa95cb4e637b9b3199cb63cd247b0">std::set::set</a></div><div class="ttdeci">set(const allocator_type &__a)</div><div class="ttdoc">Allocator-extended default constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00251">stl_set.h:251</a></div></div>
<div class="ttc" id="a07736_html_a5ef0930efbfe6211c06de5d4e4e7a253"><div class="ttname"><a href="a07736.html#a5ef0930efbfe6211c06de5d4e4e7a253">std::set::set</a></div><div class="ttdeci">set(set &&__x, 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="a00584_source.html#l00259">stl_set.h:259</a></div></div>
<div class="ttc" id="a07736_html_ac46165e1a88cdf7f318309c2c35f028d"><div class="ttname"><a href="a07736.html#ac46165e1a88cdf7f318309c2c35f028d">std::set::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="a00584_source.html#l00791">stl_set.h:791</a></div></div>
<div class="ttc" id="a07764_html_a91179413226db12e66346d3673b7835f"><div class="ttname"><a href="a07764.html#a91179413226db12e66346d3673b7835f">std::pair::second</a></div><div class="ttdeci">_T2 second</div><div class="ttdoc">first is a copy of the first object</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00215">stl_pair.h:215</a></div></div>
<div class="ttc" id="a07736_html_a7ef2f84268354d05e7213606d2f364c9"><div class="ttname"><a href="a07736.html#a7ef2f84268354d05e7213606d2f364c9">std::set::key_compare</a></div><div class="ttdeci">_Compare key_compare</div><div class="ttdoc">Public typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00122">stl_set.h:122</a></div></div>
<div class="ttc" id="a07736_html_ac33c85b1fbf245c21fe0965b7e7eca59"><div class="ttname"><a href="a07736.html#ac33c85b1fbf245c21fe0965b7e7eca59">std::set::set</a></div><div class="ttdeci">set(_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="a00584_source.html#l00271">stl_set.h:271</a></div></div>
<div class="ttc" id="a03660_html"><div class="ttname"><a href="a03660.html">std::is_nothrow_copy_constructible</a></div><div class="ttdoc">is_nothrow_copy_constructible</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00982">type_traits:982</a></div></div>
<div class="ttc" id="a07736_html_a9e362ba78518dfe70c4ea6159cae235a"><div class="ttname"><a href="a07736.html#a9e362ba78518dfe70c4ea6159cae235a">std::set::reference</a></div><div class="ttdeci">_Alloc_traits::reference reference</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00142">stl_set.h:142</a></div></div>
<div class="ttc" id="a07736_html_a91a143d5a364b10a3a13f6502ef0c23e"><div class="ttname"><a href="a07736.html#a91a143d5a364b10a3a13f6502ef0c23e">std::set::lower_bound</a></div><div class="ttdeci">auto lower_bound(const _Kt &__x) const -> decltype(const_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="a00584_source.html#l00826">stl_set.h:826</a></div></div>
<div class="ttc" id="a07736_html_ab67be28282428ca9d7bd2f77a5507c1a"><div class="ttname"><a href="a07736.html#ab67be28282428ca9d7bd2f77a5507c1a">std::set::iterator</a></div><div class="ttdeci">_Rep_type::const_iterator iterator</div><div class="ttdoc">Iterator-related typedefs.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00147">stl_set.h:147</a></div></div>
<div class="ttc" id="a07764_html_a198b03cffc037835dc1dc01c926ce251"><div class="ttname"><a href="a07764.html#a198b03cffc037835dc1dc01c926ce251">std::pair::first</a></div><div class="ttdeci">_T1 first</div><div class="ttdoc">second_type is the second bound type</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00214">stl_pair.h:214</a></div></div>
<div class="ttc" id="a07736_html_af9b85bc6147d2b93a7a470ab20baab1a"><div class="ttname"><a href="a07736.html#af9b85bc6147d2b93a7a470ab20baab1a">std::set::find</a></div><div class="ttdeci">const_iterator find(const key_type &__x) const</div><div class="ttdoc">Tries to locate an element in a set.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00779">stl_set.h:779</a></div></div>
<div class="ttc" id="a07736_html_ae03b8775010d8dc4709a4d34013964d7"><div class="ttname"><a href="a07736.html#ae03b8775010d8dc4709a4d34013964d7">std::set::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="a00584_source.html#l00840">stl_set.h:840</a></div></div>
<div class="ttc" id="a03880_html"><div class="ttname"><a href="a03880.html">std::is_same</a></div><div class="ttdoc">is_same</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l01286">type_traits:1286</a></div></div>
<div class="ttc" id="a07736_html_a1164f8c8d8b92b1b4be8a313cede8abe"><div class="ttname"><a href="a07736.html#a1164f8c8d8b92b1b4be8a313cede8abe">std::set::count</a></div><div class="ttdeci">size_type count(const key_type &__x) const</div><div class="ttdoc">Finds the number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00584_source.html#l00748">stl_set.h:748</a></div></div>
<div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
</div><!-- 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="a00584.html">stl_set.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
535
