<!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_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('a01373_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">split_fn_imps.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01373.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_/split_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> split(key_const_reference r_key, 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>  leaf_pointer p_split_lf = split_prep(r_key, other, bag);</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  if (p_split_lf == 0)</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  _GLIBCXX_DEBUG_ASSERT(bag.empty());</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  return;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  _GLIBCXX_DEBUG_ASSERT(!bag.empty());</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  other.clear();</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>  m_p_head->m_p_parent = rec_split(m_p_head->m_p_parent, pref_begin(p_split_lf),</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  pref_end(p_split_lf), other, bag);</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  m_p_head->m_p_parent->m_p_parent = m_p_head;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  head_pointer __ohead = other.m_p_head;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  __ohead->m_p_max = m_p_head->m_p_max;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  __ohead->m_p_min = other.leftmost_descendant(__ohead->m_p_parent);</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>  other.m_size = <a class="code" href="a01538.html">std</a>::<a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">distance</a>(other.PB_DS_CLASS_C_DEC::<a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(),</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  other.PB_DS_CLASS_C_DEC::<a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  m_size -= other.m_size;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  PB_DS_ASSERT_VALID((*this))</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> typename PB_DS_CLASS_C_DEC::leaf_pointer</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> split_prep(key_const_reference r_key, PB_DS_CLASS_C_DEC& other,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  branch_bag& r_bag)</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>  _GLIBCXX_DEBUG_ASSERT(r_bag.empty());</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (m_size == 0)</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  other.clear();</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  return 0;</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> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  if (synth_access_traits::cmp_keys(r_key,</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_min)->value())))</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>  other.clear();</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  value_swap(other);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  return 0;</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> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  if (!synth_access_traits::cmp_keys(r_key,</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_max)->value())))</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  PB_DS_ASSERT_VALID((*<span class="keyword">this</span>))</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  PB_DS_ASSERT_VALID(other)</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  return 0;</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>  iterator it = lower_bound(r_key);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  if (!synth_access_traits::equal_keys(PB_DS_V2F(*it), r_key))</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  --it;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  node_pointer p_nd = it.m_p_nd;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  leaf_pointer p_ret_l = static_cast<leaf_pointer>(p_nd);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  while (p_nd->m_type != head_node)</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>  r_bag.add_branch();</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  p_nd = p_nd->m_p_parent;</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>  _GLIBCXX_DEBUG_ONLY(debug_base::split(r_key,(synth_access_traits&)(*<span class="keyword">this</span>), other);)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">return</span> p_ret_l;</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_pointer</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> rec_split(node_pointer p_nd, a_const_iterator b_it, a_const_iterator e_it,</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  PB_DS_CLASS_C_DEC& other, branch_bag& r_bag)</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="keywordflow">if</span> (p_nd->m_type == leaf_node)</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  _GLIBCXX_DEBUG_ASSERT(other.m_p_head->m_p_parent == 0);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">return</span> p_nd;</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> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  inode_pointer p_ind = static_cast<inode_pointer>(p_nd);</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>  node_pointer pfirst = p_ind->get_child_node(b_it, e_it, <span class="keyword">this</span>);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  node_pointer p_child_ret = rec_split(pfirst, b_it, e_it, other, r_bag);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  PB_DS_ASSERT_NODE_VALID(p_child_ret)</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  p_ind->replace_child(p_child_ret, b_it, e_it, <span class="keyword">this</span>);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  apply_update(p_ind, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  inode_iterator child_it = p_ind->get_child_it(b_it, e_it, <span class="keyword">this</span>);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">const</span> size_type lhs_dist = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(p_ind->begin(), child_it);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">const</span> size_type lhs_num_children = lhs_dist + 1;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  _GLIBCXX_DEBUG_ASSERT(lhs_num_children > 0);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> size_type rhs_dist = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(p_ind->begin(), p_ind->end());</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  size_type rhs_num_children = rhs_dist - lhs_num_children;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (rhs_num_children == 0)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  apply_update(p_ind, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">return</span> p_ind;</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> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  other.split_insert_branch(p_ind->get_e_ind(), b_it, child_it,</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  rhs_num_children, r_bag);</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>  child_it = p_ind->get_child_it(b_it, e_it, <span class="keyword">this</span>);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">while</span> (rhs_num_children != 0)</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>  ++child_it;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  p_ind->remove_child(child_it);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  --rhs_num_children;</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>  apply_update(p_ind, (node_update*)<span class="keyword">this</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>  <span class="keyword">const</span> size_type int_dist = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(p_ind->begin(), p_ind->end());</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  _GLIBCXX_DEBUG_ASSERT(int_dist >= 1);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (int_dist > 1)</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>  p_ind->update_prefixes(<span class="keyword">this</span>);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  PB_DS_ASSERT_NODE_VALID(p_ind)</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  apply_update(p_ind, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">return</span> p_ind;</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>  node_pointer p_ret = *p_ind->begin();</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  p_ind->~inode();</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  s_inode_allocator.deallocate(p_ind, 1);</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  apply_update(p_ret, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> p_ret;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> split_insert_branch(size_type e_ind, a_const_iterator b_it,</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  inode_iterator child_b_it,</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  size_type num_children, branch_bag& r_bag)</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> {</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent != 0)</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  PB_DS_ASSERT_NODE_VALID(m_p_head->m_p_parent)</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">const</span> size_type start = m_p_head->m_p_parent == 0 ? 0 : 1;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> size_type total_num_children = start + num_children;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (total_num_children == 0)</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>  _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_parent == 0);</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (total_num_children == 1)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent != 0)</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>  PB_DS_ASSERT_NODE_VALID(m_p_head->m_p_parent)</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  return;</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> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_parent == 0);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  ++child_b_it;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  m_p_head->m_p_parent = *child_b_it;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  m_p_head->m_p_parent->m_p_parent = m_p_head;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  apply_update(m_p_head->m_p_parent, (node_update*)this);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  PB_DS_ASSERT_NODE_VALID(m_p_head->m_p_parent)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  return;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</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>  _GLIBCXX_DEBUG_ASSERT(total_num_children > 1);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  inode_pointer p_new_root = r_bag.get_branch();</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  new (p_new_root) inode(e_ind, b_it);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  size_type num_inserted = 0;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  while (num_inserted++ < num_children)</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  ++child_b_it;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  PB_DS_ASSERT_NODE_VALID((*child_b_it))</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  p_new_root->add_child(*child_b_it, pref_begin(*child_b_it),</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  pref_end(*child_b_it), <span class="keyword">this</span>);</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> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent != 0)</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  p_new_root->add_child(m_p_head->m_p_parent,</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  pref_begin(m_p_head->m_p_parent),</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  pref_end(m_p_head->m_p_parent), <span class="keyword">this</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>  m_p_head->m_p_parent = p_new_root;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  p_new_root->m_p_parent = m_p_head;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  apply_update(m_p_head->m_p_parent, (node_update*)<span class="keyword">this</span>);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  PB_DS_ASSERT_NODE_VALID(m_p_head->m_p_parent)</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> }</div><div class="ttc" id="a01538_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01538.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00099">initializer_list:99</a></div></div>
<div class="ttc" id="a01538_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00089">initializer_list:89</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="a01538_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</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="a01373.html">split_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
>
1133
