<!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++: ropeimpl.h 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('a01073_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">ropeimpl.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01073.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">// SGI's rope class implementation -*- 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) 2001-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</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later 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,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but 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</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU 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">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * Copyright (c) 1997</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> *</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</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"></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">/** @file ropeimpl.h</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Do not attempt to use it directly. @headername{ext/rope}</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> */</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include <<a class="code" href="a00239.html">cstdio</a>></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <<a class="code" href="a00116.html">ostream</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a00356.html">bits/functexcept.h</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <<a class="code" href="a16461.html">ext/algorithm</a>></span> <span class="comment">// For copy_n and lexicographical_compare_3way</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#include <<a class="code" href="a16965.html">ext/memory</a>></span> <span class="comment">// For uninitialized_copy_n</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#include <<a class="code" href="a17004.html">ext/numeric</a>></span> <span class="comment">// For power</span></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> <span class="keyword">namespace </span><a class="code" href="a01547.html">__gnu_cxx</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</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>  <span class="keyword">using</span> std::size_t;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">using</span> std::printf;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">using</span> <a class="code" href="a02463.html">std::basic_ostream</a>;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">using</span> std::__throw_length_error;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">using</span> <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">using</span> std::__uninitialized_fill_n_a;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// Set buf_start, buf_end, and buf_ptr appropriately, filling tmp_buf</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// if necessary. Assumes _M_path_end[leaf_index] and leaf_pos are correct.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Results in a valid buf_ptr if the iterator can be legitimately</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// dereferenced.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  _Rope_iterator_base<_CharT, _Alloc>::</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  _S_setbuf(_Rope_iterator_base<_CharT, _Alloc>& __x)</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index];</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">size_t</span> __leaf_pos = __x._M_leaf_pos;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordtype">size_t</span> __pos = __x._M_current_pos;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">switch</span>(__leaf->_M_tag)</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>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  __x._M_buf_start = ((_Rope_RopeLeaf<_CharT, _Alloc>*)__leaf)->_M_data;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  __x._M_buf_ptr = __x._M_buf_start + (__pos - __leaf_pos);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  __x._M_buf_end = __x._M_buf_start + __leaf->_M_size;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">size_t</span> __len = _S_iterator_buf_len;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">size_t</span> __buf_start_pos = __leaf_pos;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">size_t</span> __leaf_end = __leaf_pos + __leaf->_M_size;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  char_producer<_CharT>* __fn = ((_Rope_RopeFunction<_CharT,</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  _Alloc>*)__leaf)->_M_fn;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (__buf_start_pos + __len <= __pos)</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>  __buf_start_pos = __pos - __len / 4;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (__buf_start_pos + __len > __leaf_end)</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  __buf_start_pos = __leaf_end - __len;</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>  <span class="keywordflow">if</span> (__buf_start_pos + __len > __leaf_end)</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  __len = __leaf_end - __buf_start_pos;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  __x._M_buf_ptr = __x._M_tmp_buf + (__pos - __buf_start_pos);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  __x._M_buf_start = __x._M_tmp_buf;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  __x._M_buf_end = __x._M_tmp_buf + __len;</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>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Set path and buffer inside a rope iterator. We assume that</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// pos and root are already set.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  _Rope_iterator_base<_CharT, _Alloc>::</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  _S_setcache(_Rope_iterator_base<_CharT, _Alloc>& __x)</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>  <span class="keyword">const</span> _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1];</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">const</span> _RopeRep* __curr_rope;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordtype">int</span> __curr_depth = -1; <span class="comment">/* index into path */</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">size_t</span> __curr_start_pos = 0;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordtype">size_t</span> __pos = __x._M_current_pos;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> __dirns = 0; <span class="comment">// Bit vector marking right turns in the path</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">if</span> (__pos >= __x._M_root->_M_size)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  __x._M_buf_ptr = 0;</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>  __curr_rope = __x._M_root;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">if</span> (0 != __curr_rope->_M_c_string)</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>  <span class="comment">/* Treat the root as a leaf. */</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  __x._M_buf_start = __curr_rope->_M_c_string;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  __x._M_buf_ptr = __curr_rope->_M_c_string + __pos;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  __x._M_path_end[0] = __curr_rope;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __x._M_leaf_index = 0;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  __x._M_leaf_pos = 0;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span>(;;)</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>  ++__curr_depth;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  __path[__curr_depth] = __curr_rope;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">switch</span>(__curr_rope->_M_tag)</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  __x._M_leaf_pos = __curr_start_pos;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">goto</span> done;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  _Rope_RopeConcatenation<_CharT, _Alloc>* __c =</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  (_Rope_RopeConcatenation<_CharT, _Alloc>*)__curr_rope;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  _RopeRep* __left = __c->_M_left;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordtype">size_t</span> __left_len = __left->_M_size;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  __dirns <<= 1;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (__pos >= __curr_start_pos + __left_len)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  __dirns |= 1;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  __curr_rope = __c->_M_right;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  __curr_start_pos += __left_len;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  __curr_rope = __left;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  done:</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Copy last section of path into _M_path_end.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordtype">int</span> __i = -1;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordtype">int</span> __j = __curr_depth + 1 - int(_S_path_cache_len);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (__j < 0) __j = 0;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">while</span> (__j <= __curr_depth)</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  __x._M_path_end[++__i] = __path[__j++];</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  __x._M_leaf_index = __i;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  __x._M_path_directions = __dirns;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  _S_setbuf(__x);</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> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Specialized version of the above. Assumes that</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// the path cache is valid for the previous position.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  _Rope_iterator_base<_CharT, _Alloc>::</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  _S_setcache_for_incr(_Rope_iterator_base<_CharT, _Alloc>& __x)</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>  <span class="keywordtype">int</span> __current_index = __x._M_leaf_index;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> _RopeRep* __current_node = __x._M_path_end[__current_index];</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordtype">size_t</span> __len = __current_node->_M_size;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">size_t</span> __node_start_pos = __x._M_leaf_pos;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> __dirns = __x._M_path_directions;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  _Rope_RopeConcatenation<_CharT, _Alloc>* __c;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (__x._M_current_pos - __node_start_pos < __len)</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>  <span class="comment">/* More stuff in this leaf, we just didn't cache it. */</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  _S_setbuf(__x);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// node_start_pos is starting position of last_node.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">while</span> (--__current_index >= 0)</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> (!(__dirns & 1) <span class="comment">/* Path turned left */</span>)</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  __current_node = __x._M_path_end[__current_index];</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  __c = (_Rope_RopeConcatenation<_CharT, _Alloc>*)__current_node;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// Otherwise we were in the right child. Thus we should pop</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// the concatenation node.</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  __node_start_pos -= __c->_M_left->_M_size;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  __dirns >>= 1;</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>  <span class="keywordflow">if</span> (__current_index < 0)</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>  <span class="comment">// We underflowed the cache. Punt.</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  _S_setcache(__x);</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  __current_node = __x._M_path_end[__current_index];</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  __c = (_Rope_RopeConcatenation<_CharT, _Alloc>*)__current_node;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// current_node is a concatenation node. We are positioned on the first</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// character in its right child.</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// node_start_pos is starting position of current_node.</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  __node_start_pos += __c->_M_left->_M_size;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  __current_node = __c->_M_right;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  __x._M_path_end[++__current_index] = __current_node;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  __dirns |= 1;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">while</span> (__detail::_S_concat == __current_node->_M_tag)</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>  ++__current_index;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (<span class="keywordtype">int</span>(_S_path_cache_len) == __current_index)</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  {</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordtype">int</span> __i;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">for</span> (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  __x._M_path_end[__i] = __x._M_path_end[__i+1];</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  --__current_index;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  __current_node =</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  ((_Rope_RopeConcatenation<_CharT, _Alloc>*)__current_node)->_M_left;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  __x._M_path_end[__current_index] = __current_node;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  __dirns <<= 1;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// node_start_pos is unchanged.</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  __x._M_leaf_index = __current_index;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  __x._M_leaf_pos = __node_start_pos;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  __x._M_path_directions = __dirns;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  _S_setbuf(__x);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  _Rope_iterator_base<_CharT, _Alloc>::</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  _M_incr(<span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  _M_current_pos += __n;</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">if</span> (0 != _M_buf_ptr)</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  {</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordtype">size_t</span> __chars_left = _M_buf_end - _M_buf_ptr;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (__chars_left > __n)</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  _M_buf_ptr += __n;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__chars_left == __n)</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  _M_buf_ptr += __n;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  _S_setcache_for_incr(*<span class="keyword">this</span>);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  _M_buf_ptr = 0;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</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>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  _Rope_iterator_base<_CharT, _Alloc>::</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  _M_decr(<span class="keywordtype">size_t</span> __n)</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>  <span class="keywordflow">if</span> (0 != _M_buf_ptr)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  {</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordtype">size_t</span> __chars_left = _M_buf_ptr - _M_buf_start;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (__chars_left >= __n)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  _M_buf_ptr -= __n;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  _M_buf_ptr = 0;</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>  _M_current_pos -= __n;</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> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  _Rope_iterator<_CharT, _Alloc>::</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  _M_check()</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (_M_root_rope->_M_tree_ptr != this->_M_root)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// _Rope was modified. Get things fixed up.</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  _RopeRep::_S_unref(this->_M_root);</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  this->_M_root = _M_root_rope->_M_tree_ptr;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  _RopeRep::_S_ref(this->_M_root);</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  this->_M_buf_ptr = 0;</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>  }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  _Rope_const_iterator<_CharT, _Alloc>::</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  _Rope_const_iterator(<span class="keyword">const</span> _Rope_iterator<_CharT, _Alloc>& __x)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  : _Rope_iterator_base<_CharT, _Alloc>(__x)</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>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  _Rope_iterator<_CharT, _Alloc>::</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  _Rope_iterator(rope<_CharT, _Alloc>& __r, <span class="keywordtype">size_t</span> __pos)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  _M_root_rope(&__r)</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  { _RopeRep::_S_ref(this->_M_root); }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> </div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  _S_char_ptr_len(<span class="keyword">const</span> _CharT* __s)</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> _CharT* __p = __s;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">while</span> (!_S_is0(*__p))</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  ++__p;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">return</span> (__p - __s);</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </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> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> </div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  _Rope_RopeRep<_CharT, _Alloc>::</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  _M_free_c_string()</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  {</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  _CharT* __cstr = _M_c_string;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">if</span> (0 != __cstr)</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  {</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordtype">size_t</span> __size = this->_M_size + 1;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(__cstr, __cstr + __size, _M_get_allocator());</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  this->_Data_deallocate(__cstr, __size);</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</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>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  _Rope_RopeRep<_CharT, _Alloc>::</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  _S_free_string(_CharT* __s, <span class="keywordtype">size_t</span> __n, allocator_type& __a)</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  {</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">if</span> (!_S_is_basic_char_type((_CharT*)0))</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(__s, __s + __n, __a);</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="comment">// This has to be a static member, so this gets a bit messy</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  __a.deallocate(__s,</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  _Rope_RopeLeaf<_CharT, _Alloc>::_S_rounded_up_size(__n));</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  }</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> </div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">// There are several reasons for not doing this with virtual destructors</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// and a class specific delete operator:</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// - A class specific delete operator can't easily get access to</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// allocator instances if we need them.</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="comment">// - Any virtual function would need a 4 or byte vtable pointer;</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// this only requires a one byte tag per object.</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  _Rope_RopeRep<_CharT, _Alloc>::</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  _M_free_tree()</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  {</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">switch</span>(_M_tag)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</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>  _Rope_RopeLeaf<_CharT, _Alloc>* __l</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  = (_Rope_RopeLeaf<_CharT, _Alloc>*)<span class="keyword">this</span>;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  __l->_Rope_RopeLeaf<_CharT, _Alloc>::~_Rope_RopeLeaf();</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  this->_L_deallocate(__l, 1);</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _Rope_RopeConcatenation<_CharT,_Alloc>* __c</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  = (_Rope_RopeConcatenation<_CharT, _Alloc>*)<span class="keyword">this</span>;</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  __c->_Rope_RopeConcatenation<_CharT, _Alloc>::
~_Rope_RopeConcatenation();</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  this->_C_deallocate(__c, 1);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">break</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>  <span class="keywordflow">case</span> __detail::_S_function:</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>  _Rope_RopeFunction<_CharT, _Alloc>* __f</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  = (_Rope_RopeFunction<_CharT, _Alloc>*)<span class="keyword">this</span>;</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  __f->_Rope_RopeFunction<_CharT, _Alloc>::~_Rope_RopeFunction();</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  this->_F_deallocate(__f, 1);</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  {</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  _Rope_RopeSubstring<_CharT, _Alloc>* __ss =</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  (_Rope_RopeSubstring<_CharT, _Alloc>*)<span class="keyword">this</span>;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  __ss->_Rope_RopeSubstring<_CharT, _Alloc>::
~_Rope_RopeSubstring();</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  this->_S_deallocate(__ss, 1);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="preprocessor">#else</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>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  _Rope_RopeRep<_CharT, _Alloc>::</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  _S_free_string(<span class="keyword">const</span> _CharT*, <span class="keywordtype">size_t</span>, allocator_type)</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  { }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="preprocessor">#endif</span></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>  <span class="comment">// Concatenate a C string onto a leaf rope by copying the rope data.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="comment">// Used for short ropes.</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keyword">typename</span> rope<_CharT, _Alloc>::_RopeLeaf*</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  _S_leaf_concat_char_iter(_RopeLeaf* __r, <span class="keyword">const</span> _CharT* __iter, <span class="keywordtype">size_t</span> __len)</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  {</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordtype">size_t</span> __old_len = __r->_M_size;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  _CharT* __new_data = (_CharT*)</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  rope::_Data_allocate(_S_rounded_up_size(__old_len + __len));</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  _RopeLeaf* __result;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="a01541.html#a0ebdef0da5f05e59240160b42eec594b">uninitialized_copy_n</a>(__r->_M_data, __old_len, __new_data);</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="a01541.html#a0ebdef0da5f05e59240160b42eec594b">uninitialized_copy_n</a>(__iter, __len, __new_data + __old_len);</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  _S_cond_store_eos(__new_data[__old_len + __len]);</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  __try</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  {</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  __result = _S_new_RopeLeaf(__new_data, __old_len + __len,</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  __r->_M_get_allocator());</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>  __catch(...)</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  {</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len,</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  __r->_M_get_allocator());</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __throw_exception_again;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">return</span> __result;</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> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// As above, but it's OK to clobber original if refcount is 1</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keyword">typename</span> rope<_CharT,_Alloc>::_RopeLeaf*</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, <span class="keyword">const</span> _CharT* __iter,</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordtype">size_t</span> __len)</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>  <span class="keywordflow">if</span> (__r->_M_ref_count > 1)</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span> _S_leaf_concat_char_iter(__r, __iter, __len);</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordtype">size_t</span> __old_len = __r->_M_size;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> (_S_allocated_capacity(__old_len) >= __old_len + __len)</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  {</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// The space has been partially initialized for the standard</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// character types. But that doesn't matter for those types.</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="a01541.html#a0ebdef0da5f05e59240160b42eec594b">uninitialized_copy_n</a>(__iter, __len, __r->_M_data + __old_len);</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">if</span> (_S_is_basic_char_type((_CharT*)0))</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  _S_cond_store_eos(__r->_M_data[__old_len + __len]);</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__r->_M_c_string != __r->_M_data && 0 != __r->_M_c_string)</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  {</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  __r->_M_free_c_string();</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  __r->_M_c_string = 0;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  __r->_M_size = __old_len + __len;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  __r->_M_ref_count = 2;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">return</span> __r;</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  {</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// Assumes left and right are not 0.</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// Does not increment (nor decrement on exception) child reference counts.</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// Result has ref count 1.</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">typename</span> rope<_CharT, _Alloc>::_RopeRep*</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  _S_tree_concat(_RopeRep* __left, _RopeRep* __right)</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  {</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  _RopeConcatenation* __result = _S_new_RopeConcatenation(__left, __right,</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  __left-></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  _M_get_allocator());</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordtype">size_t</span> __depth = __result->_M_depth;</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  </div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">if</span> (__depth > 20</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  && (__result->_M_size < 1000</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  || __depth > <span class="keywordtype">size_t</span>(__detail::_S_max_rope_depth)))</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  {</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  _RopeRep* __balanced;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  __try</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  {</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  __balanced = _S_balance(__result);</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  __result->_M_unref_nonnil();</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  __catch(...)</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  {</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  rope::_C_deallocate(__result,1);</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  __throw_exception_again;</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  }</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// In case of exception, we need to deallocate</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// otherwise dangling result node. But caller</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// still owns its children. Thus unref is</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">// inappropriate.</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">return</span> __balanced;</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keyword">typename</span> rope<_CharT, _Alloc>::_RopeRep*</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  _S_concat_char_iter(_RopeRep* __r, <span class="keyword">const</span> _CharT*__s, <span class="keywordtype">size_t</span> __slen)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  _RopeRep* __result;</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> (0 == __slen)</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  {</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  _S_ref(__r);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">return</span> __r;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">if</span> (0 == __r)</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">return</span> __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen,</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  __r->_M_get_allocator());</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">if</span> (__r->_M_tag == __detail::_S_leaf</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  && __r->_M_size + __slen <= <span class="keywordtype">size_t</span>(_S_copy_max))</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  {</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  __result = _S_leaf_concat_char_iter((_RopeLeaf*)__r, __s, __slen);</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">if</span> (__detail::_S_concat == __r->_M_tag</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  && __detail::_S_leaf == ((_RopeConcatenation*) __r)->_M_right->_M_tag)</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  _RopeLeaf* __right =</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right);</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (__right->_M_size + __slen <= <span class="keywordtype">size_t</span>(_S_copy_max))</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  {</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  _RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left;</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  _RopeRep* __nright =</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  _S_leaf_concat_char_iter((_RopeLeaf*)__right, __s, __slen);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  __left->_M_ref_nonnil();</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  __try</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  { __result = _S_tree_concat(__left, __nright); }</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  __catch(...)</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  _S_unref(__left);</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  _S_unref(__nright);</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  __throw_exception_again;</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  }</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  _RopeRep* __nright =</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen, __r->_M_get_allocator());</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  __try</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  {</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  __r->_M_ref_nonnil();</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  __result = _S_tree_concat(__r, __nright);</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  __catch(...)</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  {</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  _S_unref(__r);</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  _S_unref(__nright);</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  __throw_exception_again;</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  }</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">typename</span> rope<_CharT,_Alloc>::_RopeRep*</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  rope<_CharT,_Alloc>::</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  _S_destr_concat_char_iter(_RopeRep* __r, <span class="keyword">const</span> _CharT* __s, <span class="keywordtype">size_t</span> __slen)</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  {</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  _RopeRep* __result;</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (0 == __r)</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">return</span> __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen,</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  __r->_M_get_allocator());</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordtype">size_t</span> __count = __r->_M_ref_count;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordtype">size_t</span> __orig_size = __r->_M_size;</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (__count > 1)</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">return</span> _S_concat_char_iter(__r, __s, __slen);</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">if</span> (0 == __slen)</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  {</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  __r->_M_ref_count = 2; <span class="comment">// One more than before</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">return</span> __r;</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">if</span> (__orig_size + __slen <= <span class="keywordtype">size_t</span>(_S_copy_max)</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  && __detail::_S_leaf == __r->_M_tag)</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  {</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  __result = _S_destr_leaf_concat_char_iter((_RopeLeaf*)__r, __s, </div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  __slen);</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  }</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">if</span> (__detail::_S_concat == __r->_M_tag)</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  {</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  _RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*)</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  __r)->_M_right);</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == __right->_M_tag</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  && __right->_M_size + __slen <= <span class="keywordtype">size_t</span>(_S_copy_max))</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  {</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  _RopeRep* __new_right =</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  _S_destr_leaf_concat_char_iter(__right, __s, __slen);</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (__right == __new_right)</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  __new_right->_M_ref_count = 1;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  __right->_M_unref_nonnil();</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  __r->_M_ref_count = 2; <span class="comment">// One more than before.</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  ((_RopeConcatenation*)__r)->_M_right = __new_right;</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  __r->_M_size = __orig_size + __slen;</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">if</span> (0 != __r->_M_c_string)</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  __r->_M_free_c_string();</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  __r->_M_c_string = 0;</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">return</span> __r;</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  }</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  _RopeRep* __right =</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen, __r->_M_get_allocator());</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  __r->_M_ref_nonnil();</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  __try</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  { __result = _S_tree_concat(__r, __right); }</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  __catch(...)</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  {</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  _S_unref(__r);</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  _S_unref(__right);</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  __throw_exception_again;</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  }</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="preprocessor">#endif </span><span class="comment">/* !__GC */</span><span class="preprocessor"></span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">typename</span> rope<_CharT, _Alloc>::_RopeRep*</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  _S_concat(_RopeRep* __left, _RopeRep* __right)</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  {</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">if</span> (0 == __left)</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  {</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  _S_ref(__right);</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> __right;</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (0 == __right)</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  {</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  __left->_M_ref_nonnil();</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">return</span> __left;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == __right->_M_tag)</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  {</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == __left->_M_tag)</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keywordflow">if</span> (__right->_M_size + __left->_M_size <= <span class="keywordtype">size_t</span>(_S_copy_max))</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">return</span> _S_leaf_concat_char_iter((_RopeLeaf*)__left,</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  ((_RopeLeaf*)__right)->_M_data,</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  __right->_M_size);</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__detail::_S_concat == __left->_M_tag</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  && __detail::_S_leaf == ((_RopeConcatenation*)</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  __left)->_M_right->_M_tag)</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  {</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  _RopeLeaf* __leftright =</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right);</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">if</span> (__leftright->_M_size</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  + __right->_M_size <= <span class="keywordtype">size_t</span>(_S_copy_max))</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  {</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  _RopeRep* __leftleft = ((_RopeConcatenation*)__left)->_M_left;</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  _RopeRep* __rest = _S_leaf_concat_char_iter(__leftright,</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  ((_RopeLeaf*)</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  __right)-></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  _M_data,</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  __right->_M_size);</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  __leftleft->_M_ref_nonnil();</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  __try</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  { <span class="keywordflow">return</span>(_S_tree_concat(__leftleft, __rest)); }</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  __catch(...)</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  {</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  _S_unref(__leftleft);</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  _S_unref(__rest);</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  __throw_exception_again;</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  }</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  }</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  __left->_M_ref_nonnil();</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  __right->_M_ref_nonnil();</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  __try</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  { <span class="keywordflow">return</span>(_S_tree_concat(__left, __right)); }</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  __catch(...)</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  {</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  _S_unref(__left);</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  _S_unref(__right);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  __throw_exception_again;</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  }</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> </div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keyword">typename</span> rope<_CharT, _Alloc>::_RopeRep*</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  _S_substring(_RopeRep* __base, <span class="keywordtype">size_t</span> __start, <span class="keywordtype">size_t</span> __endp1)</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  {</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">if</span> (0 == __base)</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordtype">size_t</span> __len = __base->_M_size;</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordtype">size_t</span> __adj_endp1;</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __lazy_threshold = 128;</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordflow">if</span> (__endp1 >= __len)</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  {</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordflow">if</span> (0 == __start)</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  {</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  __base->_M_ref_nonnil();</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">return</span> __base;</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  }</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  __adj_endp1 = __len;</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  </div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  }</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  __adj_endp1 = __endp1;</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">switch</span>(__base->_M_tag)</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  {</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  _RopeConcatenation* __c = (_RopeConcatenation*)__base;</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  _RopeRep* __left = __c->_M_left;</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  _RopeRep* __right = __c->_M_right;</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordtype">size_t</span> __left_len = __left->_M_size;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  _RopeRep* __result;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  </div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordflow">if</span> (__adj_endp1 <= __left_len)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">return</span> _S_substring(__left, __start, __endp1);</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__start >= __left_len)</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">return</span> _S_substring(__right, __start - __left_len,</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  __adj_endp1 - __left_len);</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  _Self_destruct_ptr __left_result(_S_substring(__left,</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  __start,</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  __left_len));</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  _Self_destruct_ptr __right_result(_S_substring(__right, 0,</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  __endp1 </div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  - __left_len));</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  __result = _S_concat(__left_result, __right_result);</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  }</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  {</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  _RopeLeaf* __l = (_RopeLeaf*)__base;</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  _RopeLeaf* __result;</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">size_t</span> __result_len;</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">if</span> (__start >= __adj_endp1)</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  __result_len = __adj_endp1 - __start;</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordflow">if</span> (__result_len > __lazy_threshold)</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">goto</span> lazy;</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="preprocessor">#ifdef __GC</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keyword">const</span> _CharT* __section = __l->_M_data + __start;</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  __result = _S_new_RopeLeaf(__section, __result_len,</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  __base->_M_get_allocator());</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  __result->_M_c_string = 0; <span class="comment">// Not eos terminated.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// We should sometimes create substring node instead.</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  __result = __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__l->_M_data + __start,</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  __result_len,</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  __base-></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  _M_get_allocator());</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  }</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="comment">// Avoid introducing multiple layers of substring nodes.</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  {</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  _RopeSubstring* __old = (_RopeSubstring*)__base;</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordtype">size_t</span> __result_len;</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keywordflow">if</span> (__start >= __adj_endp1)</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  __result_len = __adj_endp1 - __start;</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordflow">if</span> (__result_len > __lazy_threshold)</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  {</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  _RopeSubstring* __result =</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  _S_new_RopeSubstring(__old->_M_base,</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  __start + __old->_M_start,</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  __adj_endp1 - __start,</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  __base->_M_get_allocator());</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  </div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  } <span class="comment">// *** else fall through: ***</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  {</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  _RopeFunction* __f = (_RopeFunction*)__base;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  _CharT* __section;</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordtype">size_t</span> __result_len;</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">if</span> (__start >= __adj_endp1)</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  __result_len = __adj_endp1 - __start;</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  </div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">if</span> (__result_len > __lazy_threshold)</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">goto</span> lazy;</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  __section = (_CharT*)</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  rope::_Data_allocate(_S_rounded_up_size(__result_len));</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  __try</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  { (*(__f->_M_fn))(__start, __result_len, __section); }</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  __catch(...)</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  {</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  _RopeRep::__STL_FREE_STRING(__section, __result_len,</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  __base->_M_get_allocator());</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  __throw_exception_again;</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  _S_cond_store_eos(__section[__result_len]);</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordflow">return</span> _S_new_RopeLeaf(__section, __result_len,</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  __base->_M_get_allocator());</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  }</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  lazy:</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  {</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// Create substring node.</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">return</span> _S_new_RopeSubstring(__base, __start, __adj_endp1 - __start,</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  __base->_M_get_allocator());</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  }</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> </div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keyword">class </span>_Rope_flatten_char_consumer</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  : <span class="keyword">public</span> _Rope_char_consumer<_CharT></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  {</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  _CharT* _M_buf_ptr;</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  </div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  _Rope_flatten_char_consumer(_CharT* __buffer)</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  { _M_buf_ptr = __buffer; }</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> </div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  ~_Rope_flatten_char_consumer() {}</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  operator()(<span class="keyword">const</span> _CharT* __leaf, <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  {</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <a class="code" href="a01541.html#a0ebdef0da5f05e59240160b42eec594b">uninitialized_copy_n</a>(__leaf, __n, _M_buf_ptr);</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  _M_buf_ptr += __n;</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  }</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  };</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span> </div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">class </span>_Rope_find_char_char_consumer</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  : <span class="keyword">public</span> _Rope_char_consumer<_CharT></div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  {</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  _CharT _M_pattern;</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordtype">size_t</span> _M_count; <span class="comment">// Number of nonmatching characters</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  </div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  _Rope_find_char_char_consumer(_CharT __p)</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  : _M_pattern(__p), _M_count(0) {}</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  </div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  ~_Rope_find_char_char_consumer() {}</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  </div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  operator()(<span class="keyword">const</span> _CharT* __leaf, <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  {</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordtype">size_t</span> __i;</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">for</span> (__i = 0; __i < __n; __i++)</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  {</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordflow">if</span> (__leaf[__i] == _M_pattern)</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  {</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  _M_count += __i;</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  _M_count += __n; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  };</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> </div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Traits></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// Here _CharT is both the stream and rope character type.</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">class </span>_Rope_insert_char_consumer</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  : <span class="keyword">public</span> _Rope_char_consumer<_CharT></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  {</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">typedef</span> basic_ostream<_CharT,_Traits> _Insert_ostream;</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  _Insert_ostream& _M_o;</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  _Rope_insert_char_consumer(_Insert_ostream& __writer)</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  : _M_o(__writer) {}</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  ~_Rope_insert_char_consumer() { }</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="comment">// Caller is presumed to own the ostream</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordtype">bool</span> operator() (<span class="keyword">const</span> _CharT* __leaf, <span class="keywordtype">size_t</span> __n);</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// Returns true to continue traversal.</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  };</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> </div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Traits></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  _Rope_insert_char_consumer<_CharT, _Traits>::</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  operator()(<span class="keyword">const</span> _CharT* __leaf, <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  {</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordtype">size_t</span> __i;</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// We assume that formatting is set up correctly for each element.</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">for</span> (__i = 0; __i < __n; __i++)</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  _M_o.put(__leaf[__i]);</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  }</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span> </div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  _S_apply_to_pieces(_Rope_char_consumer<_CharT>& __c,</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">const</span> _RopeRep* __r, <span class="keywordtype">size_t</span> __begin, <span class="keywordtype">size_t</span> __end)</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  {</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keywordflow">if</span> (0 == __r)</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordflow">switch</span>(__r->_M_tag)</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  {</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  {</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  _RopeConcatenation* __conc = (_RopeConcatenation*)__r;</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  _RopeRep* __left = __conc->_M_left;</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordtype">size_t</span> __left_len = __left->_M_size;</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">if</span> (__begin < __left_len)</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  {</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keywordtype">size_t</span> __left_end = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__left_len, __end);</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> (!_S_apply_to_pieces(__c, __left, __begin, __left_end))</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  }</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> (__end > __left_len)</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  {</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  _RopeRep* __right = __conc->_M_right;</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keywordtype">size_t</span> __right_start = <a class="code" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a>(__left_len, __begin);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">if</span> (!_S_apply_to_pieces(__c, __right,</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  __right_start - __left_len,</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  __end - __left_len))</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  }</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  {</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  _RopeLeaf* __l = (_RopeLeaf*)__r;</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">return</span> __c(__l->_M_data + __begin, __end - __begin);</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  }</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  {</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  _RopeFunction* __f = (_RopeFunction*)__r;</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keywordtype">size_t</span> __len = __end - __begin;</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordtype">bool</span> __result;</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  _CharT* __buffer =</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  (_CharT*)_Alloc().allocate(__len * <span class="keyword">sizeof</span>(_CharT));</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  __try</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  {</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  (*(__f->_M_fn))(__begin, __len, __buffer);</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  __result = __c(__buffer, __len);</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  _Alloc().deallocate(__buffer, __len * <span class="keyword">sizeof</span>(_CharT));</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  }</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  __catch(...)</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  {</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  _Alloc().deallocate(__buffer, __len * <span class="keyword">sizeof</span>(_CharT));</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  __throw_exception_again;</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  }</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  }</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  }</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> </div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Traits></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  _Rope_fill(basic_ostream<_CharT, _Traits>& __o, <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  {</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keywordtype">char</span> __f = __o.fill();</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keywordtype">size_t</span> __i;</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  </div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">for</span> (__i = 0; __i < __n; __i++)</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  __o.put(__f);</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> </div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> </div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  _Rope_is_simple(_CharT*)</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> </div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  _Rope_is_simple(<span class="keywordtype">char</span>*)</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> </div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  _Rope_is_simple(<span class="keywordtype">wchar_t</span>*)</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> </div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Traits, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  basic_ostream<_CharT, _Traits>&</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <a class="code" href="a01541.html#a20aaa750b7ddf43635768c7b2d0385e6">operator<<</a>(basic_ostream<_CharT, _Traits>& __o,</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keyword">const</span> rope<_CharT, _Alloc>& __r)</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  {</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordtype">size_t</span> __w = __o.width();</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordtype">bool</span> __left = bool(__o.flags() & <a class="code" href="a05799.html#ac3795cde4efbdf63b27ea978f1a2755d">std::ios::left</a>);</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordtype">size_t</span> __pad_len;</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keywordtype">size_t</span> __rope_len = __r.size();</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  _Rope_insert_char_consumer<_CharT, _Traits> __c(__o);</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordtype">bool</span> __is_simple = _Rope_is_simple((_CharT*)0);</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  </div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">if</span> (__rope_len < __w)</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  __pad_len = __w - __rope_len;</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  __pad_len = 0;</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> </div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">if</span> (!__is_simple)</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  __o.width(__w / __rope_len);</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  __try</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  {</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordflow">if</span> (__is_simple && !__left && __pad_len > 0)</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  _Rope_fill(__o, __pad_len);</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  __r.apply_to_pieces(0, __r.size(), __c);</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">if</span> (__is_simple && __left && __pad_len > 0)</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  _Rope_fill(__o, __pad_len);</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keywordflow">if</span> (!__is_simple)</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  __o.width(__w);</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  __catch(...)</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  {</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keywordflow">if</span> (!__is_simple)</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  __o.width(__w);</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  __throw_exception_again;</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  }</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">return</span> __o;</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  }</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> </div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  _CharT*</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  _S_flatten(_RopeRep* __r, <span class="keywordtype">size_t</span> __start, <span class="keywordtype">size_t</span> __len,</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  _CharT* __buffer)</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  _Rope_flatten_char_consumer<_CharT> __c(__buffer);</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  _S_apply_to_pieces(__c, __r, __start, __start + __len);</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordflow">return</span>(__buffer + __len);</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  }</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> </div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  find(_CharT __pattern, <span class="keywordtype">size_t</span> __start)<span class="keyword"> const</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  _Rope_find_char_char_consumer<_CharT> __c(__pattern);</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  _S_apply_to_pieces(__c, this->_M_tree_ptr, __start, size());</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  size_type __result_pos = __start + __c._M_count;</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="preprocessor">#ifndef __STL_OLD_ROPE_SEMANTICS</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keywordflow">if</span> (__result_pos == size())</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  __result_pos = npos;</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keywordflow">return</span> __result_pos;</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  }</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> </div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  _CharT*</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  _S_flatten(_RopeRep* __r, _CharT* __buffer)</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  {</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keywordflow">if</span> (0 == __r)</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordflow">return</span> __buffer;</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">switch</span>(__r->_M_tag)</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  {</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  {</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  _RopeConcatenation* __c = (_RopeConcatenation*)__r;</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  _RopeRep* __left = __c->_M_left;</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  _RopeRep* __right = __c->_M_right;</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  _CharT* __rest = _S_flatten(__left, __buffer);</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="keywordflow">return</span> _S_flatten(__right, __rest);</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  {</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  _RopeLeaf* __l = (_RopeLeaf*)__r;</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <span class="keywordflow">return</span> copy_n(__l->_M_data, __l->_M_size, __buffer).second;</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  }</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="comment">// We don't yet do anything with substring nodes.</span></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="comment">// This needs to be fixed before ropefiles will work well.</span></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  {</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  _RopeFunction* __f = (_RopeFunction*)__r;</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  (*(__f->_M_fn))(0, __f->_M_size, __buffer);</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keywordflow">return</span> __buffer + __f->_M_size;</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  }</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  }</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  }</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> </div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="comment">// This needs work for _CharT != char</span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  _S_dump(_RopeRep* __r, <span class="keywordtype">int</span> __indent)</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  {</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> __i = 0; __i < __indent; __i++)</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  putchar(<span class="charliteral">' '</span>);</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordflow">if</span> (0 == __r)</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  {</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  printf(<span class="stringliteral">"NULL\n"</span>);</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  }</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">if</span> (__detail::_S_concat == __r->_M_tag)</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  {</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  _RopeConcatenation* __c = (_RopeConcatenation*)__r;</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  _RopeRep* __left = __c->_M_left;</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  _RopeRep* __right = __c->_M_right;</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  </div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> <span class="preprocessor">#ifdef __GC</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  printf(<span class="stringliteral">"Concatenation %p (depth = %d, len = %ld, %s balanced)\n"</span>,</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  __r, __r->_M_depth, __r->_M_size,</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  __r->_M_is_balanced? <span class="stringliteral">""</span> : <span class="stringliteral">"not"</span>);</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  printf(<span class="stringliteral">"Concatenation %p (rc = %ld, depth = %d, "</span></div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="stringliteral">"len = %ld, %s balanced)\n"</span>,</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size,</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  __r->_M_is_balanced? <span class="stringliteral">""</span> : <span class="stringliteral">"not"</span>);</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  _S_dump(__left, __indent + 2);</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  _S_dump(__right, __indent + 2);</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  }</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  {</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* __kind;</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  </div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keywordflow">switch</span> (__r->_M_tag)</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  {</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  __kind = <span class="stringliteral">"Leaf"</span>;</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  __kind = <span class="stringliteral">"Function"</span>;</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  __kind = <span class="stringliteral">"Function representing substring"</span>;</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  __kind = <span class="stringliteral">"(corrupted kind field!)"</span>;</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  }</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="preprocessor">#ifdef __GC</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  printf(<span class="stringliteral">"%s %p (depth = %d, len = %ld) "</span>,</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  __kind, __r, __r->_M_depth, __r->_M_size);</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  printf(<span class="stringliteral">"%s %p (rc = %ld, depth = %d, len = %ld) "</span>,</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  __kind, __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size);</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordflow">if</span> (_S_is_one_byte_char_type((_CharT*)0))</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  {</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> __max_len = 40;</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  _Self_destruct_ptr __prefix(_S_substring(__r, 0, __max_len));</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  _CharT __buffer[__max_len + 1];</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keywordtype">bool</span> __too_big = __r->_M_size > __prefix->_M_size;</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  </div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  _S_flatten(__prefix, __buffer);</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  __buffer[__prefix->_M_size] = _S_eos((_CharT*)0);</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  printf(<span class="stringliteral">"%s%s\n"</span>, (<span class="keywordtype">char</span>*)__buffer,</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  __too_big? <span class="stringliteral">"...\n"</span> : <span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  }</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  printf(<span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  }</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> </div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  _S_min_len[int(__detail::_S_max_rope_depth) + 1] = {</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="comment">/* 0 */</span>1, <span class="comment">/* 1 */</span>2, <span class="comment">/* 2 */</span>3, <span class="comment">/* 3 */</span>5, <span class="comment">/* 4 */</span>8, <span class="comment">/* 5 */</span>13, <span class="comment">/* 6 */</span>21,</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="comment">/* 7 */</span>34, <span class="comment">/* 8 */</span>55, <span class="comment">/* 9 */</span>89, <span class="comment">/* 10 */</span>144, <span class="comment">/* 11 */</span>233, <span class="comment">/* 12 */</span>377,</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="comment">/* 13 */</span>610, <span class="comment">/* 14 */</span>987, <span class="comment">/* 15 */</span>1597, <span class="comment">/* 16 */</span>2584, <span class="comment">/* 17 */</span>4181,</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="comment">/* 18 */</span>6765, <span class="comment">/* 19 */</span>10946, <span class="comment">/* 20 */</span>17711, <span class="comment">/* 21 */</span>28657, <span class="comment">/* 22 */</span>46368,</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="comment">/* 23 */</span>75025, <span class="comment">/* 24 */</span>121393, <span class="comment">/* 25 */</span>196418, <span class="comment">/* 26 */</span>317811,</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="comment">/* 27 */</span>514229, <span class="comment">/* 28 */</span>832040, <span class="comment">/* 29 */</span>1346269, <span class="comment">/* 30 */</span>2178309,</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="comment">/* 31 */</span>3524578, <span class="comment">/* 32 */</span>5702887, <span class="comment">/* 33 */</span>9227465, <span class="comment">/* 34 */</span>14930352,</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="comment">/* 35 */</span>24157817, <span class="comment">/* 36 */</span>39088169, <span class="comment">/* 37 */</span>63245986, <span class="comment">/* 38 */</span>102334155,</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">/* 39 */</span>165580141, <span class="comment">/* 40 */</span>267914296, <span class="comment">/* 41 */</span>433494437,</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="comment">/* 42 */</span>701408733, <span class="comment">/* 43 */</span>1134903170, <span class="comment">/* 44 */</span>1836311903,</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="comment">/* 45 */</span>2971215073u };</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="comment">// These are Fibonacci numbers < 2**32.</span></div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> </div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keyword">typename</span> rope<_CharT, _Alloc>::_RopeRep*</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  _S_balance(_RopeRep* __r)</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  {</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  _RopeRep* __forest[int(__detail::_S_max_rope_depth) + 1];</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  _RopeRep* __result = 0;</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordtype">int</span> __i;</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="comment">// Invariant:</span></div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="comment">// The concatenation of forest in descending order is equal to __r.</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="comment">// __forest[__i]._M_size >= _S_min_len[__i]</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="comment">// __forest[__i]._M_depth = __i</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="comment">// References from forest are included in refcount.</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  </div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keywordflow">for</span> (__i = 0; __i <= int(__detail::_S_max_rope_depth); ++__i)</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  __forest[__i] = 0;</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  __try</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  {</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  _S_add_to_forest(__r, __forest);</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="keywordflow">for</span> (__i = 0; __i <= int(__detail::_S_max_rope_depth); ++__i)</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">if</span> (0 != __forest[__i])</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  {</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  _Self_destruct_ptr __old(__result);</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  __result = _S_concat(__forest[__i], __result);</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  __forest[__i]->_M_unref_nonnil();</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> <span class="preprocessor">#if !defined(__GC) && __cpp_exceptions</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  __forest[__i] = 0;</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  }</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  }</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  __catch(...)</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  {</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keywordflow">for</span>(__i = 0; __i <= int(__detail::_S_max_rope_depth); __i++)</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  _S_unref(__forest[__i]);</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  __throw_exception_again;</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  }</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  </div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">if</span> (__result->_M_depth > <span class="keywordtype">int</span>(__detail::_S_max_rope_depth))</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  __throw_length_error(__N(<span class="stringliteral">"rope::_S_balance"</span>));</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keywordflow">return</span>(__result);</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  }</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> </div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  _S_add_to_forest(_RopeRep* __r, _RopeRep** __forest)</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  {</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keywordflow">if</span> (__r->_M_is_balanced)</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  {</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  _S_add_leaf_to_forest(__r, __forest);</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  }</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> </div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  {</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  _RopeConcatenation* __c = (_RopeConcatenation*)__r;</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  </div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  _S_add_to_forest(__c->_M_left, __forest);</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  _S_add_to_forest(__c->_M_right, __forest);</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  }</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  }</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> </div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> </div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  _S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest)</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  {</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  _RopeRep* __insertee; <span class="comment">// included in refcount</span></div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  _RopeRep* __too_tiny = 0; <span class="comment">// included in refcount</span></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordtype">int</span> __i; <span class="comment">// forest[0..__i-1] is empty</span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="keywordtype">size_t</span> __s = __r->_M_size;</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  </div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keywordflow">for</span> (__i = 0; __s >= _S_min_len[__i+1]<span class="comment">/* not this bucket */</span>; ++__i)</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  {</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">if</span> (0 != __forest[__i])</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  {</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  _Self_destruct_ptr __old(__too_tiny);</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  __too_tiny = _S_concat_and_set_balanced(__forest[__i],</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  __too_tiny);</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  __forest[__i]->_M_unref_nonnil();</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  __forest[__i] = 0;</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  }</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  }</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  {</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  _Self_destruct_ptr __old(__too_tiny);</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  __insertee = _S_concat_and_set_balanced(__too_tiny, __r);</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  }</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="comment">// Too_tiny dead, and no longer included in refcount.</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  <span class="comment">// Insertee is live and included.</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordflow">for</span> (;; ++__i)</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  {</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordflow">if</span> (0 != __forest[__i])</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  {</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  _Self_destruct_ptr __old(__insertee);</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  __insertee = _S_concat_and_set_balanced(__forest[__i],</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  __insertee);</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  __forest[__i]->_M_unref_nonnil();</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  __forest[__i] = 0;</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  }</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordflow">if</span> (__i == <span class="keywordtype">int</span>(__detail::_S_max_rope_depth)</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  || __insertee->_M_size < _S_min_len[__i+1])</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  {</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  __forest[__i] = __insertee;</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="comment">// refcount is OK since __insertee is now dead.</span></div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  }</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  }</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  }</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> </div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  _CharT</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  _S_fetch(_RopeRep* __r, size_type __i)</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  {</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  __GC_CONST _CharT* __cstr = __r->_M_c_string;</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  </div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordflow">if</span> (0 != __cstr)</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keywordflow">return</span> __cstr[__i];</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keywordflow">for</span>(;;)</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  {</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keywordflow">switch</span>(__r->_M_tag)</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  {</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  {</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  _RopeConcatenation* __c = (_RopeConcatenation*)__r;</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  _RopeRep* __left = __c->_M_left;</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keywordtype">size_t</span> __left_len = __left->_M_size;</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  </div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="keywordflow">if</span> (__i >= __left_len)</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  {</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  __i -= __left_len;</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  __r = __c->_M_right;</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  } </div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  __r = __left;</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  }</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  {</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  _RopeLeaf* __l = (_RopeLeaf*)__r;</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="keywordflow">return</span> __l->_M_data[__i];</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  }</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  {</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  _RopeFunction* __f = (_RopeFunction*)__r;</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  _CharT __result;</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  </div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  (*(__f->_M_fn))(__i, 1, &__result);</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  }</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  }</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  }</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  }</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  </div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// Return a uniquely referenced character slot for the given</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="comment">// position, or 0 if that's not possible.</span></div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  _CharT*</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  _S_fetch_ptr(_RopeRep* __r, size_type __i)</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  {</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  _RopeRep* __clrstack[__detail::_S_max_rope_depth];</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordtype">size_t</span> __csptr = 0;</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  </div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="keywordflow">for</span>(;;)</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  {</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keywordflow">if</span> (__r->_M_ref_count > 1)</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keywordflow">switch</span>(__r->_M_tag)</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  {</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="keywordflow">case</span> __detail::_S_concat:</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  {</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  _RopeConcatenation* __c = (_RopeConcatenation*)__r;</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  _RopeRep* __left = __c->_M_left;</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keywordtype">size_t</span> __left_len = __left->_M_size;</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  </div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keywordflow">if</span> (__c->_M_c_string != 0)</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  __clrstack[__csptr++] = __c;</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <span class="keywordflow">if</span> (__i >= __left_len)</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  {</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  __i -= __left_len;</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  __r = __c->_M_right;</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  } </div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  __r = __left;</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  }</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <span class="keywordflow">case</span> __detail::_S_leaf:</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  {</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  _RopeLeaf* __l = (_RopeLeaf*)__r;</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  <span class="keywordflow">if</span> (__l->_M_c_string != __l->_M_data && __l->_M_c_string != 0)</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  __clrstack[__csptr++] = __l;</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  <span class="keywordflow">while</span> (__csptr > 0)</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  {</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  -- __csptr;</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  _RopeRep* __d = __clrstack[__csptr];</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  __d->_M_free_c_string();</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  __d->_M_c_string = 0;</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  }</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="keywordflow">return</span> __l->_M_data + __i;</div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  }</div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keywordflow">case</span> __detail::_S_function:</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="keywordflow">case</span> __detail::_S_substringfn:</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  }</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  }</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  }</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> <span class="preprocessor">#endif </span><span class="comment">/* __GC */</span><span class="preprocessor"></span></div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span> </div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="comment">// The following could be implemented trivially using</span></div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <span class="comment">// lexicographical_compare_3way.</span></div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <span class="comment">// We do a little more work to avoid dealing with rope iterators for</span></div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="comment">// flat strings.</span></div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  <span class="keywordtype">int</span></div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  _S_compare (<span class="keyword">const</span> _RopeRep* __left, <span class="keyword">const</span> _RopeRep* __right)</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  {</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  <span class="keywordtype">size_t</span> __left_len;</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="keywordtype">size_t</span> __right_len;</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  </div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="keywordflow">if</span> (0 == __right)</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="keywordflow">return</span> 0 != __left;</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keywordflow">if</span> (0 == __left)</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  __left_len = __left->_M_size;</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  __right_len = __right->_M_size;</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == __left->_M_tag)</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  {</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  _RopeLeaf* __l = (_RopeLeaf*) __left;</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == __right->_M_tag)</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  {</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  _RopeLeaf* __r = (_RopeLeaf*) __right;</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <span class="keywordflow">return</span> <a class="code" href="a01462.html#gadd7eb026c10d4a6929b8c61d0501bdee">lexicographical_compare_3way</a>(__l->_M_data,</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  __l->_M_data + __left_len,</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  __r->_M_data, __r->_M_data</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  + __right_len);</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  }</div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  {</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  const_iterator __rstart(__right, 0);</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  const_iterator __rend(__right, __right_len);</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordflow">return</span> <a class="code" href="a01462.html#gadd7eb026c10d4a6929b8c61d0501bdee">lexicographical_compare_3way</a>(__l->_M_data, __l->_M_data</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  + __left_len,</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  __rstart, __rend);</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  }</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  }</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  {</div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  const_iterator __lstart(__left, 0);</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  const_iterator __lend(__left, __left_len);</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == __right->_M_tag)</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  {</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  _RopeLeaf* __r = (_RopeLeaf*) __right;</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordflow">return</span> <a class="code" href="a01462.html#gadd7eb026c10d4a6929b8c61d0501bdee">lexicographical_compare_3way</a>(__lstart, __lend,</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  __r->_M_data, __r->_M_data</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  + __right_len);</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  }</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  {</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  const_iterator __rstart(__right, 0);</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  const_iterator __rend(__right, __right_len);</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  <span class="keywordflow">return</span> <a class="code" href="a01462.html#gadd7eb026c10d4a6929b8c61d0501bdee">lexicographical_compare_3way</a>(__lstart, __lend,</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  __rstart, __rend);</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  }</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  }</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  }</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> </div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="comment">// Assignment to reference proxies.</span></div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  _Rope_char_ref_proxy<_CharT, _Alloc>&</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  _Rope_char_ref_proxy<_CharT, _Alloc>::</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  operator=(_CharT __c)</div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  {</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  _RopeRep* __old = _M_root->_M_tree_ptr;</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="comment">// First check for the case in which everything is uniquely</span></div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <span class="comment">// referenced. In that case we can do this destructively.</span></div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  _CharT* __ptr = _My_rope::_S_fetch_ptr(__old, _M_pos);</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keywordflow">if</span> (0 != __ptr)</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  {</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  *__ptr = __c;</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  }</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  _Self_destruct_ptr __left(_My_rope::_S_substring(__old, 0, _M_pos));</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  _Self_destruct_ptr __right(_My_rope::_S_substring(__old, _M_pos + 1,</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  __old->_M_size));</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  _Self_destruct_ptr __result_left(_My_rope::</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  _S_destr_concat_char_iter(__left,</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  &__c, 1));</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> </div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  _RopeRep* __result = _My_rope::_S_concat(__result_left, __right);</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="preprocessor">#ifndef __GC</span></div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  _RopeRep::_S_unref(__old);</div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  _M_root->_M_tree_ptr = __result;</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  }</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span> </div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  <span class="keyword">inline</span> _Rope_char_ref_proxy<_CharT, _Alloc>::</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  operator _CharT()<span class="keyword"> const</span></div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <span class="keywordflow">if</span> (_M_current_valid)</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keywordflow">return</span> _M_current;</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="keywordflow">return</span> _My_rope::_S_fetch(_M_root->_M_tree_ptr, _M_pos);</div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  }</div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> </div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  _Rope_char_ptr_proxy<_CharT, _Alloc></div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  <a class="code" href="a01541.html#a7e7330f9af270f5bd90341928263da8d">_Rope_char_ref_proxy<_CharT, _Alloc>::</a></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> <a class="code" href="a01541.html#a7e7330f9af270f5bd90341928263da8d"> operator&</a>()<span class="keyword"> const</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _Rope_char_ptr_proxy<_CharT, _Alloc>(*<span class="keyword">this</span>); }</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> </div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="keyword">template</span> <<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  rope(<span class="keywordtype">size_t</span> __n, _CharT __c, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  : _Base(__a)</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  {</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  rope<_CharT,_Alloc> __result;</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __exponentiate_threshold = 32;</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <span class="keywordtype">size_t</span> __exponent;</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="keywordtype">size_t</span> __rest;</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  _CharT* __rest_buffer;</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  _RopeRep* __remainder;</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  rope<_CharT, _Alloc> __remainder_rope;</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span> </div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="keywordflow">if</span> (0 == __n)</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span> </div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  __exponent = __n / __exponentiate_threshold;</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  __rest = __n % __exponentiate_threshold;</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keywordflow">if</span> (0 == __rest)</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  __remainder = 0;</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  {</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  __rest_buffer = this->_Data_allocate(_S_rounded_up_size(__rest));</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  __uninitialized_fill_n_a(__rest_buffer, __rest, __c,</div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  _M_get_allocator());</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  _S_cond_store_eos(__rest_buffer[__rest]);</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  __try</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  { __remainder = _S_new_RopeLeaf(__rest_buffer, __rest,</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  _M_get_allocator()); }</div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  __catch(...)</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  {</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  _RopeRep::__STL_FREE_STRING(__rest_buffer, __rest,</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  _M_get_allocator());</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  __throw_exception_again;</div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  }</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  }</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  __remainder_rope._M_tree_ptr = __remainder;</div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keywordflow">if</span> (__exponent != 0)</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  {</div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  _CharT* __base_buffer =</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  this->_Data_allocate(_S_rounded_up_size(__exponentiate_threshold));</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  _RopeLeaf* __base_leaf;</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  rope __base_rope;</div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  __uninitialized_fill_n_a(__base_buffer, __exponentiate_threshold, __c,</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  _M_get_allocator());</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  _S_cond_store_eos(__base_buffer[__exponentiate_threshold]);</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  __try</div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  {</div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  __base_leaf = _S_new_RopeLeaf(__base_buffer,</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  __exponentiate_threshold,</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  _M_get_allocator());</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  }</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  __catch(...)</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  {</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  _RopeRep::__STL_FREE_STRING(__base_buffer,</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  __exponentiate_threshold,</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  _M_get_allocator());</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  __throw_exception_again;</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  }</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  __base_rope._M_tree_ptr = __base_leaf;</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="keywordflow">if</span> (1 == __exponent)</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  __result = __base_rope;</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  __result = <a class="code" href="a01462.html#ga52a0d4d0aad4e35cbcc82c8be1dfcebe">power</a>(__base_rope, __exponent,</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  _Rope_Concat_fn<_CharT, _Alloc>());</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  </div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <span class="keywordflow">if</span> (0 != __remainder)</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  __result += __remainder_rope;</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  }</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  __result = __remainder_rope;</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  </div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  this->_M_tree_ptr = __result._M_tree_ptr;</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  this->_M_tree_ptr->_M_ref_nonnil();</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  }</div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  </div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  _CharT</div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  rope<_CharT, _Alloc>::_S_empty_c_str[1];</div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  </div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keyword">const</span> _CharT*</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  rope<_CharT, _Alloc>::</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  c_str()<span class="keyword"> const</span></div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <span class="keywordflow">if</span> (0 == this->_M_tree_ptr)</div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  {</div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  _S_empty_c_str[0] = _S_eos((_CharT*)0); <span class="comment">// Possibly redundant,</span></div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="comment">// but probably fast.</span></div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="keywordflow">return</span> _S_empty_c_str;</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  }</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  __gthread_mutex_lock (&this->_M_tree_ptr->_M_c_string_lock);</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  __GC_CONST _CharT* __result = this->_M_tree_ptr->_M_c_string;</div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="keywordflow">if</span> (0 == __result)</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  {</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  <span class="keywordtype">size_t</span> __s = size();</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  __result = this->_Data_allocate(__s + 1);</div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  _S_flatten(this->_M_tree_ptr, __result);</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  __result[__s] = _S_eos((_CharT*)0);</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  this->_M_tree_ptr->_M_c_string = __result;</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  }</div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  __gthread_mutex_unlock (&this->_M_tree_ptr->_M_c_string_lock);</div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="keywordflow">return</span>(__result);</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  }</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  </div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keyword">template</span><<span class="keyword">class</span> _CharT, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <span class="keyword">const</span> _CharT* rope<_CharT, _Alloc>::</div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  replace_with_c_str()</div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  {</div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  <span class="keywordflow">if</span> (0 == this->_M_tree_ptr)</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  {</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  _S_empty_c_str[0] = _S_eos((_CharT*)0);</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keywordflow">return</span> _S_empty_c_str;</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  }</div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  __GC_CONST _CharT* __old_c_string = this->_M_tree_ptr->_M_c_string;</div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <span class="keywordflow">if</span> (__detail::_S_leaf == this->_M_tree_ptr->_M_tag</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  && 0 != __old_c_string)</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keywordflow">return</span>(__old_c_string);</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  <span class="keywordtype">size_t</span> __s = size();</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  _CharT* __result = this->_Data_allocate(_S_rounded_up_size(__s));</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  _S_flatten(this->_M_tree_ptr, __result);</div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  __result[__s] = _S_eos((_CharT*)0);</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  this->_M_tree_ptr->_M_unref_nonnil();</div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  this->_M_tree_ptr = _S_new_RopeLeaf(__result, __s,</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  this->_M_get_allocator());</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <span class="keywordflow">return</span>(__result);</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  }</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span> </div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <span class="comment">// Algorithm specializations. More should be added.</span></div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  </div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="keyword">template</span><<span class="keyword">class</span> _Rope_iterator> <span class="comment">// was templated on CharT and Alloc</span></div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="keywordtype">void</span> <span class="comment">// VC++ workaround</span></div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  _Rope_rotate(_Rope_iterator __first,</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  _Rope_iterator __middle,</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  _Rope_iterator __last)</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  {</div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rope_iterator::value_type _CharT;</div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rope_iterator::_allocator_type _Alloc;</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  </div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  rope<_CharT, _Alloc>& __r(__first.container());</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  rope<_CharT, _Alloc> __prefix = __r.substr(0, __first.index());</div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  rope<_CharT, _Alloc> __suffix =</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  __r.substr(__last.index(), __r.size() - __last.index());</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  rope<_CharT, _Alloc> __part1 =</div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  __r.substr(__middle.index(), __last.index() - __middle.index());</div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  rope<_CharT, _Alloc> __part2 =</div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  __r.substr(__first.index(), __middle.index() - __first.index());</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  __r = __prefix;</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  __r += __part1;</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  __r += __part2;</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  __r += __suffix;</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  }</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> </div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span> <span class="preprocessor">#if !defined(__GNUC__)</span></div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  <span class="comment">// Appears to confuse g++</span></div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  rotate(_Rope_iterator<<span class="keywordtype">char</span>, __STL_DEFAULT_ALLOCATOR(<span class="keywordtype">char</span>)> __first,</div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  _Rope_iterator<<span class="keywordtype">char</span>, __STL_DEFAULT_ALLOCATOR(<span class="keywordtype">char</span>)> __middle,</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  _Rope_iterator<<span class="keywordtype">char</span>, __STL_DEFAULT_ALLOCATOR(<span class="keywordtype">char</span>)> __last)</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  { _Rope_rotate(__first, __middle, __last); }</div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> </div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span> <span class="preprocessor"># if 0</span></div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="comment">// Probably not useful for several reasons:</span></div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  <span class="comment">// - for SGIs 7.1 compiler and probably some others,</span></div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="comment">// this forces lots of rope<wchar_t, ...> instantiations, creating a</span></div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="comment">// code bloat and compile time problem. (Fixed in 7.2.)</span></div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="comment">// - wchar_t is 4 bytes wide on most UNIX platforms, making it</span></div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  <span class="comment">// unattractive for unicode strings. Unsigned short may be a better</span></div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <span class="comment">// character type.</span></div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  rotate(_Rope_iterator<<span class="keywordtype">wchar_t</span>, __STL_DEFAULT_ALLOCATOR(<span class="keywordtype">char</span>)> __first,</div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  _Rope_iterator<<span class="keywordtype">wchar_t</span>, __STL_DEFAULT_ALLOCATOR(<span class="keywordtype">char</span>)> __middle,</div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  _Rope_iterator<<span class="keywordtype">wchar_t</span>, __STL_DEFAULT_ALLOCATOR(<span class="keywordtype">char</span>)> __last)</div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  { _Rope_rotate(__first, __middle, __last); }</div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span> </div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> <div class="ttc" id="a00239_html"><div class="ttname"><a href="a00239.html">cstdio</a></div></div>
<div class="ttc" id="a01541_html_a0ebdef0da5f05e59240160b42eec594b"><div class="ttname"><a href="a01541.html#a0ebdef0da5f05e59240160b42eec594b">std::uninitialized_copy_n</a></div><div class="ttdeci">_ForwardIterator uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result)</div><div class="ttdoc">Copies the range [first,first+n) into result.</div><div class="ttdef"><b>Definition:</b> <a href="a00596_source.html#l00812">stl_uninitialized.h:812</a></div></div>
<div class="ttc" id="a00356_html"><div class="ttname"><a href="a00356.html">functexcept.h</a></div></div>
<div class="ttc" id="a01541_html_a468dae7cc599699643eafa95cc9999af"><div class="ttname"><a href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a></div><div class="ttdeci">void _Destroy(_Tp *__pointer)</div><div class="ttdef"><b>Definition:</b> <a href="a00536_source.html#l00097">stl_construct.h:97</a></div></div>
<div class="ttc" id="a17004_html"><div class="ttname"><a href="a17004.html">numeric</a></div></div>
<div class="ttc" id="a16965_html"><div class="ttname"><a href="a16965.html">memory</a></div></div>
<div class="ttc" id="a01547_html"><div class="ttname"><a href="a01547.html">__gnu_cxx</a></div><div class="ttdoc">GNU extensions for public use.</div></div>
<div class="ttc" id="a01462_html_gadd7eb026c10d4a6929b8c61d0501bdee"><div class="ttname"><a href="a01462.html#gadd7eb026c10d4a6929b8c61d0501bdee">__gnu_cxx::lexicographical_compare_3way</a></div><div class="ttdeci">int lexicographical_compare_3way(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2)</div><div class="ttdoc">memcmp on steroids.</div><div class="ttdef"><b>Definition:</b> <a href="a16461_source.html#l00201">ext/algorithm:201</a></div></div>
<div class="ttc" id="a01485_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</a></div></div>
<div class="ttc" id="a05799_html_ac3795cde4efbdf63b27ea978f1a2755d"><div class="ttname"><a href="a05799.html#ac3795cde4efbdf63b27ea978f1a2755d">std::ios_base::left</a></div><div class="ttdeci">static const fmtflags left</div><div class="ttdoc">Adds fill characters on the right (final positions) of certain generated output. (I....</div><div class="ttdef"><b>Definition:</b> <a href="a00383_source.html#l00344">ios_base.h:344</a></div></div>
<div class="ttc" id="a02463_html"><div class="ttname"><a href="a02463.html">std::basic_ostream</a></div><div class="ttdoc">Template class basic_ostream.</div><div class="ttdef"><b>Definition:</b> <a href="a00083_source.html#l00086">iosfwd:86</a></div></div>
<div class="ttc" id="a01541_html_a20aaa750b7ddf43635768c7b2d0385e6"><div class="ttname"><a href="a01541.html#a20aaa750b7ddf43635768c7b2d0385e6">std::operator<<</a></div><div class="ttdeci">std::basic_ostream< _CharT, _Traits > & operator<<(std::basic_ostream< _CharT, _Traits > &__os, const bitset< _Nb > &__x)</div><div class="ttdoc">Global I/O operators for bitsets.</div><div class="ttdef"><b>Definition:</b> <a href="a00047_source.html#l01534">bitset:1534</a></div></div>
<div class="ttc" id="a16461_html"><div class="ttname"><a href="a16461.html">algorithm</a></div></div>
<div class="ttc" id="a00116_html"><div class="ttname"><a href="a00116.html">ostream</a></div></div>
<div class="ttc" id="a01541_html_a7e7330f9af270f5bd90341928263da8d"><div class="ttname"><a href="a01541.html#a7e7330f9af270f5bd90341928263da8d">std::operator&</a></div><div class="ttdeci">bitset< _Nb > operator&(const bitset< _Nb > &__x, const bitset< _Nb > &__y) noexcept</div><div class="ttdoc">Global bitwise operations on bitsets.</div><div class="ttdef"><b>Definition:</b> <a href="a00047_source.html#l01429">bitset:1429</a></div></div>
<div class="ttc" id="a01462_html_ga52a0d4d0aad4e35cbcc82c8be1dfcebe"><div class="ttname"><a href="a01462.html#ga52a0d4d0aad4e35cbcc82c8be1dfcebe">__gnu_cxx::power</a></div><div class="ttdeci">_Tp power(_Tp __x, _Integer __n, _MonoidOperation __monoid_op)</div><div class="ttdef"><b>Definition:</b> <a href="a17004_source.html#l00113">ext/numeric:113</a></div></div>
<div class="ttc" id="a01485_html_ga84d30d8c4b3f2cbe8ec2055c34a578da"><div class="ttname"><a href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00219">stl_algobase.h:219</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_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_029334e92d1e3db3ea7d86241898d8b1.html">ext</a></li><li class="navelem"><a class="el" href="a01073.html">ropeimpl.h</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
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
961
