<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.15"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: insert_fn_imps.hpp Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(initResizable); /* @license-end */</script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.15 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(function(){initNavTree('a16866_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">bin_search_tree_/insert_fn_imps.hpp</div> </div> </div><!--header--> <div class="contents"> <a href="a16866.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">// -*- 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) 2005-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// 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, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// 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 GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// 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">// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Permission to use, copy, modify, sell, and distribute this software</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// is hereby granted without fee, provided that the above copyright</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// notice appears in all copies, and that both that copyright notice</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// and this permission notice appear in supporting documentation. None</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// of the above authors, nor IBM Haifa Research Laboratories, make any</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// representation about the suitability of this software for any</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// purpose. It is provided "as is" without express or implied</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// warranty.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">/**</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * @file bin_search_tree_/insert_fn_imps.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation class for bin_search_tree_.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> */</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">inline</span> <a class="code" href="a07764.html">std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool></a></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> insert_leaf(const_reference r_value)</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> {</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  if (m_size == 0)</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  return <a class="code" href="a01538.html">std</a>::<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(insert_imp_empty(r_value),</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  true);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  node_pointer p_nd = m_p_head->m_p_parent;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  node_pointer p_pot = m_p_head;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  while (p_nd != 0)</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value),</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  PB_DS_V2F(r_value)))</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  p_pot = p_nd;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  p_nd = p_nd->m_p_left;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  p_nd = p_nd->m_p_right;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (p_pot == m_p_head)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(insert_leaf_new(r_value, m_p_head->m_p_right, <span class="keyword">false</span>),</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">true</span>);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">if</span> (!Cmp_Fn::operator()(PB_DS_V2F(r_value),</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  PB_DS_V2F(p_pot->m_value)))</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>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_value))</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  return <a class="code" href="a01538.html">std</a>::<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(p_pot, false);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value))</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  p_nd = p_pot->m_p_left;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  if (p_nd == 0)</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  return <a class="code" href="a01538.html">std</a>::<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(insert_leaf_new(r_value, p_pot, true),</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  true);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  while (p_nd->m_p_right != 0)</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  p_nd = p_nd->m_p_right;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  return <a class="code" href="a01538.html">std</a>::<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(insert_leaf_new(r_value, p_nd, false),</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  true);</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> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> inline typename PB_DS_CLASS_C_DEC::iterator</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> insert_leaf_new(const_reference r_value, node_pointer p_nd, <span class="keywordtype">bool</span> left_nd)</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  node_pointer p_new_nd =</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  get_new_node_for_leaf_insert(r_value,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  traits_base::m_no_throw_copies_indicator);</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="keywordflow">if</span> (left_nd)</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == 0);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  _GLIBCXX_DEBUG_ASSERT(Cmp_Fn::operator()(PB_DS_V2F(r_value),</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  PB_DS_V2F(p_nd->m_value)));</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>  p_nd->m_p_left = p_new_nd;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (m_p_head->m_p_left == p_nd)</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  m_p_head->m_p_left = p_new_nd;</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">else</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  {</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_right == 0);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  _GLIBCXX_DEBUG_ASSERT(Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value),</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  PB_DS_V2F(r_value)));</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  p_nd->m_p_right = p_new_nd;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (m_p_head->m_p_right == p_nd)</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  m_p_head->m_p_right = p_new_nd;</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>  p_new_nd->m_p_parent = p_nd;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  p_new_nd->m_p_left = p_new_nd->m_p_right = 0;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  PB_DS_ASSERT_NODE_CONSISTENT(p_nd)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  update_to_top(p_new_nd, (node_update* )<span class="keyword">this</span>);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_value));)</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">return</span> iterator(p_new_nd);</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> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="keyword">inline</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> insert_imp_empty(const_reference r_value)</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>  node_pointer p_new_node =</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  get_new_node_for_leaf_insert(r_value, traits_base::m_no_throw_copies_indicator);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  m_p_head->m_p_left = m_p_head->m_p_right =</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  m_p_head->m_p_parent = p_new_node;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  p_new_node->m_p_parent = m_p_head;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  p_new_node->m_p_left = p_new_node->m_p_right = 0;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_value));)</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  update_to_top(m_p_head->m_p_parent, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> iterator(p_new_node);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="keyword">inline</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> get_new_node_for_leaf_insert(const_reference r_val, <a class="code" href="a01476.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> {</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  node_pointer p_new_nd = s_node_allocator.allocate(1);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  cond_dealtor_t cond(p_new_nd);</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">new</span> (const_cast<void* >(static_cast<const void* >(&p_new_nd->m_value)))</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">typename</span> node::value_type(r_val);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  cond.set_no_action();</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  p_new_nd->m_p_left = p_new_nd->m_p_right = 0;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  ++m_size;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">return</span> p_new_nd;</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> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="keyword">inline</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> get_new_node_for_leaf_insert(const_reference r_val, <a class="code" href="a01476.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>)</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  node_pointer p_new_nd = s_node_allocator.allocate(1);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">new</span> (const_cast<void* >(static_cast<const void* >(&p_new_nd->m_value)))</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">typename</span> node::value_type(r_val);</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>  p_new_nd->m_p_left = p_new_nd->m_p_right = 0;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  ++m_size;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">return</span> p_new_nd;</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> }</div><div class="ttc" id="a01476_html_gaebe6729ab5488ecc76c762873d226857"><div class="ttname"><a href="a01476.html#gaebe6729ab5488ecc76c762873d226857">std::false_type</a></div><div class="ttdeci">integral_constant< bool, false > false_type</div><div class="ttdoc">The type used as a compile-time boolean with false value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00078">type_traits:78</a></div></div> <div class="ttc" id="a01477_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00524">stl_pair.h:524</a></div></div> <div class="ttc" id="a01476_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01476.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant< bool, true > true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00075">type_traits:75</a></div></div> <div class="ttc" id="a01538_html"><div class="ttname"><a href="a01538.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div> <div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_e0ca5f9b79afec9781b100dc0e5c7504.html">include</a></li><li class="navelem"><a class="el" href="dir_c6c576370364e6c6dc6e0d5668726993.html">ext</a></li><li class="navelem"><a class="el" href="dir_a0b0eb1a537ff60142a3ec273ae2293b.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_b4f9fc4af74463b4dcd1a67169afcbb0.html">detail</a></li><li class="navelem"><a class="el" href="dir_185d51ec2a2511b3a25cac96ff6f6181.html">bin_search_tree_</a></li><li class="navelem"><a class="el" href="a16866.html">insert_fn_imps.hpp</a></li> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li> </ul> </div> </body> </html>