<!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++: split_join_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('a17130_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">rb_tree_map_/split_join_fn_imps.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a17130.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 rb_tree_map_/split_join_fn_imps.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation for rb_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> <span class="keywordtype">void</span></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> join(PB_DS_CLASS_C_DEC& other)</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_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  if (base_type::join_prep(other) == false)</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  return;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</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>  const node_pointer p_x = other.split_min();</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  join_imp(p_x, other.m_p_head->m_p_parent);</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  base_type::join_finish(other);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  PB_DS_ASSERT_VALID((*this))</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  PB_DS_ASSERT_VALID(other)</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> <span class="keywordtype">void</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> join_imp(node_pointer p_x, node_pointer p_r)</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  _GLIBCXX_DEBUG_ASSERT(p_x != 0);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (p_r != 0)</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  p_r->m_red = <span class="keyword">false</span>;</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>  <span class="keyword">const</span> size_type h = black_height(base_type::m_p_head->m_p_parent);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> size_type other_h = black_height(p_r);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  node_pointer p_x_l;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  node_pointer p_x_r;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="a07764.html">std::pair<node_pointer, node_pointer></a> join_pos;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> right_join = h >= other_h;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">if</span> (right_join)</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  join_pos = find_join_pos_right(base_type::m_p_head->m_p_parent, </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  h, other_h);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  p_x_l = join_pos.<a class="code" href="a07764.html#a198b03cffc037835dc1dc01c926ce251">first</a>;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  p_x_r = p_r;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  p_x_l = base_type::m_p_head->m_p_parent;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  base_type::m_p_head->m_p_parent = p_r;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (p_r != 0)</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  p_r->m_p_parent = base_type::m_p_head;</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>  join_pos = find_join_pos_left(base_type::m_p_head->m_p_parent, </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  h, other_h);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  p_x_r = join_pos.<a class="code" href="a07764.html#a198b03cffc037835dc1dc01c926ce251">first</a>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</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>  node_pointer p_parent = join_pos.<a class="code" href="a07764.html#a91179413226db12e66346d3673b7835f">second</a>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (p_parent == base_type::m_p_head)</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  base_type::m_p_head->m_p_parent = p_x;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  p_x->m_p_parent = base_type::m_p_head;</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>  <span class="keywordflow">else</span></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>  p_x->m_p_parent = p_parent;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">if</span> (right_join)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  p_x->m_p_parent->m_p_right = p_x;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  p_x->m_p_parent->m_p_left = p_x;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</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>  p_x->m_p_left = p_x_l;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (p_x_l != 0)</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  p_x_l->m_p_parent = p_x;</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>  p_x->m_p_right = p_x_r;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (p_x_r != 0)</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  p_x_r->m_p_parent = p_x;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  p_x->m_red = <span class="keyword">true</span>;</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>  base_type::initialize_min_max();</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  base_type::update_to_top(p_x, (node_update* )this);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  insert_fixup(p_x);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))</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> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> inline typename PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> split_min()</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>  node_pointer p_min = base_type::m_p_head->m_p_left;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> node_pointer p_head = base_type::m_p_head;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  _GLIBCXX_DEBUG_ASSERT(p_min != p_head);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor">#endif </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>  remove_node(p_min);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">return</span> p_min;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <a class="code" href="a07764.html">std::pair</a><</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer,</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r)</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>  _GLIBCXX_DEBUG_ASSERT(h_l >= h_r);</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>  <span class="keywordflow">if</span> (base_type::m_p_head->m_p_parent == 0)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">return</span> (<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>((node_pointer)0, base_type::m_p_head));</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>  node_pointer p_l_parent = base_type::m_p_head;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">while</span> (h_l > h_r)</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="keywordflow">if</span> (p_l->m_red == <span class="keyword">false</span>)</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>  _GLIBCXX_DEBUG_ASSERT(h_l > 0);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  --h_l;</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> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  p_l_parent = p_l;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  p_l = p_l->m_p_right;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</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>  <span class="keywordflow">if</span> (!is_effectively_black(p_l))</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  p_l_parent = p_l;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  p_l = p_l->m_p_right;</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> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_l));</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  _GLIBCXX_DEBUG_ASSERT(black_height(p_l) == h_r);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  _GLIBCXX_DEBUG_ASSERT(p_l == 0 || p_l->m_p_parent == p_l_parent);</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(p_l, p_l_parent);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> }</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <a class="code" href="a07764.html">std::pair</a><</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer,</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> find_join_pos_left(node_pointer p_r, size_type h_l, size_type h_r)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> {</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  _GLIBCXX_DEBUG_ASSERT(h_r > h_l);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (base_type::m_p_head->m_p_parent == 0)</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> (<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>((node_pointer)0,</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  base_type::m_p_head));</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  node_pointer p_r_parent = base_type::m_p_head;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">while</span> (h_r > h_l)</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">if</span> (p_r->m_red == <span class="keyword">false</span>)</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  _GLIBCXX_DEBUG_ASSERT(h_r > 0);</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  --h_r;</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>  p_r_parent = p_r;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  p_r = p_r->m_p_left;</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>  <span class="keywordflow">if</span> (!is_effectively_black(p_r))</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>  p_r_parent = p_r;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  p_r = p_r->m_p_left;</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>  _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_r));</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  _GLIBCXX_DEBUG_ASSERT(black_height(p_r) == h_l);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  _GLIBCXX_DEBUG_ASSERT(p_r == 0 || p_r->m_p_parent == p_r_parent);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(p_r, p_r_parent);</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> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">inline</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::size_type</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> black_height(node_pointer p_nd)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> {</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  size_type h = 1;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">while</span> (p_nd != 0)</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  {</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (p_nd->m_red == <span class="keyword">false</span>)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  ++h;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  p_nd = p_nd->m_p_left;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">return</span> h;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other)</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> {</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  if (base_type::split_prep(r_key, other) == false)</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  return;</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> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID(other)</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  node_pointer p_nd = this->upper_bound(r_key).m_p_nd;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  do</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  {</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  node_pointer p_next_nd = p_nd->m_p_parent;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  split_at_node(p_nd, other);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID(other)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  p_nd = p_next_nd;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  while (p_nd != base_type::m_p_head);</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>  base_type::split_finish(other);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  PB_DS_ASSERT_VALID((*this))</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> }</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> </div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> split_at_node(node_pointer p_nd, PB_DS_CLASS_C_DEC& other)</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> {</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  _GLIBCXX_DEBUG_ASSERT(p_nd != 0);</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>  node_pointer p_l = p_nd->m_p_left;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  node_pointer p_r = p_nd->m_p_right;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  node_pointer p_parent = p_nd->m_p_parent;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (p_parent == base_type::m_p_head)</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  base_type::m_p_head->m_p_parent = p_l;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (p_l != 0)</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>  p_l->m_p_parent = base_type::m_p_head;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  p_l->m_red = <span class="keyword">false</span>;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</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>  <span class="keywordflow">else</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  {</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">if</span> (p_parent->m_p_left == p_nd)</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  p_parent->m_p_left = p_l;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  p_parent->m_p_right = p_l;</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>  <span class="keywordflow">if</span> (p_l != 0)</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  p_l->m_p_parent = p_parent;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> </div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  this->update_to_top(p_parent, (node_update* )<span class="keyword">this</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="keywordflow">if</span> (!p_nd->m_red)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  remove_fixup(p_l, p_parent);</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</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>  base_type::initialize_min_max();</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  other.join_imp(p_nd, p_r);</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  PB_DS_STRUCT_ONLY_ASSERT_VALID(other)</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </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="a07764_html_a91179413226db12e66346d3673b7835f"><div class="ttname"><a href="a07764.html#a91179413226db12e66346d3673b7835f">std::pair::second</a></div><div class="ttdeci">_T2 second</div><div class="ttdoc">first is a copy of the first object</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00215">stl_pair.h:215</a></div></div>
<div class="ttc" id="a07764_html_a198b03cffc037835dc1dc01c926ce251"><div class="ttname"><a href="a07764.html#a198b03cffc037835dc1dc01c926ce251">std::pair::first</a></div><div class="ttdeci">_T1 first</div><div class="ttdoc">second_type is the second bound type</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00214">stl_pair.h:214</a></div></div>
<div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_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_4ea0a80a37dc06cdfbcb4cc3d2414383.html">rb_tree_map_</a></li><li class="navelem"><a class="el" href="a17130.html">split_join_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>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
6713
