<!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_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('a01364_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">insert_join_fn_imps.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01364.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 pat_trie_/insert_join_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 pat_trie.</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="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>  branch_bag bag;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  if (!join_prep(other, bag))</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  return;</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> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent,</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  other.m_p_head->m_p_parent, 0, bag);</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>  m_p_head->m_p_parent->m_p_parent = m_p_head;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  m_size += other.m_size;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  other.initialize();</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent);</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  PB_DS_ASSERT_VALID((*this))</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> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> join_prep(PB_DS_CLASS_C_DEC& other, branch_bag& r_bag)</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_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  if (other.m_size == 0)</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  return false;</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>  if (m_size == 0)</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>  value_swap(other);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</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="keyword">const</span> <span class="keywordtype">bool</span> greater =</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  synth_access_traits::cmp_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_max)->value()),</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  PB_DS_V2F(static_cast<leaf_const_pointer>(other.m_p_head->m_p_min)->value()));</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>  <span class="keyword">const</span> <span class="keywordtype">bool</span> lesser =</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  synth_access_traits::cmp_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(other.m_p_head->m_p_max)->value()),</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_min)->value()));</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>  <span class="keywordflow">if</span> (!greater && !lesser)</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  __throw_join_error();</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>  rec_join_prep(m_p_head->m_p_parent, other.m_p_head->m_p_parent, r_bag);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  _GLIBCXX_DEBUG_ONLY(debug_base::join(other, <span class="keyword">false</span>);)</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> rec_join_prep(node_const_pointer p_l, node_const_pointer p_r, </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  branch_bag& r_bag)</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>  <span class="keywordflow">if</span> (p_l->m_type == leaf_node)</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (p_r->m_type == leaf_node)</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>  rec_join_prep(static_cast<leaf_const_pointer>(p_l),</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  static_cast<leaf_const_pointer>(p_r), r_bag);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  _GLIBCXX_DEBUG_ASSERT(p_r->m_type == i_node);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  rec_join_prep(static_cast<leaf_const_pointer>(p_l),</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  static_cast<inode_const_pointer>(p_r), r_bag);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</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>  _GLIBCXX_DEBUG_ASSERT(p_l->m_type == i_node);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (p_r->m_type == leaf_node)</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  rec_join_prep(static_cast<inode_const_pointer>(p_l),</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  static_cast<leaf_const_pointer>(p_r), r_bag);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">return</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> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  _GLIBCXX_DEBUG_ASSERT(p_r->m_type == i_node);</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>  rec_join_prep(static_cast<inode_const_pointer>(p_l),</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  static_cast<inode_const_pointer>(p_r), r_bag);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> }</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> rec_join_prep(leaf_const_pointer <span class="comment">/*p_l*/</span>, leaf_const_pointer <span class="comment">/*p_r*/</span>,</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  branch_bag& r_bag)</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> { r_bag.add_branch(); }</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> rec_join_prep(leaf_const_pointer <span class="comment">/*p_l*/</span>, inode_const_pointer <span class="comment">/*p_r*/</span>,</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  branch_bag& r_bag)</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> { r_bag.add_branch(); }</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> rec_join_prep(inode_const_pointer <span class="comment">/*p_l*/</span>, leaf_const_pointer <span class="comment">/*p_r*/</span>,</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  branch_bag& r_bag)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> { r_bag.add_branch(); }</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> rec_join_prep(inode_const_pointer p_l, inode_const_pointer p_r,</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  branch_bag& r_bag)</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="keywordflow">if</span> (p_l->get_e_ind() == p_r->get_e_ind() &&</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  synth_access_traits::equal_prefixes(p_l->pref_b_it(), p_l->pref_e_it(),</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  p_r->pref_b_it(), p_r->pref_e_it()))</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> inode::const_iterator it = p_r->begin();</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  it != p_r->end(); ++ it)</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>  node_const_pointer p_l_join_child = p_l->get_join_child(*it, <span class="keyword">this</span>);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">if</span> (p_l_join_child != 0)</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  rec_join_prep(p_l_join_child, * it, r_bag);</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">return</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> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (p_r->get_e_ind() < p_l->get_e_ind() &&</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  p_r->should_be_mine(p_l->pref_b_it(), p_l->pref_e_it(), 0, <span class="keyword">this</span>))</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>  node_const_pointer p_r_join_child = p_r->get_join_child(p_l, <span class="keyword">this</span>);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (p_r_join_child != 0)</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  rec_join_prep(p_r_join_child, p_l, r_bag);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (p_r->get_e_ind() < p_l->get_e_ind() &&</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  p_r->should_be_mine(p_l->pref_b_it(), p_l->pref_e_it(), 0, <span class="keyword">this</span>))</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>  node_const_pointer p_r_join_child = p_r->get_join_child(p_l, <span class="keyword">this</span>);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (p_r_join_child != 0)</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  rec_join_prep(p_r_join_child, p_l, r_bag);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</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>  r_bag.add_branch();</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> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> rec_join(node_pointer p_l, node_pointer p_r, size_type checked_ind, </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  branch_bag& r_bag)</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  _GLIBCXX_DEBUG_ASSERT(p_r != 0);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (p_l == 0)</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>  apply_update(p_r, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">return</span> (p_r);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (p_l->m_type == leaf_node)</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>  <span class="keywordflow">if</span> (p_r->m_type == leaf_node)</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  {</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  node_pointer p_ret = rec_join(static_cast<leaf_pointer>(p_l),</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  static_cast<leaf_pointer>(p_r), r_bag);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  apply_update(p_ret, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">return</span> p_ret;</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="line"><a name="l00219"></a><span class="lineno"> 219</span>  _GLIBCXX_DEBUG_ASSERT(p_r->m_type == i_node);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  node_pointer p_ret = rec_join(static_cast<leaf_pointer>(p_l),</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  static_cast<inode_pointer>(p_r),</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  checked_ind, r_bag);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  apply_update(p_ret, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  _GLIBCXX_DEBUG_ASSERT(p_l->m_type == i_node);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (p_r->m_type == leaf_node)</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  node_pointer p_ret = rec_join(static_cast<inode_pointer>(p_l),</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  static_cast<leaf_pointer>(p_r),</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  checked_ind, r_bag);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  apply_update(p_ret, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  _GLIBCXX_DEBUG_ASSERT(p_r->m_type == i_node);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  node_pointer p_ret = rec_join(static_cast<inode_pointer>(p_l),</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  static_cast<inode_pointer>(p_r),</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  r_bag);</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>  apply_update(p_ret, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> }</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> rec_join(leaf_pointer p_l, leaf_pointer p_r, branch_bag& r_bag)</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  _GLIBCXX_DEBUG_ASSERT(p_r != 0);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> (p_l == 0)</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">return</span> (p_r);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  node_pointer p_ret = insert_branch(p_l, p_r, r_bag);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_ret) == 2);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> rec_join(leaf_pointer p_l, inode_pointer p_r, size_type checked_ind,</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  branch_bag& r_bag)</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> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">const</span> size_type lhs_leafs = PB_DS_RECURSIVE_COUNT_LEAFS(p_l);</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">const</span> size_type rhs_leafs = PB_DS_RECURSIVE_COUNT_LEAFS(p_r);</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  _GLIBCXX_DEBUG_ASSERT(p_r != 0);</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  node_pointer p_ret = rec_join(p_r, p_l, checked_ind, r_bag);</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_ret) == lhs_leafs + rhs_leafs);</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> }</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> rec_join(inode_pointer p_l, leaf_pointer p_r, size_type checked_ind, branch_bag& r_bag)</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>  _GLIBCXX_DEBUG_ASSERT(p_l != 0);</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  _GLIBCXX_DEBUG_ASSERT(p_r != 0);</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> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> size_type lhs_leafs = PB_DS_RECURSIVE_COUNT_LEAFS(p_l);</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">const</span> size_type rhs_leafs = PB_DS_RECURSIVE_COUNT_LEAFS(p_r);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (!p_l->should_be_mine(pref_begin(p_r), pref_end(p_r), checked_ind, <span class="keyword">this</span>))</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  {</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  node_pointer p_ret = insert_branch(p_l, p_r, r_bag);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  PB_DS_ASSERT_NODE_VALID(p_ret)</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_ret) ==</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  lhs_leafs + rhs_leafs);</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">return</span> p_ret;</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> </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  node_pointer p_pot_child = p_l->add_child(p_r, pref_begin(p_r),</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  pref_end(p_r), <span class="keyword">this</span>);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span> (p_pot_child != p_r)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  node_pointer p_new_child = rec_join(p_pot_child, p_r, p_l->get_e_ind(),</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  r_bag);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  p_l->replace_child(p_new_child, pref_begin(p_new_child),</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  pref_end(p_new_child), <span class="keyword">this</span>);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  PB_DS_ASSERT_NODE_VALID(p_l)</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_l) == lhs_leafs + rhs_leafs);</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> p_l;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> }</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> rec_join(inode_pointer p_l, inode_pointer p_r, </div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  branch_bag& r_bag)</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  _GLIBCXX_DEBUG_ASSERT(p_l != 0);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  _GLIBCXX_DEBUG_ASSERT(p_r != 0);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> size_type lhs_leafs = PB_DS_RECURSIVE_COUNT_LEAFS(p_l);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">const</span> size_type rhs_leafs = PB_DS_RECURSIVE_COUNT_LEAFS(p_r);</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (p_l->get_e_ind() == p_r->get_e_ind() &&</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  synth_access_traits::equal_prefixes(p_l->pref_b_it(), p_l->pref_e_it(),</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  p_r->pref_b_it(), p_r->pref_e_it()))</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  {</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> inode::iterator it = p_r->begin();</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  it != p_r->end(); ++ it)</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  {</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  node_pointer p_new_child = rec_join(p_l->get_join_child(*it, <span class="keyword">this</span>),</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  * it, 0, r_bag);</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  p_l->replace_child(p_new_child, pref_begin(p_new_child),</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  pref_end(p_new_child), <span class="keyword">this</span>);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  p_r->~inode();</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  s_inode_allocator.deallocate(p_r, 1);</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  PB_DS_ASSERT_NODE_VALID(p_l)</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_l) == lhs_leafs + rhs_leafs);</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">return</span> p_l;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">if</span> (p_l->get_e_ind() < p_r->get_e_ind() &&</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  p_l->should_be_mine(p_r->pref_b_it(), p_r->pref_e_it(), 0, <span class="keyword">this</span>))</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  node_pointer p_new_child = rec_join(p_l->get_join_child(p_r, <span class="keyword">this</span>),</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  p_r, 0, r_bag);</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  p_l->replace_child(p_new_child, pref_begin(p_new_child),</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  pref_end(p_new_child), <span class="keyword">this</span>);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  PB_DS_ASSERT_NODE_VALID(p_l)</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> p_l;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (p_r->get_e_ind() < p_l->get_e_ind() &&</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  p_r->should_be_mine(p_l->pref_b_it(), p_l->pref_e_it(), 0, <span class="keyword">this</span>))</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  node_pointer p_new_child = rec_join(p_r->get_join_child(p_l, <span class="keyword">this</span>), p_l,</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  0, r_bag);</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  p_r->replace_child(p_new_child, pref_begin(p_new_child),</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  pref_end(p_new_child), <span class="keyword">this</span>);</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  PB_DS_ASSERT_NODE_VALID(p_r)</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_r) == lhs_leafs + rhs_leafs);</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> p_r;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  node_pointer p_ret = insert_branch(p_l, p_r, r_bag);</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  PB_DS_ASSERT_NODE_VALID(p_ret)</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  _GLIBCXX_DEBUG_ASSERT(PB_DS_RECURSIVE_COUNT_LEAFS(p_ret) == lhs_leafs + rhs_leafs);</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="keyword">inline</span> <a class="code" href="a07764.html">std::pair<typename PB_DS_CLASS_C_DEC::iterator, bool></a></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> insert(const_reference r_val)</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> {</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  node_pointer p_lf = find_imp(PB_DS_V2F(r_val));</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (p_lf != 0 && p_lf->m_type == leaf_node &&</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_lf)->value()), PB_DS_V2F(r_val)))</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  {</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  PB_DS_CHECK_KEY_EXISTS(PB_DS_V2F(r_val))</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  return <a class="code" href="a01538.html">std</a>::<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(iterator(p_lf), false);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_val))</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  leaf_pointer p_new_lf = s_leaf_allocator.allocate(1);</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  cond_dealtor cond(p_new_lf);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> </div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  new (p_new_lf) leaf(r_val);</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  apply_update(p_new_lf, (node_update*)this);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  cond.set_call_destructor();</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  branch_bag bag;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  bag.add_branch();</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent, p_new_lf, 0, bag);</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  m_p_head->m_p_parent->m_p_parent = m_p_head;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  cond.set_no_action_dtor();</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  ++m_size;</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  update_min_max_for_inserted_leaf(p_new_lf);</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(PB_DS_V2F(r_val));)</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  PB_DS_ASSERT_VALID((*this))</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  return <a class="code" href="a01538.html">std</a>::<a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(point_iterator(p_new_lf), true);</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> }</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> typename PB_DS_CLASS_C_DEC::size_type</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> keys_diff_ind(typename access_traits::const_iterator b_l,</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  typename access_traits::const_iterator e_l,</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  typename access_traits::const_iterator b_r,</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  typename access_traits::const_iterator e_r)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  size_type diff_pos = 0;</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">while</span> (b_l != e_l)</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  {</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (b_r == e_r)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">return</span> (diff_pos);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">if</span> (access_traits::e_pos(*b_l) != access_traits::e_pos(*b_r))</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">return</span> (diff_pos);</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  ++b_l;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  ++b_r;</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  ++diff_pos;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  }</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  _GLIBCXX_DEBUG_ASSERT(b_r != e_r);</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">return</span> diff_pos;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::inode_pointer</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> insert_branch(node_pointer p_l, node_pointer p_r, branch_bag& r_bag)</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> {</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keyword">typename</span> synth_access_traits::const_iterator left_b_it = pref_begin(p_l);</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">typename</span> synth_access_traits::const_iterator left_e_it = pref_end(p_l);</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keyword">typename</span> synth_access_traits::const_iterator right_b_it = pref_begin(p_r);</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">typename</span> synth_access_traits::const_iterator right_e_it = pref_end(p_r);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> </div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keyword">const</span> size_type diff_ind = keys_diff_ind(left_b_it, left_e_it,</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  right_b_it, right_e_it);</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  inode_pointer p_new_nd = r_bag.get_branch();</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">new</span> (p_new_nd) inode(diff_ind, left_b_it);</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  p_new_nd->add_child(p_l, left_b_it, left_e_it, <span class="keyword">this</span>);</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  p_new_nd->add_child(p_r, right_b_it, right_e_it, <span class="keyword">this</span>);</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  p_l->m_p_parent = p_new_nd;</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  p_r->m_p_parent = p_new_nd;</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  PB_DS_ASSERT_NODE_VALID(p_new_nd)</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">return</span> (p_new_nd);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> update_min_max_for_inserted_leaf(leaf_pointer p_new_lf)</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> {</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (m_p_head->m_p_min == m_p_head ||</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  synth_access_traits::cmp_keys(PB_DS_V2F(p_new_lf->value()),</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_min)->value())))</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  m_p_head->m_p_min = p_new_lf;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  if (m_p_head->m_p_max == m_p_head ||</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  synth_access_traits::cmp_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_max)->value()), PB_DS_V2F(p_new_lf->value())))</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  m_p_head->m_p_max = p_new_lf;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</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="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_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_09cd9b3d747c5003a266aeaaa2ec69e9.html">pat_trie_</a></li><li class="navelem"><a class="el" href="a01364.html">insert_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
>
1125
