<!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++: rope 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('a00860_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">rope</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00860.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> // SGI's rope class -*- C++ -*-</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> // Copyright (C) 2001-2018 Free Software Foundation, Inc.</div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> //</div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> // This file is part of the GNU ISO C++ Library. This library is free</div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> // software; you can redistribute it and/or modify it under the</div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> // terms of the GNU General Public License as published by the</div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> // Free Software Foundation; either version 3, or (at your option)</div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> // any later version.</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> // This library is distributed in the hope that it will be useful,</div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> // but WITHOUT ANY WARRANTY; without even the implied warranty of</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> // GNU General Public License for more details.</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> // Under Section 7 of GPL version 3, you are granted additional</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> // permissions described in the GCC Runtime Library Exception, version</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> // 3.1, as published by the Free Software Foundation.</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> // You should have received a copy of the GNU General Public License and</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> // a copy of the GCC Runtime Library Exception along with this program;</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> // <http://www.gnu.org/licenses/>.</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> /*</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  * Copyright (c) 1997</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  * Silicon Graphics Computer Systems, Inc.</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  *</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  * Permission to use, copy, modify, distribute and sell this software</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  * and its documentation for any purpose is hereby granted without fee,</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  * provided that the above copyright notice appear in all copies and</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  * that both that copyright notice and this permission notice appear</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  * in supporting documentation. Silicon Graphics makes no</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  * representations about the suitability of this software for any</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  * purpose. It is provided "as is" without express or implied warranty.</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  */</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> /** @file ext/rope</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  * This file is a GNU extension to the Standard C++ Library (possibly</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  * containing extensions from the HP/SGI STL subset). </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</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> #ifndef _ROPE</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> #define _ROPE 1</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> #pragma GCC system_header</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> #include <algorithm></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> #include <iosfwd></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> #include <bits/stl_construct.h></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> #include <bits/stl_uninitialized.h></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> #include <bits/stl_function.h></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> #include <bits/stl_numeric.h></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> #include <bits/allocator.h></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> #include <bits/gthr.h></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> #include <tr1/functional></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> # ifdef __GC</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> # define __GC_CONST const</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> # else</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> # define __GC_CONST // constant except for deallocation</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> # endif</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> #include <ext/memory> // For uninitialized_copy_n</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  namespace __detail</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  enum { _S_max_rope_depth = 45 };</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  enum _Tag {_S_leaf, _S_concat, _S_substringfn, _S_function};</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  } // namespace __detail</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  using std::size_t;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  using std::ptrdiff_t;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  using std::allocator;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  using std::_Destroy;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  // See libstdc++/36832.</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  template<typename _ForwardIterator, typename _Allocator></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  void</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  _Destroy_const(_ForwardIterator __first,</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  _ForwardIterator __last, _Allocator __alloc)</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  for (; __first != __last; ++__first)</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  __alloc.destroy(&*__first);</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  template<typename _ForwardIterator, typename _Tp></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  inline void</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  _Destroy_const(_ForwardIterator __first,</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  _ForwardIterator __last, allocator<_Tp>)</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  { _Destroy(__first, __last); }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  // The _S_eos function is used for those functions that</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  // convert to/from C-like strings to detect the end of the string.</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  // The end-of-C-string character.</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  // This is what the draft standard says it should be.</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  template <class _CharT></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  inline _CharT</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  _S_eos(_CharT*)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  { return _CharT(); }</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>  // Test for basic character types.</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  // For basic character types leaves having a trailing eos.</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  template <class _CharT></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  inline bool</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  _S_is_basic_char_type(_CharT*)</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  { return false; }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  template <class _CharT></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  inline bool</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  _S_is_one_byte_char_type(_CharT*)</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  { return false; }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  inline bool</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  _S_is_basic_char_type(char*)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  { return true; }</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>  inline bool</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  _S_is_one_byte_char_type(char*)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  { return true; }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  inline bool</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  _S_is_basic_char_type(wchar_t*)</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  { return true; }</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>  // Store an eos iff _CharT is a basic character type.</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  // Do not reference _S_eos if it isn't.</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  template <class _CharT></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  inline void</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  _S_cond_store_eos(_CharT&) { }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  inline void</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  _S_cond_store_eos(char& __c)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  { __c = 0; }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  inline void</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  _S_cond_store_eos(wchar_t& __c)</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  { __c = 0; }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  // char_producers are logically functions that generate a section of</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  // a string. These can be converted to ropes. The resulting rope</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  // invokes the char_producer on demand. This allows, for example,</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  // files to be viewed as ropes without reading the entire file.</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  template <class _CharT></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  class char_producer</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  {</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  public:</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  virtual ~char_producer() { }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  virtual void</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  operator()(size_t __start_pos, size_t __len,</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  _CharT* __buffer) = 0;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  // Buffer should really be an arbitrary output iterator.</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  // That way we could flatten directly into an ostream, etc.</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  // This is thoroughly impossible, since iterator types don't</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  // have runtime descriptions.</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  };</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  // Sequence buffers:</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  //</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  // Sequence must provide an append operation that appends an</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  // array to the sequence. Sequence buffers are useful only if</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  // appending an entire array is cheaper than appending element by element.</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  // This is true for many string representations.</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  // This should perhaps inherit from ostream<sequence::value_type></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  // and be implemented correspondingly, so that they can be used</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  // for formatted. For the sake of portability, we don't do this yet.</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>  // For now, sequence buffers behave as output iterators. But they also</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  // behave a little like basic_ostringstream<sequence::value_type> and a</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  // little like containers.</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  template<class _Sequence, size_t _Buf_sz = 100></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  class sequence_buffer</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  : public std::iterator<std::output_iterator_tag, void, void, void, void></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>  public:</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  typedef typename _Sequence::value_type value_type;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  protected:</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  _Sequence* _M_prefix;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  value_type _M_buffer[_Buf_sz];</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  size_t _M_buf_count;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  public:</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  void</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  flush()</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>  _M_prefix->append(_M_buffer, _M_buffer + _M_buf_count);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  _M_buf_count = 0;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  ~sequence_buffer()</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  { flush(); }</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>  sequence_buffer()</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  : _M_prefix(0), _M_buf_count(0) { }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  sequence_buffer(const sequence_buffer& __x)</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  _M_prefix = __x._M_prefix;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  _M_buf_count = __x._M_buf_count;</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);</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>  </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  sequence_buffer(sequence_buffer& __x)</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  {</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  __x.flush();</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  _M_prefix = __x._M_prefix;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  _M_buf_count = 0;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  sequence_buffer(_Sequence& __s)</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  : _M_prefix(&__s), _M_buf_count(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>  sequence_buffer&</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  operator=(sequence_buffer& __x)</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  __x.flush();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  _M_prefix = __x._M_prefix;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  _M_buf_count = 0;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  return *this;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  sequence_buffer&</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  operator=(const sequence_buffer& __x)</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  _M_prefix = __x._M_prefix;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  _M_buf_count = __x._M_buf_count;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  std::copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  return *this;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  void</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  push_back(value_type __x)</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  if (_M_buf_count < _Buf_sz)</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>  _M_buffer[_M_buf_count] = __x;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  ++_M_buf_count;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  else</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  {</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  flush();</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  _M_buffer[0] = __x;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  _M_buf_count = 1;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</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>  void</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  append(value_type* __s, size_t __len)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  {</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  if (__len + _M_buf_count <= _Buf_sz)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  size_t __i = _M_buf_count;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  for (size_t __j = 0; __j < __len; __i++, __j++)</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  _M_buffer[__i] = __s[__j];</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  _M_buf_count += __len;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  else if (0 == _M_buf_count)</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  _M_prefix->append(__s, __s + __len);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  else</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>  flush();</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  append(__s, __len);</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>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  sequence_buffer&</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  write(value_type* __s, size_t __len)</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>  append(__s, __len);</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  return *this;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  sequence_buffer&</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  put(value_type __x)</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>  push_back(__x);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  return *this;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  sequence_buffer&</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  operator=(const value_type& __rhs)</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  push_back(__rhs);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  return *this;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  sequence_buffer&</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  operator*()</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  { return *this; }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  sequence_buffer&</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  operator++()</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  { return *this; }</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  </div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  sequence_buffer</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  operator++(int)</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  { return *this; }</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>  // The following should be treated as private, at least for now.</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  template<class _CharT></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  class _Rope_char_consumer</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  public:</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  // If we had member templates, these should not be virtual.</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  // For now we need to use run-time parametrization where</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  // compile-time would do. Hence this should all be private</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  // for now.</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  // The symmetry with char_producer is accidental and temporary.</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  virtual ~_Rope_char_consumer() { }</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  </div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  virtual bool</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  operator()(const _CharT* __buffer, size_t __len) = 0;</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>  </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  // First a lot of forward declarations. The standard seems to require</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  // much stricter "declaration before use" than many of the implementations</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  // that preceded it.</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  template<class _CharT, class _Alloc = allocator<_CharT> ></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  class rope;</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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  struct _Rope_RopeConcatenation;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  struct _Rope_RopeLeaf;</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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  struct _Rope_RopeFunction;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  </div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  struct _Rope_RopeSubstring;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  class _Rope_iterator;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  class _Rope_const_iterator;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  class _Rope_char_ref_proxy;</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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  class _Rope_char_ptr_proxy;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  bool</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  operator==(const _Rope_char_ptr_proxy<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  const _Rope_char_ptr_proxy<_CharT, _Alloc>& __y);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  _Rope_const_iterator<_CharT, _Alloc></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  operator-(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  ptrdiff_t __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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  _Rope_const_iterator<_CharT, _Alloc></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  operator+(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  ptrdiff_t __n);</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  _Rope_const_iterator<_CharT, _Alloc></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  operator+(ptrdiff_t __n,</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  const _Rope_const_iterator<_CharT, _Alloc>& __x);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  bool</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  operator==(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y);</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> </div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  bool</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  operator<(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y);</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  ptrdiff_t</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  operator-(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  _Rope_iterator<_CharT, _Alloc></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  operator-(const _Rope_iterator<_CharT, _Alloc>& __x, ptrdiff_t __n);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  _Rope_iterator<_CharT, _Alloc></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  operator+(const _Rope_iterator<_CharT, _Alloc>& __x, ptrdiff_t __n);</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  _Rope_iterator<_CharT, _Alloc></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  operator+(ptrdiff_t __n, const _Rope_iterator<_CharT, _Alloc>& __x);</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  bool</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  operator==(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  const _Rope_iterator<_CharT, _Alloc>& __y);</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  bool</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  operator<(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  const _Rope_iterator<_CharT, _Alloc>& __y);</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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  ptrdiff_t</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  operator-(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  const _Rope_iterator<_CharT, _Alloc>& __y);</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  rope<_CharT, _Alloc></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  operator+(const rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  const rope<_CharT, _Alloc>& __right);</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  rope<_CharT, _Alloc></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  operator+(const rope<_CharT, _Alloc>& __left, const _CharT* __right);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  template<class _CharT, class _Alloc></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>  operator+(const rope<_CharT, _Alloc>& __left, _CharT __right);</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>  // Some helpers, so we can use power on ropes.</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  // See below for why this isn't local to the implementation.</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  // This uses a nonstandard refcount convention.</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  // The result has refcount 0.</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  struct _Rope_Concat_fn</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  : public std::binary_function<rope<_CharT, _Alloc>, rope<_CharT, _Alloc>,</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  rope<_CharT, _Alloc> ></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>  rope<_CharT, _Alloc></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  operator()(const rope<_CharT, _Alloc>& __x,</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  const rope<_CharT, _Alloc>& __y)</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  { return __x + __y; }</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> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  inline rope<_CharT, _Alloc></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  identity_element(_Rope_Concat_fn<_CharT, _Alloc>)</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  { return rope<_CharT, _Alloc>(); }</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>  // Class _Refcount_Base provides a type, _RC_t, a data member,</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  // _M_ref_count, and member functions _M_incr and _M_decr, which perform</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  // atomic preincrement/predecrement. The constructor initializes</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  // _M_ref_count.</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  struct _Refcount_Base</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  {</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  // The type _RC_t</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  typedef size_t _RC_t;</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>  // The data member _M_ref_count</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  volatile _RC_t _M_ref_count;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  // Constructor</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> #ifdef __GTHREAD_MUTEX_INIT</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  __gthread_mutex_t _M_ref_count_lock = __GTHREAD_MUTEX_INIT;</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> #else</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  __gthread_mutex_t _M_ref_count_lock;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> #endif</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  _Refcount_Base(_RC_t __n) : _M_ref_count(__n)</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> #ifndef __GTHREAD_MUTEX_INIT</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> #ifdef __GTHREAD_MUTEX_INIT_FUNCTION</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  __GTHREAD_MUTEX_INIT_FUNCTION (&_M_ref_count_lock);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> #else</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> #error __GTHREAD_MUTEX_INIT or __GTHREAD_MUTEX_INIT_FUNCTION should be defined by gthr.h abstraction layer, report problem to libstdc++@gcc.gnu.org.</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> #endif</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> #endif</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</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> #ifndef __GTHREAD_MUTEX_INIT</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  ~_Refcount_Base()</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  { __gthread_mutex_destroy(&_M_ref_count_lock); }</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> #endif</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  void</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  _M_incr()</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  {</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  __gthread_mutex_lock(&_M_ref_count_lock);</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  ++_M_ref_count;</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  __gthread_mutex_unlock(&_M_ref_count_lock);</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  _RC_t</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  _M_decr()</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  {</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  __gthread_mutex_lock(&_M_ref_count_lock);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  volatile _RC_t __tmp = --_M_ref_count;</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  __gthread_mutex_unlock(&_M_ref_count_lock);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  return __tmp;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  };</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>  //</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  // What follows should really be local to rope. Unfortunately,</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  // that doesn't work, since it makes it impossible to define generic</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  // equality on rope iterators. According to the draft standard, the</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  // template parameters for such an equality operator cannot be inferred</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  // from the occurrence of a member class as a parameter.</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  // (SGI compilers in fact allow this, but the __result wouldn't be</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  // portable.)</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  // Similarly, some of the static member functions are member functions</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  // only to avoid polluting the global namespace, and to circumvent</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  // restrictions on type inference for template functions.</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> </div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  //</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  // The internal data structure for representing a rope. This is</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  // private to the implementation. A rope is really just a pointer</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  // to one of these.</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>  // A few basic functions for manipulating this data structure</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  // are members of _RopeRep. Most of the more complex algorithms</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  // are implemented as rope members.</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>  // Some of the static member functions of _RopeRep have identically</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  // named functions in rope that simply invoke the _RopeRep versions.</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> #define __ROPE_DEFINE_ALLOCS(__a) \</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  __ROPE_DEFINE_ALLOC(_CharT,_Data) /* character data */ \</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  typedef _Rope_RopeConcatenation<_CharT,__a> __C; \</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  __ROPE_DEFINE_ALLOC(__C,_C) \</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  typedef _Rope_RopeLeaf<_CharT,__a> __L; \</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  __ROPE_DEFINE_ALLOC(__L,_L) \</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  typedef _Rope_RopeFunction<_CharT,__a> __F; \</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  __ROPE_DEFINE_ALLOC(__F,_F) \</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  typedef _Rope_RopeSubstring<_CharT,__a> __S; \</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  __ROPE_DEFINE_ALLOC(__S,_S)</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> </div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  // Internal rope nodes potentially store a copy of the allocator</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  // instance used to allocate them. This is mostly redundant.</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  // But the alternative would be to pass allocator instances around</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  // in some form to nearly all internal functions, since any pointer</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  // assignment may result in a zero reference count and thus require</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  // deallocation.</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> #define __STATIC_IF_SGI_ALLOC /* not static */</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>  template <class _CharT, class _Alloc></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  struct _Rope_rep_base</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  : public _Alloc</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>  typedef _Alloc allocator_type;</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  allocator_type</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  get_allocator() const</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  { return *static_cast<const _Alloc*>(this); }</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  allocator_type&</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  _M_get_allocator()</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  { return *static_cast<_Alloc*>(this); }</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> </div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  const allocator_type&</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  _M_get_allocator() const</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  { return *static_cast<const _Alloc*>(this); }</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>  _Rope_rep_base(size_t __size, const allocator_type&)</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  : _M_size(__size) { }</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> </div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  size_t _M_size;</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> # define __ROPE_DEFINE_ALLOC(_Tp, __name) \</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  typedef typename \</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  _Alloc::template rebind<_Tp>::other __name##Alloc; \</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  static _Tp* __name##_allocate(size_t __n) \</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  { return __name##Alloc().allocate(__n); } \</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  static void __name##_deallocate(_Tp *__p, size_t __n) \</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  { __name##Alloc().deallocate(__p, __n); }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  __ROPE_DEFINE_ALLOCS(_Alloc)</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> # undef __ROPE_DEFINE_ALLOC</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  };</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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  struct _Rope_RopeRep</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  : public _Rope_rep_base<_CharT, _Alloc></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> # ifndef __GC</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  , _Refcount_Base</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> # endif</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>  public:</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  __detail::_Tag _M_tag:8;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  bool _M_is_balanced:8;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  unsigned char _M_depth;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  __GC_CONST _CharT* _M_c_string;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> #ifdef __GTHREAD_MUTEX_INIT</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  __gthread_mutex_t _M_c_string_lock = __GTHREAD_MUTEX_INIT;</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> #else</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  __gthread_mutex_t _M_c_string_lock;</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> #endif</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  /* Flattened version of string, if needed. */</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  /* typically 0. */</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  /* If it's not 0, then the memory is owned */</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  /* by this node. */</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  /* In the case of a leaf, this may point to */</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  /* the same memory as the data field. */</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  typedef typename _Rope_rep_base<_CharT, _Alloc>::allocator_type</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  allocator_type;</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> </div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  using _Rope_rep_base<_CharT, _Alloc>::get_allocator;</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  using _Rope_rep_base<_CharT, _Alloc>::_M_get_allocator;</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>  _Rope_RopeRep(__detail::_Tag __t, int __d, bool __b, size_t __size,</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  const allocator_type& __a)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  : _Rope_rep_base<_CharT, _Alloc>(__size, __a),</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> #ifndef __GC</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  _Refcount_Base(1),</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> #endif</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  _M_tag(__t), _M_is_balanced(__b), _M_depth(__d), _M_c_string(0)</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> #ifdef __GTHREAD_MUTEX_INIT</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  { }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> #else</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  { __GTHREAD_MUTEX_INIT_FUNCTION (&_M_c_string_lock); }</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  ~_Rope_RopeRep()</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  { __gthread_mutex_destroy (&_M_c_string_lock); }</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> #endif</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> #ifdef __GC</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  void</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  _M_incr () { }</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> #endif</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  static void</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  _S_free_string(__GC_CONST _CharT*, size_t __len,</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  allocator_type& __a);</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> #define __STL_FREE_STRING(__s, __l, __a) _S_free_string(__s, __l, __a);</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  // Deallocate data section of a leaf.</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  // This shouldn't be a member function.</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  // But its hard to do anything else at the</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  // moment, because it's templatized w.r.t.</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  // an allocator.</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  // Does nothing if __GC is defined.</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> #ifndef __GC</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  void _M_free_c_string();</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  void _M_free_tree();</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  // Deallocate t. Assumes t is not 0.</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  void</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  _M_unref_nonnil()</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>  if (0 == _M_decr())</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  _M_free_tree();</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> </div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  void</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  _M_ref_nonnil()</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  { _M_incr(); }</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> </div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  static void</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  _S_unref(_Rope_RopeRep* __t)</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  {</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  if (0 != __t)</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  __t->_M_unref_nonnil();</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> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  static void</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  _S_ref(_Rope_RopeRep* __t)</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  {</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  if (0 != __t)</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  __t->_M_incr();</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>  </div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  static void</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  _S_free_if_unref(_Rope_RopeRep* __t)</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  {</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  if (0 != __t && 0 == __t->_M_ref_count)</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  __t->_M_free_tree();</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> # else /* __GC */</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  void _M_unref_nonnil() { }</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  void _M_ref_nonnil() { }</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  static void _S_unref(_Rope_RopeRep*) { }</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  static void _S_ref(_Rope_RopeRep*) { }</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  static void _S_free_if_unref(_Rope_RopeRep*) { }</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> # endif</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> protected:</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  _Rope_RopeRep&</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  operator=(const _Rope_RopeRep&);</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> </div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  _Rope_RopeRep(const _Rope_RopeRep&);</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  };</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  struct _Rope_RopeLeaf</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  : public _Rope_RopeRep<_CharT, _Alloc></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>  public:</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  // Apparently needed by VC++</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  // The data fields of leaves are allocated with some</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  // extra space, to accommodate future growth and for basic</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  // character types, to hold a trailing eos character.</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  enum { _S_alloc_granularity = 8 };</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>  static size_t</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  _S_rounded_up_size(size_t __n)</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  {</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  size_t __size_with_eos;</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  </div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  if (_S_is_basic_char_type((_CharT*)0))</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  __size_with_eos = __n + 1;</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  else</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  __size_with_eos = __n;</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> #ifdef __GC</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  return __size_with_eos;</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> #else</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  // Allow slop for in-place expansion.</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  return ((__size_with_eos + size_t(_S_alloc_granularity) - 1)</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  &~ (size_t(_S_alloc_granularity) - 1));</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> #endif</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>  __GC_CONST _CharT* _M_data; /* Not necessarily 0 terminated. */</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  /* The allocated size is */</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  /* _S_rounded_up_size(size), except */</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  /* in the GC case, in which it */</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  /* doesn't matter. */</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  allocator_type;</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>  _Rope_RopeLeaf(__GC_CONST _CharT* __d, size_t __size,</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  const allocator_type& __a)</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  : _Rope_RopeRep<_CharT, _Alloc>(__detail::_S_leaf, 0, true,</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  __size, __a), _M_data(__d)</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>  if (_S_is_basic_char_type((_CharT *)0))</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  {</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  // already eos terminated.</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  this->_M_c_string = __d;</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  }</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  // The constructor assumes that d has been allocated with</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  // the proper allocator and the properly padded size.</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  // In contrast, the destructor deallocates the data:</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> #ifndef __GC</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  ~_Rope_RopeLeaf() throw()</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  {</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  if (_M_data != this->_M_c_string)</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  this->_M_free_c_string();</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  </div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  this->__STL_FREE_STRING(_M_data, this->_M_size, this->_M_get_allocator());</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> #endif</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> protected:</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  _Rope_RopeLeaf&</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  operator=(const _Rope_RopeLeaf&);</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> </div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  _Rope_RopeLeaf(const _Rope_RopeLeaf&);</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  };</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> </div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  struct _Rope_RopeConcatenation</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  : public _Rope_RopeRep<_CharT, _Alloc></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  {</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  public:</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  _Rope_RopeRep<_CharT, _Alloc>* _M_left;</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  _Rope_RopeRep<_CharT, _Alloc>* _M_right;</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>  typedef typename _Rope_rep_base<_CharT, _Alloc>::allocator_type</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  allocator_type;</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> </div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  _Rope_RopeConcatenation(_Rope_RopeRep<_CharT, _Alloc>* __l,</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  _Rope_RopeRep<_CharT, _Alloc>* __r,</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  const allocator_type& __a)</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  : _Rope_RopeRep<_CharT, _Alloc>(__detail::_S_concat,</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  std::max(__l->_M_depth,</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  __r->_M_depth) + 1,</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  false,</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  __l->_M_size + __r->_M_size, __a),</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  _M_left(__l), _M_right(__r)</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  { }</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> #ifndef __GC</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  ~_Rope_RopeConcatenation() throw()</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  {</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  this->_M_free_c_string();</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  _M_left->_M_unref_nonnil();</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  _M_right->_M_unref_nonnil();</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  }</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> #endif</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> protected:</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  _Rope_RopeConcatenation&</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  operator=(const _Rope_RopeConcatenation&);</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>  _Rope_RopeConcatenation(const _Rope_RopeConcatenation&);</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  };</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  struct _Rope_RopeFunction</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  : public _Rope_RopeRep<_CharT, _Alloc></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>  public:</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  char_producer<_CharT>* _M_fn;</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> #ifndef __GC</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  bool _M_delete_when_done; // Char_producer is owned by the</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  // rope and should be explicitly</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  // deleted when the rope becomes</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  // inaccessible.</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> #else</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  // In the GC case, we either register the rope for</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  // finalization, or not. Thus the field is unnecessary;</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  // the information is stored in the collector data structures.</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  // We do need a finalization procedure to be invoked by the</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  // collector.</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  static void</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  _S_fn_finalization_proc(void * __tree, void *)</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  { delete ((_Rope_RopeFunction *)__tree) -> _M_fn; }</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> #endif</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  typedef typename _Rope_rep_base<_CharT, _Alloc>::allocator_type</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  allocator_type;</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> </div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  _Rope_RopeFunction(char_producer<_CharT>* __f, size_t __size,</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  bool __d, const allocator_type& __a)</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  : _Rope_RopeRep<_CharT, _Alloc>(__detail::_S_function, 0, true, __size, __a)</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  , _M_fn(__f)</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> #ifndef __GC</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  , _M_delete_when_done(__d)</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> #endif</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  {</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> #ifdef __GC</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  if (__d)</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  {</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  GC_REGISTER_FINALIZER(this, _Rope_RopeFunction::</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  _S_fn_finalization_proc, 0, 0, 0);</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> #endif</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  }</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> #ifndef __GC</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  ~_Rope_RopeFunction() throw()</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  {</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  this->_M_free_c_string();</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  if (_M_delete_when_done)</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  delete _M_fn;</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> # endif</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  protected:</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  _Rope_RopeFunction&</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  operator=(const _Rope_RopeFunction&);</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> </div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  _Rope_RopeFunction(const _Rope_RopeFunction&);</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  };</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  // Substring results are usually represented using just</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  // concatenation nodes. But in the case of very long flat ropes</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  // or ropes with a functional representation that isn't practical.</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  // In that case, we represent the __result as a special case of</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  // RopeFunction, whose char_producer points back to the rope itself.</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  // In all cases except repeated substring operations and</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  // deallocation, we treat the __result as a RopeFunction.</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  struct _Rope_RopeSubstring</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  : public _Rope_RopeFunction<_CharT, _Alloc>,</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  public char_producer<_CharT></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  {</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  public:</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  // XXX this whole class should be rewritten.</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  _Rope_RopeRep<_CharT,_Alloc>* _M_base; // not 0</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  size_t _M_start;</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span> </div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  virtual void</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  operator()(size_t __start_pos, size_t __req_len,</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  _CharT* __buffer)</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  {</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  switch(_M_base->_M_tag)</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  {</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  case __detail::_S_function:</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  case __detail::_S_substringfn:</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  {</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  char_producer<_CharT>* __fn =</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  ((_Rope_RopeFunction<_CharT,_Alloc>*)_M_base)->_M_fn;</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  (*__fn)(__start_pos + _M_start, __req_len, __buffer);</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  break;</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  case __detail::_S_leaf:</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  {</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  __GC_CONST _CharT* __s =</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  ((_Rope_RopeLeaf<_CharT,_Alloc>*)_M_base)->_M_data;</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  uninitialized_copy_n(__s + __start_pos + _M_start, __req_len,</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  __buffer);</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  }</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  break;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  default:</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  break;</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</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>  typedef typename _Rope_rep_base<_CharT, _Alloc>::allocator_type</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  allocator_type;</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> </div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  _Rope_RopeSubstring(_Rope_RopeRep<_CharT, _Alloc>* __b, size_t __s,</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  size_t __l, const allocator_type& __a)</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  : _Rope_RopeFunction<_CharT, _Alloc>(this, __l, false, __a),</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  char_producer<_CharT>(), _M_base(__b), _M_start(__s)</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  {</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> #ifndef __GC</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  _M_base->_M_ref_nonnil();</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> #endif</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  this->_M_tag = __detail::_S_substringfn;</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  }</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  virtual ~_Rope_RopeSubstring() throw()</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  {</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> #ifndef __GC</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  _M_base->_M_unref_nonnil();</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  // _M_free_c_string(); -- done by parent class</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> #endif</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  }</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  };</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> </div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  // Self-destructing pointers to Rope_rep.</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  // These are not conventional smart pointers. Their</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  // only purpose in life is to ensure that unref is called</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  // on the pointer either at normal exit or if an exception</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  // is raised. It is the caller's responsibility to</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  // adjust reference counts when these pointers are initialized</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  // or assigned to. (This convention significantly reduces</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  // the number of potentially expensive reference count</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  // updates.)</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> #ifndef __GC</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  struct _Rope_self_destruct_ptr</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  {</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  _Rope_RopeRep<_CharT, _Alloc>* _M_ptr;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> </div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  ~_Rope_self_destruct_ptr()</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  { _Rope_RopeRep<_CharT, _Alloc>::_S_unref(_M_ptr); }</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> #if __cpp_exceptions</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  _Rope_self_destruct_ptr() : _M_ptr(0) { }</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> #else</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  _Rope_self_destruct_ptr() { }</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> #endif</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  _Rope_self_destruct_ptr(_Rope_RopeRep<_CharT, _Alloc>* __p)</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  : _M_ptr(__p) { }</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>  _Rope_RopeRep<_CharT, _Alloc>&</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  operator*()</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  { return *_M_ptr; }</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>  _Rope_RopeRep<_CharT, _Alloc>*</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  operator->()</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  { return _M_ptr; }</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  </div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  operator _Rope_RopeRep<_CharT, _Alloc>*()</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  { return _M_ptr; }</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  _Rope_self_destruct_ptr&</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  operator=(_Rope_RopeRep<_CharT, _Alloc>* __x)</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  { _M_ptr = __x; return *this; }</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  };</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> #endif</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>  // Dereferencing a nonconst iterator has to return something</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  // that behaves almost like a reference. It's not possible to</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  // return an actual reference since assignment requires extra</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  // work. And we would get into the same problems as with the</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  // CD2 version of basic_string.</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  class _Rope_char_ref_proxy</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  {</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  friend class rope<_CharT, _Alloc>;</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  friend class _Rope_iterator<_CharT, _Alloc>;</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  friend class _Rope_char_ptr_proxy<_CharT, _Alloc>;</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> #ifdef __GC</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  typedef _Rope_RopeRep<_CharT, _Alloc>* _Self_destruct_ptr;</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> #else</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  typedef _Rope_self_destruct_ptr<_CharT, _Alloc> _Self_destruct_ptr;</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> #endif</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  typedef _Rope_RopeRep<_CharT, _Alloc> _RopeRep;</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  typedef rope<_CharT, _Alloc> _My_rope;</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  size_t _M_pos;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  _CharT _M_current;</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  bool _M_current_valid;</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  _My_rope* _M_root; // The whole rope.</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  public:</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  _Rope_char_ref_proxy(_My_rope* __r, size_t __p)</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  : _M_pos(__p), _M_current(), _M_current_valid(false), _M_root(__r) { }</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> </div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  _Rope_char_ref_proxy(const _Rope_char_ref_proxy& __x)</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  : _M_pos(__x._M_pos), _M_current(__x._M_current), </div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  _M_current_valid(false), _M_root(__x._M_root) { }</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> </div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  // Don't preserve cache if the reference can outlive the</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  // expression. We claim that's not possible without calling</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  // a copy constructor or generating reference to a proxy</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  // reference. We declare the latter to have undefined semantics.</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  _Rope_char_ref_proxy(_My_rope* __r, size_t __p, _CharT __c)</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  : _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) { }</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> </div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  inline operator _CharT () const;</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>  _Rope_char_ref_proxy&</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  operator=(_CharT __c);</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  </div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  _Rope_char_ptr_proxy<_CharT, _Alloc> operator&() const;</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  </div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  _Rope_char_ref_proxy&</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  operator=(const _Rope_char_ref_proxy& __c)</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  { return operator=((_CharT)__c); }</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  };</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> </div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  template<class _CharT, class __Alloc></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  inline void</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  swap(_Rope_char_ref_proxy <_CharT, __Alloc > __a,</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  _Rope_char_ref_proxy <_CharT, __Alloc > __b)</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>  _CharT __tmp = __a;</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  __a = __b;</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  __b = __tmp;</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</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>  template<class _CharT, class _Alloc></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  class _Rope_char_ptr_proxy</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  {</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  // XXX this class should be rewritten.</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  friend class _Rope_char_ref_proxy<_CharT, _Alloc>;</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  size_t _M_pos;</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  rope<_CharT,_Alloc>* _M_root; // The whole rope.</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  public:</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  _Rope_char_ptr_proxy(const _Rope_char_ref_proxy<_CharT,_Alloc>& __x)</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  : _M_pos(__x._M_pos), _M_root(__x._M_root) { }</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> </div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  _Rope_char_ptr_proxy(const _Rope_char_ptr_proxy& __x)</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  : _M_pos(__x._M_pos), _M_root(__x._M_root) { }</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> </div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  _Rope_char_ptr_proxy() { }</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>  _Rope_char_ptr_proxy(_CharT* __x)</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  : _M_root(0), _M_pos(0) { }</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> </div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  _Rope_char_ptr_proxy&</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  operator=(const _Rope_char_ptr_proxy& __x)</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  {</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  _M_pos = __x._M_pos;</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  _M_root = __x._M_root;</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  return *this;</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> </div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  friend bool</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  operator==(const _Rope_char_ptr_proxy<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  const _Rope_char_ptr_proxy<_CharT2, _Alloc2>& __y);</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>  _Rope_char_ref_proxy<_CharT, _Alloc> operator*() const</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  { return _Rope_char_ref_proxy<_CharT, _Alloc>(_M_root, _M_pos); }</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  };</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> </div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  // Rope iterators:</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  // Unlike in the C version, we cache only part of the stack</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  // for rope iterators, since they must be efficiently copyable.</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  // When we run out of cache, we have to reconstruct the iterator</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  // value.</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  // Pointers from iterators are not included in reference counts.</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  // Iterators are assumed to be thread private. Ropes can</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  // be shared.</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  </div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  class _Rope_iterator_base</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  : public std::iterator<std::random_access_iterator_tag, _CharT></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  {</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  friend class rope<_CharT, _Alloc>;</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  public:</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  typedef _Alloc _allocator_type; // used in _Rope_rotate, VC++ workaround</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  typedef _Rope_RopeRep<_CharT, _Alloc> _RopeRep;</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  // Borland doesn't want this to be protected.</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  protected:</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  enum { _S_path_cache_len = 4 }; // Must be <= 9.</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  enum { _S_iterator_buf_len = 15 };</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  size_t _M_current_pos;</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  _RopeRep* _M_root; // The whole rope.</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  size_t _M_leaf_pos; // Starting position for current leaf</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  __GC_CONST _CharT* _M_buf_start;</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  // Buffer possibly</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  // containing current char.</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  __GC_CONST _CharT* _M_buf_ptr;</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  // Pointer to current char in buffer.</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  // != 0 ==> buffer valid.</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  __GC_CONST _CharT* _M_buf_end;</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  // One past __last valid char in buffer.</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  // What follows is the path cache. We go out of our</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  // way to make this compact.</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  // Path_end contains the bottom section of the path from</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  // the root to the current leaf.</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  const _RopeRep* _M_path_end[_S_path_cache_len];</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  int _M_leaf_index; // Last valid __pos in path_end;</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  // _M_path_end[0] ... _M_path_end[leaf_index-1]</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  // point to concatenation nodes.</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  unsigned char _M_path_directions;</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  // (path_directions >> __i) & 1 is 1</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  // iff we got from _M_path_end[leaf_index - __i - 1]</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  // to _M_path_end[leaf_index - __i] by going to the</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  // __right. Assumes path_cache_len <= 9.</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  _CharT _M_tmp_buf[_S_iterator_buf_len];</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  // Short buffer for surrounding chars.</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  // This is useful primarily for</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  // RopeFunctions. We put the buffer</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  // here to avoid locking in the</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  // multithreaded case.</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  // The cached path is generally assumed to be valid</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  // only if the buffer is valid.</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  static void _S_setbuf(_Rope_iterator_base& __x);</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  // Set buffer contents given</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  // path cache.</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  static void _S_setcache(_Rope_iterator_base& __x);</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  // Set buffer contents and</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  // path cache.</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  static void _S_setcache_for_incr(_Rope_iterator_base& __x);</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  // As above, but assumes path</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  // cache is valid for previous posn.</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  _Rope_iterator_base() { }</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> </div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  _Rope_iterator_base(_RopeRep* __root, size_t __pos)</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  : _M_current_pos(__pos), _M_root(__root), _M_buf_ptr(0) { }</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> </div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  void _M_incr(size_t __n);</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  void _M_decr(size_t __n);</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  public:</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  size_t</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  index() const</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  { return _M_current_pos; }</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>  _Rope_iterator_base(const _Rope_iterator_base& __x)</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  {</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  if (0 != __x._M_buf_ptr)</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  *this = __x;</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  else</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  {</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  _M_current_pos = __x._M_current_pos;</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  _M_root = __x._M_root;</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  _M_buf_ptr = 0;</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  }</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  }</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  };</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> </div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  class _Rope_iterator;</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> </div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  class _Rope_const_iterator</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  : public _Rope_iterator_base<_CharT, _Alloc></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>  friend class rope<_CharT, _Alloc>;</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  protected:</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  typedef _Rope_RopeRep<_CharT, _Alloc> _RopeRep;</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  // The one from the base class may not be directly visible.</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  _Rope_const_iterator(const _RopeRep* __root, size_t __pos)</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  : _Rope_iterator_base<_CharT, _Alloc>(const_cast<_RopeRep*>(__root),</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  __pos)</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  // Only nonconst iterators modify root ref count</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  { }</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  public:</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  typedef _CharT reference; // Really a value. Returning a reference</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  // Would be a mess, since it would have</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  // to be included in refcount.</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  typedef const _CharT* pointer;</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> </div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  public:</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  _Rope_const_iterator() { }</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> </div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  _Rope_const_iterator(const _Rope_const_iterator& __x)</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  : _Rope_iterator_base<_CharT,_Alloc>(__x) { }</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> </div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  _Rope_const_iterator(const _Rope_iterator<_CharT,_Alloc>& __x);</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  </div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  _Rope_const_iterator(const rope<_CharT, _Alloc>& __r, size_t __pos)</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos) { }</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> </div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  _Rope_const_iterator&</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  operator=(const _Rope_const_iterator& __x)</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  {</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  if (0 != __x._M_buf_ptr)</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  *(static_cast<_Rope_iterator_base<_CharT, _Alloc>*>(this)) = __x;</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  else</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  {</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  this->_M_current_pos = __x._M_current_pos;</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  this->_M_root = __x._M_root;</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  this->_M_buf_ptr = 0;</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  }</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  return(*this);</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>  reference</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  operator*()</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  {</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  if (0 == this->_M_buf_ptr)</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  this->_S_setcache(*this);</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  return *this->_M_buf_ptr;</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  }</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span> </div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  // Without this const version, Rope iterators do not meet the</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  // requirements of an Input Iterator.</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  reference</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  operator*() const</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  {</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  return *const_cast<_Rope_const_iterator&>(*this);</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  }</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> </div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  _Rope_const_iterator&</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  operator++()</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  {</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  __GC_CONST _CharT* __next;</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  if (0 != this->_M_buf_ptr</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  && (__next = this->_M_buf_ptr + 1) < this->_M_buf_end)</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  {</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  this->_M_buf_ptr = __next;</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  ++this->_M_current_pos;</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  }</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  else</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  this->_M_incr(1);</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  return *this;</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</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>  _Rope_const_iterator&</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  operator+=(ptrdiff_t __n)</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  {</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  if (__n >= 0)</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  this->_M_incr(__n);</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  else</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  this->_M_decr(-__n);</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  return *this;</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  }</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span> </div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  _Rope_const_iterator&</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  operator--()</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  {</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  this->_M_decr(1);</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  return *this;</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</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>  _Rope_const_iterator&</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  operator-=(ptrdiff_t __n)</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>  if (__n >= 0)</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  this->_M_decr(__n);</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  else</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  this->_M_incr(-__n);</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  return *this;</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  }</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span> </div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  _Rope_const_iterator</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  operator++(int)</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>  size_t __old_pos = this->_M_current_pos;</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  this->_M_incr(1);</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  return _Rope_const_iterator<_CharT,_Alloc>(this->_M_root, __old_pos);</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  // This makes a subsequent dereference expensive.</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  // Perhaps we should instead copy the iterator</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  // if it has a valid cache?</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> </div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  _Rope_const_iterator</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  operator--(int)</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>  size_t __old_pos = this->_M_current_pos;</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  this->_M_decr(1);</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  return _Rope_const_iterator<_CharT,_Alloc>(this->_M_root, __old_pos);</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  }</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> </div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  friend _Rope_const_iterator<_CharT2, _Alloc2></div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  operator-(const _Rope_const_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  ptrdiff_t __n);</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span> </div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  friend _Rope_const_iterator<_CharT2, _Alloc2></div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  operator+(const _Rope_const_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  ptrdiff_t __n);</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> </div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  friend _Rope_const_iterator<_CharT2, _Alloc2></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  operator+(ptrdiff_t __n,</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  const _Rope_const_iterator<_CharT2, _Alloc2>& __x);</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> </div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  reference</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  operator[](size_t __n)</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  { return rope<_CharT, _Alloc>::_S_fetch(this->_M_root,</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  this->_M_current_pos + __n); }</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> </div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  friend bool</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  operator==(const _Rope_const_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  const _Rope_const_iterator<_CharT2, _Alloc2>& __y);</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> </div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  friend bool</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  operator<(const _Rope_const_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  const _Rope_const_iterator<_CharT2, _Alloc2>& __y);</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> </div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  friend ptrdiff_t</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  operator-(const _Rope_const_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  const _Rope_const_iterator<_CharT2, _Alloc2>& __y);</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  };</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> </div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  template<class _CharT, class _Alloc></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  class _Rope_iterator</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  : public _Rope_iterator_base<_CharT, _Alloc></div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  {</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  friend class rope<_CharT, _Alloc>;</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  protected:</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  typedef typename _Rope_iterator_base<_CharT, _Alloc>::_RopeRep _RopeRep;</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  rope<_CharT, _Alloc>* _M_root_rope;</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span> </div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  // root is treated as a cached version of this, and is used to</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  // detect changes to the underlying rope.</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> </div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  // Root is included in the reference count. This is necessary</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  // so that we can detect changes reliably. Unfortunately, it</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  // requires careful bookkeeping for the nonGC case.</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  _Rope_iterator(rope<_CharT, _Alloc>* __r, size_t __pos)</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  : _Rope_iterator_base<_CharT, _Alloc>(__r->_M_tree_ptr, __pos),</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  _M_root_rope(__r)</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  { _RopeRep::_S_ref(this->_M_root);</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  if (!(__r -> empty()))</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  this->_S_setcache(*this);</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  }</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> </div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  void _M_check();</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  public:</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  typedef _Rope_char_ref_proxy<_CharT, _Alloc> reference;</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  typedef _Rope_char_ref_proxy<_CharT, _Alloc>* pointer;</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>  rope<_CharT, _Alloc>&</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  container()</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  { return *_M_root_rope; }</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>  _Rope_iterator()</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>  this->_M_root = 0; // Needed for reference counting.</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> </div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  _Rope_iterator(const _Rope_iterator& __x)</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  : _Rope_iterator_base<_CharT, _Alloc>(__x)</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>  _M_root_rope = __x._M_root_rope;</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  _RopeRep::_S_ref(this->_M_root);</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  }</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span> </div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  _Rope_iterator(rope<_CharT, _Alloc>& __r, size_t __pos);</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> </div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  ~_Rope_iterator()</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  { _RopeRep::_S_unref(this->_M_root); }</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span> </div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  _Rope_iterator&</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  operator=(const _Rope_iterator& __x)</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  {</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  _RopeRep* __old = this->_M_root;</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>  _RopeRep::_S_ref(__x._M_root);</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  if (0 != __x._M_buf_ptr)</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>  _M_root_rope = __x._M_root_rope;</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  *(static_cast<_Rope_iterator_base<_CharT, _Alloc>*>(this)) = __x;</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>  else</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  {</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  this->_M_current_pos = __x._M_current_pos;</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  this->_M_root = __x._M_root;</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  _M_root_rope = __x._M_root_rope;</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  this->_M_buf_ptr = 0;</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>  _RopeRep::_S_unref(__old);</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  return(*this);</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  }</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> </div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  reference</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  operator*()</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  {</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  _M_check();</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  if (0 == this->_M_buf_ptr)</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  return _Rope_char_ref_proxy<_CharT, _Alloc>(_M_root_rope,</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  this->_M_current_pos);</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  else</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  return _Rope_char_ref_proxy<_CharT, _Alloc>(_M_root_rope,</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  this->_M_current_pos,</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  *this->_M_buf_ptr);</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  }</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>  // See above comment.</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  reference</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  operator*() const</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  {</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  return *const_cast<_Rope_iterator&>(*this);</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> </div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  _Rope_iterator&</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  operator++()</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>  this->_M_incr(1);</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  return *this;</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> </div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  _Rope_iterator&</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  operator+=(ptrdiff_t __n)</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  {</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  if (__n >= 0)</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  this->_M_incr(__n);</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  else</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  this->_M_decr(-__n);</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  return *this;</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  }</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>  _Rope_iterator&</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  operator--()</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  {</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  this->_M_decr(1);</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  return *this;</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  }</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>  _Rope_iterator&</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  operator-=(ptrdiff_t __n)</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  {</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  if (__n >= 0)</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  this->_M_decr(__n);</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  else</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  this->_M_incr(-__n);</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  return *this;</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  }</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span> </div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  _Rope_iterator</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  operator++(int)</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  {</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  size_t __old_pos = this->_M_current_pos;</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  this->_M_incr(1);</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  return _Rope_iterator<_CharT,_Alloc>(_M_root_rope, __old_pos);</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> </div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  _Rope_iterator</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  operator--(int)</div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  {</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  size_t __old_pos = this->_M_current_pos;</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  this->_M_decr(1);</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  return _Rope_iterator<_CharT,_Alloc>(_M_root_rope, __old_pos);</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  }</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> </div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  reference</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  operator[](ptrdiff_t __n)</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  { return _Rope_char_ref_proxy<_CharT, _Alloc>(_M_root_rope,</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  this->_M_current_pos</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  + __n); }</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span> </div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  friend bool</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  operator==(const _Rope_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  const _Rope_iterator<_CharT2, _Alloc2>& __y);</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>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  friend bool</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  operator<(const _Rope_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  const _Rope_iterator<_CharT2, _Alloc2>& __y);</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span> </div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  friend ptrdiff_t</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  operator-(const _Rope_iterator<_CharT2, _Alloc2>& __x,</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  const _Rope_iterator<_CharT2, _Alloc2>& __y);</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span> </div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  friend _Rope_iterator<_CharT2, _Alloc2></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  operator-(const _Rope_iterator<_CharT2, _Alloc2>& __x, ptrdiff_t __n);</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> </div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  friend _Rope_iterator<_CharT2, _Alloc2></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  operator+(const _Rope_iterator<_CharT2, _Alloc2>& __x, ptrdiff_t __n);</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span> </div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  friend _Rope_iterator<_CharT2, _Alloc2></div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  operator+(ptrdiff_t __n, const _Rope_iterator<_CharT2, _Alloc2>& __x);</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> </div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span> </div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  struct _Rope_base</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  : public _Alloc</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>  typedef _Alloc allocator_type;</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>  allocator_type</div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  get_allocator() const</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  { return *static_cast<const _Alloc*>(this); }</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> </div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  allocator_type&</div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  _M_get_allocator()</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  { return *static_cast<_Alloc*>(this); }</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> </div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  const allocator_type&</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  _M_get_allocator() const</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  { return *static_cast<const _Alloc*>(this); }</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span> </div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  typedef _Rope_RopeRep<_CharT, _Alloc> _RopeRep;</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  // The one in _Base may not be visible due to template rules.</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> </div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  _Rope_base(_RopeRep* __t, const allocator_type&)</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  : _M_tree_ptr(__t) { }</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> </div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  _Rope_base(const allocator_type&) { }</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> </div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  // The only data member of a rope:</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  _RopeRep *_M_tree_ptr;</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> </div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> #define __ROPE_DEFINE_ALLOC(_Tp, __name) \</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  typedef typename \</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  _Alloc::template rebind<_Tp>::other __name##Alloc; \</div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  static _Tp* __name##_allocate(size_t __n) \</div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  { return __name##Alloc().allocate(__n); } \</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  static void __name##_deallocate(_Tp *__p, size_t __n) \</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  { __name##Alloc().deallocate(__p, __n); }</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  __ROPE_DEFINE_ALLOCS(_Alloc)</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span> #undef __ROPE_DEFINE_ALLOC</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> </div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  protected:</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  _Rope_base&</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  operator=(const _Rope_base&);</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  </div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  _Rope_base(const _Rope_base&);</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  };</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span> </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>  * This is an SGI extension.</div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  * @ingroup SGIextensions</div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  * @doctodo</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  */</div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  class rope : public _Rope_base<_CharT, _Alloc></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>  public:</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  typedef _CharT value_type;</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  typedef ptrdiff_t difference_type;</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  typedef size_t size_type;</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  typedef _CharT const_reference;</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  typedef const _CharT* const_pointer;</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  typedef _Rope_iterator<_CharT, _Alloc> iterator;</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  typedef _Rope_const_iterator<_CharT, _Alloc> const_iterator;</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  typedef _Rope_char_ref_proxy<_CharT, _Alloc> reference;</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  typedef _Rope_char_ptr_proxy<_CharT, _Alloc> pointer;</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span> </div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  friend class _Rope_iterator<_CharT, _Alloc>;</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  friend class _Rope_const_iterator<_CharT, _Alloc>;</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  friend struct _Rope_RopeRep<_CharT, _Alloc>;</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  friend class _Rope_iterator_base<_CharT, _Alloc>;</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  friend class _Rope_char_ptr_proxy<_CharT, _Alloc>;</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  friend class _Rope_char_ref_proxy<_CharT, _Alloc>;</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  friend struct _Rope_RopeSubstring<_CharT, _Alloc>;</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span> </div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  protected:</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  typedef _Rope_base<_CharT, _Alloc> _Base;</div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  typedef typename _Base::allocator_type allocator_type;</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  using _Base::_M_tree_ptr;</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  using _Base::get_allocator;</div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  using _Base::_M_get_allocator;</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  typedef __GC_CONST _CharT* _Cstrptr;</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  </div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  static _CharT _S_empty_c_str[1];</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  </div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  static bool</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  _S_is0(_CharT __c)</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  { return __c == _S_eos((_CharT*)0); }</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  </div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  enum { _S_copy_max = 23 };</div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  // For strings shorter than _S_copy_max, we copy to</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  // concatenate.</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span> </div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  typedef _Rope_RopeRep<_CharT, _Alloc> _RopeRep;</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  typedef _Rope_RopeConcatenation<_CharT, _Alloc> _RopeConcatenation;</div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  typedef _Rope_RopeLeaf<_CharT, _Alloc> _RopeLeaf;</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  typedef _Rope_RopeFunction<_CharT, _Alloc> _RopeFunction;</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  typedef _Rope_RopeSubstring<_CharT, _Alloc> _RopeSubstring;</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span> </div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  // Retrieve a character at the indicated position.</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  static _CharT _S_fetch(_RopeRep* __r, size_type __pos);</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span> </div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> #ifndef __GC</div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  // Obtain a pointer to the character at the indicated position.</div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  // The pointer can be used to change the character.</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  // If such a pointer cannot be produced, as is frequently the</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  // case, 0 is returned instead.</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  // (Returns nonzero only if all nodes in the path have a refcount</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  // of 1.)</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  static _CharT* _S_fetch_ptr(_RopeRep* __r, size_type __pos);</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span> #endif</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span> </div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  static bool</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  _S_apply_to_pieces(// should be template parameter</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  _Rope_char_consumer<_CharT>& __c,</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  const _RopeRep* __r,</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  size_t __begin, size_t __end);</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  // begin and end are assumed to be in range.</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> </div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> #ifndef __GC</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  static void</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  _S_unref(_RopeRep* __t)</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  { _RopeRep::_S_unref(__t); }</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span> </div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  static void</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  _S_ref(_RopeRep* __t)</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  { _RopeRep::_S_ref(__t); }</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> #else /* __GC */</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  static void _S_unref(_RopeRep*) { }</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  static void _S_ref(_RopeRep*) { }</div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span> #endif</div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span> </div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span> #ifdef __GC</div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  typedef _Rope_RopeRep<_CharT, _Alloc>* _Self_destruct_ptr;</div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> #else</div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  typedef _Rope_self_destruct_ptr<_CharT, _Alloc> _Self_destruct_ptr;</div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span> #endif</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span> </div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  // _Result is counted in refcount.</div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  static _RopeRep* _S_substring(_RopeRep* __base,</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  size_t __start, size_t __endp1);</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>  static _RopeRep* _S_concat_char_iter(_RopeRep* __r,</div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  const _CharT* __iter, size_t __slen);</div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  // Concatenate rope and char ptr, copying __s.</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  // Should really take an arbitrary iterator.</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  // Result is counted in refcount.</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  static _RopeRep* _S_destr_concat_char_iter(_RopeRep* __r,</div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  const _CharT* __iter,</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  size_t __slen)</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  // As above, but one reference to __r is about to be</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  // destroyed. Thus the pieces may be recycled if all</div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  // relevant reference counts are 1.</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span> #ifdef __GC</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  // We can't really do anything since refcounts are unavailable.</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  { return _S_concat_char_iter(__r, __iter, __slen); }</div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span> #else</div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  ;</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span> #endif</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>  static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);</div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  // General concatenation on _RopeRep. _Result</div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  // has refcount of 1. Adjusts argument refcounts.</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>  public:</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  void</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  apply_to_pieces(size_t __begin, size_t __end,</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  _Rope_char_consumer<_CharT>& __c) const</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  { _S_apply_to_pieces(__c, this->_M_tree_ptr, __begin, __end); }</div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span> </div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  protected:</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span> </div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  static size_t</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  _S_rounded_up_size(size_t __n)</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  { return _RopeLeaf::_S_rounded_up_size(__n); }</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> </div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  static size_t</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  _S_allocated_capacity(size_t __n)</div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  {</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  if (_S_is_basic_char_type((_CharT*)0))</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  return _S_rounded_up_size(__n) - 1;</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  else</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  return _S_rounded_up_size(__n);</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</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> </div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  // Allocate and construct a RopeLeaf using the supplied allocator</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  // Takes ownership of s instead of copying.</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  static _RopeLeaf*</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  _S_new_RopeLeaf(__GC_CONST _CharT *__s,</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  size_t __size, allocator_type& __a)</div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  {</div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  _RopeLeaf* __space = typename _Base::_LAlloc(__a).allocate(1);</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  return new(__space) _RopeLeaf(__s, __size, __a);</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  }</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span> </div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  static _RopeConcatenation*</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  _S_new_RopeConcatenation(_RopeRep* __left, _RopeRep* __right,</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  allocator_type& __a)</div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  {</div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  _RopeConcatenation* __space = typename _Base::_CAlloc(__a).allocate(1);</div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  return new(__space) _RopeConcatenation(__left, __right, __a);</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  }</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span> </div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  static _RopeFunction*</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  _S_new_RopeFunction(char_producer<_CharT>* __f,</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  size_t __size, bool __d, allocator_type& __a)</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>  _RopeFunction* __space = typename _Base::_FAlloc(__a).allocate(1);</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  return new(__space) _RopeFunction(__f, __size, __d, __a);</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  }</div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span> </div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  static _RopeSubstring*</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  _S_new_RopeSubstring(_Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s,</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  size_t __l, allocator_type& __a)</div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  {</div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  _RopeSubstring* __space = typename _Base::_SAlloc(__a).allocate(1);</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  return new(__space) _RopeSubstring(__b, __s, __l, __a);</div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  }</div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  </div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  static _RopeLeaf*</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  _S_RopeLeaf_from_unowned_char_ptr(const _CharT *__s,</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  size_t __size, allocator_type& __a)</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span> #define __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __size, __a) \</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  _S_RopeLeaf_from_unowned_char_ptr(__s, __size, __a)</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  {</div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  if (0 == __size)</div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  return 0;</div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  _CharT* __buf = __a.allocate(_S_rounded_up_size(__size));</div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  </div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  __uninitialized_copy_n_a(__s, __size, __buf, __a);</div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  _S_cond_store_eos(__buf[__size]);</div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  __try</div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  { return _S_new_RopeLeaf(__buf, __size, __a); }</div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  __catch(...)</div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  {</div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  _RopeRep::__STL_FREE_STRING(__buf, __size, __a);</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  __throw_exception_again;</div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  }</div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  }</div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span> </div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  // Concatenation of nonempty strings.</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  // Always builds a concatenation node.</div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  // Rebalances if the result is too deep.</div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  // Result has refcount 1.</div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  // Does not increment left and right ref counts even though</div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  // they are referenced.</div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  static _RopeRep*</div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  _S_tree_concat(_RopeRep* __left, _RopeRep* __right);</div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span> </div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  // Concatenation helper functions</div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  static _RopeLeaf*</div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  _S_leaf_concat_char_iter(_RopeLeaf* __r,</div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  const _CharT* __iter, size_t __slen);</div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  // Concatenate by copying leaf.</div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  // should take an arbitrary iterator</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  // result has refcount 1.</div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span> #ifndef __GC</div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  static _RopeLeaf*</div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  _S_destr_leaf_concat_char_iter(_RopeLeaf* __r,</div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  const _CharT* __iter, size_t __slen);</div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  // A version that potentially clobbers __r if __r->_M_ref_count == 1.</div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span> #endif</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span> </div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  private:</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  </div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  static size_t _S_char_ptr_len(const _CharT* __s);</div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  // slightly generalized strlen</div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span> </div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  rope(_RopeRep* __t, const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  : _Base(__t, __a) { }</div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span> </div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span> </div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  // Copy __r to the _CharT buffer.</div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  // Returns __buffer + __r->_M_size.</div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  // Assumes that buffer is uninitialized.</div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  static _CharT* _S_flatten(_RopeRep* __r, _CharT* __buffer);</div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span> </div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  // Again, with explicit starting position and length.</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  // Assumes that buffer is uninitialized.</div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  static _CharT* _S_flatten(_RopeRep* __r,</div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  size_t __start, size_t __len,</div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  _CharT* __buffer);</div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span> </div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  static const unsigned long</div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  _S_min_len[__detail::_S_max_rope_depth + 1];</div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  </div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  static bool</div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  _S_is_balanced(_RopeRep* __r)</div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  { return (__r->_M_size >= _S_min_len[__r->_M_depth]); }</div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span> </div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  static bool</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  _S_is_almost_balanced(_RopeRep* __r)</div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  { return (__r->_M_depth == 0</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  || __r->_M_size >= _S_min_len[__r->_M_depth - 1]); }</div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span> </div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  static bool</div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  _S_is_roughly_balanced(_RopeRep* __r)</div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  { return (__r->_M_depth <= 1</div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  || __r->_M_size >= _S_min_len[__r->_M_depth - 2]); }</div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span> </div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  // Assumes the result is not empty.</div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  static _RopeRep*</div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  _S_concat_and_set_balanced(_RopeRep* __left, _RopeRep* __right)</div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  {</div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  _RopeRep* __result = _S_concat(__left, __right);</div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  if (_S_is_balanced(__result))</div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  __result->_M_is_balanced = true;</div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  return __result;</div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  }</div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span> </div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  // The basic rebalancing operation. Logically copies the</div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  // rope. The result has refcount of 1. The client will</div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  // usually decrement the reference count of __r.</div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  // The result is within height 2 of balanced by the above</div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  // definition.</div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  static _RopeRep* _S_balance(_RopeRep* __r);</div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span> </div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  // Add all unbalanced subtrees to the forest of balanced trees.</div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  // Used only by balance.</div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  static void _S_add_to_forest(_RopeRep*__r, _RopeRep** __forest);</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span> </div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  // Add __r to forest, assuming __r is already balanced.</div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  static void _S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest);</div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  </div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  // Print to stdout, exposing structure</div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  static void _S_dump(_RopeRep* __r, int __indent = 0);</div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  </div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  // Return -1, 0, or 1 if __x < __y, __x == __y, or __x > __y resp.</div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  static int _S_compare(const _RopeRep* __x, const _RopeRep* __y);</div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  </div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  public:</div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  bool</div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  empty() const</div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  { return 0 == this->_M_tree_ptr; }</div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  </div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  // Comparison member function. This is public only for those</div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  // clients that need a ternary comparison. Others</div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  // should use the comparison operators below.</div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  int</div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  compare(const rope& __y) const</div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  { return _S_compare(this->_M_tree_ptr, __y._M_tree_ptr); }</div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span> </div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  rope(const _CharT* __s, const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  : _Base(__a)</div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  {</div><div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  this->_M_tree_ptr =</div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, _S_char_ptr_len(__s),</div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  _M_get_allocator());</div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  }</div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span> </div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  rope(const _CharT* __s, size_t __len,</div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  : _Base(__a)</div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  {</div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  this->_M_tree_ptr =</div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __len, _M_get_allocator());</div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  }</div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span> </div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  // Should perhaps be templatized with respect to the iterator type</div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  // and use Sequence_buffer. (It should perhaps use sequence_buffer</div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  // even now.)</div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  rope(const _CharT* __s, const _CharT* __e,</div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  : _Base(__a)</div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  {</div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  this->_M_tree_ptr =</div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __e - __s, _M_get_allocator());</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  }</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span> </div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  rope(const const_iterator& __s, const const_iterator& __e,</div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  : _Base(_S_substring(__s._M_root, __s._M_current_pos,</div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  __e._M_current_pos), __a)</div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  { }</div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span> </div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  rope(const iterator& __s, const iterator& __e,</div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  : _Base(_S_substring(__s._M_root, __s._M_current_pos,</div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  __e._M_current_pos), __a)</div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  { }</div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span> </div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  rope(_CharT __c, const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  : _Base(__a)</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  {</div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  _CharT* __buf = this->_Data_allocate(_S_rounded_up_size(1));</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  </div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  _M_get_allocator().construct(__buf, __c);</div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  __try</div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  {</div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  this->_M_tree_ptr = _S_new_RopeLeaf(__buf, 1,</div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  _M_get_allocator());</div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  }</div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  __catch(...)</div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  {</div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  _RopeRep::__STL_FREE_STRING(__buf, 1, _M_get_allocator());</div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  __throw_exception_again;</div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  }</div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  }</div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span> </div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  rope(size_t __n, _CharT __c,</div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  const allocator_type& __a = allocator_type());</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span> </div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  rope(const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  : _Base(0, __a) { }</div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span> </div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  // Construct a rope from a function that can compute its members</div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  rope(char_producer<_CharT> *__fn, size_t __len, bool __delete_fn,</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  : _Base(__a)</div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  {</div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  this->_M_tree_ptr = (0 == __len)</div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  ? 0</div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  : _S_new_RopeFunction(__fn, __len, __delete_fn, _M_get_allocator());</div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  }</div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span> </div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  rope(const rope& __x, const allocator_type& __a = allocator_type())</div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  : _Base(__x._M_tree_ptr, __a)</div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  { _S_ref(this->_M_tree_ptr); }</div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span> </div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  ~rope() throw()</div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  { _S_unref(this->_M_tree_ptr); }</div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span> </div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  rope&</div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  operator=(const rope& __x)</div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  {</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  _RopeRep* __old = this->_M_tree_ptr;</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  this->_M_tree_ptr = __x._M_tree_ptr;</div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  _S_ref(this->_M_tree_ptr);</div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  _S_unref(__old);</div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  return *this;</div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  }</div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span> </div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  void</div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  clear()</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  {</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  this->_M_tree_ptr = 0;</div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  }</div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  </div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  void</div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  push_back(_CharT __x)</div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  {</div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  _RopeRep* __old = this->_M_tree_ptr;</div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  this->_M_tree_ptr</div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  = _S_destr_concat_char_iter(this->_M_tree_ptr, &__x, 1);</div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  _S_unref(__old);</div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  }</div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span> </div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  void</div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  pop_back()</div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  {</div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  _RopeRep* __old = this->_M_tree_ptr;</div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  this->_M_tree_ptr = _S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  0, this->_M_tree_ptr->_M_size - 1);</div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  _S_unref(__old);</div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  }</div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span> </div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  _CharT</div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  back() const</div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  { return _S_fetch(this->_M_tree_ptr, this->_M_tree_ptr->_M_size - 1); }</div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span> </div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  void</div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  push_front(_CharT __x)</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  {</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  _RopeRep* __old = this->_M_tree_ptr;</div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  _RopeRep* __left =</div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  __STL_ROPE_FROM_UNOWNED_CHAR_PTR(&__x, 1, _M_get_allocator());</div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  __try</div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  {</div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  this->_M_tree_ptr = _S_concat(__left, this->_M_tree_ptr);</div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  _S_unref(__old);</div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  _S_unref(__left);</div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  }</div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  __catch(...)</div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  {</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  _S_unref(__left);</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  __throw_exception_again;</div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  }</div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  }</div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span> </div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  void</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  pop_front()</div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  {</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  _RopeRep* __old = this->_M_tree_ptr;</div><div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  this->_M_tree_ptr</div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  = _S_substring(this->_M_tree_ptr, 1, this->_M_tree_ptr->_M_size);</div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  _S_unref(__old);</div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  }</div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span> </div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  _CharT</div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  front() const</div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  { return _S_fetch(this->_M_tree_ptr, 0); }</div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span> </div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  void</div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  balance()</div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  {</div><div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  _RopeRep* __old = this->_M_tree_ptr;</div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  this->_M_tree_ptr = _S_balance(this->_M_tree_ptr);</div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  _S_unref(__old);</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  }</div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span> </div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  void</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  copy(_CharT* __buffer) const</div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  {</div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  _Destroy_const(__buffer, __buffer + size(), _M_get_allocator());</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  _S_flatten(this->_M_tree_ptr, __buffer);</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  }</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span> </div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  // This is the copy function from the standard, but</div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  // with the arguments reordered to make it consistent with the</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  // rest of the interface.</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  // Note that this guaranteed not to compile if the draft standard</div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  // order is assumed.</div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  size_type</div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  copy(size_type __pos, size_type __n, _CharT* __buffer) const</div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  {</div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  size_t __size = size();</div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  size_t __len = (__pos + __n > __size? __size - __pos : __n);</div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span> </div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  _Destroy_const(__buffer, __buffer + __len, _M_get_allocator());</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  _S_flatten(this->_M_tree_ptr, __pos, __len, __buffer);</div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  return __len;</div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  }</div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span> </div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  // Print to stdout, exposing structure. May be useful for</div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  // performance debugging.</div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  void</div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  dump()</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  { _S_dump(this->_M_tree_ptr); }</div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  </div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  // Convert to 0 terminated string in new allocated memory.</div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  // Embedded 0s in the input do not terminate the copy.</div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  const _CharT* c_str() const;</div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span> </div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  // As above, but also use the flattened representation as</div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  // the new rope representation.</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  const _CharT* replace_with_c_str();</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  </div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  // Reclaim memory for the c_str generated flattened string.</div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  // Intentionally undocumented, since it's hard to say when this</div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  // is safe for multiple threads.</div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  void</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  delete_c_str ()</div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  {</div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  if (0 == this->_M_tree_ptr)</div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  return;</div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  if (__detail::_S_leaf == this->_M_tree_ptr->_M_tag &&</div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  ((_RopeLeaf*)this->_M_tree_ptr)->_M_data ==</div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  this->_M_tree_ptr->_M_c_string)</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  {</div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  // Representation shared</div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  return;</div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  }</div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span> #ifndef __GC</div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  this->_M_tree_ptr->_M_free_c_string();</div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span> #endif</div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  this->_M_tree_ptr->_M_c_string = 0;</div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  }</div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span> </div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  _CharT</div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  operator[] (size_type __pos) const</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  { return _S_fetch(this->_M_tree_ptr, __pos); }</div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span> </div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  _CharT</div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  at(size_type __pos) const</div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  {</div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  // if (__pos >= size()) throw out_of_range; // XXX</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  return (*this)[__pos];</div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  }</div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span> </div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  const_iterator</div><div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  begin() const</div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  { return(const_iterator(this->_M_tree_ptr, 0)); }</div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span> </div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  // An easy way to get a const iterator from a non-const container.</div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  const_iterator</div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  const_begin() const</div><div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  { return(const_iterator(this->_M_tree_ptr, 0)); }</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span> </div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  const_iterator</div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  end() const</div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  { return(const_iterator(this->_M_tree_ptr, size())); }</div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span> </div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  const_iterator</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  const_end() const</div><div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  { return(const_iterator(this->_M_tree_ptr, size())); }</div><div class="line"><a name="l02055"></a><span class="lineno"> 2055</span> </div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  size_type</div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  size() const</div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  { return(0 == this->_M_tree_ptr? 0 : this->_M_tree_ptr->_M_size); }</div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  </div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  size_type</div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  length() const</div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  { return size(); }</div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span> </div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  size_type</div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  max_size() const</div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  {</div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  return _S_min_len[int(__detail::_S_max_rope_depth) - 1] - 1;</div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  // Guarantees that the result can be sufficiently</div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  // balanced. Longer ropes will probably still work,</div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  // but it's harder to make guarantees.</div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  }</div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span> </div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;</div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span> </div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  const_reverse_iterator</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  rbegin() const</div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  { return const_reverse_iterator(end()); }</div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span> </div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  const_reverse_iterator</div><div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  const_rbegin() const</div><div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  { return const_reverse_iterator(end()); }</div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span> </div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  const_reverse_iterator</div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  rend() const</div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  { return const_reverse_iterator(begin()); }</div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  </div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  const_reverse_iterator</div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  const_rend() const</div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  { return const_reverse_iterator(begin()); }</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span> </div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  friend rope<_CharT2, _Alloc2></div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  operator+(const rope<_CharT2, _Alloc2>& __left,</div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  const rope<_CharT2, _Alloc2>& __right);</div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span> </div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  friend rope<_CharT2, _Alloc2></div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  operator+(const rope<_CharT2, _Alloc2>& __left, const _CharT2* __right);</div><div class="line"><a name="l02099"></a><span class="lineno"> 2099</span> </div><div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  template<class _CharT2, class _Alloc2></div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  friend rope<_CharT2, _Alloc2></div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  operator+(const rope<_CharT2, _Alloc2>& __left, _CharT2 __right);</div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span> </div><div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  // The symmetric cases are intentionally omitted, since they're</div><div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  // presumed to be less common, and we don't handle them as well.</div><div class="line"><a name="l02106"></a><span class="lineno"> 2106</span> </div><div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  // The following should really be templatized. The first</div><div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  // argument should be an input iterator or forward iterator with</div><div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  // value_type _CharT.</div><div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  rope&</div><div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  append(const _CharT* __iter, size_t __n)</div><div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  {</div><div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  _RopeRep* __result =</div><div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  _S_destr_concat_char_iter(this->_M_tree_ptr, __iter, __n);</div><div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  return *this;</div><div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  }</div><div class="line"><a name="l02119"></a><span class="lineno"> 2119</span> </div><div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  rope&</div><div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  append(const _CharT* __c_string)</div><div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  {</div><div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  size_t __len = _S_char_ptr_len(__c_string);</div><div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  append(__c_string, __len);</div><div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  return(*this);</div><div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  }</div><div class="line"><a name="l02127"></a><span class="lineno"> 2127</span> </div><div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  rope&</div><div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  append(const _CharT* __s, const _CharT* __e)</div><div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  {</div><div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  _RopeRep* __result =</div><div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  _S_destr_concat_char_iter(this->_M_tree_ptr, __s, __e - __s);</div><div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  return *this;</div><div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  }</div><div class="line"><a name="l02137"></a><span class="lineno"> 2137</span> </div><div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  rope&</div><div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  append(const_iterator __s, const_iterator __e)</div><div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  {</div><div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  _Self_destruct_ptr __appendee(_S_substring(__s._M_root,</div><div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  __s._M_current_pos,</div><div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  __e._M_current_pos));</div><div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  _RopeRep* __result = _S_concat(this->_M_tree_ptr, </div><div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  (_RopeRep*)__appendee);</div><div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  return *this;</div><div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  }</div><div class="line"><a name="l02150"></a><span class="lineno"> 2150</span> </div><div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  rope&</div><div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  append(_CharT __c)</div><div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  {</div><div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  _RopeRep* __result =</div><div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  _S_destr_concat_char_iter(this->_M_tree_ptr, &__c, 1);</div><div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  return *this;</div><div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  }</div><div class="line"><a name="l02160"></a><span class="lineno"> 2160</span> </div><div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  rope&</div><div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  append()</div><div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  { return append(_CharT()); } // XXX why?</div><div class="line"><a name="l02164"></a><span class="lineno"> 2164</span> </div><div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  rope&</div><div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  append(const rope& __y)</div><div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>  {</div><div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  _RopeRep* __result = _S_concat(this->_M_tree_ptr, __y._M_tree_ptr);</div><div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  return *this;</div><div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  }</div><div class="line"><a name="l02173"></a><span class="lineno"> 2173</span> </div><div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  rope&</div><div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  append(size_t __n, _CharT __c)</div><div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  {</div><div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  rope<_CharT,_Alloc> __last(__n, __c);</div><div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  return append(__last);</div><div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  }</div><div class="line"><a name="l02180"></a><span class="lineno"> 2180</span> </div><div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  void</div><div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  swap(rope& __b)</div><div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  {</div><div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  _RopeRep* __tmp = this->_M_tree_ptr;</div><div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  this->_M_tree_ptr = __b._M_tree_ptr;</div><div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  __b._M_tree_ptr = __tmp;</div><div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  }</div><div class="line"><a name="l02188"></a><span class="lineno"> 2188</span> </div><div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  protected:</div><div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  // Result is included in refcount.</div><div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  static _RopeRep*</div><div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  replace(_RopeRep* __old, size_t __pos1,</div><div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  size_t __pos2, _RopeRep* __r)</div><div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  {</div><div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  if (0 == __old)</div><div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  {</div><div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  _S_ref(__r);</div><div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  return __r;</div><div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  }</div><div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  _Self_destruct_ptr __left(_S_substring(__old, 0, __pos1));</div><div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  _Self_destruct_ptr __right(_S_substring(__old, __pos2, __old->_M_size));</div><div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  _RopeRep* __result;</div><div class="line"><a name="l02203"></a><span class="lineno"> 2203</span> </div><div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  if (0 == __r)</div><div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  __result = _S_concat(__left, __right);</div><div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  else</div><div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  {</div><div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  _Self_destruct_ptr __left_result(_S_concat(__left, __r));</div><div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  __result = _S_concat(__left_result, __right);</div><div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  }</div><div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  return __result;</div><div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  }</div><div class="line"><a name="l02213"></a><span class="lineno"> 2213</span> </div><div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  public:</div><div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  void</div><div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  insert(size_t __p, const rope& __r)</div><div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  {</div><div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  _RopeRep* __result =</div><div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  replace(this->_M_tree_ptr, __p, __p, __r._M_tree_ptr);</div><div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  }</div><div class="line"><a name="l02223"></a><span class="lineno"> 2223</span> </div><div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  void</div><div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  insert(size_t __p, size_t __n, _CharT __c)</div><div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  {</div><div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  rope<_CharT,_Alloc> __r(__n,__c);</div><div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  insert(__p, __r);</div><div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  }</div><div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  </div><div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  void</div><div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  insert(size_t __p, const _CharT* __i, size_t __n)</div><div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  {</div><div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  _Self_destruct_ptr __left(_S_substring(this->_M_tree_ptr, 0, __p));</div><div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  _Self_destruct_ptr __right(_S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  __p, size()));</div><div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  _Self_destruct_ptr __left_result(_S_concat_char_iter(__left, __i, __n));</div><div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  // _S_ destr_concat_char_iter should be safe here.</div><div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  // But as it stands it's probably not a win, since __left</div><div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  // is likely to have additional references.</div><div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  _RopeRep* __result = _S_concat(__left_result, __right);</div><div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  }</div><div class="line"><a name="l02245"></a><span class="lineno"> 2245</span> </div><div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  void</div><div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  insert(size_t __p, const _CharT* __c_string)</div><div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  { insert(__p, __c_string, _S_char_ptr_len(__c_string)); }</div><div class="line"><a name="l02249"></a><span class="lineno"> 2249</span> </div><div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  void</div><div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  insert(size_t __p, _CharT __c)</div><div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  { insert(__p, &__c, 1); }</div><div class="line"><a name="l02253"></a><span class="lineno"> 2253</span> </div><div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  void</div><div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  insert(size_t __p)</div><div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  {</div><div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  _CharT __c = _CharT();</div><div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  insert(__p, &__c, 1);</div><div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  }</div><div class="line"><a name="l02260"></a><span class="lineno"> 2260</span> </div><div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  void</div><div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  insert(size_t __p, const _CharT* __i, const _CharT* __j)</div><div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  {</div><div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  rope __r(__i, __j);</div><div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>  insert(__p, __r);</div><div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>  }</div><div class="line"><a name="l02267"></a><span class="lineno"> 2267</span> </div><div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>  void</div><div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>  insert(size_t __p, const const_iterator& __i,</div><div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>  const const_iterator& __j)</div><div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  {</div><div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  rope __r(__i, __j);</div><div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  insert(__p, __r);</div><div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  }</div><div class="line"><a name="l02275"></a><span class="lineno"> 2275</span> </div><div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  void</div><div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  insert(size_t __p, const iterator& __i,</div><div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  const iterator& __j)</div><div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  {</div><div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  rope __r(__i, __j);</div><div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  insert(__p, __r);</div><div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>  }</div><div class="line"><a name="l02283"></a><span class="lineno"> 2283</span> </div><div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>  // (position, length) versions of replace operations:</div><div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  </div><div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  void</div><div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  replace(size_t __p, size_t __n, const rope& __r)</div><div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  {</div><div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>  _RopeRep* __result =</div><div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  replace(this->_M_tree_ptr, __p, __p + __n, __r._M_tree_ptr);</div><div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  }</div><div class="line"><a name="l02294"></a><span class="lineno"> 2294</span> </div><div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  void</div><div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  replace(size_t __p, size_t __n,</div><div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  const _CharT* __i, size_t __i_len)</div><div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  {</div><div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  rope __r(__i, __i_len);</div><div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  replace(__p, __n, __r);</div><div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  }</div><div class="line"><a name="l02302"></a><span class="lineno"> 2302</span> </div><div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  void</div><div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  replace(size_t __p, size_t __n, _CharT __c)</div><div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  {</div><div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  rope __r(__c);</div><div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  replace(__p, __n, __r);</div><div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  }</div><div class="line"><a name="l02309"></a><span class="lineno"> 2309</span> </div><div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  void</div><div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  replace(size_t __p, size_t __n, const _CharT* __c_string)</div><div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  {</div><div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  rope __r(__c_string);</div><div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  replace(__p, __n, __r);</div><div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  }</div><div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  </div><div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  void</div><div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  replace(size_t __p, size_t __n,</div><div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  const _CharT* __i, const _CharT* __j)</div><div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  {</div><div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  rope __r(__i, __j);</div><div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  replace(__p, __n, __r);</div><div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  }</div><div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  </div><div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  void</div><div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  replace(size_t __p, size_t __n,</div><div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  const const_iterator& __i, const const_iterator& __j)</div><div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  {</div><div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  rope __r(__i, __j);</div><div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  replace(__p, __n, __r);</div><div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  }</div><div class="line"><a name="l02332"></a><span class="lineno"> 2332</span> </div><div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  void</div><div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  replace(size_t __p, size_t __n,</div><div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  const iterator& __i, const iterator& __j)</div><div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  {</div><div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  rope __r(__i, __j);</div><div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  replace(__p, __n, __r);</div><div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  }</div><div class="line"><a name="l02340"></a><span class="lineno"> 2340</span> </div><div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  // Single character variants:</div><div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  void</div><div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>  replace(size_t __p, _CharT __c)</div><div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  {</div><div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>  iterator __i(this, __p);</div><div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  *__i = __c;</div><div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  }</div><div class="line"><a name="l02348"></a><span class="lineno"> 2348</span> </div><div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  void</div><div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  replace(size_t __p, const rope& __r)</div><div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  { replace(__p, 1, __r); }</div><div class="line"><a name="l02352"></a><span class="lineno"> 2352</span> </div><div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  void</div><div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>  replace(size_t __p, const _CharT* __i, size_t __i_len)</div><div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>  { replace(__p, 1, __i, __i_len); }</div><div class="line"><a name="l02356"></a><span class="lineno"> 2356</span> </div><div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  void</div><div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>  replace(size_t __p, const _CharT* __c_string)</div><div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  { replace(__p, 1, __c_string); }</div><div class="line"><a name="l02360"></a><span class="lineno"> 2360</span> </div><div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  void</div><div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>  replace(size_t __p, const _CharT* __i, const _CharT* __j)</div><div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>  { replace(__p, 1, __i, __j); }</div><div class="line"><a name="l02364"></a><span class="lineno"> 2364</span> </div><div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>  void</div><div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>  replace(size_t __p, const const_iterator& __i,</div><div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>  const const_iterator& __j)</div><div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>  { replace(__p, 1, __i, __j); }</div><div class="line"><a name="l02369"></a><span class="lineno"> 2369</span> </div><div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>  void</div><div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>  replace(size_t __p, const iterator& __i,</div><div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>  const iterator& __j)</div><div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>  { replace(__p, 1, __i, __j); }</div><div class="line"><a name="l02374"></a><span class="lineno"> 2374</span> </div><div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>  // Erase, (position, size) variant.</div><div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>  void</div><div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  erase(size_t __p, size_t __n)</div><div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  {</div><div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  _RopeRep* __result = replace(this->_M_tree_ptr, __p,</div><div class="line"><a name="l02380"></a><span class="lineno"> 2380</span>  __p + __n, 0);</div><div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>  _S_unref(this->_M_tree_ptr);</div><div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  this->_M_tree_ptr = __result;</div><div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  }</div><div class="line"><a name="l02384"></a><span class="lineno"> 2384</span> </div><div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  // Erase, single character</div><div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>  void</div><div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  erase(size_t __p)</div><div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>  { erase(__p, __p + 1); }</div><div class="line"><a name="l02389"></a><span class="lineno"> 2389</span> </div><div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  // Insert, iterator variants.</div><div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>  iterator</div><div class="line"><a name="l02392"></a><span class="lineno"> 2392</span>  insert(const iterator& __p, const rope& __r)</div><div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  {</div><div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>  insert(__p.index(), __r);</div><div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>  return __p;</div><div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  }</div><div class="line"><a name="l02397"></a><span class="lineno"> 2397</span> </div><div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>  iterator</div><div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  insert(const iterator& __p, size_t __n, _CharT __c)</div><div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>  {</div><div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  insert(__p.index(), __n, __c);</div><div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>  return __p;</div><div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  }</div><div class="line"><a name="l02404"></a><span class="lineno"> 2404</span> </div><div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  iterator insert(const iterator& __p, _CharT __c)</div><div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  {</div><div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  insert(__p.index(), __c);</div><div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  return __p;</div><div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  }</div><div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>  </div><div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  iterator</div><div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  insert(const iterator& __p )</div><div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  {</div><div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  insert(__p.index());</div><div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>  return __p;</div><div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  }</div><div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  </div><div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  iterator</div><div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  insert(const iterator& __p, const _CharT* c_string)</div><div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  {</div><div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  insert(__p.index(), c_string);</div><div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  return __p;</div><div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  }</div><div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  </div><div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  iterator</div><div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  insert(const iterator& __p, const _CharT* __i, size_t __n)</div><div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  {</div><div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  insert(__p.index(), __i, __n);</div><div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  return __p;</div><div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  }</div><div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  </div><div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  iterator</div><div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  insert(const iterator& __p, const _CharT* __i,</div><div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  const _CharT* __j)</div><div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  {</div><div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  insert(__p.index(), __i, __j); </div><div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  return __p;</div><div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  }</div><div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  </div><div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  iterator</div><div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  insert(const iterator& __p,</div><div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  const const_iterator& __i, const const_iterator& __j)</div><div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>  {</div><div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  insert(__p.index(), __i, __j);</div><div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>  return __p;</div><div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  }</div><div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>  </div><div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  iterator</div><div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  insert(const iterator& __p,</div><div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  const iterator& __i, const iterator& __j)</div><div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  {</div><div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>  insert(__p.index(), __i, __j);</div><div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  return __p;</div><div class="line"><a name="l02454"></a><span class="lineno"> 2454</span>  }</div><div class="line"><a name="l02455"></a><span class="lineno"> 2455</span> </div><div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>  // Replace, range variants.</div><div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  void</div><div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>  replace(const iterator& __p, const iterator& __q, const rope& __r)</div><div class="line"><a name="l02459"></a><span class="lineno"> 2459</span>  { replace(__p.index(), __q.index() - __p.index(), __r); }</div><div class="line"><a name="l02460"></a><span class="lineno"> 2460</span> </div><div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>  void</div><div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  replace(const iterator& __p, const iterator& __q, _CharT __c)</div><div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  { replace(__p.index(), __q.index() - __p.index(), __c); }</div><div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  </div><div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  void</div><div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  replace(const iterator& __p, const iterator& __q,</div><div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  const _CharT* __c_string)</div><div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  { replace(__p.index(), __q.index() - __p.index(), __c_string); }</div><div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  </div><div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  void</div><div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  replace(const iterator& __p, const iterator& __q,</div><div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  const _CharT* __i, size_t __n)</div><div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  { replace(__p.index(), __q.index() - __p.index(), __i, __n); }</div><div class="line"><a name="l02474"></a><span class="lineno"> 2474</span>  </div><div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  void</div><div class="line"><a name="l02476"></a><span class="lineno"> 2476</span>  replace(const iterator& __p, const iterator& __q,</div><div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  const _CharT* __i, const _CharT* __j)</div><div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  { replace(__p.index(), __q.index() - __p.index(), __i, __j); }</div><div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>  </div><div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>  void</div><div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  replace(const iterator& __p, const iterator& __q,</div><div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  const const_iterator& __i, const const_iterator& __j)</div><div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  { replace(__p.index(), __q.index() - __p.index(), __i, __j); }</div><div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  </div><div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>  void</div><div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>  replace(const iterator& __p, const iterator& __q,</div><div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>  const iterator& __i, const iterator& __j)</div><div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>  { replace(__p.index(), __q.index() - __p.index(), __i, __j); }</div><div class="line"><a name="l02489"></a><span class="lineno"> 2489</span> </div><div class="line"><a name="l02490"></a><span class="lineno"> 2490</span>  // Replace, iterator variants.</div><div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>  void</div><div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>  replace(const iterator& __p, const rope& __r)</div><div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  { replace(__p.index(), __r); }</div><div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  </div><div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  void</div><div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  replace(const iterator& __p, _CharT __c)</div><div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  { replace(__p.index(), __c); }</div><div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>  </div><div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  void</div><div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>  replace(const iterator& __p, const _CharT* __c_string)</div><div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  { replace(__p.index(), __c_string); }</div><div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  </div><div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  void</div><div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  replace(const iterator& __p, const _CharT* __i, size_t __n)</div><div class="line"><a name="l02505"></a><span class="lineno"> 2505</span>  { replace(__p.index(), __i, __n); }</div><div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  </div><div class="line"><a name="l02507"></a><span class="lineno"> 2507</span>  void</div><div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  replace(const iterator& __p, const _CharT* __i, const _CharT* __j)</div><div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>  { replace(__p.index(), __i, __j); }</div><div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>  </div><div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>  void</div><div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>  replace(const iterator& __p, const_iterator __i, const_iterator __j)</div><div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  { replace(__p.index(), __i, __j); }</div><div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  </div><div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  void</div><div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>  replace(const iterator& __p, iterator __i, iterator __j)</div><div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  { replace(__p.index(), __i, __j); }</div><div class="line"><a name="l02518"></a><span class="lineno"> 2518</span> </div><div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  // Iterator and range variants of erase</div><div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>  iterator</div><div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  erase(const iterator& __p, const iterator& __q)</div><div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  {</div><div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>  size_t __p_index = __p.index();</div><div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  erase(__p_index, __q.index() - __p_index);</div><div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>  return iterator(this, __p_index);</div><div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>  }</div><div class="line"><a name="l02527"></a><span class="lineno"> 2527</span> </div><div class="line"><a name="l02528"></a><span class="lineno"> 2528</span>  iterator</div><div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  erase(const iterator& __p)</div><div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>  {</div><div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  size_t __p_index = __p.index();</div><div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  erase(__p_index, 1);</div><div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  return iterator(this, __p_index);</div><div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  }</div><div class="line"><a name="l02535"></a><span class="lineno"> 2535</span> </div><div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  rope</div><div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  substr(size_t __start, size_t __len = 1) const</div><div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  {</div><div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  return rope<_CharT, _Alloc>(_S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  __start,</div><div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  __start + __len));</div><div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>  }</div><div class="line"><a name="l02543"></a><span class="lineno"> 2543</span> </div><div class="line"><a name="l02544"></a><span class="lineno"> 2544</span>  rope</div><div class="line"><a name="l02545"></a><span class="lineno"> 2545</span>  substr(iterator __start, iterator __end) const</div><div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  {</div><div class="line"><a name="l02547"></a><span class="lineno"> 2547</span>  return rope<_CharT, _Alloc>(_S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>  __start.index(),</div><div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>  __end.index()));</div><div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  }</div><div class="line"><a name="l02551"></a><span class="lineno"> 2551</span> </div><div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>  rope</div><div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  substr(iterator __start) const</div><div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  {</div><div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>  size_t __pos = __start.index();</div><div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  return rope<_CharT, _Alloc>(_S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  __pos, __pos + 1));</div><div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  }</div><div class="line"><a name="l02559"></a><span class="lineno"> 2559</span> </div><div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  rope</div><div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>  substr(const_iterator __start, const_iterator __end) const</div><div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  {</div><div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>  // This might eventually take advantage of the cache in the</div><div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  // iterator.</div><div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  return rope<_CharT, _Alloc>(_S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  __start.index(),</div><div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  __end.index()));</div><div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  }</div><div class="line"><a name="l02569"></a><span class="lineno"> 2569</span> </div><div class="line"><a name="l02570"></a><span class="lineno"> 2570</span>  rope<_CharT, _Alloc></div><div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>  substr(const_iterator __start)</div><div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>  {</div><div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  size_t __pos = __start.index();</div><div class="line"><a name="l02574"></a><span class="lineno"> 2574</span>  return rope<_CharT, _Alloc>(_S_substring(this->_M_tree_ptr,</div><div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  __pos, __pos + 1));</div><div class="line"><a name="l02576"></a><span class="lineno"> 2576</span>  }</div><div class="line"><a name="l02577"></a><span class="lineno"> 2577</span> </div><div class="line"><a name="l02578"></a><span class="lineno"> 2578</span>  static const size_type npos;</div><div class="line"><a name="l02579"></a><span class="lineno"> 2579</span> </div><div class="line"><a name="l02580"></a><span class="lineno"> 2580</span>  size_type find(_CharT __c, size_type __pos = 0) const;</div><div class="line"><a name="l02581"></a><span class="lineno"> 2581</span> </div><div class="line"><a name="l02582"></a><span class="lineno"> 2582</span>  size_type</div><div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>  find(const _CharT* __s, size_type __pos = 0) const</div><div class="line"><a name="l02584"></a><span class="lineno"> 2584</span>  {</div><div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>  size_type __result_pos;</div><div class="line"><a name="l02586"></a><span class="lineno"> 2586</span>  const_iterator __result =</div><div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>  std::search(const_begin() + __pos, const_end(),</div><div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>  __s, __s + _S_char_ptr_len(__s));</div><div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>  __result_pos = __result.index();</div><div class="line"><a name="l02590"></a><span class="lineno"> 2590</span> #ifndef __STL_OLD_ROPE_SEMANTICS</div><div class="line"><a name="l02591"></a><span class="lineno"> 2591</span>  if (__result_pos == size())</div><div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>  __result_pos = npos;</div><div class="line"><a name="l02593"></a><span class="lineno"> 2593</span> #endif</div><div class="line"><a name="l02594"></a><span class="lineno"> 2594</span>  return __result_pos;</div><div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>  }</div><div class="line"><a name="l02596"></a><span class="lineno"> 2596</span> </div><div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>  iterator</div><div class="line"><a name="l02598"></a><span class="lineno"> 2598</span>  mutable_begin()</div><div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>  { return(iterator(this, 0)); }</div><div class="line"><a name="l02600"></a><span class="lineno"> 2600</span>  </div><div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>  iterator</div><div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>  mutable_end()</div><div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>  { return(iterator(this, size())); }</div><div class="line"><a name="l02604"></a><span class="lineno"> 2604</span> </div><div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>  typedef std::reverse_iterator<iterator> reverse_iterator;</div><div class="line"><a name="l02606"></a><span class="lineno"> 2606</span>  </div><div class="line"><a name="l02607"></a><span class="lineno"> 2607</span>  reverse_iterator</div><div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>  mutable_rbegin()</div><div class="line"><a name="l02609"></a><span class="lineno"> 2609</span>  { return reverse_iterator(mutable_end()); }</div><div class="line"><a name="l02610"></a><span class="lineno"> 2610</span> </div><div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>  reverse_iterator</div><div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>  mutable_rend()</div><div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>  { return reverse_iterator(mutable_begin()); }</div><div class="line"><a name="l02614"></a><span class="lineno"> 2614</span> </div><div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>  reference</div><div class="line"><a name="l02616"></a><span class="lineno"> 2616</span>  mutable_reference_at(size_type __pos)</div><div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>  { return reference(this, __pos); }</div><div class="line"><a name="l02618"></a><span class="lineno"> 2618</span> </div><div class="line"><a name="l02619"></a><span class="lineno"> 2619</span> #ifdef __STD_STUFF</div><div class="line"><a name="l02620"></a><span class="lineno"> 2620</span>  reference</div><div class="line"><a name="l02621"></a><span class="lineno"> 2621</span>  operator[] (size_type __pos)</div><div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>  { return _char_ref_proxy(this, __pos); }</div><div class="line"><a name="l02623"></a><span class="lineno"> 2623</span> </div><div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>  reference</div><div class="line"><a name="l02625"></a><span class="lineno"> 2625</span>  at(size_type __pos)</div><div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>  {</div><div class="line"><a name="l02627"></a><span class="lineno"> 2627</span>  // if (__pos >= size()) throw out_of_range; // XXX</div><div class="line"><a name="l02628"></a><span class="lineno"> 2628</span>  return (*this)[__pos];</div><div class="line"><a name="l02629"></a><span class="lineno"> 2629</span>  }</div><div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>  </div><div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>  void resize(size_type __n, _CharT __c) { }</div><div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>  void resize(size_type __n) { }</div><div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>  void reserve(size_type __res_arg = 0) { }</div><div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>  </div><div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>  size_type</div><div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>  capacity() const</div><div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>  { return max_size(); }</div><div class="line"><a name="l02638"></a><span class="lineno"> 2638</span> </div><div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>  // Stuff below this line is dangerous because it's error prone.</div><div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>  // I would really like to get rid of it.</div><div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>  // copy function with funny arg ordering.</div><div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>  size_type</div><div class="line"><a name="l02643"></a><span class="lineno"> 2643</span>  copy(_CharT* __buffer, size_type __n,</div><div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>  size_type __pos = 0) const</div><div class="line"><a name="l02645"></a><span class="lineno"> 2645</span>  { return copy(__pos, __n, __buffer); }</div><div class="line"><a name="l02646"></a><span class="lineno"> 2646</span> </div><div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>  iterator</div><div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>  end()</div><div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>  { return mutable_end(); }</div><div class="line"><a name="l02650"></a><span class="lineno"> 2650</span> </div><div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>  iterator</div><div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>  begin()</div><div class="line"><a name="l02653"></a><span class="lineno"> 2653</span>  { return mutable_begin(); }</div><div class="line"><a name="l02654"></a><span class="lineno"> 2654</span> </div><div class="line"><a name="l02655"></a><span class="lineno"> 2655</span>  reverse_iterator</div><div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>  rend()</div><div class="line"><a name="l02657"></a><span class="lineno"> 2657</span>  { return mutable_rend(); }</div><div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>  </div><div class="line"><a name="l02659"></a><span class="lineno"> 2659</span>  reverse_iterator</div><div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>  rbegin()</div><div class="line"><a name="l02661"></a><span class="lineno"> 2661</span>  { return mutable_rbegin(); }</div><div class="line"><a name="l02662"></a><span class="lineno"> 2662</span> </div><div class="line"><a name="l02663"></a><span class="lineno"> 2663</span> #else</div><div class="line"><a name="l02664"></a><span class="lineno"> 2664</span>  const_iterator</div><div class="line"><a name="l02665"></a><span class="lineno"> 2665</span>  end()</div><div class="line"><a name="l02666"></a><span class="lineno"> 2666</span>  { return const_end(); }</div><div class="line"><a name="l02667"></a><span class="lineno"> 2667</span> </div><div class="line"><a name="l02668"></a><span class="lineno"> 2668</span>  const_iterator</div><div class="line"><a name="l02669"></a><span class="lineno"> 2669</span>  begin()</div><div class="line"><a name="l02670"></a><span class="lineno"> 2670</span>  { return const_begin(); }</div><div class="line"><a name="l02671"></a><span class="lineno"> 2671</span> </div><div class="line"><a name="l02672"></a><span class="lineno"> 2672</span>  const_reverse_iterator</div><div class="line"><a name="l02673"></a><span class="lineno"> 2673</span>  rend()</div><div class="line"><a name="l02674"></a><span class="lineno"> 2674</span>  { return const_rend(); }</div><div class="line"><a name="l02675"></a><span class="lineno"> 2675</span> </div><div class="line"><a name="l02676"></a><span class="lineno"> 2676</span>  const_reverse_iterator</div><div class="line"><a name="l02677"></a><span class="lineno"> 2677</span>  rbegin()</div><div class="line"><a name="l02678"></a><span class="lineno"> 2678</span>  { return const_rbegin(); }</div><div class="line"><a name="l02679"></a><span class="lineno"> 2679</span> </div><div class="line"><a name="l02680"></a><span class="lineno"> 2680</span> #endif</div><div class="line"><a name="l02681"></a><span class="lineno"> 2681</span>  };</div><div class="line"><a name="l02682"></a><span class="lineno"> 2682</span> </div><div class="line"><a name="l02683"></a><span class="lineno"> 2683</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02684"></a><span class="lineno"> 2684</span>  const typename rope<_CharT, _Alloc>::size_type</div><div class="line"><a name="l02685"></a><span class="lineno"> 2685</span>  rope<_CharT, _Alloc>::npos = (size_type)(-1);</div><div class="line"><a name="l02686"></a><span class="lineno"> 2686</span>  </div><div class="line"><a name="l02687"></a><span class="lineno"> 2687</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02688"></a><span class="lineno"> 2688</span>  inline bool operator==(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02689"></a><span class="lineno"> 2689</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02690"></a><span class="lineno"> 2690</span>  { return (__x._M_current_pos == __y._M_current_pos</div><div class="line"><a name="l02691"></a><span class="lineno"> 2691</span>  && __x._M_root == __y._M_root); }</div><div class="line"><a name="l02692"></a><span class="lineno"> 2692</span> </div><div class="line"><a name="l02693"></a><span class="lineno"> 2693</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02694"></a><span class="lineno"> 2694</span>  inline bool operator<(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02695"></a><span class="lineno"> 2695</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02696"></a><span class="lineno"> 2696</span>  { return (__x._M_current_pos < __y._M_current_pos); }</div><div class="line"><a name="l02697"></a><span class="lineno"> 2697</span> </div><div class="line"><a name="l02698"></a><span class="lineno"> 2698</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02699"></a><span class="lineno"> 2699</span>  inline bool operator!=(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02700"></a><span class="lineno"> 2700</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02701"></a><span class="lineno"> 2701</span>  { return !(__x == __y); }</div><div class="line"><a name="l02702"></a><span class="lineno"> 2702</span> </div><div class="line"><a name="l02703"></a><span class="lineno"> 2703</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02704"></a><span class="lineno"> 2704</span>  inline bool operator>(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02705"></a><span class="lineno"> 2705</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02706"></a><span class="lineno"> 2706</span>  { return __y < __x; }</div><div class="line"><a name="l02707"></a><span class="lineno"> 2707</span> </div><div class="line"><a name="l02708"></a><span class="lineno"> 2708</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02709"></a><span class="lineno"> 2709</span>  inline bool</div><div class="line"><a name="l02710"></a><span class="lineno"> 2710</span>  operator<=(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02711"></a><span class="lineno"> 2711</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02712"></a><span class="lineno"> 2712</span>  { return !(__y < __x); }</div><div class="line"><a name="l02713"></a><span class="lineno"> 2713</span> </div><div class="line"><a name="l02714"></a><span class="lineno"> 2714</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02715"></a><span class="lineno"> 2715</span>  inline bool</div><div class="line"><a name="l02716"></a><span class="lineno"> 2716</span>  operator>=(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02717"></a><span class="lineno"> 2717</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02718"></a><span class="lineno"> 2718</span>  { return !(__x < __y); }</div><div class="line"><a name="l02719"></a><span class="lineno"> 2719</span> </div><div class="line"><a name="l02720"></a><span class="lineno"> 2720</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02721"></a><span class="lineno"> 2721</span>  inline ptrdiff_t</div><div class="line"><a name="l02722"></a><span class="lineno"> 2722</span>  operator-(const _Rope_const_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02723"></a><span class="lineno"> 2723</span>  const _Rope_const_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02724"></a><span class="lineno"> 2724</span>  { return (ptrdiff_t)__x._M_current_pos - (ptrdiff_t)__y._M_current_pos; }</div><div class="line"><a name="l02725"></a><span class="lineno"> 2725</span> </div><div class="line"><a name="l02726"></a><span class="lineno"> 2726</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02727"></a><span class="lineno"> 2727</span>  inline _Rope_const_iterator<_CharT, _Alloc></div><div class="line"><a name="l02728"></a><span class="lineno"> 2728</span>  operator-(const _Rope_const_iterator<_CharT, _Alloc>& __x, ptrdiff_t __n)</div><div class="line"><a name="l02729"></a><span class="lineno"> 2729</span>  { return _Rope_const_iterator<_CharT, _Alloc>(__x._M_root,</div><div class="line"><a name="l02730"></a><span class="lineno"> 2730</span>  __x._M_current_pos - __n); }</div><div class="line"><a name="l02731"></a><span class="lineno"> 2731</span> </div><div class="line"><a name="l02732"></a><span class="lineno"> 2732</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02733"></a><span class="lineno"> 2733</span>  inline _Rope_const_iterator<_CharT, _Alloc></div><div class="line"><a name="l02734"></a><span class="lineno"> 2734</span>  operator+(const _Rope_const_iterator<_CharT, _Alloc>& __x, ptrdiff_t __n)</div><div class="line"><a name="l02735"></a><span class="lineno"> 2735</span>  { return _Rope_const_iterator<_CharT, _Alloc>(__x._M_root,</div><div class="line"><a name="l02736"></a><span class="lineno"> 2736</span>  __x._M_current_pos + __n); }</div><div class="line"><a name="l02737"></a><span class="lineno"> 2737</span> </div><div class="line"><a name="l02738"></a><span class="lineno"> 2738</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02739"></a><span class="lineno"> 2739</span>  inline _Rope_const_iterator<_CharT, _Alloc></div><div class="line"><a name="l02740"></a><span class="lineno"> 2740</span>  operator+(ptrdiff_t __n, const _Rope_const_iterator<_CharT, _Alloc>& __x)</div><div class="line"><a name="l02741"></a><span class="lineno"> 2741</span>  { return _Rope_const_iterator<_CharT, _Alloc>(__x._M_root,</div><div class="line"><a name="l02742"></a><span class="lineno"> 2742</span>  __x._M_current_pos + __n); }</div><div class="line"><a name="l02743"></a><span class="lineno"> 2743</span> </div><div class="line"><a name="l02744"></a><span class="lineno"> 2744</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02745"></a><span class="lineno"> 2745</span>  inline bool</div><div class="line"><a name="l02746"></a><span class="lineno"> 2746</span>  operator==(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02747"></a><span class="lineno"> 2747</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02748"></a><span class="lineno"> 2748</span>  {return (__x._M_current_pos == __y._M_current_pos</div><div class="line"><a name="l02749"></a><span class="lineno"> 2749</span>  && __x._M_root_rope == __y._M_root_rope); }</div><div class="line"><a name="l02750"></a><span class="lineno"> 2750</span>  </div><div class="line"><a name="l02751"></a><span class="lineno"> 2751</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02752"></a><span class="lineno"> 2752</span>  inline bool</div><div class="line"><a name="l02753"></a><span class="lineno"> 2753</span>  operator<(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02754"></a><span class="lineno"> 2754</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02755"></a><span class="lineno"> 2755</span>  { return (__x._M_current_pos < __y._M_current_pos); }</div><div class="line"><a name="l02756"></a><span class="lineno"> 2756</span> </div><div class="line"><a name="l02757"></a><span class="lineno"> 2757</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02758"></a><span class="lineno"> 2758</span>  inline bool</div><div class="line"><a name="l02759"></a><span class="lineno"> 2759</span>  operator!=(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02760"></a><span class="lineno"> 2760</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02761"></a><span class="lineno"> 2761</span>  { return !(__x == __y); }</div><div class="line"><a name="l02762"></a><span class="lineno"> 2762</span> </div><div class="line"><a name="l02763"></a><span class="lineno"> 2763</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02764"></a><span class="lineno"> 2764</span>  inline bool</div><div class="line"><a name="l02765"></a><span class="lineno"> 2765</span>  operator>(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02766"></a><span class="lineno"> 2766</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02767"></a><span class="lineno"> 2767</span>  { return __y < __x; }</div><div class="line"><a name="l02768"></a><span class="lineno"> 2768</span> </div><div class="line"><a name="l02769"></a><span class="lineno"> 2769</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02770"></a><span class="lineno"> 2770</span>  inline bool</div><div class="line"><a name="l02771"></a><span class="lineno"> 2771</span>  operator<=(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02772"></a><span class="lineno"> 2772</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02773"></a><span class="lineno"> 2773</span>  { return !(__y < __x); }</div><div class="line"><a name="l02774"></a><span class="lineno"> 2774</span> </div><div class="line"><a name="l02775"></a><span class="lineno"> 2775</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02776"></a><span class="lineno"> 2776</span>  inline bool</div><div class="line"><a name="l02777"></a><span class="lineno"> 2777</span>  operator>=(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02778"></a><span class="lineno"> 2778</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02779"></a><span class="lineno"> 2779</span>  { return !(__x < __y); }</div><div class="line"><a name="l02780"></a><span class="lineno"> 2780</span> </div><div class="line"><a name="l02781"></a><span class="lineno"> 2781</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02782"></a><span class="lineno"> 2782</span>  inline ptrdiff_t</div><div class="line"><a name="l02783"></a><span class="lineno"> 2783</span>  operator-(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02784"></a><span class="lineno"> 2784</span>  const _Rope_iterator<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02785"></a><span class="lineno"> 2785</span>  { return ((ptrdiff_t)__x._M_current_pos</div><div class="line"><a name="l02786"></a><span class="lineno"> 2786</span>  - (ptrdiff_t)__y._M_current_pos); }</div><div class="line"><a name="l02787"></a><span class="lineno"> 2787</span> </div><div class="line"><a name="l02788"></a><span class="lineno"> 2788</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02789"></a><span class="lineno"> 2789</span>  inline _Rope_iterator<_CharT, _Alloc></div><div class="line"><a name="l02790"></a><span class="lineno"> 2790</span>  operator-(const _Rope_iterator<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02791"></a><span class="lineno"> 2791</span>  ptrdiff_t __n)</div><div class="line"><a name="l02792"></a><span class="lineno"> 2792</span>  { return _Rope_iterator<_CharT, _Alloc>(__x._M_root_rope,</div><div class="line"><a name="l02793"></a><span class="lineno"> 2793</span>  __x._M_current_pos - __n); }</div><div class="line"><a name="l02794"></a><span class="lineno"> 2794</span> </div><div class="line"><a name="l02795"></a><span class="lineno"> 2795</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02796"></a><span class="lineno"> 2796</span>  inline _Rope_iterator<_CharT, _Alloc></div><div class="line"><a name="l02797"></a><span class="lineno"> 2797</span>  operator+(const _Rope_iterator<_CharT, _Alloc>& __x, ptrdiff_t __n)</div><div class="line"><a name="l02798"></a><span class="lineno"> 2798</span>  { return _Rope_iterator<_CharT, _Alloc>(__x._M_root_rope,</div><div class="line"><a name="l02799"></a><span class="lineno"> 2799</span>  __x._M_current_pos + __n); }</div><div class="line"><a name="l02800"></a><span class="lineno"> 2800</span> </div><div class="line"><a name="l02801"></a><span class="lineno"> 2801</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02802"></a><span class="lineno"> 2802</span>  inline _Rope_iterator<_CharT, _Alloc></div><div class="line"><a name="l02803"></a><span class="lineno"> 2803</span>  operator+(ptrdiff_t __n, const _Rope_iterator<_CharT, _Alloc>& __x)</div><div class="line"><a name="l02804"></a><span class="lineno"> 2804</span>  { return _Rope_iterator<_CharT, _Alloc>(__x._M_root_rope,</div><div class="line"><a name="l02805"></a><span class="lineno"> 2805</span>  __x._M_current_pos + __n); }</div><div class="line"><a name="l02806"></a><span class="lineno"> 2806</span> </div><div class="line"><a name="l02807"></a><span class="lineno"> 2807</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02808"></a><span class="lineno"> 2808</span>  inline rope<_CharT, _Alloc></div><div class="line"><a name="l02809"></a><span class="lineno"> 2809</span>  operator+(const rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l02810"></a><span class="lineno"> 2810</span>  const rope<_CharT, _Alloc>& __right)</div><div class="line"><a name="l02811"></a><span class="lineno"> 2811</span>  {</div><div class="line"><a name="l02812"></a><span class="lineno"> 2812</span>  // Inlining this should make it possible to keep __left and</div><div class="line"><a name="l02813"></a><span class="lineno"> 2813</span>  // __right in registers.</div><div class="line"><a name="l02814"></a><span class="lineno"> 2814</span>  typedef rope<_CharT, _Alloc> rope_type;</div><div class="line"><a name="l02815"></a><span class="lineno"> 2815</span>  return rope_type(rope_type::_S_concat(__left._M_tree_ptr, </div><div class="line"><a name="l02816"></a><span class="lineno"> 2816</span>  __right._M_tree_ptr));</div><div class="line"><a name="l02817"></a><span class="lineno"> 2817</span>  }</div><div class="line"><a name="l02818"></a><span class="lineno"> 2818</span> </div><div class="line"><a name="l02819"></a><span class="lineno"> 2819</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02820"></a><span class="lineno"> 2820</span>  inline rope<_CharT, _Alloc>&</div><div class="line"><a name="l02821"></a><span class="lineno"> 2821</span>  operator+=(rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l02822"></a><span class="lineno"> 2822</span>  const rope<_CharT, _Alloc>& __right)</div><div class="line"><a name="l02823"></a><span class="lineno"> 2823</span>  {</div><div class="line"><a name="l02824"></a><span class="lineno"> 2824</span>  __left.append(__right);</div><div class="line"><a name="l02825"></a><span class="lineno"> 2825</span>  return __left;</div><div class="line"><a name="l02826"></a><span class="lineno"> 2826</span>  }</div><div class="line"><a name="l02827"></a><span class="lineno"> 2827</span> </div><div class="line"><a name="l02828"></a><span class="lineno"> 2828</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02829"></a><span class="lineno"> 2829</span>  inline rope<_CharT, _Alloc></div><div class="line"><a name="l02830"></a><span class="lineno"> 2830</span>  operator+(const rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l02831"></a><span class="lineno"> 2831</span>  const _CharT* __right)</div><div class="line"><a name="l02832"></a><span class="lineno"> 2832</span>  {</div><div class="line"><a name="l02833"></a><span class="lineno"> 2833</span>  typedef rope<_CharT, _Alloc> rope_type;</div><div class="line"><a name="l02834"></a><span class="lineno"> 2834</span>  size_t __rlen = rope_type::_S_char_ptr_len(__right);</div><div class="line"><a name="l02835"></a><span class="lineno"> 2835</span>  return rope_type(rope_type::_S_concat_char_iter(__left._M_tree_ptr,</div><div class="line"><a name="l02836"></a><span class="lineno"> 2836</span>  __right, __rlen));</div><div class="line"><a name="l02837"></a><span class="lineno"> 2837</span>  }</div><div class="line"><a name="l02838"></a><span class="lineno"> 2838</span> </div><div class="line"><a name="l02839"></a><span class="lineno"> 2839</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02840"></a><span class="lineno"> 2840</span>  inline rope<_CharT, _Alloc>&</div><div class="line"><a name="l02841"></a><span class="lineno"> 2841</span>  operator+=(rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l02842"></a><span class="lineno"> 2842</span>  const _CharT* __right)</div><div class="line"><a name="l02843"></a><span class="lineno"> 2843</span>  {</div><div class="line"><a name="l02844"></a><span class="lineno"> 2844</span>  __left.append(__right);</div><div class="line"><a name="l02845"></a><span class="lineno"> 2845</span>  return __left;</div><div class="line"><a name="l02846"></a><span class="lineno"> 2846</span>  }</div><div class="line"><a name="l02847"></a><span class="lineno"> 2847</span> </div><div class="line"><a name="l02848"></a><span class="lineno"> 2848</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02849"></a><span class="lineno"> 2849</span>  inline rope<_CharT, _Alloc></div><div class="line"><a name="l02850"></a><span class="lineno"> 2850</span>  operator+(const rope<_CharT, _Alloc>& __left, _CharT __right)</div><div class="line"><a name="l02851"></a><span class="lineno"> 2851</span>  {</div><div class="line"><a name="l02852"></a><span class="lineno"> 2852</span>  typedef rope<_CharT, _Alloc> rope_type;</div><div class="line"><a name="l02853"></a><span class="lineno"> 2853</span>  return rope_type(rope_type::_S_concat_char_iter(__left._M_tree_ptr,</div><div class="line"><a name="l02854"></a><span class="lineno"> 2854</span>  &__right, 1));</div><div class="line"><a name="l02855"></a><span class="lineno"> 2855</span>  }</div><div class="line"><a name="l02856"></a><span class="lineno"> 2856</span> </div><div class="line"><a name="l02857"></a><span class="lineno"> 2857</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02858"></a><span class="lineno"> 2858</span>  inline rope<_CharT, _Alloc>&</div><div class="line"><a name="l02859"></a><span class="lineno"> 2859</span>  operator+=(rope<_CharT, _Alloc>& __left, _CharT __right)</div><div class="line"><a name="l02860"></a><span class="lineno"> 2860</span>  {</div><div class="line"><a name="l02861"></a><span class="lineno"> 2861</span>  __left.append(__right);</div><div class="line"><a name="l02862"></a><span class="lineno"> 2862</span>  return __left;</div><div class="line"><a name="l02863"></a><span class="lineno"> 2863</span>  }</div><div class="line"><a name="l02864"></a><span class="lineno"> 2864</span>  </div><div class="line"><a name="l02865"></a><span class="lineno"> 2865</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02866"></a><span class="lineno"> 2866</span>  bool</div><div class="line"><a name="l02867"></a><span class="lineno"> 2867</span>  operator<(const rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l02868"></a><span class="lineno"> 2868</span>  const rope<_CharT, _Alloc>& __right)</div><div class="line"><a name="l02869"></a><span class="lineno"> 2869</span>  { return __left.compare(__right) < 0; }</div><div class="line"><a name="l02870"></a><span class="lineno"> 2870</span> </div><div class="line"><a name="l02871"></a><span class="lineno"> 2871</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02872"></a><span class="lineno"> 2872</span>  bool</div><div class="line"><a name="l02873"></a><span class="lineno"> 2873</span>  operator==(const rope<_CharT, _Alloc>& __left,</div><div class="line"><a name="l02874"></a><span class="lineno"> 2874</span>  const rope<_CharT, _Alloc>& __right)</div><div class="line"><a name="l02875"></a><span class="lineno"> 2875</span>  { return __left.compare(__right) == 0; }</div><div class="line"><a name="l02876"></a><span class="lineno"> 2876</span> </div><div class="line"><a name="l02877"></a><span class="lineno"> 2877</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02878"></a><span class="lineno"> 2878</span>  inline bool</div><div class="line"><a name="l02879"></a><span class="lineno"> 2879</span>  operator==(const _Rope_char_ptr_proxy<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02880"></a><span class="lineno"> 2880</span>  const _Rope_char_ptr_proxy<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02881"></a><span class="lineno"> 2881</span>  { return (__x._M_pos == __y._M_pos && __x._M_root == __y._M_root); }</div><div class="line"><a name="l02882"></a><span class="lineno"> 2882</span> </div><div class="line"><a name="l02883"></a><span class="lineno"> 2883</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02884"></a><span class="lineno"> 2884</span>  inline bool</div><div class="line"><a name="l02885"></a><span class="lineno"> 2885</span>  operator!=(const rope<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02886"></a><span class="lineno"> 2886</span>  const rope<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02887"></a><span class="lineno"> 2887</span>  { return !(__x == __y); }</div><div class="line"><a name="l02888"></a><span class="lineno"> 2888</span> </div><div class="line"><a name="l02889"></a><span class="lineno"> 2889</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02890"></a><span class="lineno"> 2890</span>  inline bool</div><div class="line"><a name="l02891"></a><span class="lineno"> 2891</span>  operator>(const rope<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02892"></a><span class="lineno"> 2892</span>  const rope<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02893"></a><span class="lineno"> 2893</span>  { return __y < __x; }</div><div class="line"><a name="l02894"></a><span class="lineno"> 2894</span> </div><div class="line"><a name="l02895"></a><span class="lineno"> 2895</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02896"></a><span class="lineno"> 2896</span>  inline bool</div><div class="line"><a name="l02897"></a><span class="lineno"> 2897</span>  operator<=(const rope<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02898"></a><span class="lineno"> 2898</span>  const rope<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02899"></a><span class="lineno"> 2899</span>  { return !(__y < __x); }</div><div class="line"><a name="l02900"></a><span class="lineno"> 2900</span> </div><div class="line"><a name="l02901"></a><span class="lineno"> 2901</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02902"></a><span class="lineno"> 2902</span>  inline bool</div><div class="line"><a name="l02903"></a><span class="lineno"> 2903</span>  operator>=(const rope<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02904"></a><span class="lineno"> 2904</span>  const rope<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02905"></a><span class="lineno"> 2905</span>  { return !(__x < __y); }</div><div class="line"><a name="l02906"></a><span class="lineno"> 2906</span> </div><div class="line"><a name="l02907"></a><span class="lineno"> 2907</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02908"></a><span class="lineno"> 2908</span>  inline bool</div><div class="line"><a name="l02909"></a><span class="lineno"> 2909</span>  operator!=(const _Rope_char_ptr_proxy<_CharT, _Alloc>& __x,</div><div class="line"><a name="l02910"></a><span class="lineno"> 2910</span>  const _Rope_char_ptr_proxy<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02911"></a><span class="lineno"> 2911</span>  { return !(__x == __y); }</div><div class="line"><a name="l02912"></a><span class="lineno"> 2912</span> </div><div class="line"><a name="l02913"></a><span class="lineno"> 2913</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l02914"></a><span class="lineno"> 2914</span>  std::basic_ostream<_CharT, _Traits>&</div><div class="line"><a name="l02915"></a><span class="lineno"> 2915</span>  operator<<(std::basic_ostream<_CharT, _Traits>& __o,</div><div class="line"><a name="l02916"></a><span class="lineno"> 2916</span>  const rope<_CharT, _Alloc>& __r);</div><div class="line"><a name="l02917"></a><span class="lineno"> 2917</span> </div><div class="line"><a name="l02918"></a><span class="lineno"> 2918</span>  typedef rope<char> crope;</div><div class="line"><a name="l02919"></a><span class="lineno"> 2919</span>  typedef rope<wchar_t> wrope;</div><div class="line"><a name="l02920"></a><span class="lineno"> 2920</span> </div><div class="line"><a name="l02921"></a><span class="lineno"> 2921</span>  inline crope::reference</div><div class="line"><a name="l02922"></a><span class="lineno"> 2922</span>  __mutable_reference_at(crope& __c, size_t __i)</div><div class="line"><a name="l02923"></a><span class="lineno"> 2923</span>  { return __c.mutable_reference_at(__i); }</div><div class="line"><a name="l02924"></a><span class="lineno"> 2924</span> </div><div class="line"><a name="l02925"></a><span class="lineno"> 2925</span>  inline wrope::reference</div><div class="line"><a name="l02926"></a><span class="lineno"> 2926</span>  __mutable_reference_at(wrope& __c, size_t __i)</div><div class="line"><a name="l02927"></a><span class="lineno"> 2927</span>  { return __c.mutable_reference_at(__i); }</div><div class="line"><a name="l02928"></a><span class="lineno"> 2928</span> </div><div class="line"><a name="l02929"></a><span class="lineno"> 2929</span>  template <class _CharT, class _Alloc></div><div class="line"><a name="l02930"></a><span class="lineno"> 2930</span>  inline void</div><div class="line"><a name="l02931"></a><span class="lineno"> 2931</span>  swap(rope<_CharT, _Alloc>& __x, rope<_CharT, _Alloc>& __y)</div><div class="line"><a name="l02932"></a><span class="lineno"> 2932</span>  { __x.swap(__y); }</div><div class="line"><a name="l02933"></a><span class="lineno"> 2933</span> </div><div class="line"><a name="l02934"></a><span class="lineno"> 2934</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l02935"></a><span class="lineno"> 2935</span> } // namespace</div><div class="line"><a name="l02936"></a><span class="lineno"> 2936</span> </div><div class="line"><a name="l02937"></a><span class="lineno"> 2937</span> </div><div class="line"><a name="l02938"></a><span class="lineno"> 2938</span> namespace std _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l02939"></a><span class="lineno"> 2939</span> { </div><div class="line"><a name="l02940"></a><span class="lineno"> 2940</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l02941"></a><span class="lineno"> 2941</span> </div><div class="line"><a name="l02942"></a><span class="lineno"> 2942</span> namespace tr1</div><div class="line"><a name="l02943"></a><span class="lineno"> 2943</span> {</div><div class="line"><a name="l02944"></a><span class="lineno"> 2944</span>  template<></div><div class="line"><a name="l02945"></a><span class="lineno"> 2945</span>  struct hash<__gnu_cxx::crope></div><div class="line"><a name="l02946"></a><span class="lineno"> 2946</span>  {</div><div class="line"><a name="l02947"></a><span class="lineno"> 2947</span>  size_t</div><div class="line"><a name="l02948"></a><span class="lineno"> 2948</span>  operator()(const __gnu_cxx::crope& __str) const</div><div class="line"><a name="l02949"></a><span class="lineno"> 2949</span>  {</div><div class="line"><a name="l02950"></a><span class="lineno"> 2950</span>  size_t __size = __str.size();</div><div class="line"><a name="l02951"></a><span class="lineno"> 2951</span>  if (0 == __size)</div><div class="line"><a name="l02952"></a><span class="lineno"> 2952</span>  return 0;</div><div class="line"><a name="l02953"></a><span class="lineno"> 2953</span>  return 13 * __str[0] + 5 * __str[__size - 1] + __size;</div><div class="line"><a name="l02954"></a><span class="lineno"> 2954</span>  }</div><div class="line"><a name="l02955"></a><span class="lineno"> 2955</span>  };</div><div class="line"><a name="l02956"></a><span class="lineno"> 2956</span> </div><div class="line"><a name="l02957"></a><span class="lineno"> 2957</span> </div><div class="line"><a name="l02958"></a><span class="lineno"> 2958</span>  template<></div><div class="line"><a name="l02959"></a><span class="lineno"> 2959</span>  struct hash<__gnu_cxx::wrope></div><div class="line"><a name="l02960"></a><span class="lineno"> 2960</span>  {</div><div class="line"><a name="l02961"></a><span class="lineno"> 2961</span>  size_t</div><div class="line"><a name="l02962"></a><span class="lineno"> 2962</span>  operator()(const __gnu_cxx::wrope& __str) const</div><div class="line"><a name="l02963"></a><span class="lineno"> 2963</span>  {</div><div class="line"><a name="l02964"></a><span class="lineno"> 2964</span>  size_t __size = __str.size();</div><div class="line"><a name="l02965"></a><span class="lineno"> 2965</span>  if (0 == __size)</div><div class="line"><a name="l02966"></a><span class="lineno"> 2966</span>  return 0;</div><div class="line"><a name="l02967"></a><span class="lineno"> 2967</span>  return 13 * __str[0] + 5 * __str[__size - 1] + __size;</div><div class="line"><a name="l02968"></a><span class="lineno"> 2968</span>  }</div><div class="line"><a name="l02969"></a><span class="lineno"> 2969</span>  };</div><div class="line"><a name="l02970"></a><span class="lineno"> 2970</span> } // namespace tr1</div><div class="line"><a name="l02971"></a><span class="lineno"> 2971</span> </div><div class="line"><a name="l02972"></a><span class="lineno"> 2972</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l02973"></a><span class="lineno"> 2973</span> } // namespace std</div><div class="line"><a name="l02974"></a><span class="lineno"> 2974</span> </div><div class="line"><a name="l02975"></a><span class="lineno"> 2975</span> # include <ext/ropeimpl.h></div><div class="line"><a name="l02976"></a><span class="lineno"> 2976</span> </div><div class="line"><a name="l02977"></a><span class="lineno"> 2977</span> #endif</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="a00860.html">rope</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
>
760
