<!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.5"/>
<title>libstdc++: stl_tree.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.5 -->
</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('a01568_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_tree.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01568.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">// RB tree 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-2013 Free Software Foundation, Inc.</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1996,1997</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1994</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Hewlett-Packard Company</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">/** @file bits/stl_tree.h</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * Do not attempt to use it directly. @headername{map,set}</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#ifndef _STL_TREE_H</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor"></span><span class="preprocessor">#define _STL_TREE_H 1</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a01547.html">bits/stl_algobase.h</a>></span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#include <<a class="code" href="a01035.html">bits/allocator.h</a>></span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <<a class="code" href="a01551.html">bits/stl_function.h</a>></span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#include <<a class="code" href="a01135.html">bits/cpp_type_traits.h</a>></span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"></span><span class="preprocessor">#include <<a class="code" href="a01033.html">bits/alloc_traits.h</a>></span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// Red-black tree class, designed for use in implementing STL</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// associative containers (set, multiset, map, and multimap). The</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// insertion and deletion algorithms are based on those in Cormen,</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Leiserson, and Rivest, Introduction to Algorithms (MIT Press,</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// 1990), except that</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">// (1) the header cell is maintained with links not only to the root</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// but also to the leftmost node of the tree, to enable constant</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// time begin(), and to the rightmost node of the tree, to enable</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// linear time performance when used with the generic set algorithms</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// (set_union, etc.)</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">// (2) when a node being deleted has two children its successor node</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// is relinked into its place, rather than copied, so that the only</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// iterators invalidated are those referring to the deleted node.</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">enum</span> _Rb_tree_color { _S_red = <span class="keyword">false</span>, _S_black = <span class="keyword">true</span> };</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">struct </span>_Rb_tree_node_base</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="keyword">typedef</span> _Rb_tree_node_base* _Base_ptr;</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Rb_tree_node_base* _Const_Base_ptr;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  _Rb_tree_color _M_color;</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  _Base_ptr _M_parent;</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  _Base_ptr _M_left;</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  _Base_ptr _M_right;</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">static</span> _Base_ptr</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  _S_minimum(_Base_ptr __x)</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  {</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">while</span> (__x->_M_left != 0) __x = __x->_M_left;</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> __x;</div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">static</span> _Const_Base_ptr</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  _S_minimum(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  {</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">while</span> (__x->_M_left != 0) __x = __x->_M_left;</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> __x;</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> </div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">static</span> _Base_ptr</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  _S_maximum(_Base_ptr __x)</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="keywordflow">while</span> (__x->_M_right != 0) __x = __x->_M_right;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">return</span> __x;</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">static</span> _Const_Base_ptr</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  _S_maximum(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  {</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">while</span> (__x->_M_right != 0) __x = __x->_M_right;</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">return</span> __x;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  };</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val></div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">struct </span>_Rb_tree_node : <span class="keyword">public</span> _Rb_tree_node_base</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  {</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">typedef</span> _Rb_tree_node<_Val>* _Link_type;</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  _Val _M_value_field;</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  _Rb_tree_node(_Args&&... __args)</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  : _Rb_tree_node_base(),</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  _M_value_field(std::<a class="code" href="a01701.html#gacb5baec338e12b99cb6bddea7506c7c6">forward</a><_Args>(__args)...) { }</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="preprocessor"></span> };</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _GLIBCXX_PURE _Rb_tree_node_base*</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  _Rb_tree_increment(_Rb_tree_node_base* __x) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  _GLIBCXX_PURE <span class="keyword">const</span> _Rb_tree_node_base*</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  _Rb_tree_increment(<span class="keyword">const</span> _Rb_tree_node_base* __x) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  _GLIBCXX_PURE _Rb_tree_node_base*</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  _Rb_tree_decrement(_Rb_tree_node_base* __x) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  _GLIBCXX_PURE <span class="keyword">const</span> _Rb_tree_node_base*</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _Rb_tree_decrement(<span class="keyword">const</span> _Rb_tree_node_base* __x) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">struct </span>_Rb_tree_iterator</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">typedef</span> _Tp value_type;</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">typedef</span> _Tp& reference;</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">typedef</span> _Tp* pointer;</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">typedef</span> bidirectional_iterator_tag iterator_category;</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">typedef</span> _Rb_tree_iterator<_Tp> _Self;</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">typedef</span> _Rb_tree_node_base::_Base_ptr _Base_ptr;</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">typedef</span> _Rb_tree_node<_Tp>* _Link_type;</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  _Rb_tree_iterator()</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  : _M_node() { }</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">explicit</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  _Rb_tree_iterator(_Link_type __x)</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  : _M_node(__x) { }</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  reference</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="a01690.html#gaf84b7343bdda8ed9615cd8f5a61c5e83">operator*</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(_M_node)->_M_value_field; }</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  pointer</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  operator->()<span class="keyword"> const</span></div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <a class="code" href="a01701.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a>(static_cast<_Link_type></div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  (_M_node)->_M_value_field); }</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  _Self&</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  operator++()</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  {</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  _M_node = _Rb_tree_increment(_M_node);</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  _Self</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  operator++(<span class="keywordtype">int</span>)</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  {</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  _Self __tmp = *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  _M_node = _Rb_tree_increment(_M_node);</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  _Self&</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  operator--()</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  {</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  _M_node = _Rb_tree_decrement(_M_node);</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  _Self</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  operator--(<span class="keywordtype">int</span>)</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  {</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  _Self __tmp = *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  _M_node = _Rb_tree_decrement(_M_node);</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  operator==(<span class="keyword">const</span> _Self& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_node == __x._M_node; }</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  operator!=(<span class="keyword">const</span> _Self& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_node != __x._M_node; }</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  _Base_ptr _M_node;</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  };</div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">struct </span>_Rb_tree_const_iterator</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  {</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">typedef</span> _Tp value_type;</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp& reference;</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp* pointer;</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">typedef</span> _Rb_tree_iterator<_Tp> iterator;</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>  <span class="keyword">typedef</span> bidirectional_iterator_tag iterator_category;</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</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>  <span class="keyword">typedef</span> _Rb_tree_const_iterator<_Tp> _Self;</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">typedef</span> _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Rb_tree_node<_Tp>* _Link_type;</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  _Rb_tree_const_iterator()</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  : _M_node() { }</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">explicit</span></div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  _Rb_tree_const_iterator(_Link_type __x)</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  : _M_node(__x) { }</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  _Rb_tree_const_iterator(<span class="keyword">const</span> iterator& __it)</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  : _M_node(__it._M_node) { }</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div>
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  iterator</div>
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  _M_const_cast()<span class="keyword"> const</span></div>
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> iterator(static_cast<typename iterator::_Link_type></div>
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  (const_cast<typename iterator::_Base_ptr>(_M_node))); }</div>
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> </div>
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  reference</div>
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="a01690.html#gaf84b7343bdda8ed9615cd8f5a61c5e83">operator*</a>()<span class="keyword"> const</span></div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(_M_node)->_M_value_field; }</div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  pointer</div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  operator->()<span class="keyword"> const</span></div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <a class="code" href="a01701.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a>(static_cast<_Link_type></div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  (_M_node)->_M_value_field); }</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  _Self&</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  operator++()</div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  {</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  _M_node = _Rb_tree_increment(_M_node);</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  _Self</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  operator++(<span class="keywordtype">int</span>)</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  {</div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  _Self __tmp = *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  _M_node = _Rb_tree_increment(_M_node);</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  _Self&</div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  operator--()</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  _M_node = _Rb_tree_decrement(_M_node);</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  _Self</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  operator--(<span class="keywordtype">int</span>)</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  {</div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  _Self __tmp = *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  _M_node = _Rb_tree_decrement(_M_node);</div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  operator==(<span class="keyword">const</span> _Self& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_node == __x._M_node; }</div>
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div>
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  operator!=(<span class="keyword">const</span> _Self& __x)<span class="keyword"> const</span></div>
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_node != __x._M_node; }</div>
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  _Base_ptr _M_node;</div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  };</div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val></div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  operator==(<span class="keyword">const</span> _Rb_tree_iterator<_Val>& __x,</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">const</span> _Rb_tree_const_iterator<_Val>& __y)</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  { <span class="keywordflow">return</span> __x._M_node == __y._M_node; }</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val></div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  operator!=(<span class="keyword">const</span> _Rb_tree_iterator<_Val>& __x,</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">const</span> _Rb_tree_const_iterator<_Val>& __y)</div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  { <span class="keywordflow">return</span> __x._M_node != __y._M_node; }</div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span> </div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  _Rb_tree_insert_and_rebalance(<span class="keyword">const</span> <span class="keywordtype">bool</span> __insert_left,</div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  _Rb_tree_node_base* __x,</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  _Rb_tree_node_base* __p,</div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  _Rb_tree_node_base& __header) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  _Rb_tree_node_base*</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* <span class="keyword">const</span> __z,</div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  _Rb_tree_node_base& __header) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> </div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc = allocator<_Val> ></div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">class </span>_Rb_tree</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  {</div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<_Rb_tree_node<_Val> >::other</div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  _Node_allocator;</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">protected</span>:</div>
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">typedef</span> _Rb_tree_node_base* _Base_ptr;</div>
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Rb_tree_node_base* _Const_Base_ptr;</div>
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div>
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">typedef</span> _Key key_type;</div>
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">typedef</span> _Val value_type;</div>
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">typedef</span> value_type* pointer;</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> value_type* const_pointer;</div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">typedef</span> value_type& reference;</div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> value_type& const_reference;</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">typedef</span> _Rb_tree_node<_Val>* _Link_type;</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Rb_tree_node<_Val>* _Const_Link_type;</div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  _Node_allocator&</div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  _M_get_Node_allocator() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  { <span class="keywordflow">return</span> *<span class="keyword">static_cast<</span>_Node_allocator*<span class="keyword">></span>(&this->_M_impl); }</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  </div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> _Node_allocator&</div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  { <span class="keywordflow">return</span> *<span class="keyword">static_cast<</span><span class="keyword">const </span>_Node_allocator*<span class="keyword">></span>(&this->_M_impl); }</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  allocator_type</div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  get_allocator() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  { <span class="keywordflow">return</span> allocator_type(_M_get_Node_allocator()); }</div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">protected</span>:</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  _Link_type</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  _M_get_node()</div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  { <span class="keywordflow">return</span> _M_impl._Node_allocator::allocate(1); }</div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  _M_put_node(_Link_type __p)</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  { _M_impl._Node_allocator::deallocate(__p, 1); }</div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="preprocessor"></span> _Link_type</div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  _M_create_node(<span class="keyword">const</span> value_type& __x)</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  {</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  _Link_type __tmp = _M_get_node();</div>
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  __try</div>
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  { get_allocator().construct</div>
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  (<a class="code" href="a01701.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a>(__tmp->_M_value_field), __x); }</div>
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  __catch(...)</div>
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  {</div>
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  _M_put_node(__tmp);</div>
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  __throw_exception_again;</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div>
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div>
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  _M_destroy_node(_Link_type __p)</div>
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  {</div>
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  get_allocator().destroy(<a class="code" href="a01701.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a>(__p->_M_value_field));</div>
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  _M_put_node(__p);</div>
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</div>
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  _Link_type</div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  _M_create_node(_Args&&... __args)</div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  {</div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  _Link_type __tmp = _M_get_node();</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  __try</div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  {</div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <a class="code" href="a00446.html#a526410983f7c2688d3fd6c47d8b5bd7f">allocator_traits<_Node_allocator>::</a></div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <a class="code" href="a00446.html#a526410983f7c2688d3fd6c47d8b5bd7f"> construct</a>(_M_get_Node_allocator(), __tmp,</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  std::forward<_Args>(__args)...);</div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  __catch(...)</div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  {</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  _M_put_node(__tmp);</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  __throw_exception_again;</div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</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>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  _M_destroy_node(_Link_type __p)</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  _M_get_Node_allocator().destroy(__p);</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  _M_put_node(__p);</div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  _Link_type</div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  _M_clone_node(_Const_Link_type __x)</div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  {</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  _Link_type __tmp = _M_create_node(__x->_M_value_field);</div>
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  __tmp->_M_color = __x->_M_color;</div>
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  __tmp->_M_left = 0;</div>
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  __tmp->_M_right = 0;</div>
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">return</span> __tmp;</div>
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div>
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div>
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">protected</span>:</div>
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key_compare, </div>
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordtype">bool</span> _Is_pod_comparator = __is_pod(_Key_compare)></div>
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">struct </span>_Rb_tree_impl : <span class="keyword">public</span> _Node_allocator</div>
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  {</div>
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  _Key_compare _M_key_compare;</div>
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  _Rb_tree_node_base _M_header;</div>
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  size_type _M_node_count; <span class="comment">// Keeps track of size of tree.</span></div>
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div>
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  _Rb_tree_impl()</div>
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  : _Node_allocator(), _M_key_compare(), _M_header(),</div>
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  _M_node_count(0)</div>
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  { _M_initialize(); }</div>
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div>
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  _Rb_tree_impl(<span class="keyword">const</span> _Key_compare& __comp, <span class="keyword">const</span> _Node_allocator& __a)</div>
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),</div>
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  _M_node_count(0)</div>
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  { _M_initialize(); }</div>
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div>
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="preprocessor"></span> _Rb_tree_impl(<span class="keyword">const</span> _Key_compare& __comp, _Node_allocator&& __a)</div>
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  : _Node_allocator(std::move(__a)), _M_key_compare(__comp),</div>
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  _M_header(), _M_node_count(0)</div>
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  { _M_initialize(); }</div>
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">private</span>:</div>
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  _M_initialize()</div>
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  {</div>
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  this->_M_header._M_color = _S_red;</div>
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  this->_M_header._M_parent = 0;</div>
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  this->_M_header._M_left = &this->_M_header;</div>
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  this->_M_header._M_right = &this->_M_header;</div>
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  } </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> </div>
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  _Rb_tree_impl<_Compare> _M_impl;</div>
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> </div>
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">protected</span>:</div>
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  _Base_ptr&</div>
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  _M_root()</div>
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  { <span class="keywordflow">return</span> this->_M_impl._M_header._M_parent; }</div>
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div>
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  _Const_Base_ptr</div>
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  _M_root()<span class="keyword"> const</span></div>
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_impl._M_header._M_parent; }</div>
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div>
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  _Base_ptr&</div>
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  _M_leftmost()</div>
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  { <span class="keywordflow">return</span> this->_M_impl._M_header._M_left; }</div>
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div>
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  _Const_Base_ptr</div>
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  _M_leftmost()<span class="keyword"> const</span></div>
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_impl._M_header._M_left; }</div>
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div>
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  _Base_ptr&</div>
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  _M_rightmost()</div>
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  { <span class="keywordflow">return</span> this->_M_impl._M_header._M_right; }</div>
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> </div>
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  _Const_Base_ptr</div>
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  _M_rightmost()<span class="keyword"> const</span></div>
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_impl._M_header._M_right; }</div>
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div>
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  _Link_type</div>
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  _M_begin()</div>
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(this->_M_impl._M_header._M_parent); }</div>
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div>
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  _Const_Link_type</div>
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  _M_begin()<span class="keyword"> const</span></div>
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Const_Link_type<span class="keyword">></span></div>
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  (this->_M_impl._M_header._M_parent);</div>
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div>
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div>
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  _Link_type</div>
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  _M_end()</div>
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(&this->_M_impl._M_header); }</div>
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span> </div>
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  _Const_Link_type</div>
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  _M_end()<span class="keyword"> const</span></div>
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Const_Link_type<span class="keyword">></span>(&this->_M_impl._M_header); }</div>
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div>
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keyword">static</span> const_reference</div>
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  _S_value(_Const_Link_type __x)</div>
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  { <span class="keywordflow">return</span> __x->_M_value_field; }</div>
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div>
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keyword">static</span> <span class="keyword">const</span> _Key&</div>
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  _S_key(_Const_Link_type __x)</div>
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  { <span class="keywordflow">return</span> _KeyOfValue()(_S_value(__x)); }</div>
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div>
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">static</span> _Link_type</div>
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  _S_left(_Base_ptr __x)</div>
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(__x->_M_left); }</div>
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span> </div>
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">static</span> _Const_Link_type</div>
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  _S_left(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Const_Link_type<span class="keyword">></span>(__x->_M_left); }</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="keyword">static</span> _Link_type</div>
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  _S_right(_Base_ptr __x)</div>
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(__x->_M_right); }</div>
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span> </div>
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keyword">static</span> _Const_Link_type</div>
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  _S_right(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Const_Link_type<span class="keyword">></span>(__x->_M_right); }</div>
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> </div>
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keyword">static</span> const_reference</div>
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  _S_value(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>_Const_Link_type<span class="keyword">></span>(__x)->_M_value_field; }</div>
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div>
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">static</span> <span class="keyword">const</span> _Key&</div>
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  _S_key(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  { <span class="keywordflow">return</span> _KeyOfValue()(_S_value(__x)); }</div>
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div>
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">static</span> _Base_ptr</div>
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  _S_minimum(_Base_ptr __x)</div>
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  { <span class="keywordflow">return</span> _Rb_tree_node_base::_S_minimum(__x); }</div>
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span> </div>
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">static</span> _Const_Base_ptr</div>
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  _S_minimum(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  { <span class="keywordflow">return</span> _Rb_tree_node_base::_S_minimum(__x); }</div>
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> </div>
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">static</span> _Base_ptr</div>
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  _S_maximum(_Base_ptr __x)</div>
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  { <span class="keywordflow">return</span> _Rb_tree_node_base::_S_maximum(__x); }</div>
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div>
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keyword">static</span> _Const_Base_ptr</div>
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  _S_maximum(_Const_Base_ptr __x)</div>
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  { <span class="keywordflow">return</span> _Rb_tree_node_base::_S_maximum(__x); }</div>
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div>
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">typedef</span> _Rb_tree_iterator<value_type> iterator;</div>
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">typedef</span> _Rb_tree_const_iterator<value_type> const_iterator;</div>
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span> </div>
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keyword">typedef</span> <a class="code" href="a00967.html">std::reverse_iterator<iterator></a> reverse_iterator;</div>
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">typedef</span> <a class="code" href="a00967.html">std::reverse_iterator<const_iterator></a> const_reverse_iterator;</div>
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span> </div>
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">private</span>:</div>
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  pair<_Base_ptr, _Base_ptr></div>
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  _M_get_insert_unique_pos(<span class="keyword">const</span> key_type& __k);</div>
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div>
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  pair<_Base_ptr, _Base_ptr></div>
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  _M_get_insert_equal_pos(<span class="keyword">const</span> key_type& __k);</div>
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div>
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  pair<_Base_ptr, _Base_ptr></div>
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  _M_get_insert_hint_unique_pos(const_iterator __pos,</div>
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">const</span> key_type& __k);</div>
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span> </div>
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  pair<_Base_ptr, _Base_ptr></div>
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  _M_get_insert_hint_equal_pos(const_iterator __pos,</div>
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keyword">const</span> key_type& __k);</div>
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span> </div>
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  iterator</div>
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v);</div>
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div>
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  iterator</div>
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);</div>
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div>
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  iterator</div>
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  _M_insert_lower(_Base_ptr __y, _Arg&& __v);</div>
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div>
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  iterator</div>
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  _M_insert_equal_lower(_Arg&& __x);</div>
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span> </div>
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  iterator</div>
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  _M_insert_lower_node(_Base_ptr __p, _Link_type __z);</div>
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div>
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  iterator</div>
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  _M_insert_equal_lower_node(_Link_type __z);</div>
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="preprocessor"></span> iterator</div>
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  _M_insert_(_Base_ptr __x, _Base_ptr __y,</div>
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keyword">const</span> value_type& __v);</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>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// 233. Insertion hints in associative containers.</span></div>
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  iterator</div>
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  _M_insert_lower(_Base_ptr __y, <span class="keyword">const</span> value_type& __v);</div>
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span> </div>
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  iterator</div>
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  _M_insert_equal_lower(<span class="keyword">const</span> value_type& __x);</div>
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  _Link_type</div>
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  _M_copy(_Const_Link_type __x, _Link_type __p);</div>
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> </div>
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  _M_erase(_Link_type __x);</div>
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span> </div>
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  iterator</div>
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  _M_lower_bound(_Link_type __x, _Link_type __y,</div>
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keyword">const</span> _Key& __k);</div>
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span> </div>
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  const_iterator</div>
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,</div>
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keyword">const</span> _Key& __k) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span> </div>
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  iterator</div>
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  _M_upper_bound(_Link_type __x, _Link_type __y,</div>
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keyword">const</span> _Key& __k);</div>
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span> </div>
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  const_iterator</div>
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,</div>
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keyword">const</span> _Key& __k) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> </div>
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// allocation/deallocation</span></div>
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  _Rb_tree() { }</div>
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span> </div>
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  _Rb_tree(<span class="keyword">const</span> _Compare& __comp,</div>
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div>
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  : _M_impl(__comp, _Node_allocator(__a)) { }</div>
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div>
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  _Rb_tree(<span class="keyword">const</span> _Rb_tree& __x)</div>
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())</div>
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  {</div>
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (__x._M_root() != 0)</div>
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  {</div>
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  _M_root() = _M_copy(__x._M_begin(), _M_end());</div>
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  _M_leftmost() = _S_minimum(_M_root());</div>
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  _M_rightmost() = _S_maximum(_M_root());</div>
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  _M_impl._M_node_count = __x._M_impl._M_node_count;</div>
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div>
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div>
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> </div>
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span> <span class="preprocessor"></span> _Rb_tree(_Rb_tree&& __x);</div>
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  ~_Rb_tree() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  { _M_erase(_M_begin()); }</div>
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> </div>
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  _Rb_tree&</div>
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  operator=(<span class="keyword">const</span> _Rb_tree& __x);</div>
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span> </div>
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="comment">// Accessors.</span></div>
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  _Compare</div>
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  key_comp()<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_impl._M_key_compare; }</div>
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span> </div>
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  iterator</div>
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  { </div>
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordflow">return</span> iterator(static_cast<_Link_type></div>
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  (this->_M_impl._M_header._M_left));</div>
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div>
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span> </div>
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  const_iterator</div>
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() const _GLIBCXX_NOEXCEPT</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="keywordflow">return</span> const_iterator(static_cast<_Const_Link_type></div>
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  (this->_M_impl._M_header._M_left));</div>
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  }</div>
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span> </div>
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  iterator</div>
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  { <span class="keywordflow">return</span> iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); }</div>
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span> </div>
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  const_iterator</div>
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  { </div>
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">return</span> const_iterator(static_cast<_Const_Link_type></div>
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  (&this->_M_impl._M_header));</div>
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div>
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span> </div>
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  reverse_iterator</div>
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  rbegin() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  { <span class="keywordflow">return</span> reverse_iterator(<a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>()); }</div>
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span> </div>
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  const_reverse_iterator</div>
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  rbegin() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  { <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>()); }</div>
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span> </div>
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  reverse_iterator</div>
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  rend() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  { <span class="keywordflow">return</span> reverse_iterator(<a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>()); }</div>
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span> </div>
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  const_reverse_iterator</div>
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  rend() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  { <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>()); }</div>
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span> </div>
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  empty() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  { <span class="keywordflow">return</span> _M_impl._M_node_count == 0; }</div>
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div>
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  size_type</div>
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <a class="code" href="a01662.html#a7d6d850b7c581f119ba12205c6037635">size</a>() const _GLIBCXX_NOEXCEPT </div>
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  { <span class="keywordflow">return</span> _M_impl._M_node_count; }</div>
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span> </div>
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  size_type</div>
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  max_size() const _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  { <span class="keywordflow">return</span> _M_get_Node_allocator().max_size(); }</div>
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span> </div>
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">swap</a>(_Rb_tree& __t); </div>
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span> </div>
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="comment">// Insert/erase.</span></div>
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  pair<iterator, bool></div>
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  _M_insert_unique(_Arg&& __x);</div>
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span> </div>
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  iterator</div>
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  _M_insert_equal(_Arg&& __x);</div>
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> </div>
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  iterator</div>
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  _M_insert_unique_(const_iterator __position, _Arg&& __x);</div>
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span> </div>
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  iterator</div>
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  _M_insert_equal_(const_iterator __position, _Arg&& __x);</div>
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span> </div>
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  pair<iterator, bool></div>
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  _M_emplace_unique(_Args&&... __args);</div>
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span> </div>
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  iterator</div>
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  _M_emplace_equal(_Args&&... __args);</div>
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span> </div>
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  iterator</div>
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args);</div>
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span> </div>
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  iterator</div>
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args);</div>
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="preprocessor"></span> pair<iterator, bool></div>
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  _M_insert_unique(<span class="keyword">const</span> value_type& __x);</div>
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div>
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  iterator</div>
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  _M_insert_equal(<span class="keyword">const</span> value_type& __x);</div>
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span> </div>
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  iterator</div>
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  _M_insert_unique_(const_iterator __position, <span class="keyword">const</span> value_type& __x);</div>
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span> </div>
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  iterator</div>
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  _M_insert_equal_(const_iterator __position, <span class="keyword">const</span> value_type& __x);</div>
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div>
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  _M_insert_unique(_InputIterator __first, _InputIterator __last);</div>
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span> </div>
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div>
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  _M_insert_equal(_InputIterator __first, _InputIterator __last);</div>
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div>
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keyword">private</span>:</div>
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  _M_erase_aux(const_iterator __position);</div>
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span> </div>
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  _M_erase_aux(const_iterator __first, const_iterator __last);</div>
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span> </div>
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keyword">public</span>:</div>
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="preprocessor"></span> <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span></div>
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  _GLIBCXX_ABI_TAG_CXX11</div>
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  iterator</div>
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  erase(const_iterator __position)</div>
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  {</div>
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  const_iterator __result = __position;</div>
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  ++__result;</div>
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  _M_erase_aux(__position);</div>
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">return</span> __result._M_const_cast();</div>
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div>
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span> </div>
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="comment">// LWG 2059.</span></div>
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  _GLIBCXX_ABI_TAG_CXX11</div>
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  iterator</div>
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  erase(iterator __position)</div>
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  {</div>
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  iterator __result = __position;</div>
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  ++__result;</div>
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  _M_erase_aux(__position);</div>
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">return</span> __result;</div>
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div>
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="preprocessor"></span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  erase(iterator __position)</div>
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  { _M_erase_aux(__position); }</div>
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span> </div>
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  erase(const_iterator __position)</div>
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  { _M_erase_aux(__position); }</div>
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="preprocessor"></span> size_type</div>
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  erase(<span class="keyword">const</span> key_type& __x);</div>
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span> </div>
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="preprocessor"></span> <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span></div>
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  _GLIBCXX_ABI_TAG_CXX11</div>
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  iterator</div>
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  erase(const_iterator __first, const_iterator __last)</div>
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  {</div>
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  _M_erase_aux(__first, __last);</div>
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">return</span> __last._M_const_cast();</div>
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  }</div>
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="preprocessor"></span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  erase(iterator __first, iterator __last)</div>
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  { _M_erase_aux(__first, __last); }</div>
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span> </div>
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  erase(const_iterator __first, const_iterator __last)</div>
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  { _M_erase_aux(__first, __last); }</div>
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="preprocessor"></span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  erase(<span class="keyword">const</span> key_type* __first, <span class="keyword">const</span> key_type* __last);</div>
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span> </div>
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  clear() _GLIBCXX_NOEXCEPT</div>
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  {</div>
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  _M_erase(_M_begin());</div>
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  _M_leftmost() = _M_end();</div>
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  _M_root() = 0;</div>
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  _M_rightmost() = _M_end();</div>
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  _M_impl._M_node_count = 0;</div>
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div>
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span> </div>
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="comment">// Set operations.</span></div>
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  iterator</div>
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  find(<span class="keyword">const</span> key_type& __k);</div>
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span> </div>
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  const_iterator</div>
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  find(<span class="keyword">const</span> key_type& __k) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span> </div>
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  size_type</div>
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <a class="code" href="a01662.html#a8f6cca82d2559b11064c4eef2d292d3b">count</a>(<span class="keyword">const</span> key_type& __k) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span> </div>
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  iterator</div>
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  lower_bound(<span class="keyword">const</span> key_type& __k)</div>
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  { <span class="keywordflow">return</span> _M_lower_bound(_M_begin(), _M_end(), __k); }</div>
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span> </div>
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  const_iterator</div>
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  lower_bound(<span class="keyword">const</span> key_type& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_lower_bound(_M_begin(), _M_end(), __k); }</div>
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span> </div>
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  iterator</div>
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  upper_bound(<span class="keyword">const</span> key_type& __k)</div>
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  { <span class="keywordflow">return</span> _M_upper_bound(_M_begin(), _M_end(), __k); }</div>
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span> </div>
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  const_iterator</div>
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  upper_bound(<span class="keyword">const</span> key_type& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_upper_bound(_M_begin(), _M_end(), __k); }</div>
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span> </div>
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  pair<iterator, iterator></div>
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  equal_range(<span class="keyword">const</span> key_type& __k);</div>
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span> </div>
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  pair<const_iterator, const_iterator></div>
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  equal_range(<span class="keyword">const</span> key_type& __k) <span class="keyword">const</span>;</div>
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span> </div>
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="comment">// Debugging.</span></div>
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  __rb_verify() <span class="keyword">const</span>;</div>
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  };</div>
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div>
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  operator==(<span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  {</div>
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordflow">return</span> __x.size() == __y.size()</div>
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  && <a class="code" href="a01705.html#gad9f16258cd8b86bb63165c004cf660d5">std::equal</a>(__x.begin(), __x.end(), __y.begin());</div>
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  }</div>
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span> </div>
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  {</div>
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">return</span> <a class="code" href="a01706.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a>(__x.begin(), __x.end(), </div>
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  __y.begin(), __y.end());</div>
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  }</div>
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span> </div>
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  operator!=(<span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div>
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span> </div>
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  operator>(<span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  { <span class="keywordflow">return</span> __y < __x; }</div>
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span> </div>
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div>
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div>
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div>
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  operator>=(<span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div>
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span> </div>
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div>
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">swap</a>(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,</div>
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</div>
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  { __x.swap(__y); }</div>
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span> </div>
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  _Rb_tree(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&& __x)</div>
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  : _M_impl(__x._M_impl._M_key_compare,</div>
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  std::move(__x._M_get_Node_allocator()))</div>
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  {</div>
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (__x._M_root() != 0)</div>
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  {</div>
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  _M_root() = __x._M_root();</div>
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  _M_leftmost() = __x._M_leftmost();</div>
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  _M_rightmost() = __x._M_rightmost();</div>
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  _M_root()->_M_parent = _M_end();</div>
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span> </div>
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  __x._M_root() = 0;</div>
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  __x._M_leftmost() = __x._M_end();</div>
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  __x._M_rightmost() = __x._M_end();</div>
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span> </div>
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  this->_M_impl._M_node_count = __x._M_impl._M_node_count;</div>
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  __x._M_impl._M_node_count = 0;</div>
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  }</div>
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  }</div>
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&</div>
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  operator=(<span class="keyword">const</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)</div>
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  {</div>
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> != &__x)</div>
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  {</div>
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="comment">// Note that _Key may be a constant type.</span></div>
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  clear();</div>
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  _M_impl._M_key_compare = __x._M_impl._M_key_compare;</div>
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keywordflow">if</span> (__x._M_root() != 0)</div>
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  {</div>
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  _M_root() = _M_copy(__x._M_begin(), _M_end());</div>
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  _M_leftmost() = _S_minimum(_M_root());</div>
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  _M_rightmost() = _S_maximum(_M_root());</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  _M_impl._M_node_count = __x._M_impl._M_node_count;</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  }</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  }</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> </div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> <span class="preprocessor"></span> <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> <span class="preprocessor"></span> _M_insert_(_Base_ptr __x, _Base_ptr __p, _Arg&& __v)</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> <span class="preprocessor"></span> _M_insert_(_Base_ptr __x, _Base_ptr __p, <span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordtype">bool</span> __insert_left = (__x != 0 || __p == _M_end()</div>
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  || _M_impl._M_key_compare(_KeyOfValue()(__v),</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  _S_key(__p)));</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> </div>
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  this->_M_impl._M_header);</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  ++_M_impl._M_node_count;</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">return</span> iterator(__z);</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  }</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> </div>
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="preprocessor"></span> <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> <span class="preprocessor"></span> _M_insert_lower(_Base_ptr __p, _Arg&& __v)</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="preprocessor"></span> _M_insert_lower(_Base_ptr __p, <span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordtype">bool</span> __insert_left = (__p == _M_end()</div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  || !_M_impl._M_key_compare(_S_key(__p),</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  _KeyOfValue()(__v)));</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> </div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> </div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,</div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  this->_M_impl._M_header);</div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  ++_M_impl._M_node_count;</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keywordflow">return</span> iterator(__z);</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  }</div>
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> </div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="preprocessor"></span> <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> <span class="preprocessor"></span> _M_insert_equal_lower(_Arg&& __v)</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="preprocessor"></span> _M_insert_equal_lower(<span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  _Link_type __x = _M_begin();</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  _Link_type __y = _M_end();</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  {</div>
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  __y = __x;</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?</div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  _S_left(__x) : _S_right(__x);</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  }</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="keywordflow">return</span> _M_insert_lower(__y, _GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> </div>
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KoV,</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  _M_copy(_Const_Link_type __x, _Link_type __p)</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  {</div>
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">// Structural copy. __x and __p must be non-null.</span></div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  _Link_type __top = _M_clone_node(__x);</div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  __top->_M_parent = __p;</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  __try</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  {</div>
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">if</span> (__x->_M_right)</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  __top->_M_right = _M_copy(_S_right(__x), __top);</div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  __p = __top;</div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  __x = _S_left(__x);</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span> </div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  {</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  _Link_type __y = _M_clone_node(__x);</div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  __p->_M_left = __y;</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  __y->_M_parent = __p;</div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">if</span> (__x->_M_right)</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  __y->_M_right = _M_copy(_S_right(__x), __y);</div>
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  __p = __y;</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  __x = _S_left(__x);</div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  }</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  }</div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  __catch(...)</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  {</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  _M_erase(__top);</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  __throw_exception_again;</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  }</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordflow">return</span> __top;</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  }</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> </div>
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  _M_erase(_Link_type __x)</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  {</div>
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="comment">// Erase without rebalancing.</span></div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  {</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  _M_erase(_S_right(__x));</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  _Link_type __y = _S_left(__x);</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  _M_destroy_node(__x);</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  __x = __y;</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  }</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  }</div>
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> </div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  _M_lower_bound(_Link_type __x, _Link_type __y,</div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keyword">const</span> _Key& __k)</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  {</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordflow">if</span> (!_M_impl._M_key_compare(_S_key(__x), __k))</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  __x = _S_right(__x);</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">return</span> iterator(__y);</div>
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  }</div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> </div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  _Compare, _Alloc>::const_iterator</div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y,</div>
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">if</span> (!_M_impl._M_key_compare(_S_key(__x), __k))</div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  __x = _S_right(__x);</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="keywordflow">return</span> const_iterator(__y);</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  }</div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> </div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  _M_upper_bound(_Link_type __x, _Link_type __y,</div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keyword">const</span> _Key& __k)</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  {</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordflow">if</span> (_M_impl._M_key_compare(__k, _S_key(__x)))</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  __x = _S_right(__x);</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keywordflow">return</span> iterator(__y);</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> </div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  _Compare, _Alloc>::const_iterator</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y,</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordflow">if</span> (_M_impl._M_key_compare(__k, _S_key(__x)))</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  __x = _S_right(__x);</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">return</span> const_iterator(__y);</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  }</div>
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> </div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  _Compare, _Alloc>::iterator,</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  _Compare, _Alloc>::iterator></div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  equal_range(<span class="keyword">const</span> _Key& __k)</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  {</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  _Link_type __x = _M_begin();</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  _Link_type __y = _M_end();</div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  {</div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="keywordflow">if</span> (_M_impl._M_key_compare(_S_key(__x), __k))</div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  __x = _S_right(__x);</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_M_impl._M_key_compare(__k, _S_key(__x)))</div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  {</div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  _Link_type __xu(__x), __yu(__y);</div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  __xu = _S_right(__xu);</div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keywordflow">return</span> pair<iterator,</div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  iterator>(_M_lower_bound(__x, __y, __k),</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  _M_upper_bound(__xu, __yu, __k));</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  }</div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  }</div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordflow">return</span> pair<iterator, iterator>(iterator(__y),</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  iterator(__y));</div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  }</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> </div>
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  _Compare, _Alloc>::const_iterator,</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  _Compare, _Alloc>::const_iterator></div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  equal_range(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  _Const_Link_type __x = _M_begin();</div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  _Const_Link_type __y = _M_end();</div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  {</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="keywordflow">if</span> (_M_impl._M_key_compare(_S_key(__x), __k))</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  __x = _S_right(__x);</div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_M_impl._M_key_compare(__k, _S_key(__x)))</div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  {</div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  _Const_Link_type __xu(__x), __yu(__y);</div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  __y = __x, __x = _S_left(__x);</div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  __xu = _S_right(__xu);</div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordflow">return</span> pair<const_iterator,</div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  const_iterator>(_M_lower_bound(__x, __y, __k),</div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  _M_upper_bound(__xu, __yu, __k));</div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  }</div>
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  }</div>
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <span class="keywordflow">return</span> pair<const_iterator, const_iterator>(const_iterator(__y),</div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  const_iterator(__y));</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  }</div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> </div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</a></div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335"> swap</a>(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)</div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  {</div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">if</span> (_M_root() == 0)</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  {</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">if</span> (__t._M_root() != 0)</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  {</div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  _M_root() = __t._M_root();</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  _M_leftmost() = __t._M_leftmost();</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  _M_rightmost() = __t._M_rightmost();</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  _M_root()->_M_parent = _M_end();</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  </div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  __t._M_root() = 0;</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  __t._M_leftmost() = __t._M_end();</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  __t._M_rightmost() = __t._M_end();</div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  }</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  }</div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__t._M_root() == 0)</div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  {</div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  __t._M_root() = _M_root();</div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  __t._M_leftmost() = _M_leftmost();</div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  __t._M_rightmost() = _M_rightmost();</div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  __t._M_root()->_M_parent = __t._M_end();</div>
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  </div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  _M_root() = 0;</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  _M_leftmost() = _M_end();</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  _M_rightmost() = _M_end();</div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  }</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  {</div>
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">std::swap</a>(_M_root(),__t._M_root());</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">std::swap</a>(_M_leftmost(),__t._M_leftmost());</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">std::swap</a>(_M_rightmost(),__t._M_rightmost());</div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  </div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  _M_root()->_M_parent = _M_end();</div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  __t._M_root()->_M_parent = __t._M_end();</div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  }</div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="comment">// No need to swap header's color as it does not change.</span></div>
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">std::swap</a>(this->_M_impl._M_node_count, __t._M_impl._M_node_count);</div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <a class="code" href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">std::swap</a>(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);</div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  </div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div>
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="comment">// 431. Swapping containers with unequal allocators.</span></div>
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  std::__alloc_swap<_Node_allocator>::</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator());</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  }</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> </div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  _Compare, _Alloc>::_Base_ptr,</div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  _Compare, _Alloc>::_Base_ptr></div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  _M_get_insert_unique_pos(<span class="keyword">const</span> key_type& __k)</div>
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  {</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="keyword">typedef</span> pair<_Base_ptr, _Base_ptr> _Res;</div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  _Link_type __x = _M_begin();</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  _Link_type __y = _M_end();</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keywordtype">bool</span> __comp = <span class="keyword">true</span>;</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  {</div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  __y = __x;</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  __comp = _M_impl._M_key_compare(__k, _S_key(__x));</div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  __x = __comp ? _S_left(__x) : _S_right(__x);</div>
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  }</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  iterator __j = iterator(__y);</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <span class="keywordflow">if</span> (__comp)</div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  {</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keywordflow">if</span> (__j == <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>())</div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keywordflow">return</span> _Res(__x, __y);</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  --__j;</div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  }</div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keywordflow">if</span> (_M_impl._M_key_compare(_S_key(__j._M_node), __k))</div>
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keywordflow">return</span> _Res(__x, __y);</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keywordflow">return</span> _Res(__j._M_node, 0);</div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  }</div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> </div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  _Compare, _Alloc>::_Base_ptr,</div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  _Compare, _Alloc>::_Base_ptr></div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  _M_get_insert_equal_pos(<span class="keyword">const</span> key_type& __k)</div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  {</div>
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keyword">typedef</span> pair<_Base_ptr, _Base_ptr> _Res;</div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  _Link_type __x = _M_begin();</div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  _Link_type __y = _M_end();</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  {</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  __y = __x;</div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  __x = _M_impl._M_key_compare(__k, _S_key(__x)) ?</div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  _S_left(__x) : _S_right(__x);</div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  }</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keywordflow">return</span> _Res(__x, __y);</div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  }</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> </div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> <span class="preprocessor"></span> pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  _Compare, _Alloc>::iterator, <span class="keywordtype">bool</span>></div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span> <span class="preprocessor"></span> _M_insert_unique(_Arg&& __v)</div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> <span class="preprocessor"></span> _M_insert_unique(<span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keyword">typedef</span> pair<iterator, bool> _Res;</div>
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  pair<_Base_ptr, _Base_ptr> __res</div>
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  = _M_get_insert_unique_pos(_KeyOfValue()(__v));</div>
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span> </div>
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keywordflow">if</span> (__res.second)</div>
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keywordflow">return</span> _Res(_M_insert_(__res.first, __res.second,</div>
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  _GLIBCXX_FORWARD(_Arg, __v)),</div>
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keyword">true</span>);</div>
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span> </div>
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  <span class="keywordflow">return</span> _Res(iterator(static_cast<_Link_type>(__res.first)), <span class="keyword">false</span>);</div>
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  }</div>
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span> </div>
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span> <span class="preprocessor"></span> <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> <span class="preprocessor"></span> _M_insert_equal(_Arg&& __v)</div>
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> <span class="preprocessor"></span> _M_insert_equal(<span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  pair<_Base_ptr, _Base_ptr> __res</div>
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  = _M_get_insert_equal_pos(_KeyOfValue()(__v));</div>
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="keywordflow">return</span> _M_insert_(__res.first, __res.second, _GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  }</div>
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> </div>
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  _Compare, _Alloc>::_Base_ptr,</div>
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  _Compare, _Alloc>::_Base_ptr></div>
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  _M_get_insert_hint_unique_pos(const_iterator __position,</div>
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keyword">const</span> key_type& __k)</div>
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  {</div>
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  iterator __pos = __position._M_const_cast();</div>
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="keyword">typedef</span> pair<_Base_ptr, _Base_ptr> _Res;</div>
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span> </div>
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <span class="comment">// end()</span></div>
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">if</span> (__pos._M_node == _M_end())</div>
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  {</div>
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  <span class="keywordflow">if</span> (<a class="code" href="a01662.html#a7d6d850b7c581f119ba12205c6037635">size</a>() > 0</div>
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))</div>
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <span class="keywordflow">return</span> _Res(0, _M_rightmost());</div>
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  <span class="keywordflow">return</span> _M_get_insert_unique_pos(__k);</div>
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  }</div>
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))</div>
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  {</div>
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="comment">// First, try before...</span></div>
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  iterator __before = __pos;</div>
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="keywordflow">if</span> (__pos._M_node == _M_leftmost()) <span class="comment">// begin()</span></div>
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  <span class="keywordflow">return</span> _Res(_M_leftmost(), _M_leftmost());</div>
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))</div>
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  {</div>
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordflow">if</span> (_S_right(__before._M_node) == 0)</div>
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  <span class="keywordflow">return</span> _Res(0, __before._M_node);</div>
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  <span class="keywordflow">return</span> _Res(__pos._M_node, __pos._M_node);</div>
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  }</div>
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <span class="keywordflow">return</span> _M_get_insert_unique_pos(__k);</div>
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  }</div>
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_M_impl._M_key_compare(_S_key(__pos._M_node), __k))</div>
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  {</div>
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="comment">// ... then try after.</span></div>
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  iterator __after = __pos;</div>
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keywordflow">if</span> (__pos._M_node == _M_rightmost())</div>
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="keywordflow">return</span> _Res(0, _M_rightmost());</div>
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))</div>
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  {</div>
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="keywordflow">if</span> (_S_right(__pos._M_node) == 0)</div>
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <span class="keywordflow">return</span> _Res(0, __pos._M_node);</div>
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="keywordflow">return</span> _Res(__after._M_node, __after._M_node);</div>
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  }</div>
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordflow">return</span> _M_get_insert_unique_pos(__k);</div>
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  }</div>
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  <span class="comment">// Equivalent keys.</span></div>
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordflow">return</span> _Res(__pos._M_node, 0);</div>
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  }</div>
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span> </div>
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span> <span class="preprocessor"></span> <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span> <span class="preprocessor"></span> _M_insert_unique_(const_iterator __position, _Arg&& __v)</div>
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> <span class="preprocessor"></span> _M_insert_unique_(const_iterator __position, <span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  pair<_Base_ptr, _Base_ptr> __res</div>
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  = _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v));</div>
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> </div>
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  <span class="keywordflow">if</span> (__res.second)</div>
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="keywordflow">return</span> _M_insert_(__res.first, __res.second,</div>
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  _GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="keywordflow">return</span> iterator(static_cast<_Link_type>(__res.first));</div>
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  }</div>
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span> </div>
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  _Compare, _Alloc>::_Base_ptr,</div>
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  _Compare, _Alloc>::_Base_ptr></div>
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  _M_get_insert_hint_equal_pos(const_iterator __position, <span class="keyword">const</span> key_type& __k)</div>
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  {</div>
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  iterator __pos = __position._M_const_cast();</div>
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  <span class="keyword">typedef</span> pair<_Base_ptr, _Base_ptr> _Res;</div>
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> </div>
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  <span class="comment">// end()</span></div>
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <span class="keywordflow">if</span> (__pos._M_node == _M_end())</div>
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  {</div>
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <span class="keywordflow">if</span> (<a class="code" href="a01662.html#a7d6d850b7c581f119ba12205c6037635">size</a>() > 0</div>
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  && !_M_impl._M_key_compare(__k, _S_key(_M_rightmost())))</div>
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="keywordflow">return</span> _Res(0, _M_rightmost());</div>
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <span class="keywordflow">return</span> _M_get_insert_equal_pos(__k);</div>
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  }</div>
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!_M_impl._M_key_compare(_S_key(__pos._M_node), __k))</div>
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  {</div>
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="comment">// First, try before...</span></div>
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  iterator __before = __pos;</div>
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <span class="keywordflow">if</span> (__pos._M_node == _M_leftmost()) <span class="comment">// begin()</span></div>
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keywordflow">return</span> _Res(_M_leftmost(), _M_leftmost());</div>
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!_M_impl._M_key_compare(__k, _S_key((--__before)._M_node)))</div>
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  {</div>
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="keywordflow">if</span> (_S_right(__before._M_node) == 0)</div>
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  <span class="keywordflow">return</span> _Res(0, __before._M_node);</div>
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <span class="keywordflow">return</span> _Res(__pos._M_node, __pos._M_node);</div>
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  }</div>
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="keywordflow">return</span> _M_get_insert_equal_pos(__k);</div>
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  }</div>
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  {</div>
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="comment">// ... then try after. </span></div>
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  iterator __after = __pos;</div>
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="keywordflow">if</span> (__pos._M_node == _M_rightmost())</div>
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordflow">return</span> _Res(0, _M_rightmost());</div>
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!_M_impl._M_key_compare(_S_key((++__after)._M_node), __k))</div>
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  {</div>
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="keywordflow">if</span> (_S_right(__pos._M_node) == 0)</div>
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keywordflow">return</span> _Res(0, __pos._M_node);</div>
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keywordflow">return</span> _Res(__after._M_node, __after._M_node);</div>
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  }</div>
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordflow">return</span> _Res(0, 0);</div>
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  }</div>
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  }</div>
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span> </div>
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div>
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> <span class="preprocessor"></span> <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> <span class="preprocessor"></span> _M_insert_equal_(const_iterator __position, _Arg&& __v)</div>
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> <span class="preprocessor"></span> _M_insert_equal_(const_iterator __position, <span class="keyword">const</span> _Val& __v)</div>
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span> <span class="preprocessor"></span> {</div>
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  pair<_Base_ptr, _Base_ptr> __res</div>
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  = _M_get_insert_hint_equal_pos(__position, _KeyOfValue()(__v));</div>
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> </div>
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  <span class="keywordflow">if</span> (__res.second)</div>
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keywordflow">return</span> _M_insert_(__res.first, __res.second,</div>
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  _GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span> </div>
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="keywordflow">return</span> _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v));</div>
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  }</div>
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span> </div>
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div>
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span> <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  _M_insert_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)</div>
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  {</div>
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="keywordtype">bool</span> __insert_left = (__x != 0 || __p == _M_end()</div>
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  || _M_impl._M_key_compare(_S_key(__z),</div>
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  _S_key(__p)));</div>
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span> </div>
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,</div>
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  this->_M_impl._M_header);</div>
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  ++_M_impl._M_node_count;</div>
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keywordflow">return</span> iterator(__z);</div>
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  }</div>
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> </div>
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  _M_insert_lower_node(_Base_ptr __p, _Link_type __z)</div>
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  {</div>
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <span class="keywordtype">bool</span> __insert_left = (__p == _M_end()</div>
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  || !_M_impl._M_key_compare(_S_key(__p),</div>
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  _S_key(__z)));</div>
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span> </div>
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,</div>
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  this->_M_impl._M_header);</div>
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  ++_M_impl._M_node_count;</div>
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">return</span> iterator(__z);</div>
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  }</div>
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span> </div>
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  _M_insert_equal_lower_node(_Link_type __z)</div>
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  {</div>
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  _Link_type __x = _M_begin();</div>
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  _Link_type __y = _M_end();</div>
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keywordflow">while</span> (__x != 0)</div>
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  {</div>
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  __y = __x;</div>
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  __x = !_M_impl._M_key_compare(_S_key(__x), _S_key(__z)) ?</div>
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  _S_left(__x) : _S_right(__x);</div>
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  }</div>
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="keywordflow">return</span> _M_insert_lower_node(__y, __z);</div>
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  }</div>
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span> </div>
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  pair<<span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  _Compare, _Alloc>::iterator, <span class="keywordtype">bool</span>></div>
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  _M_emplace_unique(_Args&&... __args)</div>
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  {</div>
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);</div>
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span> </div>
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  __try</div>
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  {</div>
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keyword">typedef</span> pair<iterator, bool> _Res;</div>
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  <span class="keyword">auto</span> __res = _M_get_insert_unique_pos(_S_key(__z));</div>
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keywordflow">if</span> (__res.second)</div>
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <span class="keywordflow">return</span> _Res(_M_insert_node(__res.first, __res.second, __z), <span class="keyword">true</span>);</div>
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  </div>
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  _M_destroy_node(__z);</div>
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  <span class="keywordflow">return</span> _Res(iterator(static_cast<_Link_type>(__res.first)), <span class="keyword">false</span>);</div>
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  }</div>
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  __catch(...)</div>
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  {</div>
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  _M_destroy_node(__z);</div>
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  __throw_exception_again;</div>
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  }</div>
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  }</div>
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span> </div>
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  _M_emplace_equal(_Args&&... __args)</div>
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  {</div>
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);</div>
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span> </div>
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  __try</div>
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  {</div>
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  <span class="keyword">auto</span> __res = _M_get_insert_equal_pos(_S_key(__z));</div>
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="keywordflow">return</span> _M_insert_node(__res.first, __res.second, __z);</div>
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  }</div>
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  __catch(...)</div>
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  {</div>
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  _M_destroy_node(__z);</div>
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  __throw_exception_again;</div>
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  }</div>
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  }</div>
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span> </div>
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args)</div>
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  {</div>
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);</div>
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> </div>
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  __try</div>
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  {</div>
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="keyword">auto</span> __res = _M_get_insert_hint_unique_pos(__pos, _S_key(__z));</div>
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span> </div>
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="keywordflow">if</span> (__res.second)</div>
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <span class="keywordflow">return</span> _M_insert_node(__res.first, __res.second, __z);</div>
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> </div>
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  _M_destroy_node(__z);</div>
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  <span class="keywordflow">return</span> iterator(static_cast<_Link_type>(__res.first));</div>
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  }</div>
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  __catch(...)</div>
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  {</div>
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  _M_destroy_node(__z);</div>
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  __throw_exception_again;</div>
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  }</div>
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  }</div>
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span> </div>
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div>
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args)</div>
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  {</div>
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);</div>
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> </div>
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  __try</div>
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  {</div>
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="keyword">auto</span> __res = _M_get_insert_hint_equal_pos(__pos, _S_key(__z));</div>
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> </div>
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  <span class="keywordflow">if</span> (__res.second)</div>
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <span class="keywordflow">return</span> _M_insert_node(__res.first, __res.second, __z);</div>
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span> </div>
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="keywordflow">return</span> _M_insert_equal_lower_node(__z);</div>
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  }</div>
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  __catch(...)</div>
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  {</div>
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  _M_destroy_node(__z);</div>
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  __throw_exception_again;</div>
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  }</div>
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  }</div>
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span> <span class="preprocessor">#endif</span></div>
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KoV,</div>
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  <span class="keyword">typename</span> _Cmp, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keyword">template</span><<span class="keyword">class</span> _II></div>
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::</div>
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  _M_insert_unique(_II __first, _II __last)</div>
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  {</div>
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div>
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  _M_insert_unique_(<a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>(), *__first);</div>
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  }</div>
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span> </div>
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KoV,</div>
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="keyword">typename</span> _Cmp, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <span class="keyword">template</span><<span class="keyword">class</span> _II></div>
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::</div>
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  _M_insert_equal(_II __first, _II __last)</div>
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  {</div>
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div>
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  _M_insert_equal_(<a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>(), *__first);</div>
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  }</div>
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> </div>
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  _M_erase_aux(const_iterator __position)</div>
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  {</div>
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  _Link_type __y =</div>
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="keyword">static_cast<</span>_Link_type<span class="keyword">></span>(_Rb_tree_rebalance_for_erase</div>
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  (const_cast<_Base_ptr>(__position._M_node),</div>
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  this->_M_impl._M_header));</div>
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  _M_destroy_node(__y);</div>
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  --_M_impl._M_node_count;</div>
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  }</div>
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span> </div>
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  _M_erase_aux(const_iterator __first, const_iterator __last)</div>
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  {</div>
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <span class="keywordflow">if</span> (__first == <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() && __last == <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div>
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  clear();</div>
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  <span class="keywordflow">else</span></div>
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <span class="keywordflow">while</span> (__first != __last)</div>
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  erase(__first++);</div>
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  }</div>
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span> </div>
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type</div>
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  erase(<span class="keyword">const</span> _Key& __x)</div>
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  {</div>
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  pair<iterator, iterator> __p = equal_range(__x);</div>
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keyword">const</span> size_type __old_size = <a class="code" href="a01662.html#a7d6d850b7c581f119ba12205c6037635">size</a>();</div>
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  erase(__p.first, __p.second);</div>
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <span class="keywordflow">return</span> __old_size - <a class="code" href="a01662.html#a7d6d850b7c581f119ba12205c6037635">size</a>();</div>
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  }</div>
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span> </div>
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="keywordtype">void</span></div>
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  erase(<span class="keyword">const</span> _Key* __first, <span class="keyword">const</span> _Key* __last)</div>
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  {</div>
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  <span class="keywordflow">while</span> (__first != __last)</div>
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  erase(*__first++);</div>
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  }</div>
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> </div>
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  _Compare, _Alloc>::iterator</div>
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  find(<span class="keyword">const</span> _Key& __k)</div>
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  {</div>
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);</div>
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  <span class="keywordflow">return</span> (__j == <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>()</div>
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  || _M_impl._M_key_compare(__k,</div>
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  _S_key(__j._M_node))) ? <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>() : __j;</div>
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  }</div>
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span> </div>
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue,</div>
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  _Compare, _Alloc>::const_iterator</div>
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</div>
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  find(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);</div>
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  <span class="keywordflow">return</span> (__j == <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>()</div>
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  || _M_impl._M_key_compare(__k, </div>
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  _S_key(__j._M_node))) ? <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>() : __j;</div>
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  }</div>
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span> </div>
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="keyword">typename</span> _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type</div>
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <a class="code" href="a01662.html#a8f6cca82d2559b11064c4eef2d292d3b">_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::</a></div>
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span> <a class="code" href="a01662.html#a8f6cca82d2559b11064c4eef2d292d3b"> count</a>(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span></div>
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  pair<const_iterator, const_iterator> __p = equal_range(__k);</div>
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="keyword">const</span> size_type __n = <a class="code" href="a01662.html#a5852ded2c7147a161b33951ef37ecba8">std::distance</a>(__p.first, __p.second);</div>
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="keywordflow">return</span> __n;</div>
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  }</div>
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span> </div>
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  _GLIBCXX_PURE <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span></div>
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  _Rb_tree_black_count(<span class="keyword">const</span> _Rb_tree_node_base* __node,</div>
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="keyword">const</span> _Rb_tree_node_base* __root) <span class="keywordflow">throw</span> ();</div>
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span> </div>
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Val, <span class="keyword">typename</span> _KeyOfValue,</div>
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div>
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="keywordtype">bool</span></div>
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify()<span class="keyword"> const</span></div>
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span> <span class="keyword"> </span>{</div>
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="keywordflow">if</span> (_M_impl._M_node_count == 0 || <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() == <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div>
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <span class="keywordflow">return</span> _M_impl._M_node_count == 0 && <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() == <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>()</div>
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  && this->_M_impl._M_header._M_left == _M_end()</div>
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  && this->_M_impl._M_header._M_right == _M_end();</div>
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span> </div>
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> __len = _Rb_tree_black_count(_M_leftmost(), _M_root());</div>
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <span class="keywordflow">for</span> (const_iterator __it = <a class="code" href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(); __it != <a class="code" href="a01662.html#a579ff3807b61f57bda29d023b3918504">end</a>(); ++__it)</div>
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  {</div>
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  _Const_Link_type __x = <span class="keyword">static_cast<</span>_Const_Link_type<span class="keyword">></span>(__it._M_node);</div>
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  _Const_Link_type __L = _S_left(__x);</div>
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  _Const_Link_type __R = _S_right(__x);</div>
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span> </div>
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="keywordflow">if</span> (__x->_M_color == _S_red)</div>
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keywordflow">if</span> ((__L && __L->_M_color == _S_red)</div>
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  || (__R && __R->_M_color == _S_red))</div>
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> </div>
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="keywordflow">if</span> (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))</div>
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  <span class="keywordflow">if</span> (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))</div>
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span> </div>
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  <span class="keywordflow">if</span> (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)</div>
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  }</div>
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span> </div>
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <span class="keywordflow">if</span> (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))</div>
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="keywordflow">if</span> (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))</div>
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  }</div>
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span> </div>
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span> _GLIBCXX_END_NAMESPACE_VERSION</div>
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span> } <span class="comment">// namespace</span></div>
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span> </div>
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span> <span class="preprocessor">#endif</span></div>
<div class="ttc" id="a01551_html"><div class="ttname"><a href="a01551.html">stl_function.h</a></div></div>
<div class="ttc" id="a01662_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01662.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initilizer_list. </div><div class="ttdef"><b>Definition:</b> <a href="a01294_source.html#l00099">initializer_list:99</a></div></div>
<div class="ttc" id="a01662_html_a8f6cca82d2559b11064c4eef2d292d3b"><div class="ttname"><a href="a01662.html#a8f6cca82d2559b11064c4eef2d292d3b">std::count</a></div><div class="ttdeci">size_t count() const noexcept</div><div class="ttdoc">Returns the number of bits which are set. </div><div class="ttdef"><b>Definition:</b> <a href="a01061_source.html#l01277">bitset:1277</a></div></div>
<div class="ttc" id="a00967_html"><div class="ttname"><a href="a00967.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a01553_source.html#l00096">stl_iterator.h:96</a></div></div>
<div class="ttc" id="a01701_html_gacb5baec338e12b99cb6bddea7506c7c6"><div class="ttname"><a href="a01701.html#gacb5baec338e12b99cb6bddea7506c7c6">std::forward</a></div><div class="ttdeci">constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept</div><div class="ttdoc">Forward an lvalue. </div><div class="ttdef"><b>Definition:</b> <a href="a01368_source.html#l00076">move.h:76</a></div></div>
<div class="ttc" id="a01662_html_a5852ded2c7147a161b33951ef37ecba8"><div class="ttname"><a href="a01662.html#a5852ded2c7147a161b33951ef37ecba8">std::distance</a></div><div class="ttdeci">iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic. </div><div class="ttdef"><b>Definition:</b> <a href="a01554_source.html#l00114">stl_iterator_base_funcs.h:114</a></div></div>
<div class="ttc" id="a01547_html"><div class="ttname"><a href="a01547.html">stl_algobase.h</a></div></div>
<div class="ttc" id="a01035_html"><div class="ttname"><a href="a01035.html">allocator.h</a></div></div>
<div class="ttc" id="a01135_html"><div class="ttname"><a href="a01135.html">cpp_type_traits.h</a></div></div>
<div class="ttc" id="a00446_html_a526410983f7c2688d3fd6c47d8b5bd7f"><div class="ttname"><a href="a00446.html#a526410983f7c2688d3fd6c47d8b5bd7f">std::allocator_traits::construct</a></div><div class="ttdeci">static auto construct(_Alloc &__a, _Tp *__p, _Args &&...__args) -> decltype(_S_construct(__a, __p, std::forward< _Args >(__args)...))</div><div class="ttdoc">Construct an object of type _Tp. </div><div class="ttdef"><b>Definition:</b> <a href="a01033_source.html#l00391">bits/alloc_traits.h:391</a></div></div>
<div class="ttc" id="a01701_html_ga145a38ffdb1e846f389c2841897665b7"><div class="ttname"><a href="a01701.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a></div><div class="ttdeci">_Tp * __addressof(_Tp &__r) noexcept</div><div class="ttdoc">Same as C++11 std::addressof. </div><div class="ttdef"><b>Definition:</b> <a href="a01368_source.html#l00047">move.h:47</a></div></div>
<div class="ttc" id="a01690_html_gaf84b7343bdda8ed9615cd8f5a61c5e83"><div class="ttname"><a href="a01690.html#gaf84b7343bdda8ed9615cd8f5a61c5e83">std::operator*</a></div><div class="ttdeci">complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)</div><div class="ttdoc">Return new complex value x times y. </div><div class="ttdef"><b>Definition:</b> <a href="a01104_source.html#l00384">complex:384</a></div></div>
<div class="ttc" id="a01662_html_a7d6d850b7c581f119ba12205c6037635"><div class="ttname"><a href="a01662.html#a7d6d850b7c581f119ba12205c6037635">std::size</a></div><div class="ttdeci">constexpr size_t size() const noexcept</div><div class="ttdoc">Returns the total number of bits. </div><div class="ttdef"><b>Definition:</b> <a href="a01061_source.html#l01282">bitset:1282</a></div></div>
<div class="ttc" id="a01662_html_aa36b65fec3dac007e5357c3fc03d0335"><div class="ttname"><a href="a01662.html#aa36b65fec3dac007e5357c3fc03d0335">std::swap</a></div><div class="ttdeci">void swap(function< _Res(_Args...)> &__x, function< _Res(_Args...)> &__y)</div><div class="ttdoc">Swap the targets of two polymorphic function object wrappers. </div><div class="ttdef"><b>Definition:</b> <a href="a01256_source.html#l02566">functional:2566</a></div></div>
<div class="ttc" id="a01662_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01662.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initilizer_list. </div><div class="ttdef"><b>Definition:</b> <a href="a01294_source.html#l00089">initializer_list:89</a></div></div>
<div class="ttc" id="a01706_html_gae179ce2d015dc0908973644687dce4c6"><div class="ttname"><a href="a01706.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a></div><div class="ttdeci">bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp)</div><div class="ttdoc">Performs dictionary comparison on ranges. </div><div class="ttdef"><b>Definition:</b> <a href="a01547_source.html#l01120">stl_algobase.h:1120</a></div></div>
<div class="ttc" id="a01033_html"><div class="ttname"><a href="a01033.html">alloc_traits.h</a></div></div>
<div class="ttc" id="a01705_html_gad9f16258cd8b86bb63165c004cf660d5"><div class="ttname"><a href="a01705.html#gad9f16258cd8b86bb63165c004cf660d5">std::equal</a></div><div class="ttdeci">bool equal(_II1 __first1, _II1 __last1, _II2 __first2)</div><div class="ttdoc">Tests a range for element-wise equality. </div><div class="ttdef"><b>Definition:</b> <a href="a01547_source.html#l01021">stl_algobase.h:1021</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_db0ecf5ff2f2b0f79bbdc6312473b0df.html">include</a></li><li class="navelem"><a class="el" href="dir_846f7197e92b1d36f31729e06f4479a1.html">bits</a></li><li class="navelem"><a class="el" href="a01568.html">stl_tree.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.5 </li>
</ul>
</div>
</body>
</html>
