<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.3"/>
<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="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</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 style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.3 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('a01509_source.html','');});
</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="a01509.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, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// 2011 Free Software Foundation, Inc.</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</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="l00007"></a><span class="lineno"> 7</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// any later version.</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// GNU General Public License for more details.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</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"> *</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Copyright (c) 1994</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * Hewlett-Packard Company</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * representations about the suitability of this software for any</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</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"> *</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Copyright (c) 1996,1997</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * representations about the suitability of this software for any</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</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"></span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">/** @file bits/stl_set.h</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * Do not attempt to use it directly. @headername{set}</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#ifndef _STL_SET_H</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor"></span><span class="preprocessor">#define _STL_SET_H 1</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a01052.html">bits/concept_check.h</a>></span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor"></span><span class="preprocessor">#include <<a class="code" href="a01239.html">initializer_list</a>></span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> {</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> <span class="comment"></span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * @brief A standard container made up of unique keys, which can be</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * retrieved in logarithmic time.</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"> * @ingroup associative_containers</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and an</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * <a href="tables.html#69">associative container</a> (using unique keys).</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * Sets support bidirectional iterators.</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * @tparam _Key Type of key objects.</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * @tparam _Compare Comparison function object type, defaults to less<Key>.</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<Key>.</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * The private tree data is declared exactly the same way for set and</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * multiset; the distinction is made entirely in how the tree functions are</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * called (*_unique versus *_equal, same as the standard).</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</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="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">typename</span> _Alloc = std::allocator<_Key> ></div>
<div class="line"><a name="l00091"></a><span class="lineno"><a class="code" href="a00468.html"> 91</a></span>  <span class="keyword">class </span><a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set</a></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// concept requirements</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  __glibcxx_class_requires(_Key, _SGIAssignableConcept)</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  __glibcxx_class_requires4(_Compare, <span class="keywordtype">bool</span>, _Key, _Key,</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  _BinaryFunctionConcept)</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept)</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// typedefs:</span><span class="comment"></span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> //@{</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"></span><span class="comment"> /// Public typedefs.</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"><a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89"> 104</a></span> <span class="comment"></span> <span class="keyword">typedef</span> _Key <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>;</div>
<div class="line"><a name="l00105"></a><span class="lineno"><a class="code" href="a00468.html#a3e752147bbbb2d617e85d6a9f15cd57b"> 105</a></span>  <span class="keyword">typedef</span> _Key <a class="code" href="a00468.html#a3e752147bbbb2d617e85d6a9f15cd57b" title="Public typedefs.">value_type</a>;</div>
<div class="line"><a name="l00106"></a><span class="lineno"><a class="code" href="a00468.html#a7ef2f84268354d05e7213606d2f364c9"> 106</a></span>  <span class="keyword">typedef</span> _Compare <a class="code" href="a00468.html#a7ef2f84268354d05e7213606d2f364c9" title="Public typedefs.">key_compare</a>;</div>
<div class="line"><a name="l00107"></a><span class="lineno"><a class="code" href="a00468.html#a2d638b35695b151f99f992e5048cb58d"> 107</a></span>  <span class="keyword">typedef</span> _Compare <a class="code" href="a00468.html#a2d638b35695b151f99f992e5048cb58d" title="Public typedefs.">value_compare</a>;</div>
<div class="line"><a name="l00108"></a><span class="lineno"><a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7"> 108</a></span>  <span class="keyword">typedef</span> _Alloc <a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7" title="Public typedefs.">allocator_type</a>;<span class="comment"></span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> //@}</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"></span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">private</span>:</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<_Key>::other _Key_alloc_type;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typedef</span> _Rb_tree<key_type, value_type, _Identity<value_type>,</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <a class="code" href="a00468.html#a7ef2f84268354d05e7213606d2f364c9" title="Public typedefs.">key_compare</a>, _Key_alloc_type> _Rep_type;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  _Rep_type _M_t; <span class="comment">// Red-black tree representing set.</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">public</span>:<span class="comment"></span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> //@{</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"></span><span class="comment"> /// Iterator-related typedefs.</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"><a class="code" href="a00468.html#a5c75bebdcbe727e8fe85ede5351301e1"> 121</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Key_alloc_type::pointer <a class="code" href="a00468.html#a5c75bebdcbe727e8fe85ede5351301e1" title="Iterator-related typedefs.">pointer</a>;</div>
<div class="line"><a name="l00122"></a><span class="lineno"><a class="code" href="a00468.html#a178eef3559480df0b22e516a4f0ee812"> 122</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Key_alloc_type::const_pointer <a class="code" href="a00468.html#a178eef3559480df0b22e516a4f0ee812" title="Iterator-related typedefs.">const_pointer</a>;</div>
<div class="line"><a name="l00123"></a><span class="lineno"><a class="code" href="a00468.html#a4492a01e04b7e235eadec66eb4154874"> 123</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Key_alloc_type::reference <a class="code" href="a00468.html#a4492a01e04b7e235eadec66eb4154874" title="Iterator-related typedefs.">reference</a>;</div>
<div class="line"><a name="l00124"></a><span class="lineno"><a class="code" href="a00468.html#a4fae7e0a321bd1c0e67603c9764bb890"> 124</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Key_alloc_type::const_reference <a class="code" href="a00468.html#a4fae7e0a321bd1c0e67603c9764bb890" title="Iterator-related typedefs.">const_reference</a>;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// DR 103. set::iterator is required to be modifiable,</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// but this allows modification of keys.</span></div>
<div class="line"><a name="l00128"></a><span class="lineno"><a class="code" href="a00468.html#ab67be28282428ca9d7bd2f77a5507c1a"> 128</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator <a class="code" href="a00468.html#ab67be28282428ca9d7bd2f77a5507c1a" title="Iterator-related typedefs.">iterator</a>;</div>
<div class="line"><a name="l00129"></a><span class="lineno"><a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57"> 129</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator <a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a>;</div>
<div class="line"><a name="l00130"></a><span class="lineno"><a class="code" href="a00468.html#ab7b54ee87cf04d32f163e87e1bd0b5c5"> 130</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00906.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a00468.html#ab7b54ee87cf04d32f163e87e1bd0b5c5" title="Iterator-related typedefs.">reverse_iterator</a>;</div>
<div class="line"><a name="l00131"></a><span class="lineno"><a class="code" href="a00468.html#ab28676718c0dc84a292b8998fa943c83"> 131</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00906.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a00468.html#ab28676718c0dc84a292b8998fa943c83" title="Iterator-related typedefs.">const_reverse_iterator</a>;</div>
<div class="line"><a name="l00132"></a><span class="lineno"><a class="code" href="a00468.html#ad9837325cd001566e32eb95539a8ded5"> 132</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::size_type <a class="code" href="a00468.html#ad9837325cd001566e32eb95539a8ded5" title="Iterator-related typedefs.">size_type</a>;</div>
<div class="line"><a name="l00133"></a><span class="lineno"><a class="code" href="a00468.html#a1209ccfa7ee8ec775e03282e07a4d3ab"> 133</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::difference_type <a class="code" href="a00468.html#a1209ccfa7ee8ec775e03282e07a4d3ab" title="Iterator-related typedefs.">difference_type</a>;<span class="comment"></span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> //@}</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"></span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// allocation/deallocation</span><span class="comment"></span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00140"></a><span class="lineno"><a class="code" href="a00468.html#ae9620ab923754bc313da0a8cc76a5cde"> 140</a></span>  <span class="keyword">set</span>()</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  : _M_t() { }</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"></span></div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> * @brief Creates a %set with no elements.</span></div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> * @param __comp Comparator to use.</span></div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> * @param __a An allocator object.</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">explicit</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"><a class="code" href="a00468.html#aed34d26628e845f2b7e0eb45959ef0fc"> 149</a></span>  <span class="keyword">set</span>(<span class="keyword">const</span> _Compare& __comp,</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">const</span> <a class="code" href="a00426.html" title="The standard allocator, as per [20.4].">allocator_type</a>& __a = <a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7" title="Public typedefs.">allocator_type</a>())</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  : _M_t(__comp, _Key_alloc_type(__a)) { }</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"></span></div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> * @brief Builds a %set from a range.</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> * @param __first An input iterator.</span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> * @param __last An input iterator.</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * Create a %set consisting of copies of the elements from</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * [__first,__last). This is linear in N if the range is</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * already sorted, and NlogN otherwise (where N is</span></div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * distance(__first,__last)).</span></div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div>
<div class="line"><a name="l00164"></a><span class="lineno"><a class="code" href="a00468.html#a5c24e6efdb6526f5a28e7c54af8e3e15"> 164</a></span>  <span class="keyword">set</span>(_InputIterator __first, _InputIterator __last)</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  : _M_t()</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  { _M_t._M_insert_unique(__first, __last); }</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"></span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> * @brief Builds a %set from a range.</span></div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> * @param __first An input iterator.</span></div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> * @param __last An input iterator.</span></div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> * @param __comp A comparison functor.</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="comment"> * Create a %set consisting of copies of the elements from</span></div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> * [__first,__last). This is linear in N if the range is</span></div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> * already sorted, and NlogN otherwise (where N is</span></div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> * distance(__first,__last)).</span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div>
<div class="line"><a name="l00181"></a><span class="lineno"><a class="code" href="a00468.html#a0b099bbbac6aef91b91c671c3e231979"> 181</a></span>  <span class="keyword">set</span>(_InputIterator __first, _InputIterator __last,</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">const</span> _Compare& __comp,</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">const</span> <a class="code" href="a00426.html" title="The standard allocator, as per [20.4].">allocator_type</a>& __a = <a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7" title="Public typedefs.">allocator_type</a>())</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  : _M_t(__comp, _Key_alloc_type(__a))</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  { _M_t._M_insert_unique(__first, __last); }</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"></span></div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @brief %Set copy constructor.</span></div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * @param __x A %set of identical element and allocator types.</span></div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * The newly-created %set uses a copy of the allocation object used</span></div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> * by @a __x.</span></div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00194"></a><span class="lineno"><a class="code" href="a00468.html#a55ad8220eb27334c32663e81c84f4966"> 194</a></span>  <span class="keyword">set</span>(<span class="keyword">const</span> <span class="keyword">set</span>& __x)</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  : _M_t(__x._M_t) { }</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="preprocessor"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * @brief %Set move constructor</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> * @param __x A %set of identical element and allocator types.</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"> * The newly-created %set contains the exact contents of @a x.</span></div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> * The contents of @a x are a valid, but unspecified %set.</span></div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00205"></a><span class="lineno"><a class="code" href="a00468.html#a5c56d92a8311d7951ac6c66acec97a1e"> 205</a></span>  <span class="keyword">set</span>(<span class="keyword">set</span>&& __x)</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  noexcept(<a class="code" href="a00771.html" title="is_nothrow_copy_constructible">is_nothrow_copy_constructible<_Compare>::value</a>)</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  : _M_t(std::move(__x._M_t)) { }</div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"></span></div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * @brief Builds a %set from an initializer_list.</span></div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> * @param __l An initializer_list.</span></div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> * @param __comp A comparison functor.</span></div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> * @param __a An allocator object.</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"> * Create a %set consisting of copies of the elements in the list.</span></div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> * This is linear in N if the list is already sorted, and NlogN</span></div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * otherwise (where N is @a __l.size()).</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"><a class="code" href="a00468.html#acdf4b44f5a2f222c735237d763b89eaa"> 219</a></span>  <span class="keyword">set</span>(<a class="code" href="a00727.html" title="initializer_list">initializer_list<value_type></a> __l,</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keyword">const</span> _Compare& __comp = _Compare(),</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> <a class="code" href="a00426.html" title="The standard allocator, as per [20.4].">allocator_type</a>& __a = <a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7" title="Public typedefs.">allocator_type</a>())</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  : _M_t(__comp, _Key_alloc_type(__a))</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  { _M_t._M_insert_unique(__l.begin(), __l.end()); }</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> * @brief %Set assignment operator.</span></div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"> * @param __x A %set of identical element and allocator types.</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> * All the elements of @a __x are copied, but unlike the copy</span></div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"> * constructor, the allocator object is not copied.</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="keyword">set</span>&</div>
<div class="line"><a name="l00234"></a><span class="lineno"><a class="code" href="a00468.html#af3f30ac5b858d8ee1959ec8852083073"> 234</a></span>  <a class="code" href="a00468.html#af3f30ac5b858d8ee1959ec8852083073" title="Set assignment operator.">operator=</a>(<span class="keyword">const</span> <span class="keyword">set</span>& __x)</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  {</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  _M_t = __x._M_t;</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="preprocessor"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> * @brief %Set move assignment operator.</span></div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment"> * @param __x A %set of identical element and allocator types.</span></div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> * The contents of @a __x are moved into this %set (without copying).</span></div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> * @a __x is a valid, but unspecified %set.</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">set</span>&</div>
<div class="line"><a name="l00249"></a><span class="lineno"><a class="code" href="a00468.html#a093f0784776a14f43c176787862000ae"> 249</a></span>  <a class="code" href="a00468.html#af3f30ac5b858d8ee1959ec8852083073" title="Set assignment operator.">operator=</a>(<span class="keyword">set</span>&& __x)</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  {</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// NB: DR 1204.</span></div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// NB: DR 675.</span></div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  this-><a class="code" href="a00468.html#aa5ba8ae06431f696a32bb401c8316392">clear</a>();</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  this-><a class="code" href="a00468.html#a53b2780abb1a6f4d29368c9859cf3b5a" title="Swaps data with another set.">swap</a>(__x);</div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  }</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"></span></div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> * @brief %Set list assignment operator.</span></div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * @param __l An initializer_list.</span></div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * This function fills a %set with copies of the elements in the</span></div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> * initializer list @a __l.</span></div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> * Note that the assignment completely changes the %set and</span></div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> * that the resulting %set's size is the same as the number</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> * of elements assigned. Old data may be lost.</span></div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">set</span>&</div>
<div class="line"><a name="l00270"></a><span class="lineno"><a class="code" href="a00468.html#a8e269a4d9e589df1ef1bc6df659e7a96"> 270</a></span>  <a class="code" href="a00468.html#af3f30ac5b858d8ee1959ec8852083073" title="Set assignment operator.">operator=</a>(<a class="code" href="a00727.html" title="initializer_list">initializer_list<value_type></a> __l)</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  {</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  this-><a class="code" href="a00468.html#aa5ba8ae06431f696a32bb401c8316392">clear</a>();</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  this-><a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(__l.begin(), __l.end());</div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// accessors:</span></div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"></span></div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> /// Returns the comparison object with which the %set was constructed.</span></div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"></span> <a class="code" href="a00468.html#a7ef2f84268354d05e7213606d2f364c9" title="Public typedefs.">key_compare</a></div>
<div class="line"><a name="l00282"></a><span class="lineno"><a class="code" href="a00468.html#aebd0348aa21584e7c9cd531ba19d336c"> 282</a></span>  <a class="code" href="a00468.html#aebd0348aa21584e7c9cd531ba19d336c" title="Returns the comparison object with which the set was constructed.">key_comp</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }<span class="comment"></span></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"> /// Returns the comparison object with which the %set was constructed.</span></div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"></span> <a class="code" href="a00468.html#a2d638b35695b151f99f992e5048cb58d" title="Public typedefs.">value_compare</a></div>
<div class="line"><a name="l00286"></a><span class="lineno"><a class="code" href="a00468.html#a8834d557a6121d489472da8dd9b01ae1"> 286</a></span>  <a class="code" href="a00468.html#a8834d557a6121d489472da8dd9b01ae1" title="Returns the comparison object with which the set was constructed.">value_comp</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }<span class="comment"></span></div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"> /// Returns the allocator object with which the %set was constructed.</span></div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment"></span> <a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7" title="Public typedefs.">allocator_type</a></div>
<div class="line"><a name="l00290"></a><span class="lineno"><a class="code" href="a00468.html#a2f527216302c22a32ec656b205107020"> 290</a></span>  <a class="code" href="a00468.html#a2f527216302c22a32ec656b205107020" title="Returns the allocator object with which the set was constructed.">get_allocator</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  { <span class="keywordflow">return</span> <a class="code" href="a00468.html#a3cfe51976315c0c1fbe62ac14c98e1f7" title="Public typedefs.">allocator_type</a>(_M_t.get_allocator()); }</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"></span></div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> * to the keys.</span></div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00299"></a><span class="lineno"><a class="code" href="a00468.html#a2845ad2b648b419edba995575a1c7979"> 299</a></span>  <a class="code" href="a00468.html#a2845ad2b648b419edba995575a1c7979">begin</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"></span></div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"> * to the keys.</span></div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00308"></a><span class="lineno"><a class="code" href="a00468.html#a289af40cd3219bd03b1c2520187dab25"> 308</a></span>  <a class="code" href="a00468.html#a289af40cd3219bd03b1c2520187dab25">end</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  { <span class="keywordflow">return</span> _M_t.end(); }</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"> /**</span></div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the last</span></div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> * element in the %set. Iteration is done in descending order according</span></div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> * to the keys.</span></div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="a00906.html">reverse_iterator</a></div>
<div class="line"><a name="l00317"></a><span class="lineno"><a class="code" href="a00468.html#a3d434ebb7ecbe1d9eb6bf6b12e51c473"> 317</a></span>  <a class="code" href="a00468.html#a3d434ebb7ecbe1d9eb6bf6b12e51c473">rbegin</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"></span></div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> * last pair in the %set. Iteration is done in descending order</span></div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"> * according to the keys.</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>  <a class="code" href="a00906.html">reverse_iterator</a></div>
<div class="line"><a name="l00326"></a><span class="lineno"><a class="code" href="a00468.html#aa06efdcdc2f7724bf0b08791cccd4bff"> 326</a></span>  <a class="code" href="a00468.html#aa06efdcdc2f7724bf0b08791cccd4bff">rend</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="preprocessor"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"> * to the keys.</span></div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00336"></a><span class="lineno"><a class="code" href="a00468.html#a39e7d303fb234db62a1faa6df63f4604"> 336</a></span>  <a class="code" href="a00468.html#a39e7d303fb234db62a1faa6df63f4604">cbegin</a>() const noexcept</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</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"> /**</span></div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> * element in the %set. Iteration is done in ascending order according</span></div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> * to the keys.</span></div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00345"></a><span class="lineno"><a class="code" href="a00468.html#a5d2030f67826e8bfea0b6dce51e792b7"> 345</a></span>  <a class="code" href="a00468.html#a5d2030f67826e8bfea0b6dce51e792b7">cend</a>() const noexcept</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  { <span class="keywordflow">return</span> _M_t.end(); }</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"> /**</span></div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the last</span></div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> * element in the %set. Iteration is done in descending order according</span></div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> * to the keys.</span></div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <a class="code" href="a00906.html">reverse_iterator</a></div>
<div class="line"><a name="l00354"></a><span class="lineno"><a class="code" href="a00468.html#aa748ce25c53c595cbb332058bf1841d3"> 354</a></span>  <a class="code" href="a00468.html#aa748ce25c53c595cbb332058bf1841d3">crbegin</a>() const noexcept</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</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"> /**</span></div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"> * last pair in the %set. Iteration is done in descending order</span></div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> * according to the keys.</span></div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <a class="code" href="a00906.html">reverse_iterator</a></div>
<div class="line"><a name="l00363"></a><span class="lineno"><a class="code" href="a00468.html#abb253be090c388adfba1f54046c0f416"> 363</a></span>  <a class="code" href="a00468.html#abb253be090c388adfba1f54046c0f416">crend</a>() const noexcept</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> /// Returns true if the %set is empty.</span></div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"></span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00369"></a><span class="lineno"><a class="code" href="a00468.html#ac6ba6ea1418242a1017238ecbfd1e376"> 369</a></span>  <a class="code" href="a00468.html#ac6ba6ea1418242a1017238ecbfd1e376" title="Returns true if the set is empty.">empty</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  { <span class="keywordflow">return</span> _M_t.empty(); }</div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment"></span></div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment"> /// Returns the size of the %set.</span></div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"></span> <a class="code" href="a00468.html#ad9837325cd001566e32eb95539a8ded5" title="Iterator-related typedefs.">size_type</a></div>
<div class="line"><a name="l00374"></a><span class="lineno"><a class="code" href="a00468.html#ad110e6a86f6746027c3baa63458e3c32"> 374</a></span>  <a class="code" href="a00468.html#ad110e6a86f6746027c3baa63458e3c32" title="Returns the size of the set.">size</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  { <span class="keywordflow">return</span> _M_t.size(); }</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"></span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> /// Returns the maximum size of the %set.</span></div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"></span> <a class="code" href="a00468.html#ad9837325cd001566e32eb95539a8ded5" title="Iterator-related typedefs.">size_type</a></div>
<div class="line"><a name="l00379"></a><span class="lineno"><a class="code" href="a00468.html#acfc72c594a3d623f979be673434ea9e6"> 379</a></span>  <a class="code" href="a00468.html#acfc72c594a3d623f979be673434ea9e6" title="Returns the maximum size of the set.">max_size</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  { <span class="keywordflow">return</span> _M_t.max_size(); }</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"></span></div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> * @brief Swaps data with another %set.</span></div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> * @param __x A %set of the same element and allocator types.</span></div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> * This exchanges the elements between two sets in constant</span></div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> * time. (It is only swapping a pointer, an integer, and an</span></div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> * instance of the @c Compare type (which itself is often</span></div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> * stateless and empty), so it should be quite fast.) Note</span></div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> * that the global std::swap() function is specialized such</span></div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> * that std::swap(s1,s2) will feed to this function.</span></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="keywordtype">void</span></div>
<div class="line"><a name="l00394"></a><span class="lineno"><a class="code" href="a00468.html#a53b2780abb1a6f4d29368c9859cf3b5a"> 394</a></span>  <a class="code" href="a00468.html#a53b2780abb1a6f4d29368c9859cf3b5a" title="Swaps data with another set.">swap</a>(<span class="keyword">set</span>& __x)</div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  { _M_t.swap(__x._M_t); }</div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// insert/erase</span><span class="comment"></span></div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * @brief Attempts to insert an element into the %set.</span></div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> * @param __x Element to be inserted.</span></div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> * to the possibly inserted element, and the second is a bool</span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> * that is true if the element was actually inserted.</span></div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * This function attempts to insert an element into the %set. A %set</span></div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</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="l00407"></a><span class="lineno"> 407</span> <span class="comment"> * not already present in the %set.</span></div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> * Insertion requires logarithmic time.</span></div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, bool></a></div>
<div class="line"><a name="l00412"></a><span class="lineno"><a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78"> 412</a></span>  <a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a3e752147bbbb2d617e85d6a9f15cd57b" title="Public typedefs.">value_type</a>& __x)</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  {</div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<typename _Rep_type::iterator, bool></a> __p =</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  _M_t._M_insert_unique(__x);</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, bool></a>(__p.<a class="code" href="a00460.html#a198b03cffc037835dc1dc01c926ce251" title="second_type is the second bound type">first</a>, __p.<a class="code" href="a00460.html#a91179413226db12e66346d3673b7835f" title="first is a copy of the first object">second</a>);</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="preprocessor"></span> <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, bool></a></div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(<a class="code" href="a00468.html#a3e752147bbbb2d617e85d6a9f15cd57b" title="Public typedefs.">value_type</a>&& __x)</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  {</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<typename _Rep_type::iterator, bool></a> __p =</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  _M_t._M_insert_unique(std::move(__x));</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">return</span> <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, bool></a>(__p.<a class="code" href="a00460.html#a198b03cffc037835dc1dc01c926ce251" title="second_type is the second bound type">first</a>, __p.<a class="code" href="a00460.html#a91179413226db12e66346d3673b7835f" title="first is a copy of the first object">second</a>);</div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> * @brief Attempts to insert an element into the %set.</span></div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> * @param __position An iterator that serves as a hint as to where the</span></div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> * element should be inserted.</span></div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> * @param __x Element to be inserted.</span></div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> * @a __x (may or may not be the element passed in).</span></div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> * and thus does not return a boolean like the single-argument insert()</span></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> * does. Note that the first parameter is only a hint and can</span></div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> * potentially improve the performance of the insertion process. A bad</span></div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> * hint would cause no gains in efficiency.</span></div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"> * For more on @a hinting, see:</span></div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html</span></div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</span></div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <a class="code" href="a00468.html#ab67be28282428ca9d7bd2f77a5507c1a" title="Iterator-related typedefs.">iterator</a></div>
<div class="line"><a name="l00449"></a><span class="lineno"><a class="code" href="a00468.html#abe856758e09628d4ec26d1e77ceee152"> 449</a></span>  <a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(<a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a> __position, <span class="keyword">const</span> <a class="code" href="a00468.html#a3e752147bbbb2d617e85d6a9f15cd57b" title="Public typedefs.">value_type</a>& __x)</div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position, __x); }</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="preprocessor"></span> <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(<a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a> __position, <a class="code" href="a00468.html#a3e752147bbbb2d617e85d6a9f15cd57b" title="Public typedefs.">value_type</a>&& __x)</div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position, std::move(__x)); }</div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> * @brief A template function that attempts to insert a range</span></div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> * of elements.</span></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> * inserted.</span></div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00469"></a><span class="lineno"><a class="code" href="a00468.html#aa383fd1111f8ced96c22eacf1e42c258"> 469</a></span>  <a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(_InputIterator __first, _InputIterator __last)</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  { _M_t._M_insert_unique(__first, __last); }</div>
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span> </div>
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="preprocessor"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> * @brief Attempts to insert a list of elements into the %set.</span></div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="comment"> * @param __l A std::initializer_list<value_type> of elements</span></div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment"> * to be inserted.</span></div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00481"></a><span class="lineno"><a class="code" href="a00468.html#a555b9e2cf15a4d3aac095883904743a8"> 481</a></span>  <a class="code" href="a00468.html#af168dfb4d8e0515557884b2619117c78" title="Attempts to insert an element into the set.">insert</a>(<a class="code" href="a00727.html" title="initializer_list">initializer_list<value_type></a> __l)</div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  { this-><a class="code" href="a00468.html#a555b9e2cf15a4d3aac095883904743a8" title="Attempts to insert a list of elements into the set.">insert</a>(__l.begin(), __l.end()); }</div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="preprocessor"></span> <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment"> * @brief Erases an element from a %set.</span></div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"> * @a __position prior to the element being erased. If no such</span></div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"> * element exists, end() is returned.</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"> * This function erases an element, pointed to by the given iterator,</span></div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment"> * from a %set. Note that this function only erases the element, and</span></div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</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="l00498"></a><span class="lineno"> 498</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment"> * responsibility.</span></div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00502"></a><span class="lineno"><a class="code" href="a00468.html#a49008cc93d9740e5d3253863cbb61d54"> 502</a></span>  <a class="code" href="a00468.html#a49008cc93d9740e5d3253863cbb61d54" title="Erases an element from a set.">erase</a>(<a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a> __position)</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  { <span class="keywordflow">return</span> _M_t.erase(__position); }</div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="preprocessor"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="comment"> * @brief Erases an element from a %set.</span></div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment"> * @param position An iterator pointing to the element to be erased.</span></div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="comment"> * This function erases an element, pointed to by the given iterator,</span></div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span> <span class="comment"> * from a %set. Note that this function only erases the element, and</span></div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</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="l00512"></a><span class="lineno"> 512</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment"> * responsibility.</span></div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <a class="code" href="a00468.html#a49008cc93d9740e5d3253863cbb61d54" title="Erases an element from a set.">erase</a>(<a class="code" href="a00453.html" title="Common iterator class.">iterator</a> __position)</div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  { _M_t.erase(__position); }</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment"> * @param __x Key of element to be erased.</span></div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment"> * @return The number of elements erased.</span></div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> * This function erases all the elements located by the given key from</span></div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> * a %set.</span></div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <a class="code" href="a00468.html#ad9837325cd001566e32eb95539a8ded5" title="Iterator-related typedefs.">size_type</a></div>
<div class="line"><a name="l00532"></a><span class="lineno"><a class="code" href="a00468.html#af75595c05a003b09225a0367cbe4d468"> 532</a></span>  <a class="code" href="a00468.html#a49008cc93d9740e5d3253863cbb61d54" title="Erases an element from a set.">erase</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  { <span class="keywordflow">return</span> _M_t.erase(__x); }</div>
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div>
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span></div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="preprocessor"></span> <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from a %set.</span></div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> * erased.</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"> * @param __last Iterator pointing to the end of the range to</span></div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment"> * be erased.</span></div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment"> * @return The iterator @a __last.</span></div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="comment"> * This function erases a sequence of elements from a %set.</span></div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00553"></a><span class="lineno"><a class="code" href="a00468.html#a0d27b1ac6f5325db17081c540755accf"> 553</a></span>  <a class="code" href="a00468.html#a49008cc93d9740e5d3253863cbb61d54" title="Erases an element from a set.">erase</a>(<a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a> __first, <a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a> __last)</div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  { <span class="keywordflow">return</span> _M_t.erase(__first, __last); }</div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="preprocessor"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment"> * @brief Erases a [first,last) range of elements from a %set.</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"> * erased.</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 to</span></div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"> * be erased.</span></div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> * This function erases a sequence of elements from a %set.</span></div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <a class="code" href="a00468.html#a49008cc93d9740e5d3253863cbb61d54" title="Erases an element from a set.">erase</a>(<a class="code" href="a00453.html" title="Common iterator class.">iterator</a> __first, <a class="code" href="a00453.html" title="Common iterator class.">iterator</a> __last)</div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  { _M_t.erase(__first, __last); }</div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="preprocessor"></span><span class="comment"></span></div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"> * Erases all elements in a %set. Note that this function only erases</span></div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="comment"> * the elements, and that if the elements themselves are pointers, the</span></div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment"> * pointed-to memory is not touched in any way. Managing the pointer is</span></div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> * the user's responsibility.</span></div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00580"></a><span class="lineno"><a class="code" href="a00468.html#aa5ba8ae06431f696a32bb401c8316392"> 580</a></span>  <a class="code" href="a00468.html#aa5ba8ae06431f696a32bb401c8316392">clear</a>() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  { _M_t.clear(); }</div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> </div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// set operations:</span></div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment"></span></div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment"> * @brief Finds the number of elements.</span></div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="comment"> * @param __x Element to located.</span></div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="comment"> * @return Number of elements with specified key.</span></div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment"> * This function only makes sense for multisets; for set the result will</span></div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment"> * either be 0 (not present) or 1 (present).</span></div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <a class="code" href="a00468.html#ad9837325cd001566e32eb95539a8ded5" title="Iterator-related typedefs.">size_type</a></div>
<div class="line"><a name="l00594"></a><span class="lineno"><a class="code" href="a00468.html#a967644cc24e90c66aa71162952905878"> 594</a></span>  <a class="code" href="a00468.html#a967644cc24e90c66aa71162952905878" title="Finds the number of elements.">count</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</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="l00596"></a><span class="lineno"> 596</span> </div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// 214. set::find() missing const overload</span><span class="comment"></span></div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> //@{</span></div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> * @brief Tries to locate an element in a %set.</span></div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> * @param __x Element to be located.</span></div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * found.</span></div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> * pointing to the sought after element. If unsuccessful it returns the</span></div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</span></div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00612"></a><span class="lineno"><a class="code" href="a00468.html#af20eddb69820079242b06871210f9b06"> 612</a></span>  <a class="code" href="a00468.html#af20eddb69820079242b06871210f9b06" title="Tries to locate an element in a set.">find</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)</div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  { <span class="keywordflow">return</span> _M_t.find(__x); }</div>
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div>
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a></div>
<div class="line"><a name="l00616"></a><span class="lineno"><a class="code" href="a00468.html#afba88755f3da582c1f81662702ea1dfd"> 616</a></span>  <a class="code" href="a00468.html#af20eddb69820079242b06871210f9b06" title="Tries to locate an element in a set.">find</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x); }<span class="comment"></span></div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment"> //@}</span></div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment"></span><span class="comment"></span></div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span> <span class="comment"> //@{</span></div>
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <span class="comment"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span></div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment"> * @param __x Key to be located.</span></div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment"> * @return Iterator pointing to first element equal to or greater</span></div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment"> * than key, or end().</span></div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span> <span class="comment"> * This function returns the first element of a subsequence of elements</span></div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span></div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="comment"> * pointing to the first element that has a greater value than given key</span></div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment"> * or end() if no such element exists.</span></div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00633"></a><span class="lineno"><a class="code" href="a00468.html#ae0623408c438fcbe7426deb496d3fd36"> 633</a></span>  <a class="code" href="a00468.html#ae0623408c438fcbe7426deb496d3fd36" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)</div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  { <span class="keywordflow">return</span> _M_t.lower_bound(__x); }</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>  <a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a></div>
<div class="line"><a name="l00637"></a><span class="lineno"><a class="code" href="a00468.html#abed960c43909e26e781b8f04684692b2"> 637</a></span>  <a class="code" href="a00468.html#ae0623408c438fcbe7426deb496d3fd36" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.lower_bound(__x); }<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"></span><span class="comment"></span></div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> //@{</span></div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span></div>
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * @param __x Key to be located.</span></div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> * @return Iterator pointing to the first element</span></div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> * greater than key, or end().</span></div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="a00453.html" title="Common iterator class.">iterator</a></div>
<div class="line"><a name="l00649"></a><span class="lineno"><a class="code" href="a00468.html#ae03b8775010d8dc4709a4d34013964d7"> 649</a></span>  <a class="code" href="a00468.html#ae03b8775010d8dc4709a4d34013964d7" title="Finds the end of a subsequence matching given key.">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)</div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  { <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="a00468.html#a3d51d0ac851fe6c1b5d59e3b5aacfe57" title="Iterator-related typedefs.">const_iterator</a></div>
<div class="line"><a name="l00653"></a><span class="lineno"><a class="code" href="a00468.html#aead5df0feb273c1cdeba65dc105b2a0f"> 653</a></span>  <a class="code" href="a00468.html#ae03b8775010d8dc4709a4d34013964d7" title="Finds the end of a subsequence matching given key.">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.upper_bound(__x); }<span class="comment"></span></div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> //@}</span></div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="comment"></span><span class="comment"></span></div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="comment"> //@{</span></div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="comment"></span><span class="comment"> /**</span></div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="comment"> * @param __x Key to be located.</span></div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="comment"> * matching given key.</span></div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"> * This function is equivalent to</span></div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> * @code</span></div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="comment"> * std::make_pair(c.lower_bound(val),</span></div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span> <span class="comment"> * c.upper_bound(val))</span></div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="comment"> * @endcode</span></div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="comment"> * (but is faster than making the calls separately).</span></div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"> * This function probably only makes sense for multisets.</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>  <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, iterator></a></div>
<div class="line"><a name="l00674"></a><span class="lineno"><a class="code" href="a00468.html#af9f201350c153d3da65fe02191c0129f"> 674</a></span>  <a class="code" href="a00468.html#af9f201350c153d3da65fe02191c0129f" title="Finds a subsequence matching given key.">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)</div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  { <span class="keywordflow">return</span> _M_t.equal_range(__x); }</div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> </div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <a class="code" href="a00460.html" title="Struct holding two objects of arbitrary type.">std::pair<const_iterator, const_iterator></a></div>
<div class="line"><a name="l00678"></a><span class="lineno"><a class="code" href="a00468.html#a09816b4325300c9eab7f4d4f6559ba9d"> 678</a></span>  <a class="code" href="a00468.html#af9f201350c153d3da65fe02191c0129f" title="Finds a subsequence matching given key.">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a00468.html#a8629917347e6dc60f7b778017591ac89" title="Public typedefs.">key_type</a>& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.equal_range(__x); }<span class="comment"></span></div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> //@}</span></div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment"></span></div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</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="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  operator==(<span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_K1, _C1, _A1></a>&, <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_K1, _C1, _A1></a>&);</div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span> </div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="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="l00687"></a><span class="lineno"> 687</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  operator<(const set<_K1, _C1, _A1>&, <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_K1, _C1, _A1></a>&);</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  };</div>
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span> </div>
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="comment"></span></div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span> <span class="comment"> * @brief Set equality comparison.</span></div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span> <span class="comment"> * @param __x A %set.</span></div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="comment"> * @param __y A %set of the same type as @a x.</span></div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"> * @return True iff the size and elements of the sets are equal.</span></div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</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="l00699"></a><span class="lineno"> 699</span> <span class="comment"> * Sets are considered equivalent if their sizes are equal, and if</span></div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment"> * corresponding elements compare equal.</span></div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</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="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00704"></a><span class="lineno"><a class="code" href="a01604.html#aeed20ec23d92debc5bd1a0c0ee6c1b52"> 704</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __x,</div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  { <span class="keywordflow">return</span> __x._M_t == __y._M_t; }</div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="comment"></span></div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="comment"> /**</span></div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment"> * @brief Set ordering relation.</span></div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> * @param __x A %set.</span></div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> * @param __y A %set of the same type as @a x.</span></div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment"> * @return True iff @a __x is lexicographically less than @a __y.</span></div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span></div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment"> * maps. The elements must be comparable with @c <.</span></div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="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="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00721"></a><span class="lineno"><a class="code" href="a01604.html#a7f56f6da4d4f20444cbbab54a95e99e5"> 721</a></span>  operator<(const set<_Key, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  { <span class="keywordflow">return</span> __x._M_t < __y._M_t; }</div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="comment"></span></div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="comment"> /// Returns !(x == y).</span></div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</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="l00727"></a><span class="lineno"> 727</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00728"></a><span class="lineno"><a class="code" href="a01604.html#a2855896e6ac169748344ed4e2f064ccb"> 728</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __x,</div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="comment"></span></div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"> /// Returns y < x.</span></div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</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="l00734"></a><span class="lineno"> 734</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00735"></a><span class="lineno"><a class="code" href="a01604.html#a76a6b1542f3e854da212df3a9046cd05"> 735</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __x,</div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  { <span class="keywordflow">return</span> __y < __x; }</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"> /// Returns !(y < x)</span></div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</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="l00741"></a><span class="lineno"> 741</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00742"></a><span class="lineno"><a class="code" href="a01604.html#a5b152596ab130d1c97908b694e5fd761"> 742</a></span>  operator<=(const set<_Key, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="comment"></span></div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="comment"> /// Returns !(x < y)</span></div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</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="l00748"></a><span class="lineno"> 748</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00749"></a><span class="lineno"><a class="code" href="a01604.html#abf5b635cc4dfc9f737e9a3933b6d7e06"> 749</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __x,</div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keyword">const</span> <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment"></span></div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"> /// See std::set::swap().</span></div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</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="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00756"></a><span class="lineno"><a class="code" href="a01604.html#af10ca7908244802e2ec607aba6ede7e1"> 756</a></span>  swap(<a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __x, <a class="code" href="a00468.html" title="A standard container made up of unique keys, which can be retrieved in logarithmic time...">set<_Key, _Compare, _Alloc></a>& __y)</div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  { __x.<a class="code" href="a00468.html#a53b2780abb1a6f4d29368c9859cf3b5a" title="Swaps data with another set.">swap</a>(__y); }</div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span> } <span class="comment">//namespace std</span></div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_SET_H */</span><span class="preprocessor"></span></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_9fd2c24bcafa2f71ff52c79e6ae82b6c.html">include</a></li><li class="navelem"><a class="el" href="dir_a8d793a06dff7d8deba9ddcc28db7f7a.html">bits</a></li><li class="navelem"><a class="el" href="a01509.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.3 </li>
</ul>
</div>
</body>
</html>
