<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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"/>
<title>libstdc++: rc_string_base.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a01004.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">rc_string_base.h</div> </div>
</div>
<div class="contents">
<a href="a01004.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Reference-counted versatile string base -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010</span>
<a name="l00004"></a>00004 <span class="comment">// Free Software Foundation, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00007"></a>00007 <span class="comment">// software; you can redistribute it and/or modify it under the</span>
<a name="l00008"></a>00008 <span class="comment">// terms of the GNU General Public License as published by the</span>
<a name="l00009"></a>00009 <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span>
<a name="l00010"></a>00010 <span class="comment">// any later version.</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="comment">// This library is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00015"></a>00015 <span class="comment">// GNU General Public License for more details.</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00018"></a>00018 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00019"></a>00019 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00022"></a>00022 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00023"></a>00023 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00024"></a>00024 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00025"></a>00025 <span class="comment"></span>
<a name="l00026"></a>00026 <span class="comment">/** @file ext/rc_string_base.h</span>
<a name="l00027"></a>00027 <span class="comment"> * This is an internal header file, included by other library headers.</span>
<a name="l00028"></a>00028 <span class="comment"> * Do not attempt to use it directly. @headername{ext/vstring.h}</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="preprocessor">#ifndef _RC_STRING_BASE_H</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#define _RC_STRING_BASE_H 1</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span>
<a name="l00034"></a>00034 <span class="preprocessor">#include <<a class="code" href="a00760.html">ext/atomicity.h</a>></span>
<a name="l00035"></a>00035 <span class="preprocessor">#include <<a class="code" href="a01053.html">bits/stl_iterator_base_funcs.h</a>></span>
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keyword">namespace </span>__gnu_cxx _GLIBCXX_VISIBILITY(default)
<a name="l00038"></a>00038 {
<a name="l00039"></a>00039 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00040"></a>00040 <span class="comment"></span>
<a name="l00041"></a>00041 <span class="comment"> /**</span>
<a name="l00042"></a>00042 <span class="comment"> * Documentation? What's that?</span>
<a name="l00043"></a>00043 <span class="comment"> * Nathan Myers <ncm@cantrip.org>.</span>
<a name="l00044"></a>00044 <span class="comment"> *</span>
<a name="l00045"></a>00045 <span class="comment"> * A string looks like this:</span>
<a name="l00046"></a>00046 <span class="comment"> *</span>
<a name="l00047"></a>00047 <span class="comment"> * @code</span>
<a name="l00048"></a>00048 <span class="comment"> * [_Rep]</span>
<a name="l00049"></a>00049 <span class="comment"> * _M_length</span>
<a name="l00050"></a>00050 <span class="comment"> * [__rc_string_base<char_type>] _M_capacity</span>
<a name="l00051"></a>00051 <span class="comment"> * _M_dataplus _M_refcount</span>
<a name="l00052"></a>00052 <span class="comment"> * _M_p ----------------> unnamed array of char_type</span>
<a name="l00053"></a>00053 <span class="comment"> * @endcode</span>
<a name="l00054"></a>00054 <span class="comment"> *</span>
<a name="l00055"></a>00055 <span class="comment"> * Where the _M_p points to the first character in the string, and</span>
<a name="l00056"></a>00056 <span class="comment"> * you cast it to a pointer-to-_Rep and subtract 1 to get a</span>
<a name="l00057"></a>00057 <span class="comment"> * pointer to the header.</span>
<a name="l00058"></a>00058 <span class="comment"> *</span>
<a name="l00059"></a>00059 <span class="comment"> * This approach has the enormous advantage that a string object</span>
<a name="l00060"></a>00060 <span class="comment"> * requires only one allocation. All the ugliness is confined</span>
<a name="l00061"></a>00061 <span class="comment"> * within a single pair of inline functions, which each compile to</span>
<a name="l00062"></a>00062 <span class="comment"> * a single @a add instruction: _Rep::_M_refdata(), and</span>
<a name="l00063"></a>00063 <span class="comment"> * __rc_string_base::_M_rep(); and the allocation function which gets a</span>
<a name="l00064"></a>00064 <span class="comment"> * block of raw bytes and with room enough and constructs a _Rep</span>
<a name="l00065"></a>00065 <span class="comment"> * object at the front.</span>
<a name="l00066"></a>00066 <span class="comment"> *</span>
<a name="l00067"></a>00067 <span class="comment"> * The reason you want _M_data pointing to the character array and</span>
<a name="l00068"></a>00068 <span class="comment"> * not the _Rep is so that the debugger can see the string</span>
<a name="l00069"></a>00069 <span class="comment"> * contents. (Probably we should add a non-inline member to get</span>
<a name="l00070"></a>00070 <span class="comment"> * the _Rep for the debugger to use, so users can check the actual</span>
<a name="l00071"></a>00071 <span class="comment"> * string length.)</span>
<a name="l00072"></a>00072 <span class="comment"> *</span>
<a name="l00073"></a>00073 <span class="comment"> * Note that the _Rep object is a POD so that you can have a</span>
<a name="l00074"></a>00074 <span class="comment"> * static <em>empty string</em> _Rep object already @a constructed before</span>
<a name="l00075"></a>00075 <span class="comment"> * static constructors have run. The reference-count encoding is</span>
<a name="l00076"></a>00076 <span class="comment"> * chosen so that a 0 indicates one reference, so you never try to</span>
<a name="l00077"></a>00077 <span class="comment"> * destroy the empty-string _Rep object.</span>
<a name="l00078"></a>00078 <span class="comment"> *</span>
<a name="l00079"></a>00079 <span class="comment"> * All but the last paragraph is considered pretty conventional</span>
<a name="l00080"></a>00080 <span class="comment"> * for a C++ string implementation.</span>
<a name="l00081"></a>00081 <span class="comment"> */</span>
<a name="l00082"></a>00082 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00083"></a><a class="code" href="a00017.html">00083</a> <span class="keyword">class </span><a class="code" href="a00017.html">__rc_string_base</a>
<a name="l00084"></a>00084 : <span class="keyword">protected</span> __vstring_utility<_CharT, _Traits, _Alloc>
<a name="l00085"></a>00085 {
<a name="l00086"></a>00086 <span class="keyword">public</span>:
<a name="l00087"></a>00087 <span class="keyword">typedef</span> _Traits traits_type;
<a name="l00088"></a>00088 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Traits::char_type value_type;
<a name="l00089"></a>00089 <span class="keyword">typedef</span> _Alloc allocator_type;
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="keyword">typedef</span> __vstring_utility<_CharT, _Traits, _Alloc> _Util_Base;
<a name="l00092"></a>00092 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Util_Base::_CharT_alloc_type _CharT_alloc_type;
<a name="l00093"></a>00093 <span class="keyword">typedef</span> <span class="keyword">typename</span> _CharT_alloc_type::size_type size_type;
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keyword">private</span>:
<a name="l00096"></a>00096 <span class="comment">// _Rep: string representation</span>
<a name="l00097"></a>00097 <span class="comment">// Invariants:</span>
<a name="l00098"></a>00098 <span class="comment">// 1. String really contains _M_length + 1 characters: due to 21.3.4</span>
<a name="l00099"></a>00099 <span class="comment">// must be kept null-terminated.</span>
<a name="l00100"></a>00100 <span class="comment">// 2. _M_capacity >= _M_length</span>
<a name="l00101"></a>00101 <span class="comment">// Allocated memory is always (_M_capacity + 1) * sizeof(_CharT).</span>
<a name="l00102"></a>00102 <span class="comment">// 3. _M_refcount has three states:</span>
<a name="l00103"></a>00103 <span class="comment">// -1: leaked, one reference, no ref-copies allowed, non-const.</span>
<a name="l00104"></a>00104 <span class="comment">// 0: one reference, non-const.</span>
<a name="l00105"></a>00105 <span class="comment">// n>0: n + 1 references, operations require a lock, const.</span>
<a name="l00106"></a>00106 <span class="comment">// 4. All fields == 0 is an empty string, given the extra storage</span>
<a name="l00107"></a>00107 <span class="comment">// beyond-the-end for a null terminator; thus, the shared</span>
<a name="l00108"></a>00108 <span class="comment">// empty string representation needs no constructor.</span>
<a name="l00109"></a>00109 <span class="keyword">struct </span>_Rep
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 <span class="keyword">union</span>
<a name="l00112"></a>00112 {
<a name="l00113"></a>00113 <span class="keyword">struct</span>
<a name="l00114"></a>00114 {
<a name="l00115"></a>00115 size_type _M_length;
<a name="l00116"></a>00116 size_type _M_capacity;
<a name="l00117"></a>00117 _Atomic_word _M_refcount;
<a name="l00118"></a>00118 } _M_info;
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="comment">// Only for alignment purposes.</span>
<a name="l00121"></a>00121 _CharT _M_align;
<a name="l00122"></a>00122 };
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<_Rep>::other _Rep_alloc_type;
<a name="l00125"></a>00125
<a name="l00126"></a>00126 _CharT*
<a name="l00127"></a>00127 _M_refdata() <span class="keywordflow">throw</span>()
<a name="l00128"></a>00128 { <span class="keywordflow">return</span> <span class="keyword">reinterpret_cast<</span>_CharT*<span class="keyword">></span>(<span class="keyword">this</span> + 1); }
<a name="l00129"></a>00129
<a name="l00130"></a>00130 _CharT*
<a name="l00131"></a>00131 _M_refcopy() <span class="keywordflow">throw</span>()
<a name="l00132"></a>00132 {
<a name="l00133"></a>00133 __atomic_add_dispatch(&_M_info._M_refcount, 1);
<a name="l00134"></a>00134 <span class="keywordflow">return</span> _M_refdata();
<a name="l00135"></a>00135 } <span class="comment">// XXX MT</span>
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="keywordtype">void</span>
<a name="l00138"></a>00138 _M_set_length(size_type __n)
<a name="l00139"></a>00139 {
<a name="l00140"></a>00140 _M_info._M_refcount = 0; <span class="comment">// One reference.</span>
<a name="l00141"></a>00141 _M_info._M_length = __n;
<a name="l00142"></a>00142 <span class="comment">// grrr. (per 21.3.4)</span>
<a name="l00143"></a>00143 <span class="comment">// You cannot leave those LWG people alone for a second.</span>
<a name="l00144"></a>00144 traits_type::assign(_M_refdata()[__n], _CharT());
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <span class="comment">// Create & Destroy</span>
<a name="l00148"></a>00148 <span class="keyword">static</span> _Rep*
<a name="l00149"></a>00149 _S_create(size_type, size_type, <span class="keyword">const</span> _Alloc&);
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="keywordtype">void</span>
<a name="l00152"></a>00152 _M_destroy(<span class="keyword">const</span> _Alloc&) <span class="keywordflow">throw</span>();
<a name="l00153"></a>00153
<a name="l00154"></a>00154 _CharT*
<a name="l00155"></a>00155 _M_clone(<span class="keyword">const</span> _Alloc&, size_type __res = 0);
<a name="l00156"></a>00156 };
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keyword">struct </span>_Rep_empty
<a name="l00159"></a>00159 : <span class="keyword">public</span> _Rep
<a name="l00160"></a>00160 {
<a name="l00161"></a>00161 _CharT _M_terminal;
<a name="l00162"></a>00162 };
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keyword">static</span> _Rep_empty _S_empty_rep;
<a name="l00165"></a>00165
<a name="l00166"></a>00166 <span class="comment">// The maximum number of individual char_type elements of an</span>
<a name="l00167"></a>00167 <span class="comment">// individual string is determined by _S_max_size. This is the</span>
<a name="l00168"></a>00168 <span class="comment">// value that will be returned by max_size(). (Whereas npos</span>
<a name="l00169"></a>00169 <span class="comment">// is the maximum number of bytes the allocator can allocate.)</span>
<a name="l00170"></a>00170 <span class="comment">// If one was to divvy up the theoretical largest size string,</span>
<a name="l00171"></a>00171 <span class="comment">// with a terminating character and m _CharT elements, it'd</span>
<a name="l00172"></a>00172 <span class="comment">// look like this:</span>
<a name="l00173"></a>00173 <span class="comment">// npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT)</span>
<a name="l00174"></a>00174 <span class="comment">// + sizeof(_Rep) - 1</span>
<a name="l00175"></a>00175 <span class="comment">// (NB: last two terms for rounding reasons, see _M_create below)</span>
<a name="l00176"></a>00176 <span class="comment">// Solving for m:</span>
<a name="l00177"></a>00177 <span class="comment">// m = ((npos - 2 * sizeof(_Rep) + 1) / sizeof(_CharT)) - 1</span>
<a name="l00178"></a>00178 <span class="comment">// In addition, this implementation halves this amount.</span>
<a name="l00179"></a>00179 <span class="keyword">enum</span> { _S_max_size = (((<span class="keyword">static_cast<</span>size_type<span class="keyword">></span>(-1) - 2 * <span class="keyword">sizeof</span>(_Rep)
<a name="l00180"></a>00180 + 1) / <span class="keyword">sizeof</span>(_CharT)) - 1) / 2 };
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="comment">// Data Member (private):</span>
<a name="l00183"></a>00183 <span class="keyword">mutable</span> <span class="keyword">typename</span> _Util_Base::template _Alloc_hider<_Alloc> _M_dataplus;
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="keywordtype">void</span>
<a name="l00186"></a>00186 _M_data(_CharT* __p)
<a name="l00187"></a>00187 { _M_dataplus._M_p = __p; }
<a name="l00188"></a>00188
<a name="l00189"></a>00189 _Rep*
<a name="l00190"></a>00190 _M_rep()<span class="keyword"> const</span>
<a name="l00191"></a>00191 <span class="keyword"> </span>{ <span class="keywordflow">return</span> &((<span class="keyword">reinterpret_cast<</span>_Rep*<span class="keyword">></span>(_M_data()))[-1]); }
<a name="l00192"></a>00192
<a name="l00193"></a>00193 _CharT*
<a name="l00194"></a>00194 _M_grab(<span class="keyword">const</span> _Alloc& __alloc)<span class="keyword"> const</span>
<a name="l00195"></a>00195 <span class="keyword"> </span>{
<a name="l00196"></a>00196 <span class="keywordflow">return</span> (!_M_is_leaked() && _M_get_allocator() == __alloc)
<a name="l00197"></a>00197 ? _M_rep()->_M_refcopy() : _M_rep()->_M_clone(__alloc);
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <span class="keywordtype">void</span>
<a name="l00201"></a>00201 _M_dispose()
<a name="l00202"></a>00202 {
<a name="l00203"></a>00203 <span class="comment">// Be race-detector-friendly. For more info see bits/c++config.</span>
<a name="l00204"></a>00204 _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&_M_rep()->_M_info.
<a name="l00205"></a>00205 _M_refcount);
<a name="l00206"></a>00206 <span class="keywordflow">if</span> (__exchange_and_add_dispatch(&_M_rep()->_M_info._M_refcount,
<a name="l00207"></a>00207 -1) <= 0)
<a name="l00208"></a>00208 {
<a name="l00209"></a>00209 _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_rep()->_M_info.
<a name="l00210"></a>00210 _M_refcount);
<a name="l00211"></a>00211 _M_rep()->_M_destroy(_M_get_allocator());
<a name="l00212"></a>00212 }
<a name="l00213"></a>00213 } <span class="comment">// XXX MT</span>
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="keywordtype">bool</span>
<a name="l00216"></a>00216 _M_is_leaked()<span class="keyword"> const</span>
<a name="l00217"></a>00217 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_refcount < 0; }
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keywordtype">void</span>
<a name="l00220"></a>00220 _M_set_sharable()
<a name="l00221"></a>00221 { _M_rep()->_M_info._M_refcount = 0; }
<a name="l00222"></a>00222
<a name="l00223"></a>00223 <span class="keywordtype">void</span>
<a name="l00224"></a>00224 _M_leak_hard();
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="comment">// _S_construct_aux is used to implement the 21.3.1 para 15 which</span>
<a name="l00227"></a>00227 <span class="comment">// requires special behaviour if _InIterator is an integral type</span>
<a name="l00228"></a>00228 <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator>
<a name="l00229"></a>00229 <span class="keyword">static</span> _CharT*
<a name="l00230"></a>00230 _S_construct_aux(_InIterator __beg, _InIterator __end,
<a name="l00231"></a>00231 <span class="keyword">const</span> _Alloc& __a, std::__false_type)
<a name="l00232"></a>00232 {
<a name="l00233"></a>00233 <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_InIterator>::iterator_category _Tag;
<a name="l00234"></a>00234 <span class="keywordflow">return</span> _S_construct(__beg, __end, __a, _Tag());
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00238"></a>00238 <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span>
<a name="l00239"></a>00239 <span class="keyword">template</span><<span class="keyword">typename</span> _Integer>
<a name="l00240"></a>00240 <span class="keyword">static</span> _CharT*
<a name="l00241"></a>00241 _S_construct_aux(_Integer __beg, _Integer __end,
<a name="l00242"></a>00242 <span class="keyword">const</span> _Alloc& __a, std::__true_type)
<a name="l00243"></a>00243 { <span class="keywordflow">return</span> _S_construct_aux_2(static_cast<size_type>(__beg),
<a name="l00244"></a>00244 __end, __a); }
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="keyword">static</span> _CharT*
<a name="l00247"></a>00247 _S_construct_aux_2(size_type __req, _CharT __c, <span class="keyword">const</span> _Alloc& __a)
<a name="l00248"></a>00248 { <span class="keywordflow">return</span> _S_construct(__req, __c, __a); }
<a name="l00249"></a>00249
<a name="l00250"></a>00250 <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator>
<a name="l00251"></a>00251 <span class="keyword">static</span> _CharT*
<a name="l00252"></a>00252 _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a)
<a name="l00253"></a>00253 {
<a name="l00254"></a>00254 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InIterator>::__type _Integral;
<a name="l00255"></a>00255 <span class="keywordflow">return</span> _S_construct_aux(__beg, __end, __a, _Integral());
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="comment">// For Input Iterators, used in istreambuf_iterators, etc.</span>
<a name="l00259"></a>00259 <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator>
<a name="l00260"></a>00260 <span class="keyword">static</span> _CharT*
<a name="l00261"></a>00261 _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a,
<a name="l00262"></a>00262 <a class="code" href="a00525.html" title="Marking input iterators.">std::input_iterator_tag</a>);
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="comment">// For forward_iterators up to random_access_iterators, used for</span>
<a name="l00265"></a>00265 <span class="comment">// string::iterator, _CharT*, etc.</span>
<a name="l00266"></a>00266 <span class="keyword">template</span><<span class="keyword">typename</span> _FwdIterator>
<a name="l00267"></a>00267 <span class="keyword">static</span> _CharT*
<a name="l00268"></a>00268 _S_construct(_FwdIterator __beg, _FwdIterator __end, <span class="keyword">const</span> _Alloc& __a,
<a name="l00269"></a>00269 <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a>);
<a name="l00270"></a>00270
<a name="l00271"></a>00271 <span class="keyword">static</span> _CharT*
<a name="l00272"></a>00272 _S_construct(size_type __req, _CharT __c, <span class="keyword">const</span> _Alloc& __a);
<a name="l00273"></a>00273
<a name="l00274"></a>00274 <span class="keyword">public</span>:
<a name="l00275"></a>00275 size_type
<a name="l00276"></a>00276 _M_max_size()<span class="keyword"> const</span>
<a name="l00277"></a>00277 <span class="keyword"> </span>{ <span class="keywordflow">return</span> size_type(_S_max_size); }
<a name="l00278"></a>00278
<a name="l00279"></a>00279 _CharT*
<a name="l00280"></a>00280 _M_data()<span class="keyword"> const</span>
<a name="l00281"></a>00281 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_dataplus._M_p; }
<a name="l00282"></a>00282
<a name="l00283"></a>00283 size_type
<a name="l00284"></a>00284 _M_length()<span class="keyword"> const</span>
<a name="l00285"></a>00285 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_length; }
<a name="l00286"></a>00286
<a name="l00287"></a>00287 size_type
<a name="l00288"></a>00288 _M_capacity()<span class="keyword"> const</span>
<a name="l00289"></a>00289 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_capacity; }
<a name="l00290"></a>00290
<a name="l00291"></a>00291 <span class="keywordtype">bool</span>
<a name="l00292"></a>00292 _M_is_shared()<span class="keyword"> const</span>
<a name="l00293"></a>00293 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_rep()->_M_info._M_refcount > 0; }
<a name="l00294"></a>00294
<a name="l00295"></a>00295 <span class="keywordtype">void</span>
<a name="l00296"></a>00296 _M_set_leaked()
<a name="l00297"></a>00297 { _M_rep()->_M_info._M_refcount = -1; }
<a name="l00298"></a>00298
<a name="l00299"></a>00299 <span class="keywordtype">void</span>
<a name="l00300"></a>00300 _M_leak() <span class="comment">// for use in begin() & non-const op[]</span>
<a name="l00301"></a>00301 {
<a name="l00302"></a>00302 <span class="keywordflow">if</span> (!_M_is_leaked())
<a name="l00303"></a>00303 _M_leak_hard();
<a name="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keywordtype">void</span>
<a name="l00307"></a>00307 _M_set_length(size_type __n)
<a name="l00308"></a>00308 { _M_rep()->_M_set_length(__n); }
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <a class="code" href="a00017.html">__rc_string_base</a>()
<a name="l00311"></a>00311 : _M_dataplus(_S_empty_rep._M_refcopy()) { }
<a name="l00312"></a>00312
<a name="l00313"></a>00313 <a class="code" href="a00017.html">__rc_string_base</a>(<span class="keyword">const</span> _Alloc& __a);
<a name="l00314"></a>00314
<a name="l00315"></a>00315 <a class="code" href="a00017.html">__rc_string_base</a>(<span class="keyword">const</span> <a class="code" href="a00017.html">__rc_string_base</a>& __rcs);
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00318"></a>00318 <span class="preprocessor"></span> <a class="code" href="a00017.html">__rc_string_base</a>(<a class="code" href="a00017.html">__rc_string_base</a>&& __rcs)
<a name="l00319"></a>00319 : _M_dataplus(__rcs._M_dataplus)
<a name="l00320"></a>00320 { __rcs._M_data(_S_empty_rep._M_refcopy()); }
<a name="l00321"></a>00321 <span class="preprocessor">#endif</span>
<a name="l00322"></a>00322 <span class="preprocessor"></span>
<a name="l00323"></a>00323 <a class="code" href="a00017.html">__rc_string_base</a>(size_type __n, _CharT __c, <span class="keyword">const</span> _Alloc& __a);
<a name="l00324"></a>00324
<a name="l00325"></a>00325 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00326"></a>00326 <a class="code" href="a00017.html">__rc_string_base</a>(_InputIterator __beg, _InputIterator __end,
<a name="l00327"></a>00327 <span class="keyword">const</span> _Alloc& __a);
<a name="l00328"></a>00328
<a name="l00329"></a>00329 ~<a class="code" href="a00017.html">__rc_string_base</a>()
<a name="l00330"></a>00330 { _M_dispose(); }
<a name="l00331"></a>00331
<a name="l00332"></a>00332 allocator_type&
<a name="l00333"></a>00333 _M_get_allocator()
<a name="l00334"></a>00334 { <span class="keywordflow">return</span> _M_dataplus; }
<a name="l00335"></a>00335
<a name="l00336"></a>00336 <span class="keyword">const</span> allocator_type&
<a name="l00337"></a>00337 _M_get_allocator()<span class="keyword"> const</span>
<a name="l00338"></a>00338 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_dataplus; }
<a name="l00339"></a>00339
<a name="l00340"></a>00340 <span class="keywordtype">void</span>
<a name="l00341"></a>00341 _M_swap(<a class="code" href="a00017.html">__rc_string_base</a>& __rcs);
<a name="l00342"></a>00342
<a name="l00343"></a>00343 <span class="keywordtype">void</span>
<a name="l00344"></a>00344 _M_assign(<span class="keyword">const</span> <a class="code" href="a00017.html">__rc_string_base</a>& __rcs);
<a name="l00345"></a>00345
<a name="l00346"></a>00346 <span class="keywordtype">void</span>
<a name="l00347"></a>00347 _M_reserve(size_type __res);
<a name="l00348"></a>00348
<a name="l00349"></a>00349 <span class="keywordtype">void</span>
<a name="l00350"></a>00350 _M_mutate(size_type __pos, size_type __len1, <span class="keyword">const</span> _CharT* __s,
<a name="l00351"></a>00351 size_type __len2);
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <span class="keywordtype">void</span>
<a name="l00354"></a>00354 _M_erase(size_type __pos, size_type __n);
<a name="l00355"></a>00355
<a name="l00356"></a>00356 <span class="keywordtype">void</span>
<a name="l00357"></a>00357 _M_clear()
<a name="l00358"></a>00358 { _M_erase(size_type(0), _M_length()); }
<a name="l00359"></a>00359
<a name="l00360"></a>00360 <span class="keywordtype">bool</span>
<a name="l00361"></a>00361 _M_compare(<span class="keyword">const</span> <a class="code" href="a00017.html">__rc_string_base</a>&)<span class="keyword"> const</span>
<a name="l00362"></a>00362 <span class="keyword"> </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }
<a name="l00363"></a>00363 };
<a name="l00364"></a>00364
<a name="l00365"></a>00365 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00366"></a>00366 <span class="keyword">typename</span> <a class="code" href="a00017.html">__rc_string_base<_CharT, _Traits, _Alloc>::_Rep_empty</a>
<a name="l00367"></a>00367 <a class="code" href="a00017.html">__rc_string_base<_CharT, _Traits, _Alloc>::_S_empty_rep</a>;
<a name="l00368"></a>00368
<a name="l00369"></a>00369 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00370"></a>00370 <span class="keyword">typename</span> <a class="code" href="a00017.html">__rc_string_base<_CharT, _Traits, _Alloc>::_Rep</a>*
<a name="l00371"></a>00371 <a class="code" href="a00017.html">__rc_string_base<_CharT, _Traits, _Alloc>::_Rep::</a>
<a name="l00372"></a>00372 <a class="code" href="a00017.html"> _S_create</a>(size_type __capacity, size_type __old_capacity,
<a name="l00373"></a>00373 <span class="keyword">const</span> _Alloc& __alloc)
<a name="l00374"></a>00374 {
<a name="l00375"></a>00375 <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00376"></a>00376 <span class="comment">// 83. String::npos vs. string::max_size()</span>
<a name="l00377"></a>00377 <span class="keywordflow">if</span> (__capacity > size_type(_S_max_size))
<a name="l00378"></a>00378 std::__throw_length_error(__N(<span class="stringliteral">"__rc_string_base::_Rep::_S_create"</span>));
<a name="l00379"></a>00379
<a name="l00380"></a>00380 <span class="comment">// The standard places no restriction on allocating more memory</span>
<a name="l00381"></a>00381 <span class="comment">// than is strictly needed within this layer at the moment or as</span>
<a name="l00382"></a>00382 <span class="comment">// requested by an explicit application call to reserve().</span>
<a name="l00383"></a>00383
<a name="l00384"></a>00384 <span class="comment">// Many malloc implementations perform quite poorly when an</span>
<a name="l00385"></a>00385 <span class="comment">// application attempts to allocate memory in a stepwise fashion</span>
<a name="l00386"></a>00386 <span class="comment">// growing each allocation size by only 1 char. Additionally,</span>
<a name="l00387"></a>00387 <span class="comment">// it makes little sense to allocate less linear memory than the</span>
<a name="l00388"></a>00388 <span class="comment">// natural blocking size of the malloc implementation.</span>
<a name="l00389"></a>00389 <span class="comment">// Unfortunately, we would need a somewhat low-level calculation</span>
<a name="l00390"></a>00390 <span class="comment">// with tuned parameters to get this perfect for any particular</span>
<a name="l00391"></a>00391 <span class="comment">// malloc implementation. Fortunately, generalizations about</span>
<a name="l00392"></a>00392 <span class="comment">// common features seen among implementations seems to suffice.</span>
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="comment">// __pagesize need not match the actual VM page size for good</span>
<a name="l00395"></a>00395 <span class="comment">// results in practice, thus we pick a common value on the low</span>
<a name="l00396"></a>00396 <span class="comment">// side. __malloc_header_size is an estimate of the amount of</span>
<a name="l00397"></a>00397 <span class="comment">// overhead per memory allocation (in practice seen N * sizeof</span>
<a name="l00398"></a>00398 <span class="comment">// (void*) where N is 0, 2 or 4). According to folklore,</span>
<a name="l00399"></a>00399 <span class="comment">// picking this value on the high side is better than</span>
<a name="l00400"></a>00400 <span class="comment">// low-balling it (especially when this algorithm is used with</span>
<a name="l00401"></a>00401 <span class="comment">// malloc implementations that allocate memory blocks rounded up</span>
<a name="l00402"></a>00402 <span class="comment">// to a size which is a power of 2).</span>
<a name="l00403"></a>00403 <span class="keyword">const</span> size_type __pagesize = 4096;
<a name="l00404"></a>00404 <span class="keyword">const</span> size_type __malloc_header_size = 4 * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*);
<a name="l00405"></a>00405
<a name="l00406"></a>00406 <span class="comment">// The below implements an exponential growth policy, necessary to</span>
<a name="l00407"></a>00407 <span class="comment">// meet amortized linear time requirements of the library: see</span>
<a name="l00408"></a>00408 <span class="comment">// http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html.</span>
<a name="l00409"></a>00409 <span class="keywordflow">if</span> (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
<a name="l00410"></a>00410 {
<a name="l00411"></a>00411 __capacity = 2 * __old_capacity;
<a name="l00412"></a>00412 <span class="comment">// Never allocate a string bigger than _S_max_size.</span>
<a name="l00413"></a>00413 <span class="keywordflow">if</span> (__capacity > size_type(_S_max_size))
<a name="l00414"></a>00414 __capacity = size_type(_S_max_size);
<a name="l00415"></a>00415 }
<a name="l00416"></a>00416
<a name="l00417"></a>00417 <span class="comment">// NB: Need an array of char_type[__capacity], plus a terminating</span>
<a name="l00418"></a>00418 <span class="comment">// null char_type() element, plus enough for the _Rep data structure,</span>
<a name="l00419"></a>00419 <span class="comment">// plus sizeof(_Rep) - 1 to upper round to a size multiple of</span>
<a name="l00420"></a>00420 <span class="comment">// sizeof(_Rep).</span>
<a name="l00421"></a>00421 <span class="comment">// Whew. Seemingly so needy, yet so elemental.</span>
<a name="l00422"></a>00422 size_type __size = ((__capacity + 1) * <span class="keyword">sizeof</span>(_CharT)
<a name="l00423"></a>00423 + 2 * <span class="keyword">sizeof</span>(_Rep) - 1);
<a name="l00424"></a>00424
<a name="l00425"></a>00425 <span class="keyword">const</span> size_type __adj_size = __size + __malloc_header_size;
<a name="l00426"></a>00426 <span class="keywordflow">if</span> (__adj_size > __pagesize && __capacity > __old_capacity)
<a name="l00427"></a>00427 {
<a name="l00428"></a>00428 <span class="keyword">const</span> size_type __extra = __pagesize - __adj_size % __pagesize;
<a name="l00429"></a>00429 __capacity += __extra / <span class="keyword">sizeof</span>(_CharT);
<a name="l00430"></a>00430 <span class="keywordflow">if</span> (__capacity > size_type(_S_max_size))
<a name="l00431"></a>00431 __capacity = size_type(_S_max_size);
<a name="l00432"></a>00432 __size = (__capacity + 1) * <span class="keyword">sizeof</span>(_CharT) + 2 * <span class="keyword">sizeof</span>(_Rep) - 1;
<a name="l00433"></a>00433 }
<a name="l00434"></a>00434
<a name="l00435"></a>00435 <span class="comment">// NB: Might throw, but no worries about a leak, mate: _Rep()</span>
<a name="l00436"></a>00436 <span class="comment">// does not throw.</span>
<a name="l00437"></a>00437 _Rep* __place = _Rep_alloc_type(__alloc).allocate(__size / <span class="keyword">sizeof</span>(_Rep));
<a name="l00438"></a>00438 _Rep* __p = <span class="keyword">new</span> (__place) _Rep;
<a name="l00439"></a>00439 __p->_M_info._M_capacity = __capacity;
<a name="l00440"></a>00440 <span class="keywordflow">return</span> __p;
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442
<a name="l00443"></a>00443 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00444"></a>00444 <span class="keywordtype">void</span>
<a name="l00445"></a>00445 __rc_string_base<_CharT, _Traits, _Alloc>::_Rep::
<a name="l00446"></a>00446 _M_destroy(<span class="keyword">const</span> _Alloc& __a) <span class="keywordflow">throw</span> ()
<a name="l00447"></a>00447 {
<a name="l00448"></a>00448 <span class="keyword">const</span> size_type __size = ((_M_info._M_capacity + 1) * <span class="keyword">sizeof</span>(_CharT)
<a name="l00449"></a>00449 + 2 * <span class="keyword">sizeof</span>(_Rep) - 1);
<a name="l00450"></a>00450 _Rep_alloc_type(__a).deallocate(<span class="keyword">this</span>, __size / <span class="keyword">sizeof</span>(_Rep));
<a name="l00451"></a>00451 }
<a name="l00452"></a>00452
<a name="l00453"></a>00453 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00454"></a>00454 _CharT*
<a name="l00455"></a>00455 __rc_string_base<_CharT, _Traits, _Alloc>::_Rep::
<a name="l00456"></a>00456 _M_clone(<span class="keyword">const</span> _Alloc& __alloc, size_type __res)
<a name="l00457"></a>00457 {
<a name="l00458"></a>00458 <span class="comment">// Requested capacity of the clone.</span>
<a name="l00459"></a>00459 <span class="keyword">const</span> size_type __requested_cap = _M_info._M_length + __res;
<a name="l00460"></a>00460 _Rep* __r = _Rep::_S_create(__requested_cap, _M_info._M_capacity,
<a name="l00461"></a>00461 __alloc);
<a name="l00462"></a>00462
<a name="l00463"></a>00463 <span class="keywordflow">if</span> (_M_info._M_length)
<a name="l00464"></a>00464 _S_copy(__r->_M_refdata(), _M_refdata(), _M_info._M_length);
<a name="l00465"></a>00465
<a name="l00466"></a>00466 __r->_M_set_length(_M_info._M_length);
<a name="l00467"></a>00467 <span class="keywordflow">return</span> __r->_M_refdata();
<a name="l00468"></a>00468 }
<a name="l00469"></a>00469
<a name="l00470"></a>00470 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00471"></a>00471 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00472"></a>00472 __rc_string_base(<span class="keyword">const</span> _Alloc& __a)
<a name="l00473"></a>00473 : _M_dataplus(__a, _S_construct(size_type(), _CharT(), __a)) { }
<a name="l00474"></a>00474
<a name="l00475"></a>00475 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00476"></a>00476 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00477"></a>00477 __rc_string_base(<span class="keyword">const</span> __rc_string_base& __rcs)
<a name="l00478"></a>00478 : _M_dataplus(__rcs._M_get_allocator(),
<a name="l00479"></a>00479 __rcs._M_grab(__rcs._M_get_allocator())) { }
<a name="l00480"></a>00480
<a name="l00481"></a>00481 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00482"></a>00482 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00483"></a>00483 __rc_string_base(size_type __n, _CharT __c, <span class="keyword">const</span> _Alloc& __a)
<a name="l00484"></a>00484 : _M_dataplus(__a, _S_construct(__n, __c, __a)) { }
<a name="l00485"></a>00485
<a name="l00486"></a>00486 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00487"></a>00487 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00488"></a>00488 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00489"></a>00489 __rc_string_base(_InputIterator __beg, _InputIterator __end,
<a name="l00490"></a>00490 <span class="keyword">const</span> _Alloc& __a)
<a name="l00491"></a>00491 : _M_dataplus(__a, _S_construct(__beg, __end, __a)) { }
<a name="l00492"></a>00492
<a name="l00493"></a>00493 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00494"></a>00494 <span class="keywordtype">void</span>
<a name="l00495"></a>00495 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00496"></a>00496 _M_leak_hard()
<a name="l00497"></a>00497 {
<a name="l00498"></a>00498 <span class="keywordflow">if</span> (_M_is_shared())
<a name="l00499"></a>00499 _M_erase(0, 0);
<a name="l00500"></a>00500 _M_set_leaked();
<a name="l00501"></a>00501 }
<a name="l00502"></a>00502
<a name="l00503"></a>00503 <span class="comment">// NB: This is the special case for Input Iterators, used in</span>
<a name="l00504"></a>00504 <span class="comment">// istreambuf_iterators, etc.</span>
<a name="l00505"></a>00505 <span class="comment">// Input Iterators have a cost structure very different from</span>
<a name="l00506"></a>00506 <span class="comment">// pointers, calling for a different coding style.</span>
<a name="l00507"></a>00507 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00508"></a>00508 <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator>
<a name="l00509"></a>00509 _CharT*
<a name="l00510"></a>00510 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00511"></a>00511 _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a,
<a name="l00512"></a>00512 <a class="code" href="a00525.html" title="Marking input iterators.">std::input_iterator_tag</a>)
<a name="l00513"></a>00513 {
<a name="l00514"></a>00514 <span class="keywordflow">if</span> (__beg == __end && __a == _Alloc())
<a name="l00515"></a>00515 <span class="keywordflow">return</span> _S_empty_rep._M_refcopy();
<a name="l00516"></a>00516
<a name="l00517"></a>00517 <span class="comment">// Avoid reallocation for common case.</span>
<a name="l00518"></a>00518 _CharT __buf[128];
<a name="l00519"></a>00519 size_type __len = 0;
<a name="l00520"></a>00520 <span class="keywordflow">while</span> (__beg != __end && __len < <span class="keyword">sizeof</span>(__buf) / <span class="keyword">sizeof</span>(_CharT))
<a name="l00521"></a>00521 {
<a name="l00522"></a>00522 __buf[__len++] = *__beg;
<a name="l00523"></a>00523 ++__beg;
<a name="l00524"></a>00524 }
<a name="l00525"></a>00525 _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
<a name="l00526"></a>00526 _S_copy(__r->_M_refdata(), __buf, __len);
<a name="l00527"></a>00527 __try
<a name="l00528"></a>00528 {
<a name="l00529"></a>00529 <span class="keywordflow">while</span> (__beg != __end)
<a name="l00530"></a>00530 {
<a name="l00531"></a>00531 <span class="keywordflow">if</span> (__len == __r->_M_info._M_capacity)
<a name="l00532"></a>00532 {
<a name="l00533"></a>00533 <span class="comment">// Allocate more space.</span>
<a name="l00534"></a>00534 _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
<a name="l00535"></a>00535 _S_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
<a name="l00536"></a>00536 __r->_M_destroy(__a);
<a name="l00537"></a>00537 __r = __another;
<a name="l00538"></a>00538 }
<a name="l00539"></a>00539 __r->_M_refdata()[__len++] = *__beg;
<a name="l00540"></a>00540 ++__beg;
<a name="l00541"></a>00541 }
<a name="l00542"></a>00542 }
<a name="l00543"></a>00543 __catch(...)
<a name="l00544"></a>00544 {
<a name="l00545"></a>00545 __r->_M_destroy(__a);
<a name="l00546"></a>00546 __throw_exception_again;
<a name="l00547"></a>00547 }
<a name="l00548"></a>00548 __r->_M_set_length(__len);
<a name="l00549"></a>00549 <span class="keywordflow">return</span> __r->_M_refdata();
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551
<a name="l00552"></a>00552 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00553"></a>00553 <span class="keyword">template</span><<span class="keyword">typename</span> _InIterator>
<a name="l00554"></a>00554 _CharT*
<a name="l00555"></a>00555 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00556"></a>00556 _S_construct(_InIterator __beg, _InIterator __end, <span class="keyword">const</span> _Alloc& __a,
<a name="l00557"></a>00557 <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a>)
<a name="l00558"></a>00558 {
<a name="l00559"></a>00559 <span class="keywordflow">if</span> (__beg == __end && __a == _Alloc())
<a name="l00560"></a>00560 <span class="keywordflow">return</span> _S_empty_rep._M_refcopy();
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="comment">// NB: Not required, but considered best practice.</span>
<a name="l00563"></a>00563 <span class="keywordflow">if</span> (__is_null_pointer(__beg) && __beg != __end)
<a name="l00564"></a>00564 std::__throw_logic_error(__N(<span class="stringliteral">"__rc_string_base::"</span>
<a name="l00565"></a>00565 <span class="stringliteral">"_S_construct null not valid"</span>));
<a name="l00566"></a>00566
<a name="l00567"></a>00567 <span class="keyword">const</span> size_type __dnew = <span class="keyword">static_cast<</span>size_type<span class="keyword">></span>(<a class="code" href="a01157.html#ga0cdb1b8e35620aaaaf4b65f19b8bd4c8">std::distance</a>(__beg,
<a name="l00568"></a>00568 __end));
<a name="l00569"></a>00569 <span class="comment">// Check for out_of_range and length_error exceptions.</span>
<a name="l00570"></a>00570 _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);
<a name="l00571"></a>00571 __try
<a name="l00572"></a>00572 { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
<a name="l00573"></a>00573 __catch(...)
<a name="l00574"></a>00574 {
<a name="l00575"></a>00575 __r->_M_destroy(__a);
<a name="l00576"></a>00576 __throw_exception_again;
<a name="l00577"></a>00577 }
<a name="l00578"></a>00578 __r->_M_set_length(__dnew);
<a name="l00579"></a>00579 <span class="keywordflow">return</span> __r->_M_refdata();
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00583"></a>00583 _CharT*
<a name="l00584"></a>00584 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00585"></a>00585 _S_construct(size_type __n, _CharT __c, <span class="keyword">const</span> _Alloc& __a)
<a name="l00586"></a>00586 {
<a name="l00587"></a>00587 <span class="keywordflow">if</span> (__n == 0 && __a == _Alloc())
<a name="l00588"></a>00588 <span class="keywordflow">return</span> _S_empty_rep._M_refcopy();
<a name="l00589"></a>00589
<a name="l00590"></a>00590 <span class="comment">// Check for out_of_range and length_error exceptions.</span>
<a name="l00591"></a>00591 _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
<a name="l00592"></a>00592 <span class="keywordflow">if</span> (__n)
<a name="l00593"></a>00593 _S_assign(__r->_M_refdata(), __n, __c);
<a name="l00594"></a>00594
<a name="l00595"></a>00595 __r->_M_set_length(__n);
<a name="l00596"></a>00596 <span class="keywordflow">return</span> __r->_M_refdata();
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598
<a name="l00599"></a>00599 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00600"></a>00600 <span class="keywordtype">void</span>
<a name="l00601"></a>00601 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00602"></a>00602 _M_swap(__rc_string_base& __rcs)
<a name="l00603"></a>00603 {
<a name="l00604"></a>00604 <span class="keywordflow">if</span> (_M_is_leaked())
<a name="l00605"></a>00605 _M_set_sharable();
<a name="l00606"></a>00606 <span class="keywordflow">if</span> (__rcs._M_is_leaked())
<a name="l00607"></a>00607 __rcs._M_set_sharable();
<a name="l00608"></a>00608
<a name="l00609"></a>00609 _CharT* __tmp = _M_data();
<a name="l00610"></a>00610 _M_data(__rcs._M_data());
<a name="l00611"></a>00611 __rcs._M_data(__tmp);
<a name="l00612"></a>00612
<a name="l00613"></a>00613 <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00614"></a>00614 <span class="comment">// 431. Swapping containers with unequal allocators.</span>
<a name="l00615"></a>00615 std::__alloc_swap<allocator_type>::_S_do_it(_M_get_allocator(),
<a name="l00616"></a>00616 __rcs._M_get_allocator());
<a name="l00617"></a>00617 }
<a name="l00618"></a>00618
<a name="l00619"></a>00619 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00620"></a>00620 <span class="keywordtype">void</span>
<a name="l00621"></a>00621 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00622"></a>00622 _M_assign(<span class="keyword">const</span> __rc_string_base& __rcs)
<a name="l00623"></a>00623 {
<a name="l00624"></a>00624 <span class="keywordflow">if</span> (_M_rep() != __rcs._M_rep())
<a name="l00625"></a>00625 {
<a name="l00626"></a>00626 _CharT* __tmp = __rcs._M_grab(_M_get_allocator());
<a name="l00627"></a>00627 _M_dispose();
<a name="l00628"></a>00628 _M_data(__tmp);
<a name="l00629"></a>00629 }
<a name="l00630"></a>00630 }
<a name="l00631"></a>00631
<a name="l00632"></a>00632 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00633"></a>00633 <span class="keywordtype">void</span>
<a name="l00634"></a>00634 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00635"></a>00635 _M_reserve(size_type __res)
<a name="l00636"></a>00636 {
<a name="l00637"></a>00637 <span class="comment">// Make sure we don't shrink below the current size.</span>
<a name="l00638"></a>00638 <span class="keywordflow">if</span> (__res < _M_length())
<a name="l00639"></a>00639 __res = _M_length();
<a name="l00640"></a>00640
<a name="l00641"></a>00641 <span class="keywordflow">if</span> (__res != _M_capacity() || _M_is_shared())
<a name="l00642"></a>00642 {
<a name="l00643"></a>00643 _CharT* __tmp = _M_rep()->_M_clone(_M_get_allocator(),
<a name="l00644"></a>00644 __res - _M_length());
<a name="l00645"></a>00645 _M_dispose();
<a name="l00646"></a>00646 _M_data(__tmp);
<a name="l00647"></a>00647 }
<a name="l00648"></a>00648 }
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00651"></a>00651 <span class="keywordtype">void</span>
<a name="l00652"></a>00652 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00653"></a>00653 _M_mutate(size_type __pos, size_type __len1, <span class="keyword">const</span> _CharT* __s,
<a name="l00654"></a>00654 size_type __len2)
<a name="l00655"></a>00655 {
<a name="l00656"></a>00656 <span class="keyword">const</span> size_type __how_much = _M_length() - __pos - __len1;
<a name="l00657"></a>00657
<a name="l00658"></a>00658 _Rep* __r = _Rep::_S_create(_M_length() + __len2 - __len1,
<a name="l00659"></a>00659 _M_capacity(), _M_get_allocator());
<a name="l00660"></a>00660
<a name="l00661"></a>00661 <span class="keywordflow">if</span> (__pos)
<a name="l00662"></a>00662 _S_copy(__r->_M_refdata(), _M_data(), __pos);
<a name="l00663"></a>00663 <span class="keywordflow">if</span> (__s && __len2)
<a name="l00664"></a>00664 _S_copy(__r->_M_refdata() + __pos, __s, __len2);
<a name="l00665"></a>00665 <span class="keywordflow">if</span> (__how_much)
<a name="l00666"></a>00666 _S_copy(__r->_M_refdata() + __pos + __len2,
<a name="l00667"></a>00667 _M_data() + __pos + __len1, __how_much);
<a name="l00668"></a>00668
<a name="l00669"></a>00669 _M_dispose();
<a name="l00670"></a>00670 _M_data(__r->_M_refdata());
<a name="l00671"></a>00671 }
<a name="l00672"></a>00672
<a name="l00673"></a>00673 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Alloc>
<a name="l00674"></a>00674 <span class="keywordtype">void</span>
<a name="l00675"></a>00675 __rc_string_base<_CharT, _Traits, _Alloc>::
<a name="l00676"></a>00676 _M_erase(size_type __pos, size_type __n)
<a name="l00677"></a>00677 {
<a name="l00678"></a>00678 <span class="keyword">const</span> size_type __new_size = _M_length() - __n;
<a name="l00679"></a>00679 <span class="keyword">const</span> size_type __how_much = _M_length() - __pos - __n;
<a name="l00680"></a>00680
<a name="l00681"></a>00681 <span class="keywordflow">if</span> (_M_is_shared())
<a name="l00682"></a>00682 {
<a name="l00683"></a>00683 <span class="comment">// Must reallocate.</span>
<a name="l00684"></a>00684 _Rep* __r = _Rep::_S_create(__new_size, _M_capacity(),
<a name="l00685"></a>00685 _M_get_allocator());
<a name="l00686"></a>00686
<a name="l00687"></a>00687 <span class="keywordflow">if</span> (__pos)
<a name="l00688"></a>00688 _S_copy(__r->_M_refdata(), _M_data(), __pos);
<a name="l00689"></a>00689 <span class="keywordflow">if</span> (__how_much)
<a name="l00690"></a>00690 _S_copy(__r->_M_refdata() + __pos,
<a name="l00691"></a>00691 _M_data() + __pos + __n, __how_much);
<a name="l00692"></a>00692
<a name="l00693"></a>00693 _M_dispose();
<a name="l00694"></a>00694 _M_data(__r->_M_refdata());
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__how_much && __n)
<a name="l00697"></a>00697 {
<a name="l00698"></a>00698 <span class="comment">// Work in-place.</span>
<a name="l00699"></a>00699 _S_move(_M_data() + __pos,
<a name="l00700"></a>00700 _M_data() + __pos + __n, __how_much);
<a name="l00701"></a>00701 }
<a name="l00702"></a>00702
<a name="l00703"></a>00703 _M_rep()->_M_set_length(__new_size);
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705
<a name="l00706"></a>00706 <span class="keyword">template</span><>
<a name="l00707"></a>00707 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00708"></a>00708 __rc_string_base<char, std::char_traits<char>,
<a name="l00709"></a>00709 <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<char></a> >::
<a name="l00710"></a>00710 _M_compare(<span class="keyword">const</span> __rc_string_base& __rcs) <span class="keyword">const</span>
<a name="l00711"></a>00711 {
<a name="l00712"></a>00712 <span class="keywordflow">if</span> (_M_rep() == __rcs._M_rep())
<a name="l00713"></a>00713 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00714"></a>00714 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00715"></a>00715 }
<a name="l00716"></a>00716
<a name="l00717"></a>00717 <span class="preprocessor">#ifdef _GLIBCXX_USE_WCHAR_T</span>
<a name="l00718"></a>00718 <span class="preprocessor"></span> <span class="keyword">template</span><>
<a name="l00719"></a>00719 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00720"></a>00720 __rc_string_base<wchar_t, std::char_traits<wchar_t>,
<a name="l00721"></a>00721 <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<wchar_t></a> >::
<a name="l00722"></a>00722 _M_compare(<span class="keyword">const</span> __rc_string_base& __rcs) <span class="keyword">const</span>
<a name="l00723"></a>00723 {
<a name="l00724"></a>00724 <span class="keywordflow">if</span> (_M_rep() == __rcs._M_rep())
<a name="l00725"></a>00725 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00726"></a>00726 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00727"></a>00727 }
<a name="l00728"></a>00728 <span class="preprocessor">#endif</span>
<a name="l00729"></a>00729 <span class="preprocessor"></span>
<a name="l00730"></a>00730 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00731"></a>00731 } <span class="comment">// namespace</span>
<a name="l00732"></a>00732
<a name="l00733"></a>00733 <span class="preprocessor">#endif </span><span class="comment">/* _RC_STRING_BASE_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a01004.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.7.4 </li>
</ul>
</div>
</body>
</html>
