<!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++: vector.tcc 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('a01117.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">vector.tcc</div> </div>
</div>
<div class="contents">
<a href="a01117.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Vector implementation (out of line) -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,</span>
<a name="l00004"></a>00004 <span class="comment">// 2011 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
<a name="l00026"></a>00026 <span class="comment">/*</span>
<a name="l00027"></a>00027 <span class="comment"> *</span>
<a name="l00028"></a>00028 <span class="comment"> * Copyright (c) 1994</span>
<a name="l00029"></a>00029 <span class="comment"> * Hewlett-Packard Company</span>
<a name="l00030"></a>00030 <span class="comment"> *</span>
<a name="l00031"></a>00031 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span>
<a name="l00032"></a>00032 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span>
<a name="l00033"></a>00033 <span class="comment"> * provided that the above copyright notice appear in all copies and</span>
<a name="l00034"></a>00034 <span class="comment"> * that both that copyright notice and this permission notice appear</span>
<a name="l00035"></a>00035 <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span>
<a name="l00036"></a>00036 <span class="comment"> * representations about the suitability of this software for any</span>
<a name="l00037"></a>00037 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span>
<a name="l00038"></a>00038 <span class="comment"> *</span>
<a name="l00039"></a>00039 <span class="comment"> *</span>
<a name="l00040"></a>00040 <span class="comment"> * Copyright (c) 1996</span>
<a name="l00041"></a>00041 <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span>
<a name="l00042"></a>00042 <span class="comment"> *</span>
<a name="l00043"></a>00043 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span>
<a name="l00044"></a>00044 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span>
<a name="l00045"></a>00045 <span class="comment"> * provided that the above copyright notice appear in all copies and</span>
<a name="l00046"></a>00046 <span class="comment"> * that both that copyright notice and this permission notice appear</span>
<a name="l00047"></a>00047 <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span>
<a name="l00048"></a>00048 <span class="comment"> * representations about the suitability of this software for any</span>
<a name="l00049"></a>00049 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span>
<a name="l00050"></a>00050 <span class="comment"> */</span>
<a name="l00051"></a>00051 <span class="comment"></span>
<a name="l00052"></a>00052 <span class="comment">/** @file bits/vector.tcc</span>
<a name="l00053"></a>00053 <span class="comment"> * This is an internal header file, included by other library headers.</span>
<a name="l00054"></a>00054 <span class="comment"> * Do not attempt to use it directly. @headername{vector}</span>
<a name="l00055"></a>00055 <span class="comment"> */</span>
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="preprocessor">#ifndef _VECTOR_TCC</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define _VECTOR_TCC 1</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span>
<a name="l00060"></a>00060 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00061"></a>00061 {
<a name="l00062"></a>00062 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00065"></a>00065 <span class="keywordtype">void</span>
<a name="l00066"></a>00066 <a class="code" href="a00739.html#a8ab62036345a72d8126fa30425dfe869" title="Attempt to preallocate enough memory for specified number of elements.">vector<_Tp, _Alloc>::</a>
<a name="l00067"></a><a class="code" href="a00739.html#a8ab62036345a72d8126fa30425dfe869">00067</a> <a class="code" href="a00739.html#a8ab62036345a72d8126fa30425dfe869" title="Attempt to preallocate enough memory for specified number of elements."> reserve</a>(size_type __n)
<a name="l00068"></a>00068 {
<a name="l00069"></a>00069 <span class="keywordflow">if</span> (__n > this->max_size())
<a name="l00070"></a>00070 __throw_length_error(__N(<span class="stringliteral">"vector::reserve"</span>));
<a name="l00071"></a>00071 <span class="keywordflow">if</span> (this->capacity() < __n)
<a name="l00072"></a>00072 {
<a name="l00073"></a>00073 <span class="keyword">const</span> size_type __old_size = <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>();
<a name="l00074"></a>00074 pointer __tmp = _M_allocate_and_copy(__n,
<a name="l00075"></a>00075 _GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_start),
<a name="l00076"></a>00076 _GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_finish));
<a name="l00077"></a>00077 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00078"></a>00078 _M_get_Tp_allocator());
<a name="l00079"></a>00079 _M_deallocate(this->_M_impl._M_start,
<a name="l00080"></a>00080 this->_M_impl._M_end_of_storage
<a name="l00081"></a>00081 - this->_M_impl._M_start);
<a name="l00082"></a>00082 this->_M_impl._M_start = __tmp;
<a name="l00083"></a>00083 this->_M_impl._M_finish = __tmp + __old_size;
<a name="l00084"></a>00084 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
<a name="l00085"></a>00085 }
<a name="l00086"></a>00086 }
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00089"></a>00089 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00090"></a>00090 <span class="keyword">template</span><<span class="keyword">typename</span>... _Args>
<a name="l00091"></a>00091 <span class="keywordtype">void</span>
<a name="l00092"></a>00092 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector<_Tp, _Alloc>::</a>
<a name="l00093"></a>00093 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order..."> emplace_back</a>(_Args&&... __args)
<a name="l00094"></a>00094 {
<a name="l00095"></a>00095 <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
<a name="l00096"></a>00096 {
<a name="l00097"></a>00097 this->_M_impl.construct(this->_M_impl._M_finish,
<a name="l00098"></a>00098 std::forward<_Args>(__args)...);
<a name="l00099"></a>00099 ++this->_M_impl._M_finish;
<a name="l00100"></a>00100 }
<a name="l00101"></a>00101 <span class="keywordflow">else</span>
<a name="l00102"></a>00102 _M_insert_aux(<a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), std::forward<_Args>(__args)...);
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104 <span class="preprocessor">#endif</span>
<a name="l00105"></a>00105 <span class="preprocessor"></span>
<a name="l00106"></a>00106 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00107"></a>00107 <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator
<a name="l00108"></a>00108 <a class="code" href="a00739.html#a53d2a978afcbb3fdf5276a95e323842b" title="Inserts given value into vector before specified iterator.">vector<_Tp, _Alloc>::</a>
<a name="l00109"></a><a class="code" href="a00739.html#a53d2a978afcbb3fdf5276a95e323842b">00109</a> <a class="code" href="a00739.html#a53d2a978afcbb3fdf5276a95e323842b" title="Inserts given value into vector before specified iterator."> insert</a>(iterator __position, <span class="keyword">const</span> value_type& __x)
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 <span class="keyword">const</span> size_type __n = __position - <a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>();
<a name="l00112"></a>00112 <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage
<a name="l00113"></a>00113 && __position == <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>())
<a name="l00114"></a>00114 {
<a name="l00115"></a>00115 this->_M_impl.construct(this->_M_impl._M_finish, __x);
<a name="l00116"></a>00116 ++this->_M_impl._M_finish;
<a name="l00117"></a>00117 }
<a name="l00118"></a>00118 <span class="keywordflow">else</span>
<a name="l00119"></a>00119 {
<a name="l00120"></a>00120 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00121"></a>00121 <span class="preprocessor"></span> <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 _Tp __x_copy = __x;
<a name="l00124"></a>00124 _M_insert_aux(__position, std::move(__x_copy));
<a name="l00125"></a>00125 }
<a name="l00126"></a>00126 <span class="keywordflow">else</span>
<a name="l00127"></a>00127 <span class="preprocessor">#endif</span>
<a name="l00128"></a>00128 <span class="preprocessor"></span> _M_insert_aux(__position, __x);
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130 <span class="keywordflow">return</span> iterator(this->_M_impl._M_start + __n);
<a name="l00131"></a>00131 }
<a name="l00132"></a>00132
<a name="l00133"></a>00133 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00134"></a>00134 <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator
<a name="l00135"></a>00135 <a class="code" href="a00739.html#a161093a193b38c249c70f2ea35d09db4" title="Remove element at given position.">vector<_Tp, _Alloc>::</a>
<a name="l00136"></a><a class="code" href="a00739.html#a161093a193b38c249c70f2ea35d09db4">00136</a> <a class="code" href="a00739.html#a161093a193b38c249c70f2ea35d09db4" title="Remove element at given position."> erase</a>(iterator __position)
<a name="l00137"></a>00137 {
<a name="l00138"></a>00138 <span class="keywordflow">if</span> (__position + 1 != <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>())
<a name="l00139"></a>00139 _GLIBCXX_MOVE3(__position + 1, <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), __position);
<a name="l00140"></a>00140 --this->_M_impl._M_finish;
<a name="l00141"></a>00141 this->_M_impl.destroy(this->_M_impl._M_finish);
<a name="l00142"></a>00142 <span class="keywordflow">return</span> __position;
<a name="l00143"></a>00143 }
<a name="l00144"></a>00144
<a name="l00145"></a>00145 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00146"></a>00146 <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator
<a name="l00147"></a>00147 <a class="code" href="a00739.html#a161093a193b38c249c70f2ea35d09db4" title="Remove element at given position.">vector<_Tp, _Alloc>::</a>
<a name="l00148"></a><a class="code" href="a00739.html#a1239d8128978ef13223f169d4a1a1fb8">00148</a> <a class="code" href="a00739.html#a161093a193b38c249c70f2ea35d09db4" title="Remove element at given position."> erase</a>(iterator __first, iterator __last)
<a name="l00149"></a>00149 {
<a name="l00150"></a>00150 <span class="keywordflow">if</span> (__first != __last)
<a name="l00151"></a>00151 {
<a name="l00152"></a>00152 <span class="keywordflow">if</span> (__last != <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>())
<a name="l00153"></a>00153 _GLIBCXX_MOVE3(__last, <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), __first);
<a name="l00154"></a>00154 _M_erase_at_end(__first.base() + (<a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>() - __last));
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156 <span class="keywordflow">return</span> __first;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158
<a name="l00159"></a>00159 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00160"></a>00160 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector<_Tp, _Alloc></a>&
<a name="l00161"></a>00161 <a class="code" href="a00739.html#a9c56711f1fdb6aeb4a287570da90a688" title="Vector assignment operator.">vector<_Tp, _Alloc>::</a>
<a name="l00162"></a><a class="code" href="a00739.html#a9c56711f1fdb6aeb4a287570da90a688">00162</a> <a class="code" href="a00739.html#a9c56711f1fdb6aeb4a287570da90a688" title="Vector assignment operator."> operator=</a>(<span class="keyword">const</span> <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector<_Tp, _Alloc></a>& __x)
<a name="l00163"></a>00163 {
<a name="l00164"></a>00164 <span class="keywordflow">if</span> (&__x != <span class="keyword">this</span>)
<a name="l00165"></a>00165 {
<a name="l00166"></a>00166 <span class="keyword">const</span> size_type __xlen = __x.<a class="code" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size</a>();
<a name="l00167"></a>00167 <span class="keywordflow">if</span> (__xlen > capacity())
<a name="l00168"></a>00168 {
<a name="l00169"></a>00169 pointer __tmp = _M_allocate_and_copy(__xlen, __x.<a class="code" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a>(),
<a name="l00170"></a>00170 __x.<a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>());
<a name="l00171"></a>00171 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00172"></a>00172 _M_get_Tp_allocator());
<a name="l00173"></a>00173 _M_deallocate(this->_M_impl._M_start,
<a name="l00174"></a>00174 this->_M_impl._M_end_of_storage
<a name="l00175"></a>00175 - this->_M_impl._M_start);
<a name="l00176"></a>00176 this->_M_impl._M_start = __tmp;
<a name="l00177"></a>00177 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>() >= __xlen)
<a name="l00180"></a>00180 {
<a name="l00181"></a>00181 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(std::copy(__x.<a class="code" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a>(), __x.<a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(), <a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>()),
<a name="l00182"></a>00182 <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), _M_get_Tp_allocator());
<a name="l00183"></a>00183 }
<a name="l00184"></a>00184 <span class="keywordflow">else</span>
<a name="l00185"></a>00185 {
<a name="l00186"></a>00186 std::copy(__x._M_impl._M_start, __x._M_impl._M_start + <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>(),
<a name="l00187"></a>00187 this->_M_impl._M_start);
<a name="l00188"></a>00188 std::__uninitialized_copy_a(__x._M_impl._M_start + <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>(),
<a name="l00189"></a>00189 __x._M_impl._M_finish,
<a name="l00190"></a>00190 this->_M_impl._M_finish,
<a name="l00191"></a>00191 _M_get_Tp_allocator());
<a name="l00192"></a>00192 }
<a name="l00193"></a>00193 this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
<a name="l00194"></a>00194 }
<a name="l00195"></a>00195 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00199"></a>00199 <span class="keywordtype">void</span>
<a name="l00200"></a>00200 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector<_Tp, _Alloc>::</a>
<a name="l00201"></a>00201 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order..."> _M_fill_assign</a>(<span class="keywordtype">size_t</span> __n, <span class="keyword">const</span> value_type& __val)
<a name="l00202"></a>00202 {
<a name="l00203"></a>00203 <span class="keywordflow">if</span> (__n > capacity())
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector</a> __tmp(__n, __val, _M_get_Tp_allocator());
<a name="l00206"></a>00206 __tmp.swap(*<span class="keyword">this</span>);
<a name="l00207"></a>00207 }
<a name="l00208"></a>00208 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__n > <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>())
<a name="l00209"></a>00209 {
<a name="l00210"></a>00210 std::fill(<a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>(), <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), __val);
<a name="l00211"></a>00211 std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
<a name="l00212"></a>00212 __n - <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>(), __val,
<a name="l00213"></a>00213 _M_get_Tp_allocator());
<a name="l00214"></a>00214 this->_M_impl._M_finish += __n - <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>();
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216 <span class="keywordflow">else</span>
<a name="l00217"></a>00217 _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00221"></a>00221 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00222"></a>00222 <span class="keywordtype">void</span>
<a name="l00223"></a>00223 vector<_Tp, _Alloc>::
<a name="l00224"></a>00224 _M_assign_aux(_InputIterator __first, _InputIterator __last,
<a name="l00225"></a>00225 <a class="code" href="a00525.html" title="Marking input iterators.">std::input_iterator_tag</a>)
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 pointer __cur(this->_M_impl._M_start);
<a name="l00228"></a>00228 <span class="keywordflow">for</span> (; __first != __last && __cur != this->_M_impl._M_finish;
<a name="l00229"></a>00229 ++__cur, ++__first)
<a name="l00230"></a>00230 *__cur = *__first;
<a name="l00231"></a>00231 <span class="keywordflow">if</span> (__first == __last)
<a name="l00232"></a>00232 _M_erase_at_end(__cur);
<a name="l00233"></a>00233 <span class="keywordflow">else</span>
<a name="l00234"></a>00234 insert(<a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), __first, __last);
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00238"></a>00238 <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator>
<a name="l00239"></a>00239 <span class="keywordtype">void</span>
<a name="l00240"></a>00240 vector<_Tp, _Alloc>::
<a name="l00241"></a>00241 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
<a name="l00242"></a>00242 <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a>)
<a name="l00243"></a>00243 {
<a name="l00244"></a>00244 <span class="keyword">const</span> size_type __len = <a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__first, __last);
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="keywordflow">if</span> (__len > capacity())
<a name="l00247"></a>00247 {
<a name="l00248"></a>00248 pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
<a name="l00249"></a>00249 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00250"></a>00250 _M_get_Tp_allocator());
<a name="l00251"></a>00251 _M_deallocate(this->_M_impl._M_start,
<a name="l00252"></a>00252 this->_M_impl._M_end_of_storage
<a name="l00253"></a>00253 - this->_M_impl._M_start);
<a name="l00254"></a>00254 this->_M_impl._M_start = __tmp;
<a name="l00255"></a>00255 this->_M_impl._M_finish = this->_M_impl._M_start + __len;
<a name="l00256"></a>00256 this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>() >= __len)
<a name="l00259"></a>00259 _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
<a name="l00260"></a>00260 <span class="keywordflow">else</span>
<a name="l00261"></a>00261 {
<a name="l00262"></a>00262 _ForwardIterator __mid = __first;
<a name="l00263"></a>00263 <a class="code" href="a01137.html#abe7a9a9a314d1ccbcfdd361b22e1e960" title="A generalization of pointer arithmetic.">std::advance</a>(__mid, <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>());
<a name="l00264"></a>00264 std::copy(__first, __mid, this->_M_impl._M_start);
<a name="l00265"></a>00265 this->_M_impl._M_finish =
<a name="l00266"></a>00266 std::__uninitialized_copy_a(__mid, __last,
<a name="l00267"></a>00267 this->_M_impl._M_finish,
<a name="l00268"></a>00268 _M_get_Tp_allocator());
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00273"></a>00273 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00274"></a>00274 <span class="keyword">template</span><<span class="keyword">typename</span>... _Args>
<a name="l00275"></a>00275 <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator
<a name="l00276"></a>00276 <a class="code" href="a00739.html#a0bba92692c6f4d980a09d6a6c3cd3cf8" title="Inserts an object in vector before specified iterator.">vector<_Tp, _Alloc>::</a>
<a name="l00277"></a><a class="code" href="a00739.html#a0bba92692c6f4d980a09d6a6c3cd3cf8">00277</a> <a class="code" href="a00739.html#a0bba92692c6f4d980a09d6a6c3cd3cf8" title="Inserts an object in vector before specified iterator."> emplace</a>(iterator __position, _Args&&... __args)
<a name="l00278"></a>00278 {
<a name="l00279"></a>00279 <span class="keyword">const</span> size_type __n = __position - <a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>();
<a name="l00280"></a>00280 <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage
<a name="l00281"></a>00281 && __position == <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>())
<a name="l00282"></a>00282 {
<a name="l00283"></a>00283 this->_M_impl.construct(this->_M_impl._M_finish,
<a name="l00284"></a>00284 std::forward<_Args>(__args)...);
<a name="l00285"></a>00285 ++this->_M_impl._M_finish;
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287 <span class="keywordflow">else</span>
<a name="l00288"></a>00288 _M_insert_aux(__position, std::forward<_Args>(__args)...);
<a name="l00289"></a>00289 <span class="keywordflow">return</span> iterator(this->_M_impl._M_start + __n);
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00292"></a>00292 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00293"></a>00293 <span class="keyword">template</span><<span class="keyword">typename</span>... _Args>
<a name="l00294"></a>00294 <span class="keywordtype">void</span>
<a name="l00295"></a>00295 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector<_Tp, _Alloc>::</a>
<a name="l00296"></a>00296 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order..."> _M_insert_aux</a>(<a class="code" href="a00260.html" title="Common iterator class.">iterator</a> __position, _Args&&... __args)
<a name="l00297"></a>00297 <span class="preprocessor">#else</span>
<a name="l00298"></a>00298 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00299"></a>00299 <span class="keywordtype">void</span>
<a name="l00300"></a>00300 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order...">vector<_Tp, _Alloc>::</a>
<a name="l00301"></a>00301 <a class="code" href="a00739.html" title="A standard container which offers fixed time access to individual elements in any order..."> _M_insert_aux</a>(<a class="code" href="a00260.html" title="Common iterator class.">iterator</a> __position, <span class="keyword">const</span> _Tp& __x)
<a name="l00302"></a>00302 <span class="preprocessor">#endif</span>
<a name="l00303"></a>00303 <span class="preprocessor"></span> {
<a name="l00304"></a>00304 <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
<a name="l00305"></a>00305 {
<a name="l00306"></a>00306 this->_M_impl.construct(this->_M_impl._M_finish,
<a name="l00307"></a>00307 _GLIBCXX_MOVE(*(this->_M_impl._M_finish
<a name="l00308"></a>00308 - 1)));
<a name="l00309"></a>00309 ++this->_M_impl._M_finish;
<a name="l00310"></a>00310 <span class="preprocessor">#ifndef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00311"></a>00311 <span class="preprocessor"></span> _Tp __x_copy = __x;
<a name="l00312"></a>00312 <span class="preprocessor">#endif</span>
<a name="l00313"></a>00313 <span class="preprocessor"></span> _GLIBCXX_MOVE_BACKWARD3(__position.base(),
<a name="l00314"></a>00314 this->_M_impl._M_finish - 2,
<a name="l00315"></a>00315 this->_M_impl._M_finish - 1);
<a name="l00316"></a>00316 <span class="preprocessor">#ifndef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00317"></a>00317 <span class="preprocessor"></span> *__position = __x_copy;
<a name="l00318"></a>00318 <span class="preprocessor">#else</span>
<a name="l00319"></a>00319 <span class="preprocessor"></span> *__position = _Tp(std::forward<_Args>(__args)...);
<a name="l00320"></a>00320 <span class="preprocessor">#endif</span>
<a name="l00321"></a>00321 <span class="preprocessor"></span> }
<a name="l00322"></a>00322 <span class="keywordflow">else</span>
<a name="l00323"></a>00323 {
<a name="l00324"></a>00324 <span class="keyword">const</span> size_type __len =
<a name="l00325"></a>00325 _M_check_len(size_type(1), <span class="stringliteral">"vector::_M_insert_aux"</span>);
<a name="l00326"></a>00326 <span class="keyword">const</span> size_type __elems_before = __position - <a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>();
<a name="l00327"></a>00327 pointer __new_start(this->_M_allocate(__len));
<a name="l00328"></a>00328 pointer __new_finish(__new_start);
<a name="l00329"></a>00329 __try
<a name="l00330"></a>00330 {
<a name="l00331"></a>00331 <span class="comment">// The order of the three operations is dictated by the C++0x</span>
<a name="l00332"></a>00332 <span class="comment">// case, where the moves could alter a new element belonging</span>
<a name="l00333"></a>00333 <span class="comment">// to the existing vector. This is an issue only for callers</span>
<a name="l00334"></a>00334 <span class="comment">// taking the element by const lvalue ref (see 23.1/13).</span>
<a name="l00335"></a>00335 this->_M_impl.construct(__new_start + __elems_before,
<a name="l00336"></a>00336 #ifdef __GXX_EXPERIMENTAL_CXX0X__
<a name="l00337"></a>00337 std::forward<_Args>(__args)...);
<a name="l00338"></a>00338 <span class="preprocessor">#else</span>
<a name="l00339"></a>00339 <span class="preprocessor"></span> __x);
<a name="l00340"></a>00340 <span class="preprocessor">#endif</span>
<a name="l00341"></a>00341 <span class="preprocessor"></span> __new_finish = 0;
<a name="l00342"></a>00342
<a name="l00343"></a>00343 __new_finish =
<a name="l00344"></a>00344 std::__uninitialized_move_a(this->_M_impl._M_start,
<a name="l00345"></a>00345 __position.base(), __new_start,
<a name="l00346"></a>00346 _M_get_Tp_allocator());
<a name="l00347"></a>00347 ++__new_finish;
<a name="l00348"></a>00348
<a name="l00349"></a>00349 __new_finish =
<a name="l00350"></a>00350 std::__uninitialized_move_a(__position.base(),
<a name="l00351"></a>00351 this->_M_impl._M_finish,
<a name="l00352"></a>00352 __new_finish,
<a name="l00353"></a>00353 _M_get_Tp_allocator());
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355 __catch(...)
<a name="l00356"></a>00356 {
<a name="l00357"></a>00357 <span class="keywordflow">if</span> (!__new_finish)
<a name="l00358"></a>00358 this->_M_impl.destroy(__new_start + __elems_before);
<a name="l00359"></a>00359 <span class="keywordflow">else</span>
<a name="l00360"></a>00360 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(__new_start, __new_finish, _M_get_Tp_allocator());
<a name="l00361"></a>00361 _M_deallocate(__new_start, __len);
<a name="l00362"></a>00362 __throw_exception_again;
<a name="l00363"></a>00363 }
<a name="l00364"></a>00364 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00365"></a>00365 _M_get_Tp_allocator());
<a name="l00366"></a>00366 _M_deallocate(this->_M_impl._M_start,
<a name="l00367"></a>00367 this->_M_impl._M_end_of_storage
<a name="l00368"></a>00368 - this->_M_impl._M_start);
<a name="l00369"></a>00369 this->_M_impl._M_start = __new_start;
<a name="l00370"></a>00370 this->_M_impl._M_finish = __new_finish;
<a name="l00371"></a>00371 this->_M_impl._M_end_of_storage = __new_start + __len;
<a name="l00372"></a>00372 }
<a name="l00373"></a>00373 }
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00376"></a>00376 <span class="keywordtype">void</span>
<a name="l00377"></a>00377 vector<_Tp, _Alloc>::
<a name="l00378"></a>00378 _M_fill_insert(iterator __position, size_type __n, <span class="keyword">const</span> value_type& __x)
<a name="l00379"></a>00379 {
<a name="l00380"></a>00380 <span class="keywordflow">if</span> (__n != 0)
<a name="l00381"></a>00381 {
<a name="l00382"></a>00382 <span class="keywordflow">if</span> (size_type(this->_M_impl._M_end_of_storage
<a name="l00383"></a>00383 - this->_M_impl._M_finish) >= __n)
<a name="l00384"></a>00384 {
<a name="l00385"></a>00385 value_type __x_copy = __x;
<a name="l00386"></a>00386 <span class="keyword">const</span> size_type __elems_after = <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>() - __position;
<a name="l00387"></a>00387 pointer __old_finish(this->_M_impl._M_finish);
<a name="l00388"></a>00388 <span class="keywordflow">if</span> (__elems_after > __n)
<a name="l00389"></a>00389 {
<a name="l00390"></a>00390 std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
<a name="l00391"></a>00391 this->_M_impl._M_finish,
<a name="l00392"></a>00392 this->_M_impl._M_finish,
<a name="l00393"></a>00393 _M_get_Tp_allocator());
<a name="l00394"></a>00394 this->_M_impl._M_finish += __n;
<a name="l00395"></a>00395 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
<a name="l00396"></a>00396 __old_finish - __n, __old_finish);
<a name="l00397"></a>00397 std::fill(__position.base(), __position.base() + __n,
<a name="l00398"></a>00398 __x_copy);
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400 <span class="keywordflow">else</span>
<a name="l00401"></a>00401 {
<a name="l00402"></a>00402 std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
<a name="l00403"></a>00403 __n - __elems_after,
<a name="l00404"></a>00404 __x_copy,
<a name="l00405"></a>00405 _M_get_Tp_allocator());
<a name="l00406"></a>00406 this->_M_impl._M_finish += __n - __elems_after;
<a name="l00407"></a>00407 std::__uninitialized_move_a(__position.base(), __old_finish,
<a name="l00408"></a>00408 this->_M_impl._M_finish,
<a name="l00409"></a>00409 _M_get_Tp_allocator());
<a name="l00410"></a>00410 this->_M_impl._M_finish += __elems_after;
<a name="l00411"></a>00411 std::fill(__position.base(), __old_finish, __x_copy);
<a name="l00412"></a>00412 }
<a name="l00413"></a>00413 }
<a name="l00414"></a>00414 <span class="keywordflow">else</span>
<a name="l00415"></a>00415 {
<a name="l00416"></a>00416 <span class="keyword">const</span> size_type __len =
<a name="l00417"></a>00417 _M_check_len(__n, <span class="stringliteral">"vector::_M_fill_insert"</span>);
<a name="l00418"></a>00418 <span class="keyword">const</span> size_type __elems_before = __position - <a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>();
<a name="l00419"></a>00419 pointer __new_start(this->_M_allocate(__len));
<a name="l00420"></a>00420 pointer __new_finish(__new_start);
<a name="l00421"></a>00421 __try
<a name="l00422"></a>00422 {
<a name="l00423"></a>00423 <span class="comment">// See _M_insert_aux above.</span>
<a name="l00424"></a>00424 std::__uninitialized_fill_n_a(__new_start + __elems_before,
<a name="l00425"></a>00425 __n, __x,
<a name="l00426"></a>00426 _M_get_Tp_allocator());
<a name="l00427"></a>00427 __new_finish = 0;
<a name="l00428"></a>00428
<a name="l00429"></a>00429 __new_finish =
<a name="l00430"></a>00430 std::__uninitialized_move_a(this->_M_impl._M_start,
<a name="l00431"></a>00431 __position.base(),
<a name="l00432"></a>00432 __new_start,
<a name="l00433"></a>00433 _M_get_Tp_allocator());
<a name="l00434"></a>00434 __new_finish += __n;
<a name="l00435"></a>00435
<a name="l00436"></a>00436 __new_finish =
<a name="l00437"></a>00437 std::__uninitialized_move_a(__position.base(),
<a name="l00438"></a>00438 this->_M_impl._M_finish,
<a name="l00439"></a>00439 __new_finish,
<a name="l00440"></a>00440 _M_get_Tp_allocator());
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442 __catch(...)
<a name="l00443"></a>00443 {
<a name="l00444"></a>00444 <span class="keywordflow">if</span> (!__new_finish)
<a name="l00445"></a>00445 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(__new_start + __elems_before,
<a name="l00446"></a>00446 __new_start + __elems_before + __n,
<a name="l00447"></a>00447 _M_get_Tp_allocator());
<a name="l00448"></a>00448 <span class="keywordflow">else</span>
<a name="l00449"></a>00449 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(__new_start, __new_finish,
<a name="l00450"></a>00450 _M_get_Tp_allocator());
<a name="l00451"></a>00451 _M_deallocate(__new_start, __len);
<a name="l00452"></a>00452 __throw_exception_again;
<a name="l00453"></a>00453 }
<a name="l00454"></a>00454 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00455"></a>00455 _M_get_Tp_allocator());
<a name="l00456"></a>00456 _M_deallocate(this->_M_impl._M_start,
<a name="l00457"></a>00457 this->_M_impl._M_end_of_storage
<a name="l00458"></a>00458 - this->_M_impl._M_start);
<a name="l00459"></a>00459 this->_M_impl._M_start = __new_start;
<a name="l00460"></a>00460 this->_M_impl._M_finish = __new_finish;
<a name="l00461"></a>00461 this->_M_impl._M_end_of_storage = __new_start + __len;
<a name="l00462"></a>00462 }
<a name="l00463"></a>00463 }
<a name="l00464"></a>00464 }
<a name="l00465"></a>00465
<a name="l00466"></a>00466 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00467"></a>00467 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00468"></a>00468 <span class="keywordtype">void</span>
<a name="l00469"></a>00469 vector<_Tp, _Alloc>::
<a name="l00470"></a>00470 _M_default_append(size_type __n)
<a name="l00471"></a>00471 {
<a name="l00472"></a>00472 <span class="keywordflow">if</span> (__n != 0)
<a name="l00473"></a>00473 {
<a name="l00474"></a>00474 <span class="keywordflow">if</span> (size_type(this->_M_impl._M_end_of_storage
<a name="l00475"></a>00475 - this->_M_impl._M_finish) >= __n)
<a name="l00476"></a>00476 {
<a name="l00477"></a>00477 std::__uninitialized_default_n_a(this->_M_impl._M_finish,
<a name="l00478"></a>00478 __n, _M_get_Tp_allocator());
<a name="l00479"></a>00479 this->_M_impl._M_finish += __n;
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481 <span class="keywordflow">else</span>
<a name="l00482"></a>00482 {
<a name="l00483"></a>00483 <span class="keyword">const</span> size_type __len =
<a name="l00484"></a>00484 _M_check_len(__n, <span class="stringliteral">"vector::_M_default_append"</span>);
<a name="l00485"></a>00485 <span class="keyword">const</span> size_type __old_size = this-><a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>();
<a name="l00486"></a>00486 pointer __new_start(this->_M_allocate(__len));
<a name="l00487"></a>00487 pointer __new_finish(__new_start);
<a name="l00488"></a>00488 __try
<a name="l00489"></a>00489 {
<a name="l00490"></a>00490 __new_finish =
<a name="l00491"></a>00491 std::__uninitialized_move_a(this->_M_impl._M_start,
<a name="l00492"></a>00492 this->_M_impl._M_finish,
<a name="l00493"></a>00493 __new_start,
<a name="l00494"></a>00494 _M_get_Tp_allocator());
<a name="l00495"></a>00495 std::__uninitialized_default_n_a(__new_finish, __n,
<a name="l00496"></a>00496 _M_get_Tp_allocator());
<a name="l00497"></a>00497 __new_finish += __n;
<a name="l00498"></a>00498 }
<a name="l00499"></a>00499 __catch(...)
<a name="l00500"></a>00500 {
<a name="l00501"></a>00501 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(__new_start, __new_finish,
<a name="l00502"></a>00502 _M_get_Tp_allocator());
<a name="l00503"></a>00503 _M_deallocate(__new_start, __len);
<a name="l00504"></a>00504 __throw_exception_again;
<a name="l00505"></a>00505 }
<a name="l00506"></a>00506 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00507"></a>00507 _M_get_Tp_allocator());
<a name="l00508"></a>00508 _M_deallocate(this->_M_impl._M_start,
<a name="l00509"></a>00509 this->_M_impl._M_end_of_storage
<a name="l00510"></a>00510 - this->_M_impl._M_start);
<a name="l00511"></a>00511 this->_M_impl._M_start = __new_start;
<a name="l00512"></a>00512 this->_M_impl._M_finish = __new_finish;
<a name="l00513"></a>00513 this->_M_impl._M_end_of_storage = __new_start + __len;
<a name="l00514"></a>00514 }
<a name="l00515"></a>00515 }
<a name="l00516"></a>00516 }
<a name="l00517"></a>00517 <span class="preprocessor">#endif</span>
<a name="l00518"></a>00518 <span class="preprocessor"></span>
<a name="l00519"></a>00519 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00520"></a>00520 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00521"></a>00521 <span class="keywordtype">void</span>
<a name="l00522"></a>00522 vector<_Tp, _Alloc>::
<a name="l00523"></a>00523 _M_range_insert(iterator __pos, _InputIterator __first,
<a name="l00524"></a>00524 _InputIterator __last, <a class="code" href="a00525.html" title="Marking input iterators.">std::input_iterator_tag</a>)
<a name="l00525"></a>00525 {
<a name="l00526"></a>00526 <span class="keywordflow">for</span> (; __first != __last; ++__first)
<a name="l00527"></a>00527 {
<a name="l00528"></a>00528 __pos = insert(__pos, *__first);
<a name="l00529"></a>00529 ++__pos;
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 }
<a name="l00532"></a>00532
<a name="l00533"></a>00533 <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc>
<a name="l00534"></a>00534 <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator>
<a name="l00535"></a>00535 <span class="keywordtype">void</span>
<a name="l00536"></a>00536 vector<_Tp, _Alloc>::
<a name="l00537"></a>00537 _M_range_insert(iterator __position, _ForwardIterator __first,
<a name="l00538"></a>00538 _ForwardIterator __last, <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a>)
<a name="l00539"></a>00539 {
<a name="l00540"></a>00540 <span class="keywordflow">if</span> (__first != __last)
<a name="l00541"></a>00541 {
<a name="l00542"></a>00542 <span class="keyword">const</span> size_type __n = <a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__first, __last);
<a name="l00543"></a>00543 <span class="keywordflow">if</span> (size_type(this->_M_impl._M_end_of_storage
<a name="l00544"></a>00544 - this->_M_impl._M_finish) >= __n)
<a name="l00545"></a>00545 {
<a name="l00546"></a>00546 <span class="keyword">const</span> size_type __elems_after = <a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>() - __position;
<a name="l00547"></a>00547 pointer __old_finish(this->_M_impl._M_finish);
<a name="l00548"></a>00548 <span class="keywordflow">if</span> (__elems_after > __n)
<a name="l00549"></a>00549 {
<a name="l00550"></a>00550 std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
<a name="l00551"></a>00551 this->_M_impl._M_finish,
<a name="l00552"></a>00552 this->_M_impl._M_finish,
<a name="l00553"></a>00553 _M_get_Tp_allocator());
<a name="l00554"></a>00554 this->_M_impl._M_finish += __n;
<a name="l00555"></a>00555 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
<a name="l00556"></a>00556 __old_finish - __n, __old_finish);
<a name="l00557"></a>00557 std::copy(__first, __last, __position);
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559 <span class="keywordflow">else</span>
<a name="l00560"></a>00560 {
<a name="l00561"></a>00561 _ForwardIterator __mid = __first;
<a name="l00562"></a>00562 <a class="code" href="a01137.html#abe7a9a9a314d1ccbcfdd361b22e1e960" title="A generalization of pointer arithmetic.">std::advance</a>(__mid, __elems_after);
<a name="l00563"></a>00563 std::__uninitialized_copy_a(__mid, __last,
<a name="l00564"></a>00564 this->_M_impl._M_finish,
<a name="l00565"></a>00565 _M_get_Tp_allocator());
<a name="l00566"></a>00566 this->_M_impl._M_finish += __n - __elems_after;
<a name="l00567"></a>00567 std::__uninitialized_move_a(__position.base(),
<a name="l00568"></a>00568 __old_finish,
<a name="l00569"></a>00569 this->_M_impl._M_finish,
<a name="l00570"></a>00570 _M_get_Tp_allocator());
<a name="l00571"></a>00571 this->_M_impl._M_finish += __elems_after;
<a name="l00572"></a>00572 std::copy(__first, __mid, __position);
<a name="l00573"></a>00573 }
<a name="l00574"></a>00574 }
<a name="l00575"></a>00575 <span class="keywordflow">else</span>
<a name="l00576"></a>00576 {
<a name="l00577"></a>00577 <span class="keyword">const</span> size_type __len =
<a name="l00578"></a>00578 _M_check_len(__n, <span class="stringliteral">"vector::_M_range_insert"</span>);
<a name="l00579"></a>00579 pointer __new_start(this->_M_allocate(__len));
<a name="l00580"></a>00580 pointer __new_finish(__new_start);
<a name="l00581"></a>00581 __try
<a name="l00582"></a>00582 {
<a name="l00583"></a>00583 __new_finish =
<a name="l00584"></a>00584 std::__uninitialized_move_a(this->_M_impl._M_start,
<a name="l00585"></a>00585 __position.base(),
<a name="l00586"></a>00586 __new_start,
<a name="l00587"></a>00587 _M_get_Tp_allocator());
<a name="l00588"></a>00588 __new_finish =
<a name="l00589"></a>00589 std::__uninitialized_copy_a(__first, __last,
<a name="l00590"></a>00590 __new_finish,
<a name="l00591"></a>00591 _M_get_Tp_allocator());
<a name="l00592"></a>00592 __new_finish =
<a name="l00593"></a>00593 std::__uninitialized_move_a(__position.base(),
<a name="l00594"></a>00594 this->_M_impl._M_finish,
<a name="l00595"></a>00595 __new_finish,
<a name="l00596"></a>00596 _M_get_Tp_allocator());
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598 __catch(...)
<a name="l00599"></a>00599 {
<a name="l00600"></a>00600 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(__new_start, __new_finish,
<a name="l00601"></a>00601 _M_get_Tp_allocator());
<a name="l00602"></a>00602 _M_deallocate(__new_start, __len);
<a name="l00603"></a>00603 __throw_exception_again;
<a name="l00604"></a>00604 }
<a name="l00605"></a>00605 <a class="code" href="a01137.html#a81deec3b993a64a7a9e1c955fe98f556">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,
<a name="l00606"></a>00606 _M_get_Tp_allocator());
<a name="l00607"></a>00607 _M_deallocate(this->_M_impl._M_start,
<a name="l00608"></a>00608 this->_M_impl._M_end_of_storage
<a name="l00609"></a>00609 - this->_M_impl._M_start);
<a name="l00610"></a>00610 this->_M_impl._M_start = __new_start;
<a name="l00611"></a>00611 this->_M_impl._M_finish = __new_finish;
<a name="l00612"></a>00612 this->_M_impl._M_end_of_storage = __new_start + __len;
<a name="l00613"></a>00613 }
<a name="l00614"></a>00614 }
<a name="l00615"></a>00615 }
<a name="l00616"></a>00616
<a name="l00617"></a>00617
<a name="l00618"></a>00618 <span class="comment">// vector<bool></span>
<a name="l00619"></a>00619
<a name="l00620"></a>00620 <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc>
<a name="l00621"></a>00621 <span class="keywordtype">void</span>
<a name="l00622"></a>00622 <a class="code" href="a00739.html#a8ab62036345a72d8126fa30425dfe869" title="Attempt to preallocate enough memory for specified number of elements.">vector<bool, _Alloc>::</a>
<a name="l00623"></a>00623 <a class="code" href="a00739.html#a8ab62036345a72d8126fa30425dfe869" title="Attempt to preallocate enough memory for specified number of elements."> reserve</a>(size_type __n)
<a name="l00624"></a>00624 {
<a name="l00625"></a>00625 <span class="keywordflow">if</span> (__n > this-><a class="code" href="a00739.html#a68fc9ad8180aacdca3a3cf15b8e1ddb9">max_size</a>())
<a name="l00626"></a>00626 __throw_length_error(__N(<span class="stringliteral">"vector::reserve"</span>));
<a name="l00627"></a>00627 <span class="keywordflow">if</span> (this-><a class="code" href="a00739.html#a566ce30a571bb5621946950405bb0e64">capacity</a>() < __n)
<a name="l00628"></a>00628 {
<a name="l00629"></a>00629 _Bit_type* __q = this->_M_allocate(__n);
<a name="l00630"></a>00630 this->_M_impl._M_finish = _M_copy_aligned(<a class="code" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a>(), <a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(),
<a name="l00631"></a>00631 iterator(__q, 0));
<a name="l00632"></a>00632 this->_M_deallocate();
<a name="l00633"></a>00633 this->_M_impl._M_start = iterator(__q, 0);
<a name="l00634"></a>00634 this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1)
<a name="l00635"></a>00635 / <span class="keywordtype">int</span>(_S_word_bit));
<a name="l00636"></a>00636 }
<a name="l00637"></a>00637 }
<a name="l00638"></a>00638
<a name="l00639"></a>00639 <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc>
<a name="l00640"></a>00640 <span class="keywordtype">void</span>
<a name="l00641"></a>00641 vector<bool, _Alloc>::
<a name="l00642"></a>00642 _M_fill_insert(iterator __position, size_type __n, <span class="keywordtype">bool</span> __x)
<a name="l00643"></a>00643 {
<a name="l00644"></a>00644 <span class="keywordflow">if</span> (__n == 0)
<a name="l00645"></a>00645 <span class="keywordflow">return</span>;
<a name="l00646"></a>00646 <span class="keywordflow">if</span> (<a class="code" href="a00739.html#a566ce30a571bb5621946950405bb0e64">capacity</a>() - <a class="code" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size</a>() >= __n)
<a name="l00647"></a>00647 {
<a name="l00648"></a>00648 std::copy_backward(__position, <a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(),
<a name="l00649"></a>00649 this->_M_impl._M_finish + difference_type(__n));
<a name="l00650"></a>00650 std::fill(__position, __position + difference_type(__n), __x);
<a name="l00651"></a>00651 this->_M_impl._M_finish += difference_type(__n);
<a name="l00652"></a>00652 }
<a name="l00653"></a>00653 <span class="keywordflow">else</span>
<a name="l00654"></a>00654 {
<a name="l00655"></a>00655 <span class="keyword">const</span> size_type __len =
<a name="l00656"></a>00656 _M_check_len(__n, <span class="stringliteral">"vector<bool>::_M_fill_insert"</span>);
<a name="l00657"></a>00657 _Bit_type * __q = this->_M_allocate(__len);
<a name="l00658"></a>00658 iterator __i = _M_copy_aligned(<a class="code" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a>(), __position,
<a name="l00659"></a>00659 iterator(__q, 0));
<a name="l00660"></a>00660 std::fill(__i, __i + difference_type(__n), __x);
<a name="l00661"></a>00661 this->_M_impl._M_finish = std::copy(__position, <a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(),
<a name="l00662"></a>00662 __i + difference_type(__n));
<a name="l00663"></a>00663 this->_M_deallocate();
<a name="l00664"></a>00664 this->_M_impl._M_end_of_storage = (__q + ((__len
<a name="l00665"></a>00665 + int(_S_word_bit) - 1)
<a name="l00666"></a>00666 / <span class="keywordtype">int</span>(_S_word_bit)));
<a name="l00667"></a>00667 this->_M_impl._M_start = iterator(__q, 0);
<a name="l00668"></a>00668 }
<a name="l00669"></a>00669 }
<a name="l00670"></a>00670
<a name="l00671"></a>00671 <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc>
<a name="l00672"></a>00672 <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator>
<a name="l00673"></a>00673 <span class="keywordtype">void</span>
<a name="l00674"></a>00674 vector<bool, _Alloc>::
<a name="l00675"></a>00675 _M_insert_range(iterator __position, _ForwardIterator __first,
<a name="l00676"></a>00676 _ForwardIterator __last, <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a>)
<a name="l00677"></a>00677 {
<a name="l00678"></a>00678 <span class="keywordflow">if</span> (__first != __last)
<a name="l00679"></a>00679 {
<a name="l00680"></a>00680 size_type __n = <a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__first, __last);
<a name="l00681"></a>00681 <span class="keywordflow">if</span> (<a class="code" href="a00739.html#a566ce30a571bb5621946950405bb0e64">capacity</a>() - <a class="code" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size</a>() >= __n)
<a name="l00682"></a>00682 {
<a name="l00683"></a>00683 std::copy_backward(__position, <a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(),
<a name="l00684"></a>00684 this->_M_impl._M_finish
<a name="l00685"></a>00685 + difference_type(__n));
<a name="l00686"></a>00686 std::copy(__first, __last, __position);
<a name="l00687"></a>00687 this->_M_impl._M_finish += difference_type(__n);
<a name="l00688"></a>00688 }
<a name="l00689"></a>00689 <span class="keywordflow">else</span>
<a name="l00690"></a>00690 {
<a name="l00691"></a>00691 <span class="keyword">const</span> size_type __len =
<a name="l00692"></a>00692 _M_check_len(__n, <span class="stringliteral">"vector<bool>::_M_insert_range"</span>);
<a name="l00693"></a>00693 _Bit_type * __q = this->_M_allocate(__len);
<a name="l00694"></a>00694 iterator __i = _M_copy_aligned(<a class="code" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a>(), __position,
<a name="l00695"></a>00695 iterator(__q, 0));
<a name="l00696"></a>00696 __i = std::copy(__first, __last, __i);
<a name="l00697"></a>00697 this->_M_impl._M_finish = std::copy(__position, <a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(), __i);
<a name="l00698"></a>00698 this->_M_deallocate();
<a name="l00699"></a>00699 this->_M_impl._M_end_of_storage = (__q
<a name="l00700"></a>00700 + ((__len
<a name="l00701"></a>00701 + int(_S_word_bit) - 1)
<a name="l00702"></a>00702 / <span class="keywordtype">int</span>(_S_word_bit)));
<a name="l00703"></a>00703 this->_M_impl._M_start = iterator(__q, 0);
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705 }
<a name="l00706"></a>00706 }
<a name="l00707"></a>00707
<a name="l00708"></a>00708 <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc>
<a name="l00709"></a>00709 <span class="keywordtype">void</span>
<a name="l00710"></a>00710 vector<bool, _Alloc>::
<a name="l00711"></a>00711 _M_insert_aux(iterator __position, <span class="keywordtype">bool</span> __x)
<a name="l00712"></a>00712 {
<a name="l00713"></a>00713 <span class="keywordflow">if</span> (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
<a name="l00714"></a>00714 {
<a name="l00715"></a>00715 std::copy_backward(__position, this->_M_impl._M_finish,
<a name="l00716"></a>00716 this->_M_impl._M_finish + 1);
<a name="l00717"></a>00717 *__position = __x;
<a name="l00718"></a>00718 ++this->_M_impl._M_finish;
<a name="l00719"></a>00719 }
<a name="l00720"></a>00720 <span class="keywordflow">else</span>
<a name="l00721"></a>00721 {
<a name="l00722"></a>00722 <span class="keyword">const</span> size_type __len =
<a name="l00723"></a>00723 _M_check_len(size_type(1), <span class="stringliteral">"vector<bool>::_M_insert_aux"</span>);
<a name="l00724"></a>00724 _Bit_type * __q = this->_M_allocate(__len);
<a name="l00725"></a>00725 iterator __i = _M_copy_aligned(<a class="code" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a>(), __position,
<a name="l00726"></a>00726 iterator(__q, 0));
<a name="l00727"></a>00727 *__i++ = __x;
<a name="l00728"></a>00728 this->_M_impl._M_finish = std::copy(__position, <a class="code" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a>(), __i);
<a name="l00729"></a>00729 this->_M_deallocate();
<a name="l00730"></a>00730 this->_M_impl._M_end_of_storage = (__q + ((__len
<a name="l00731"></a>00731 + int(_S_word_bit) - 1)
<a name="l00732"></a>00732 / <span class="keywordtype">int</span>(_S_word_bit)));
<a name="l00733"></a>00733 this->_M_impl._M_start = iterator(__q, 0);
<a name="l00734"></a>00734 }
<a name="l00735"></a>00735 }
<a name="l00736"></a>00736
<a name="l00737"></a>00737 _GLIBCXX_END_NAMESPACE_CONTAINER
<a name="l00738"></a>00738 } <span class="comment">// namespace std</span>
<a name="l00739"></a>00739
<a name="l00740"></a>00740 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00741"></a>00741 <span class="preprocessor"></span>
<a name="l00742"></a>00742 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00743"></a>00743 {
<a name="l00744"></a>00744 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00745"></a>00745
<a name="l00746"></a>00746 <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc>
<a name="l00747"></a>00747 <span class="keywordtype">size_t</span>
<a name="l00748"></a>00748 hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>::
<a name="l00749"></a>00749 operator()(<span class="keyword">const</span> _GLIBCXX_STD_C::vector<bool, _Alloc>& __b)<span class="keyword"> const</span>
<a name="l00750"></a>00750 <span class="keyword"> </span>{
<a name="l00751"></a>00751 <span class="keywordtype">size_t</span> __hash = 0;
<a name="l00752"></a>00752 <span class="keyword">using</span> _GLIBCXX_STD_C::_S_word_bit;
<a name="l00753"></a>00753 <span class="keyword">using</span> _GLIBCXX_STD_C::_Bit_type;
<a name="l00754"></a>00754
<a name="l00755"></a>00755 <span class="keyword">const</span> <span class="keywordtype">size_t</span> __words = __b.size() / _S_word_bit;
<a name="l00756"></a>00756 <span class="keywordflow">if</span> (__words)
<a name="l00757"></a>00757 {
<a name="l00758"></a>00758 <span class="keyword">const</span> <span class="keywordtype">size_t</span> __clength = __words * <span class="keyword">sizeof</span>(_Bit_type);
<a name="l00759"></a>00759 __hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);
<a name="l00760"></a>00760 }
<a name="l00761"></a>00761
<a name="l00762"></a>00762 <span class="keyword">const</span> <span class="keywordtype">size_t</span> __extrabits = __b.size() % _S_word_bit;
<a name="l00763"></a>00763 <span class="keywordflow">if</span> (__extrabits)
<a name="l00764"></a>00764 {
<a name="l00765"></a>00765 _Bit_type __hiword = *__b._M_impl._M_finish._M_p;
<a name="l00766"></a>00766 __hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);
<a name="l00767"></a>00767
<a name="l00768"></a>00768 <span class="keyword">const</span> <span class="keywordtype">size_t</span> __clength
<a name="l00769"></a>00769 = (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;
<a name="l00770"></a>00770 <span class="keywordflow">if</span> (__words)
<a name="l00771"></a>00771 __hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);
<a name="l00772"></a>00772 <span class="keywordflow">else</span>
<a name="l00773"></a>00773 __hash = std::_Hash_impl::hash(&__hiword, __clength);
<a name="l00774"></a>00774 }
<a name="l00775"></a>00775
<a name="l00776"></a>00776 <span class="keywordflow">return</span> __hash;
<a name="l00777"></a>00777 }
<a name="l00778"></a>00778
<a name="l00779"></a>00779 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00780"></a>00780 } <span class="comment">// namespace std</span>
<a name="l00781"></a>00781
<a name="l00782"></a>00782 <span class="preprocessor">#endif // __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00783"></a>00783 <span class="preprocessor"></span>
<a name="l00784"></a>00784 <span class="preprocessor">#endif </span><span class="comment">/* _VECTOR_TCC */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a01117.html">vector.tcc</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>
