<!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++: constructors_destructor_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('a16572_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">bin_search_tree_/constructors_destructor_fn_imps.hpp</div> </div> </div><!--header--> <div class="contents"> <a href="a16572.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_/constructors_destructor_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">typename</span> PB_DS_CLASS_C_DEC::node_allocator</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> PB_DS_CLASS_C_DEC::s_node_allocator;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> PB_DS_BIN_TREE_NAME() : m_p_head(s_node_allocator.allocate(1)), m_size(0)</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  initialize();</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</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> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> PB_DS_BIN_TREE_NAME(<span class="keyword">const</span> Cmp_Fn& r_cmp_fn) :</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  Cmp_Fn(r_cmp_fn), m_p_head(s_node_allocator.allocate(1)), m_size(0)</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>  initialize();</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</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> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> PB_DS_BIN_TREE_NAME(<span class="keyword">const</span> Cmp_Fn& r_cmp_fn, <span class="keyword">const</span> node_update& r_node_update) :</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  Cmp_Fn(r_cmp_fn),</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  node_update(r_node_update),</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  m_p_head(s_node_allocator.allocate(1)),</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  m_size(0)</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>  initialize();</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</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> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> PB_DS_BIN_TREE_NAME(<span class="keyword">const</span> PB_DS_CLASS_C_DEC& other) :</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> #ifdef _GLIBCXX_DEBUG</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  debug_base(other),</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> #endif </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> #ifdef PB_DS_TREE_TRACE</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  PB_DS_TREE_TRACE_BASE_C_DEC(other),</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> #endif </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  Cmp_Fn(other),</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  node_update(other),</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  m_p_head(s_node_allocator.allocate(1)),</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  m_size(0)</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>  initialize();</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  m_size = other.m_size;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID(other)</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>  __try</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent != 0)</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  m_p_head->m_p_parent->m_p_parent = m_p_head;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  m_size = other.m_size;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  initialize_min_max();</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  __catch(...)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  _GLIBCXX_DEBUG_ONLY(debug_base::clear();)</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  s_node_allocator.deallocate(m_p_head, 1);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  __throw_exception_again;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</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> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> swap(PB_DS_CLASS_C_DEC& other)</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>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID(other)</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  value_swap(other);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="a01538.html">std</a>::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID(other)</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> value_swap(PB_DS_CLASS_C_DEC& other)</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  _GLIBCXX_DEBUG_ONLY(debug_base::swap(other);)</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  std::swap(m_p_head, other.m_p_head);</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::swap(m_size, other.m_size);</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> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> PB_DS_CLASS_T_DEC</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> ~PB_DS_BIN_TREE_NAME()</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>  clear();</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  s_node_allocator.deallocate(m_p_head, 1);</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> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> initialize()</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  m_p_head->m_p_parent = 0;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  m_p_head->m_p_left = m_p_head;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  m_p_head->m_p_right = m_p_head;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  m_size = 0;</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> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> recursive_copy_node(<span class="keyword">const</span> node_pointer p_nd)</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="keywordflow">if</span> (p_nd == 0)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">return</span> (0);</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>  node_pointer p_ret = s_node_allocator.allocate(1);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  __try</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">new</span> (p_ret) node(*p_nd);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  __catch(...)</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>  s_node_allocator.deallocate(p_ret, 1);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  __throw_exception_again;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</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>  p_ret->m_p_left = p_ret->m_p_right = 0;</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>  __try</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>  p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);</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>  __catch(...)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  {</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  clear_imp(p_ret);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  __throw_exception_again;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">if</span> (p_ret->m_p_left != 0)</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  p_ret->m_p_left->m_p_parent = p_ret;</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>  <span class="keywordflow">if</span> (p_ret->m_p_right != 0)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  p_ret->m_p_right->m_p_parent = p_ret;</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>  PB_DS_ASSERT_NODE_CONSISTENT(p_ret)</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> p_ret;</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> initialize_min_max()</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> {</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent == 0)</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>  m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</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>  {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  node_pointer p_min = m_p_head->m_p_parent;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">while</span> (p_min->m_p_left != 0)</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  p_min = p_min->m_p_left;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  m_p_head->m_p_left = p_min;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</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>  {</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  node_pointer p_max = m_p_head->m_p_parent;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">while</span> (p_max->m_p_right != 0)</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  p_max = p_max->m_p_right;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  m_p_head->m_p_right = p_max;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </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><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="dir_afaff2f5b61f44d50c9875b428318082.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_f37d910f5ba825954160494085256009.html">detail</a></li><li class="navelem"><a class="el" href="dir_7cbb3293f490fa6a5479ac623bcc8b31.html">bin_search_tree_</a></li><li class="navelem"><a class="el" href="a16572.html">constructors_destructor_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>