<!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++: rc_string_base.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a01070_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">rc_string_base.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01070.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Reference-counted versatile string base -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2005-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file ext/rc_string_base.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Do not attempt to use it directly. @headername{ext/vstring.h}</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#ifndef _RC_STRING_BASE_H</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define _RC_STRING_BASE_H 1</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <<a class="code" href="a01025.html">ext/atomicity.h</a>></span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <<a class="code" href="a00551.html">bits/stl_iterator_base_funcs.h</a>></span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">namespace </span><a class="code" href="a01547.html">__gnu_cxx</a> _GLIBCXX_VISIBILITY(default)</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> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> /**</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * Documentation? What's that?</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Nathan Myers <ncm@cantrip.org>.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> *</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * A string looks like this:</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> *</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * @code</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * [_Rep]</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * _M_length</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * [__rc_string_base<char_type>] _M_capacity</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * _M_dataplus _M_refcount</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * _M_p ----------------> unnamed array of char_type</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * @endcode</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> *</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * Where the _M_p points to the first character in the string, and</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * you cast it to a pointer-to-_Rep and subtract 1 to get a</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * pointer to the header.</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> *</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * This approach has the enormous advantage that a string object</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * requires only one allocation. All the ugliness is confined</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * within a single pair of inline functions, which each compile to</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * a single @a add instruction: _Rep::_M_refdata(), and</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * __rc_string_base::_M_rep(); and the allocation function which gets a</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * block of raw bytes and with room enough and constructs a _Rep</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * object at the front.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> *</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * The reason you want _M_data pointing to the character array and</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * not the _Rep is so that the debugger can see the string</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * contents. (Probably we should add a non-inline member to get</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * the _Rep for the debugger to use, so users can check the actual</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * string length.)</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> *</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * Note that the _Rep object is a POD so that you can have a</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * static <em>empty string</em> _Rep object already @a constructed before</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * static constructors have run. The reference-count encoding is</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * chosen so that a 0 indicates one reference, so you never try to</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * destroy the empty-string _Rep object.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> *</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * All but the last paragraph is considered pretty conventional</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * for a C++ string implementation.</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> */</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="a10551.html"> 82</a></span>  <span class="keyword">class </span><a class="code" href="a10551.html">__rc_string_base</a></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  : <span class="keyword">protected</span> __vstring_utility<_CharT, _Traits, _Alloc></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typedef</span> _Traits traits_type;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Traits::char_type value_type;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</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>  <span class="keyword">typedef</span> __vstring_utility<_CharT, _Traits, _Alloc> _Util_Base;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Util_Base::_CharT_alloc_type _CharT_alloc_type;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _CharT_alloc_type::size_type size_type;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// _Rep: string representation</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// Invariants:</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// 1. String really contains _M_length + 1 characters: due to 21.3.4</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// must be kept null-terminated.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// 2. _M_capacity >= _M_length</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// Allocated memory is always (_M_capacity + 1) * sizeof(_CharT).</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// 3. _M_refcount has three states:</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// -1: leaked, one reference, no ref-copies allowed, non-const.</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// 0: one reference, non-const.</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// n>0: n + 1 references, operations require a lock, const.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// 4. All fields == 0 is an empty string, given the extra storage</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// beyond-the-end for a null terminator; thus, the shared</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// empty string representation needs no constructor.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">struct </span>_Rep</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">union</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">struct</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  size_type _M_length;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  size_type _M_capacity;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  _Atomic_word _M_refcount;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  } _M_info;</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>  <span class="comment">// Only for alignment purposes.</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  _CharT _M_align;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  };</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<_Rep>::other _Rep_alloc_type;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  _CharT*</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  _M_refdata() <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  { <span class="keywordflow">return</span> reinterpret_cast<_CharT*>(<span class="keyword">this</span> + 1); }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  _CharT*</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  _M_refcopy() <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  __atomic_add_dispatch(&_M_info._M_refcount, 1);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">return</span> _M_refdata();</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  } <span class="comment">// XXX MT</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  _M_set_length(size_type __n)</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  {</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  _M_info._M_refcount = 0; <span class="comment">// One reference.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  _M_info._M_length = __n;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// grrr. (per 21.3.4)</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// You cannot leave those LWG people alone for a second.</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  traits_type::assign(_M_refdata()[__n], _CharT());</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> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// Create & Destroy</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">static</span> _Rep*</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  _S_create(size_type, size_type, <span class="keyword">const</span> _Alloc&);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  _M_destroy(<span class="keyword">const</span> _Alloc&) <span class="keywordflow">throw</span>();</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  _CharT*</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _M_clone(<span class="keyword">const</span> _Alloc&, size_type __res = 0);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  };</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">struct </span>_Rep_empty</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  : <span class="keyword">public</span> _Rep</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  {</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  _CharT _M_terminal;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  };</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">static</span> _Rep_empty _S_empty_rep;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// The maximum number of individual char_type elements of an</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// individual string is determined by _S_max_size. This is the</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// value that will be returned by max_size(). (Whereas npos</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// is the maximum number of bytes the allocator can allocate.)</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// If one was to divvy up the theoretical largest size string,</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// with a terminating character and m _CharT elements, it'd</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// look like this:</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT)</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// + sizeof(_Rep) - 1</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// (NB: last two terms for rounding reasons, see _M_create below)</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// Solving for m:</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// m = ((npos - 2 * sizeof(_Rep) + 1) / sizeof(_CharT)) - 1</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// In addition, this implementation halves this amount.</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">enum</span> { _S_max_size = (((static_cast<size_type>(-1) - 2 * <span class="keyword">sizeof</span>(_Rep)</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  + 1) / <span class="keyword">sizeof</span>(_CharT)) - 1) / 2 };</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// Data Member (private):</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">mutable</span> <span class="keyword">typename</span> _Util_Base::template _Alloc_hider<_Alloc> _M_dataplus;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  _M_data(_CharT* __p)</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  { _M_dataplus._M_p = __p; }</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  _Rep*</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  _M_rep()<span class="keyword"> const</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> &((reinterpret_cast<_Rep*>(_M_data()))[-1]); }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  _CharT*</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  _M_grab(<span class="keyword">const</span> _Alloc& __alloc)<span class="keyword"> const</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">return</span> (!_M_is_leaked() && _M_get_allocator() == __alloc)</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  ? _M_rep()->_M_refcopy() : _M_rep()->_M_clone(__alloc);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  _M_dispose()</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Be race-detector-friendly. For more info see bits/c++config.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&_M_rep()->_M_info.</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  _M_refcount);</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">if</span> (__exchange_and_add_dispatch(&_M_rep()->_M_info._M_refcount,</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  -1) <= 0)</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_rep()->_M_info.</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  _M_refcount);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  _M_rep()->_M_destroy(_M_get_allocator());</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  } <span class="comment">// XXX MT</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  _M_is_leaked()<span class="keyword"> const</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_refcount < 0; }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  _M_set_sharable()</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  { _M_rep()->_M_info._M_refcount = 0; }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  _M_leak_hard();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// _S_construct_aux is used to implement the 21.3.1 para 15 which</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// requires special behaviour if _InIterator is an integral type</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  _S_construct_aux(_InIterator __beg, _InIterator __end,</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> _Alloc& __a, std::__false_type)</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>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_InIterator>::iterator_category _Tag;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span> _S_construct(__beg, __end, __a, _Tag());</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  _S_construct_aux(_Integer __beg, _Integer __end,</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> _Alloc& __a, std::__true_type)</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  { <span class="keywordflow">return</span> _S_construct_aux_2(static_cast<size_type>(__beg),</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  __end, __a); }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  _S_construct_aux_2(size_type __req, _CharT __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  { <span class="keywordflow">return</span> _S_construct(__req, __c, __a); }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a)</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>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InIterator>::__type _Integral;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">return</span> _S_construct_aux(__beg, __end, __a, _Integral());</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// For Input Iterators, used in istreambuf_iterators, etc.</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a,</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <a class="code" href="a07655.html">std::input_iterator_tag</a>);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// For forward_iterators up to random_access_iterators, used for</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// string::iterator, _CharT*, etc.</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _FwdIterator></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  _S_construct(_FwdIterator __beg, _FwdIterator __end, <span class="keyword">const</span> _Alloc& __a,</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="a07663.html">std::forward_iterator_tag</a>);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">static</span> _CharT*</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  _S_construct(size_type __req, _CharT __c, <span class="keyword">const</span> _Alloc& __a);</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>  <span class="keyword">public</span>:</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  size_type</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  _M_max_size()<span class="keyword"> const</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> size_type(_S_max_size); }</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  _CharT*</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  _M_data()<span class="keyword"> const</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_dataplus._M_p; }</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  size_type</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  _M_length()<span class="keyword"> const</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_length; }</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>  size_type</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  _M_capacity()<span class="keyword"> const</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_capacity; }</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>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  _M_is_shared()<span class="keyword"> const</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_refcount > 0; }</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  _M_set_leaked()</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  { _M_rep()->_M_info._M_refcount = -1; }</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  _M_leak() <span class="comment">// for use in begin() & non-const op[]</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  {</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</span> (!_M_is_leaked())</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  _M_leak_hard();</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  _M_set_length(size_type __n)</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  { _M_rep()->_M_set_length(__n); }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <a class="code" href="a10551.html">__rc_string_base</a>()</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  : _M_dataplus(_S_empty_rep._M_refcopy()) { }</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="a10551.html">__rc_string_base</a>(<span class="keyword">const</span> _Alloc& __a);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="a10551.html">__rc_string_base</a>(<span class="keyword">const</span> <a class="code" href="a10551.html">__rc_string_base</a>& __rcs);</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="a10551.html">__rc_string_base</a>(<a class="code" href="a10551.html">__rc_string_base</a>&& __rcs)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  : _M_dataplus(__rcs._M_dataplus)</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  { __rcs._M_data(_S_empty_rep._M_refcopy()); }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="preprocessor">#endif</span></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>  <a class="code" href="a10551.html">__rc_string_base</a>(size_type __n, _CharT __c, <span class="keyword">const</span> _Alloc& __a);</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <a class="code" href="a10551.html">__rc_string_base</a>(_InputIterator __beg, _InputIterator __end,</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> _Alloc& __a);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  ~<a class="code" href="a10551.html">__rc_string_base</a>()</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  { _M_dispose(); }</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> </div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  allocator_type&</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  _M_get_allocator()</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  { <span class="keywordflow">return</span> _M_dataplus; }</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">const</span> allocator_type&</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  _M_get_allocator()<span class="keyword"> const</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_dataplus; }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  _M_swap(<a class="code" href="a10551.html">__rc_string_base</a>& __rcs);</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  _M_assign(<span class="keyword">const</span> <a class="code" href="a10551.html">__rc_string_base</a>& __rcs);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  _M_reserve(size_type __res);</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  _M_mutate(size_type __pos, size_type __len1, <span class="keyword">const</span> _CharT* __s,</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  size_type __len2);</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  _M_erase(size_type __pos, size_type __n);</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  _M_clear()</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>  _M_dispose();</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  _M_data(_S_empty_rep._M_refcopy());</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  _M_compare(<span class="keyword">const</span> <a class="code" href="a10551.html">__rc_string_base</a>&)<span class="keyword"> const</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  };</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keyword">typename</span> <a class="code" href="a10551.html">__rc_string_base<_CharT, _Traits, _Alloc>::_Rep_empty</a></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="a10551.html">__rc_string_base<_CharT, _Traits, _Alloc>::_S_empty_rep</a>;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">typename</span> <a class="code" href="a10551.html">__rc_string_base<_CharT, _Traits, _Alloc>::_Rep</a>*</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="a10551.html">__rc_string_base<_CharT, _Traits, _Alloc>::_Rep::</a></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <a class="code" href="a10551.html"> _S_create</a>(size_type __capacity, size_type __old_capacity,</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> _Alloc& __alloc)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// 83. String::npos vs. string::max_size()</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">if</span> (__capacity > size_type(_S_max_size))</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  std::__throw_length_error(__N(<span class="stringliteral">"__rc_string_base::_Rep::_S_create"</span>));</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// The standard places no restriction on allocating more memory</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// than is strictly needed within this layer at the moment or as</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// requested by an explicit application call to reserve().</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> </div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// Many malloc implementations perform quite poorly when an</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// application attempts to allocate memory in a stepwise fashion</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// growing each allocation size by only 1 char. Additionally,</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// it makes little sense to allocate less linear memory than the</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">// natural blocking size of the malloc implementation.</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="comment">// Unfortunately, we would need a somewhat low-level calculation</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">// with tuned parameters to get this perfect for any particular</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">// malloc implementation. Fortunately, generalizations about</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// common features seen among implementations seems to suffice.</span></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>  <span class="comment">// __pagesize need not match the actual VM page size for good</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// results in practice, thus we pick a common value on the low</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">// side. __malloc_header_size is an estimate of the amount of</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">// overhead per memory allocation (in practice seen N * sizeof</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">// (void*) where N is 0, 2 or 4). According to folklore,</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// picking this value on the high side is better than</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="comment">// low-balling it (especially when this algorithm is used with</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">// malloc implementations that allocate memory blocks rounded up</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// to a size which is a power of 2).</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">const</span> size_type __pagesize = 4096;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">const</span> size_type __malloc_header_size = 4 * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> </div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// The below implements an exponential growth policy, necessary to</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// meet amortized linear time requirements of the library: see</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html.</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (__capacity > __old_capacity && __capacity < 2 * __old_capacity)</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  {</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  __capacity = 2 * __old_capacity;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">// Never allocate a string bigger than _S_max_size.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">if</span> (__capacity > size_type(_S_max_size))</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  __capacity = size_type(_S_max_size);</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// NB: Need an array of char_type[__capacity], plus a terminating</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// null char_type() element, plus enough for the _Rep data structure,</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="comment">// plus sizeof(_Rep) - 1 to upper round to a size multiple of</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="comment">// sizeof(_Rep).</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="comment">// Whew. Seemingly so needy, yet so elemental.</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  size_type __size = ((__capacity + 1) * <span class="keyword">sizeof</span>(_CharT)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  + 2 * <span class="keyword">sizeof</span>(_Rep) - 1);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> </div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keyword">const</span> size_type __adj_size = __size + __malloc_header_size;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">if</span> (__adj_size > __pagesize && __capacity > __old_capacity)</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  {</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keyword">const</span> size_type __extra = __pagesize - __adj_size % __pagesize;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  __capacity += __extra / <span class="keyword">sizeof</span>(_CharT);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (__capacity > size_type(_S_max_size))</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  __capacity = size_type(_S_max_size);</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  __size = (__capacity + 1) * <span class="keyword">sizeof</span>(_CharT) + 2 * <span class="keyword">sizeof</span>(_Rep) - 1;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  }</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> </div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// NB: Might throw, but no worries about a leak, mate: _Rep()</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// does not throw.</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  _Rep* __place = _Rep_alloc_type(__alloc).allocate(__size / <span class="keyword">sizeof</span>(_Rep));</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  _Rep* __p = <span class="keyword">new</span> (__place) _Rep;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  __p->_M_info._M_capacity = __capacity;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">return</span> __p;</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> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  __rc_string_base<_CharT, _Traits, _Alloc>::_Rep::</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  _M_destroy(<span class="keyword">const</span> _Alloc& __a) <span class="keywordflow">throw</span> ()</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">const</span> size_type __size = ((_M_info._M_capacity + 1) * <span class="keyword">sizeof</span>(_CharT)</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  + 2 * <span class="keyword">sizeof</span>(_Rep) - 1);</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  _Rep_alloc_type(__a).deallocate(<span class="keyword">this</span>, __size / <span class="keyword">sizeof</span>(_Rep));</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  _CharT*</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  __rc_string_base<_CharT, _Traits, _Alloc>::_Rep::</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  _M_clone(<span class="keyword">const</span> _Alloc& __alloc, size_type __res)</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  {</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="comment">// Requested capacity of the clone.</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> size_type __requested_cap = _M_info._M_length + __res;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  _Rep* __r = _Rep::_S_create(__requested_cap, _M_info._M_capacity,</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  __alloc);</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> </div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (_M_info._M_length)</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  __rc_string_base::_S_copy(__r->_M_refdata(), _M_refdata(), _M_info._M_length);</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>  __r->_M_set_length(_M_info._M_length);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">return</span> __r->_M_refdata();</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> </div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  __rc_string_base(<span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  : _M_dataplus(__a, _S_construct(size_type(), _CharT(), __a)) { }</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  __rc_string_base(<span class="keyword">const</span> __rc_string_base& __rcs)</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  : _M_dataplus(__rcs._M_get_allocator(),</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  __rcs._M_grab(__rcs._M_get_allocator())) { }</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> </div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  __rc_string_base(size_type __n, _CharT __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  : _M_dataplus(__a, _S_construct(__n, __c, __a)) { }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  __rc_string_base(_InputIterator __beg, _InputIterator __end,</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  : _M_dataplus(__a, _S_construct(__beg, __end, __a)) { }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  _M_leak_hard()</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>  <span class="keywordflow">if</span> (_M_is_shared())</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  _M_erase(0, 0);</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  _M_set_leaked();</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  }</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// NB: This is the special case for Input Iterators, used in</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// istreambuf_iterators, etc.</span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// Input Iterators have a cost structure very different from</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// pointers, calling for a different coding style.</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  _CharT*</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a,</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <a class="code" href="a07655.html">std::input_iterator_tag</a>)</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>  <span class="keywordflow">if</span> (__beg == __end && __a == _Alloc())</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">return</span> _S_empty_rep._M_refcopy();</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// Avoid reallocation for common case.</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  _CharT __buf[128];</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  size_type __len = 0;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">while</span> (__beg != __end && __len < <span class="keyword">sizeof</span>(__buf) / <span class="keyword">sizeof</span>(_CharT))</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>  __buf[__len++] = *__beg;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  ++__beg;</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>  _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  _S_copy(__r->_M_refdata(), __buf, __len);</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  __try</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  {</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">while</span> (__beg != __end)</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  {</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (__len == __r->_M_info._M_capacity)</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  {</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// Allocate more space.</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  _S_copy(__another->_M_refdata(), __r->_M_refdata(), __len);</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  __r->_M_destroy(__a);</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  __r = __another;</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  __r->_M_refdata()[__len++] = *__beg;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  ++__beg;</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  }</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  __catch(...)</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>  __r->_M_destroy(__a);</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  __throw_exception_again;</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  __r->_M_set_length(__len);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">return</span> __r->_M_refdata();</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> </div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  _CharT*</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a,</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <a class="code" href="a07663.html">std::forward_iterator_tag</a>)</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>  <span class="keywordflow">if</span> (__beg == __end && __a == _Alloc())</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">return</span> _S_empty_rep._M_refcopy();</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// NB: Not required, but considered best practice.</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">if</span> (__is_null_pointer(__beg) && __beg != __end)</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  std::__throw_logic_error(__N(<span class="stringliteral">"__rc_string_base::"</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="stringliteral">"_S_construct null not valid"</span>));</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> </div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">const</span> size_type __dnew = static_cast<size_type>(<a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__beg,</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  __end));</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Check for out_of_range and length_error exceptions.</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  __try</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  { __rc_string_base::_S_copy_chars(__r->_M_refdata(), __beg, __end); }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  __catch(...)</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  {</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  __r->_M_destroy(__a);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  __throw_exception_again;</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>  __r->_M_set_length(__dnew);</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">return</span> __r->_M_refdata();</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  }</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> </div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  _CharT*</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  _S_construct(size_type __n, _CharT __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (__n == 0 && __a == _Alloc())</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">return</span> _S_empty_rep._M_refcopy();</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// Check for out_of_range and length_error exceptions.</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (__n)</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  __rc_string_base::_S_assign(__r->_M_refdata(), __n, __c);</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  __r->_M_set_length(__n);</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">return</span> __r->_M_refdata();</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  _M_swap(__rc_string_base& __rcs)</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  {</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">if</span> (_M_is_leaked())</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  _M_set_sharable();</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">if</span> (__rcs._M_is_leaked())</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  __rcs._M_set_sharable();</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> </div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  _CharT* __tmp = _M_data();</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  _M_data(__rcs._M_data());</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  __rcs._M_data(__tmp);</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// 431. Swapping containers with unequal allocators.</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  std::__alloc_swap<allocator_type>::_S_do_it(_M_get_allocator(),</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  __rcs._M_get_allocator());</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  _M_assign(<span class="keyword">const</span> __rc_string_base& __rcs)</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordflow">if</span> (_M_rep() != __rcs._M_rep())</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  {</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  _CharT* __tmp = __rcs._M_grab(_M_get_allocator());</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  _M_dispose();</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  _M_data(__tmp);</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> </div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  _M_reserve(size_type __res)</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  {</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// Make sure we don't shrink below the current size.</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">if</span> (__res < _M_length())</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  __res = _M_length();</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> </div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">if</span> (__res != _M_capacity() || _M_is_shared())</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>  _CharT* __tmp = _M_rep()->_M_clone(_M_get_allocator(),</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  __res - _M_length());</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  _M_dispose();</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  _M_data(__tmp);</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  }</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  }</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  _M_mutate(size_type __pos, size_type __len1, <span class="keyword">const</span> _CharT* __s,</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  size_type __len2)</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  {</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keyword">const</span> size_type __how_much = _M_length() - __pos - __len1;</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>  _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1,</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  _M_capacity(), _M_get_allocator());</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>  <span class="keywordflow">if</span> (__pos)</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  this->_S_copy(__r->_M_refdata(), _M_data(), __pos);</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">if</span> (__s && __len2)</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  this->_S_copy(__r->_M_refdata() + __pos, __s, __len2);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (__how_much)</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  this->_S_copy(__r->_M_refdata() + __pos + __len2,</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  _M_data() + __pos + __len1, __how_much);</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> </div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  _M_dispose();</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  _M_data(__r->_M_refdata());</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  }</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> </div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  __rc_string_base<_CharT, _Traits, _Alloc>::</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  _M_erase(size_type __pos, size_type __n)</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  {</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keyword">const</span> size_type __new_size = _M_length() - __n;</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">const</span> size_type __how_much = _M_length() - __pos - __n;</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordflow">if</span> (_M_is_shared())</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// Must reallocate.</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  _Rep* __r = _Rep::_S_create(__new_size, _M_capacity(),</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  _M_get_allocator());</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span> </div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keywordflow">if</span> (__pos)</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  this->_S_copy(__r->_M_refdata(), _M_data(), __pos);</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">if</span> (__how_much)</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  this->_S_copy(__r->_M_refdata() + __pos,</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  _M_data() + __pos + __n, __how_much);</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> </div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  _M_dispose();</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  _M_data(__r->_M_refdata());</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>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__how_much && __n)</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  {</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// Work in-place.</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  this->_S_move(_M_data() + __pos,</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  _M_data() + __pos + __n, __how_much);</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> </div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  _M_rep()->_M_set_length(__new_size);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  }</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> </div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  __rc_string_base<char, std::char_traits<char>,</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <a class="code" href="a04707.html">std::allocator<char></a> >::</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  _M_compare(<span class="keyword">const</span> __rc_string_base& __rcs)<span class="keyword"> const</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">if</span> (_M_rep() == __rcs._M_rep())</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  }</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> </div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="preprocessor">#ifdef _GLIBCXX_USE_WCHAR_T</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  __rc_string_base<wchar_t, std::char_traits<wchar_t>,</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <a class="code" href="a04707.html">std::allocator<wchar_t></a> >::</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  _M_compare(<span class="keyword">const</span> __rc_string_base& __rcs)<span class="keyword"> const</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">if</span> (_M_rep() == __rcs._M_rep())</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> </div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="preprocessor">#endif </span><span class="comment">/* _RC_STRING_BASE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a07655_html"><div class="ttname"><a href="a07655.html">std::input_iterator_tag</a></div><div class="ttdoc">Marking input iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00089">stl_iterator_base_types.h:89</a></div></div>
<div class="ttc" id="a04707_html"><div class="ttname"><a href="a04707.html">std::allocator</a></div><div class="ttdoc">The standard allocator, as per [20.4].</div><div class="ttdef"><b>Definition:</b> <a href="a00272_source.html#l00108">allocator.h:108</a></div></div>
<div class="ttc" id="a07663_html"><div class="ttname"><a href="a07663.html">std::forward_iterator_tag</a></div><div class="ttdoc">Forward iterators support a superset of input iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00095">stl_iterator_base_types.h:95</a></div></div>
<div class="ttc" id="a01547_html"><div class="ttname"><a href="a01547.html">__gnu_cxx</a></div><div class="ttdoc">GNU extensions for public use.</div></div>
<div class="ttc" id="a10551_html"><div class="ttname"><a href="a10551.html">__gnu_cxx::__rc_string_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a01070_source.html#l00082">rc_string_base.h:82</a></div></div>
<div class="ttc" id="a01025_html"><div class="ttname"><a href="a01025.html">atomicity.h</a></div></div>
<div class="ttc" id="a00551_html"><div class="ttname"><a href="a00551.html">stl_iterator_base_funcs.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_029334e92d1e3db3ea7d86241898d8b1.html">ext</a></li><li class="navelem"><a class="el" href="a01070.html">rc_string_base.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
958
