<!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"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.13"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: stl_vector.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> $(document).ready(initResizable); </script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.13 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> $(document).ready(function(){initNavTree('a00554_source.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">stl_vector.h</div> </div> </div><!--header--> <div class="contents"> <a href="a00554.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Vector implementation -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2001-2015 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** @file bits/stl_vector.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{vector}</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef _STL_VECTOR_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_VECTOR_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00506.html">bits/stl_iterator_base_funcs.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00332.html">bits/functexcept.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a00302.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <<a class="code" href="a00023.html">initializer_list</a>></span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">namespace </span><a class="code" href="a01487.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> /// See bits/stl_deque.h's _Deque_base for an explanation.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="a06817.html"> 72</a></span>  <span class="keyword">struct </span><a class="code" href="a06817.html">_Vector_base</a></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Alloc>::template</a></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  rebind<_Tp>::other _Tp_alloc_type;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __gnu_cxx::__alloc_traits<_Tp_alloc_type>::pointer</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  pointer;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">struct </span>_Vector_impl </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  : <span class="keyword">public</span> _Tp_alloc_type</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  pointer _M_start;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  pointer _M_finish;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  pointer _M_end_of_storage;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  _Vector_impl()</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  : _Tp_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage()</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  { }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  _Vector_impl(_Tp_alloc_type <span class="keyword">const</span>& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  : _Tp_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage()</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  { }</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  _Vector_impl(_Tp_alloc_type&& __a) noexcept</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  : _Tp_alloc_type(std::move(__a)),</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  _M_start(), _M_finish(), _M_end_of_storage()</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  { }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">void</span> _M_swap_data(_Vector_impl& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  std::swap(_M_start, __x._M_start);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  std::swap(_M_finish, __x._M_finish);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  std::swap(_M_end_of_storage, __x._M_end_of_storage);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  };</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  _Tp_alloc_type&</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  _M_get_Tp_allocator() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  { <span class="keywordflow">return</span> *<span class="keyword">static_cast<</span>_Tp_alloc_type*<span class="keyword">></span>(&this->_M_impl); }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> _Tp_alloc_type&</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _M_get_Tp_allocator() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  { <span class="keywordflow">return</span> *<span class="keyword">static_cast<</span><span class="keyword">const </span>_Tp_alloc_type*<span class="keyword">></span>(&this->_M_impl); }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  allocator_type</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  get_allocator() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  { <span class="keywordflow">return</span> allocator_type(_M_get_Tp_allocator()); }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="a06817.html">_Vector_base</a>()</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  : _M_impl() { }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="a06817.html">_Vector_base</a>(<span class="keyword">const</span> allocator_type& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  : _M_impl(__a) { }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="a06817.html">_Vector_base</a>(<span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  : _M_impl()</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  { _M_create_storage(__n); }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="a06817.html">_Vector_base</a>(<span class="keywordtype">size_t</span> __n, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  : _M_impl(__a)</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  { _M_create_storage(__n); }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="a06817.html">_Vector_base</a>(_Tp_alloc_type&& __a) noexcept</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  : _M_impl(std::move(__a)) { }</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="a06817.html">_Vector_base</a>(<a class="code" href="a06817.html">_Vector_base</a>&& __x) noexcept</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  : _M_impl(std::move(__x._M_get_Tp_allocator()))</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  { this->_M_impl._M_swap_data(__x._M_impl); }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="a06817.html">_Vector_base</a>(<a class="code" href="a06817.html">_Vector_base</a>&& __x, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  : _M_impl(__a)</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  {</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">if</span> (__x.get_allocator() == __a)</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  this->_M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordtype">size_t</span> __n = __x._M_impl._M_finish - __x._M_impl._M_start;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _M_create_storage(__n);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  ~<a class="code" href="a06817.html">_Vector_base</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  - this->_M_impl._M_start); }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  _Vector_impl _M_impl;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  pointer</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  _M_allocate(<span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">typedef</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> _Tr;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  _M_deallocate(pointer __p, <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">typedef</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> _Tr;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (__p)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  _Tr::deallocate(_M_impl, __p, __n);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  _M_create_storage(<span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  this->_M_impl._M_start = this->_M_allocate(__n);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  this->_M_impl._M_finish = this->_M_impl._M_start;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  };</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"></span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> /**</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * @brief A standard container which offers fixed time access to</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * individual elements in any order.</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> *</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * @ingroup sequences</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> *</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> * @tparam _Tp Type of element.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> *</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and a</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> * <a href="tables.html#67">sequence</a>, including the</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> * <a href="tables.html#68">optional sequence requirements</a> with the</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> * %exception of @c push_front and @c pop_front.</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> *</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> * In some terminology a %vector can be described as a dynamic</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * C-style array, it offers fast and efficient access to individual</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> * elements in any order and saves the user from worrying about</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * memory and size allocation. Subscripting ( @c [] ) access is</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> * also provided as with C-style arrays.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> */</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc = std::allocator<_Tp> ></div><div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="a06825.html"> 214</a></span>  <span class="keyword">class </span><a class="code" href="a06825.html">vector</a> : <span class="keyword">protected</span> <a class="code" href="a06817.html">_Vector_base</a><_Tp, _Alloc></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// Concept requirements.</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">typedef</span> <a class="code" href="a06817.html">_Vector_base<_Tp, _Alloc></a> <a class="code" href="a06817.html">_Base</a>;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::_Tp_alloc_type _Tp_alloc_type;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">typedef</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> <a class="code" href="a08925.html">_Alloc_traits</a>;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::pointer pointer;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_pointer const_pointer;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::reference reference;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_reference const_reference;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">typedef</span> __gnu_cxx::__normal_iterator<pointer, vector> iterator;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">typedef</span> __gnu_cxx::__normal_iterator<const_pointer, vector></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  const_iterator;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">typedef</span> <a class="code" href="a06569.html">std::reverse_iterator<const_iterator></a> <a class="code" href="a06569.html">const_reverse_iterator</a>;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">typedef</span> <a class="code" href="a06569.html">std::reverse_iterator<iterator></a> <a class="code" href="a06569.html">reverse_iterator</a>;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">using</span> _Base::_M_allocate;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">using</span> _Base::_M_deallocate;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">using</span> _Base::_M_impl;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">using</span> _Base::_M_get_Tp_allocator;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// [23.2.4.1] construct/copy/destroy</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="comment">// (assign() and get_allocator() are also listed in this section)</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"></span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> /**</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> * @brief Creates a %vector with no elements.</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> */</span></div><div class="line"><a name="l00253"></a><span class="lineno"><a class="line" href="a06825.html#a67a4f190d61c7b35fa951357cf96a10f"> 253</a></span>  <a class="code" href="a06825.html#a67a4f190d61c7b35fa951357cf96a10f">vector</a>()</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  noexcept(is_nothrow_default_constructible<_Alloc>::value)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  : _Base() { }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"></span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> /**</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * @brief Creates a %vector with no elements.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> */</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00264"></a><span class="lineno"><a class="line" href="a06825.html#ab6d52bbbf36c0b4c6a61075ae2b87654"> 264</a></span>  <a class="code" href="a06825.html#ab6d52bbbf36c0b4c6a61075ae2b87654">vector</a>(<span class="keyword">const</span> allocator_type& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  : _Base(__a) { }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> /**</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> * @brief Creates a %vector with default constructed elements.</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> *</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> * This constructor fills the %vector with @a __n default</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> * constructed elements.</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> */</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="a06825.html#a6b8074967f8051c5fbcbe5c7057775ec"> 277</a></span>  <a class="code" href="a06825.html#a6b8074967f8051c5fbcbe5c7057775ec">vector</a>(size_type __n, <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  : _Base(__n, __a)</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  { _M_default_initialize(__n); }</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"></span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> /**</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"> * @brief Creates a %vector with copies of an exemplar element.</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"> * @param __value An element to copy.</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> *</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> * This constructor fills the %vector with @a __n copies of @a __value.</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"> */</span></div><div class="line"><a name="l00289"></a><span class="lineno"><a class="line" href="a06825.html#a501b56f5a3b8558587ca1be9029e1de5"> 289</a></span>  <a class="code" href="a06825.html#a501b56f5a3b8558587ca1be9029e1de5">vector</a>(size_type __n, <span class="keyword">const</span> value_type& __value,</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  : _Base(__n, __a)</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  { _M_fill_initialize(__n, __value); }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> /**</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> * @brief Creates a %vector with copies of an exemplar element.</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> * @param __value An element to copy.</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"> *</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"> * This constructor fills the %vector with @a __n copies of @a __value.</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> */</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <a class="code" href="a06825.html">vector</a>(size_type __n, <span class="keyword">const</span> value_type& __value = value_type(),</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  : _Base(__n, __a)</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  { _M_fill_initialize(__n, __value); }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"></span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> /**</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> * @brief %Vector copy constructor.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> * @param __x A %vector of identical element and allocator types.</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> *</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> * The newly-created %vector uses a copy of the allocation</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> * object used by @a __x. All the elements of @a __x are copied,</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> * but any extra memory in</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> * @a __x (for fast expansion) will not be copied.</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> */</span></div><div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="a06825.html#a002b00e3596af506a260bd957bee0212"> 318</a></span>  <a class="code" href="a06825.html#a002b00e3596af506a260bd957bee0212">vector</a>(<span class="keyword">const</span> <a class="code" href="a06825.html">vector</a>& __x)</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  : _Base(__x.size(),</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  _Alloc_traits::_S_select_on_copy(__x._M_get_Tp_allocator()))</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  { this->_M_impl._M_finish =</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  std::__uninitialized_copy_a(__x.<a class="code" href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __x.<a class="code" href="a06825.html#ae957699b810eb3313916800773e103d7">end</a>(),</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"> /**</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment"> * @brief %Vector move constructor.</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment"> * @param __x A %vector of identical element and allocator types.</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment"> *</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"> * The newly-created %vector contains the exact contents of @a __x.</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"> * The contents of @a __x are a valid, but unspecified %vector.</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> */</span></div><div class="line"><a name="l00335"></a><span class="lineno"><a class="line" href="a06825.html#a928812d75ac8e43de2346603cfef2d4b"> 335</a></span>  <a class="code" href="a06825.html#a928812d75ac8e43de2346603cfef2d4b">vector</a>(<a class="code" href="a06825.html">vector</a>&& __x) noexcept</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  : _Base(std::move(__x)) { }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"></span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> /// Copy constructor with alternative allocator</span></div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="a06825.html#a325e3dbc4cd5c50fbfa108ff9e1a9bb9"> 339</a></span> <span class="comment"></span> <a class="code" href="a06825.html#a325e3dbc4cd5c50fbfa108ff9e1a9bb9">vector</a>(<span class="keyword">const</span> <a class="code" href="a06825.html">vector</a>& __x, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  : _Base(__x.size(), __a)</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  { this->_M_impl._M_finish =</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  std::__uninitialized_copy_a(__x.<a class="code" href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __x.<a class="code" href="a06825.html#ae957699b810eb3313916800773e103d7">end</a>(),</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"></span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="comment"> /// Move constructor with alternative allocator</span></div><div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="a06825.html#affbc2a0599ddf5a0e87475e4e65775a0"> 348</a></span> <span class="comment"></span> <a class="code" href="a06825.html#affbc2a0599ddf5a0e87475e4e65775a0">vector</a>(<a class="code" href="a06825.html">vector</a>&& __rv, <span class="keyword">const</span> allocator_type& __m)</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  noexcept(_Alloc_traits::_S_always_equal())</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  : _Base(<a class="code" href="a01487.html">std</a>::move(__rv), __m)</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  {</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (__rv.get_allocator() != __m)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  std::__uninitialized_move_a(__rv.begin(), __rv.end(),</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  __rv.clear();</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"></span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> /**</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> * @brief Builds a %vector from an initializer list.</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> *</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"> * Create a %vector consisting of copies of the elements in the</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"> * initializer_list @a __l.</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> *</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"> * This will call the element type's copy constructor N times</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment"> * (where N is @a __l.size()) and do no memory reallocation.</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment"> */</span></div><div class="line"><a name="l00373"></a><span class="lineno"><a class="line" href="a06825.html#a010e6e6c437a7eb67dae7c052790cf94"> 373</a></span>  <a class="code" href="a06825.html#a010e6e6c437a7eb67dae7c052790cf94">vector</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  : _Base(__a)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  _M_range_initialize(__l.begin(), __l.end(),</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <a class="code" href="a06601.html">random_access_iterator_tag</a>());</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"></span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> /**</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> * @brief Builds a %vector from a range.</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> *</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> * Create a %vector consisting of copies of the elements from</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> * [first,last).</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> *</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> * If the iterators are forward, bidirectional, or</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> * random-access, then this will call the elements' copy</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> * constructor N times (where N is distance(first,last)) and do</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> * no memory reallocation. But if only input iterators are</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> * used, then this will do at most 2N calls to the copy</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> * constructor, and logN memory reallocations.</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"> */</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l00401"></a><span class="lineno"><a class="line" href="a06825.html#a8d611ffc7e37ca37dff8acabba2897a5"> 401</a></span>  <a class="code" href="a06825.html#a8d611ffc7e37ca37dff8acabba2897a5">vector</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  : _Base(__a)</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  { _M_initialize_dispatch(__first, __last, __false_type()); }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <a class="code" href="a06825.html">vector</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  : _Base(__a)</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  {</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  _M_initialize_dispatch(__first, __last, _Integral());</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"></span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> /**</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> * The dtor only erases the elements, and note that if the</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> * elements themselves are pointers, the pointed-to memory is</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment"> * not touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"> */</span></div><div class="line"><a name="l00423"></a><span class="lineno"><a class="line" href="a06825.html#a71ef09bb9b5003131ec404461fbdfa13"> 423</a></span>  <a class="code" href="a06825.html#a71ef09bb9b5003131ec404461fbdfa13">~vector</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  { <a class="code" href="a01487.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  _M_get_Tp_allocator()); }</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"></span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> /**</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> * @brief %Vector assignment operator.</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> * @param __x A %vector of identical element and allocator types.</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> *</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> * All the elements of @a __x are copied, but any extra memory in</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> * @a __x (for fast expansion) will not be copied. Unlike the</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> * copy constructor, the allocator object is not copied.</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> */</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <a class="code" href="a06825.html">vector</a>&</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  operator=(<span class="keyword">const</span> <a class="code" href="a06825.html">vector</a>& __x);</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> /**</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> * @brief %Vector move assignment operator.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> * @param __x A %vector of identical element and allocator types.</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> *</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"> * The contents of @a __x are moved into this %vector (without copying,</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> * if the allocators permit it).</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> * @a __x is a valid, but unspecified %vector.</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> */</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <a class="code" href="a06825.html">vector</a>&</div><div class="line"><a name="l00448"></a><span class="lineno"><a class="line" href="a06825.html#a3bcd2b28b84df51df419171868014a84"> 448</a></span>  <a class="code" href="a06825.html#a3bcd2b28b84df51df419171868014a84">operator=</a>(<a class="code" href="a06825.html">vector</a>&& __x) noexcept(_Alloc_traits::_S_nothrow_move())</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  constexpr <span class="keywordtype">bool</span> __move_storage =</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  _Alloc_traits::_S_propagate_on_move_assign()</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  || _Alloc_traits::_S_always_equal();</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  _M_move_assign(std::move(__x),</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="a03485.html">integral_constant<bool, __move_storage></a>());</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"></span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> /**</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> * @brief %Vector list assignment operator.</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> *</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> * This function fills a %vector with copies of the elements in the</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> * initializer list @a __l.</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> *</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> * Note that the assignment completely changes the %vector and</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> * that the resulting %vector's size is the same as the number</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> * of elements assigned. Old data may be lost.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment"> */</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <a class="code" href="a06825.html">vector</a>&</div><div class="line"><a name="l00470"></a><span class="lineno"><a class="line" href="a06825.html#a5badc45ac5ba40fafcbb6ec5a0b8a745"> 470</a></span>  <a class="code" href="a06825.html#a5badc45ac5ba40fafcbb6ec5a0b8a745">operator=</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  this->assign(__l.begin(), __l.end());</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment"></span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="comment"> /**</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="comment"> * @brief Assigns a given value to a %vector.</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="comment"> * @param __n Number of elements to be assigned.</span></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="comment"> * @param __val Value to be assigned.</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="comment"> *</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="comment"> * This function fills a %vector with @a __n copies of the given</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="comment"> * value. Note that the assignment completely changes the</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment"> * %vector and that the resulting %vector's size is the same as</span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="comment"> * the number of elements assigned. Old data may be lost.</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment"> */</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00488"></a><span class="lineno"><a class="line" href="a06825.html#a943d35baf02f390b9870351f0f78c1d7"> 488</a></span>  <a class="code" href="a06825.html#a943d35baf02f390b9870351f0f78c1d7">assign</a>(size_type __n, <span class="keyword">const</span> value_type& __val)</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  { _M_fill_assign(__n, __val); }</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment"></span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment"> /**</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="comment"> * @brief Assigns a range to a %vector.</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="comment"> *</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment"> * This function fills a %vector with copies of the elements in the</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"> * range [__first,__last).</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="comment"> *</span></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="comment"> * Note that the assignment completely changes the %vector and</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> <span class="comment"> * that the resulting %vector's size is the same as the number</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="comment"> * of elements assigned. Old data may be lost.</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> <span class="comment"> */</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00507"></a><span class="lineno"><a class="line" href="a06825.html#acaab0c546279a999bcba3ed54478c83d"> 507</a></span>  <a class="code" href="a06825.html#acaab0c546279a999bcba3ed54478c83d">assign</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  { _M_assign_dispatch(__first, __last, __false_type()); }</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  assign(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  _M_assign_dispatch(__first, __last, _Integral());</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  }</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment"> /**</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment"> * @brief Assigns an initializer list to a %vector.</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment"> *</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> * This function fills a %vector with copies of the elements in the</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> * initializer list @a __l.</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> *</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> * Note that the assignment completely changes the %vector and</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> * that the resulting %vector's size is the same as the number</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> * of elements assigned. Old data may be lost.</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> */</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00533"></a><span class="lineno"><a class="line" href="a06825.html#acda096d477c2ef09ee0b3e7fb3ca558c"> 533</a></span>  <a class="code" href="a06825.html#acda096d477c2ef09ee0b3e7fb3ca558c">assign</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  { this->assign(__l.begin(), __l.end()); }</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"></span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> /// Get a copy of the memory allocation object.</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"></span> <span class="keyword">using</span> _Base::get_allocator;</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// iterators</span><span class="comment"></span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> /**</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> * Returns a read/write iterator that points to the first</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"> * element in the %vector. Iteration is done in ordinary</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment"> */</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  iterator</div><div class="line"><a name="l00547"></a><span class="lineno"><a class="line" href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1"> 547</a></span>  <a class="code" href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  { <span class="keywordflow">return</span> iterator(this->_M_impl._M_start); }</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"></span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> /**</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> * first element in the %vector. Iteration is done in ordinary</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"> */</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  const_iterator</div><div class="line"><a name="l00556"></a><span class="lineno"><a class="line" href="a06825.html#a8ecd17bf8b6b1b1ddbdb045e0553ba75"> 556</a></span>  <a class="code" href="a06825.html#a8ecd17bf8b6b1b1ddbdb045e0553ba75">begin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  { <span class="keywordflow">return</span> const_iterator(this->_M_impl._M_start); }</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment"></span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"> /**</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="comment"> * Returns a read/write iterator that points one past the last</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"> * element in the %vector. Iteration is done in ordinary</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> */</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  iterator</div><div class="line"><a name="l00565"></a><span class="lineno"><a class="line" href="a06825.html#ae957699b810eb3313916800773e103d7"> 565</a></span>  <a class="code" href="a06825.html#ae957699b810eb3313916800773e103d7">end</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  { <span class="keywordflow">return</span> iterator(this->_M_impl._M_finish); }</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"></span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> /**</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> * the last element in the %vector. Iteration is done in</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> * ordinary element order.</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> */</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  const_iterator</div><div class="line"><a name="l00574"></a><span class="lineno"><a class="line" href="a06825.html#ae3d969a640523603b2c51341c975b30c"> 574</a></span>  <a class="code" href="a06825.html#ae3d969a640523603b2c51341c975b30c">end</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  { <span class="keywordflow">return</span> const_iterator(this->_M_impl._M_finish); }</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment"></span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> /**</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"> * Returns a read/write reverse iterator that points to the</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment"> * last element in the %vector. Iteration is done in reverse</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment"> */</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  reverse_iterator</div><div class="line"><a name="l00583"></a><span class="lineno"><a class="line" href="a06825.html#a20e5ca3edaf43348d346614730c8b637"> 583</a></span>  <a class="code" href="a06825.html#a20e5ca3edaf43348d346614730c8b637">rbegin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  { <span class="keywordflow">return</span> reverse_iterator(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>()); }</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment"></span></div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment"> /**</span></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> <span class="comment"> * to the last element in the %vector. Iteration is done in</span></div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="comment"> * reverse element order.</span></div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment"> */</span></div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  const_reverse_iterator</div><div class="line"><a name="l00592"></a><span class="lineno"><a class="line" href="a06825.html#ac1f157333783a401dd4a0c23edaddf1c"> 592</a></span>  <a class="code" href="a06825.html#ac1f157333783a401dd4a0c23edaddf1c">rbegin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  { <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>()); }</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment"></span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"> /**</span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"> * Returns a read/write reverse iterator that points to one</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> * before the first element in the %vector. Iteration is done</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment"> * in reverse element order.</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> */</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  reverse_iterator</div><div class="line"><a name="l00601"></a><span class="lineno"><a class="line" href="a06825.html#a52d47db7d19a815e22d1cefdfa94d93c"> 601</a></span>  <a class="code" href="a06825.html#a52d47db7d19a815e22d1cefdfa94d93c">rend</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  { <span class="keywordflow">return</span> reverse_iterator(<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>()); }</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"></span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> /**</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * to one before the first element in the %vector. Iteration</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * is done in reverse element order.</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> */</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  const_reverse_iterator</div><div class="line"><a name="l00610"></a><span class="lineno"><a class="line" href="a06825.html#aa32a4b05a4c404e012c787360d7518a8"> 610</a></span>  <a class="code" href="a06825.html#aa32a4b05a4c404e012c787360d7518a8">rend</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  { <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>()); }</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> </div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> /**</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment"> * first element in the %vector. Iteration is done in ordinary</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment"> */</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  const_iterator</div><div class="line"><a name="l00620"></a><span class="lineno"><a class="line" href="a06825.html#aa5ce64abecf486fbdb7914ae9734d289"> 620</a></span>  <a class="code" href="a06825.html#aa5ce64abecf486fbdb7914ae9734d289">cbegin</a>() const noexcept</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  { <span class="keywordflow">return</span> const_iterator(this->_M_impl._M_start); }</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment"></span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment"> /**</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment"> * the last element in the %vector. Iteration is done in</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment"> * ordinary element order.</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> <span class="comment"> */</span></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  const_iterator</div><div class="line"><a name="l00629"></a><span class="lineno"><a class="line" href="a06825.html#aae7e855d48dc6fc90c9f746d2098c263"> 629</a></span>  <a class="code" href="a06825.html#aae7e855d48dc6fc90c9f746d2098c263">cend</a>() const noexcept</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  { <span class="keywordflow">return</span> const_iterator(this->_M_impl._M_finish); }</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment"></span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment"> /**</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment"> * to the last element in the %vector. Iteration is done in</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"> * reverse element order.</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="comment"> */</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  const_reverse_iterator</div><div class="line"><a name="l00638"></a><span class="lineno"><a class="line" href="a06825.html#a30f4698eae082ffd64ed80c8cb648360"> 638</a></span>  <a class="code" href="a06825.html#a30f4698eae082ffd64ed80c8cb648360">crbegin</a>() const noexcept</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  { <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>()); }</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"></span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> /**</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * to one before the first element in the %vector. Iteration</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * is done in reverse element order.</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> */</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  const_reverse_iterator</div><div class="line"><a name="l00647"></a><span class="lineno"><a class="line" href="a06825.html#a825800ea90d4e7367b5361ae53f864c7"> 647</a></span>  <a class="code" href="a06825.html#a825800ea90d4e7367b5361ae53f864c7">crend</a>() const noexcept</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  { <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>()); }</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> </div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// [23.2.4.2] capacity</span><span class="comment"></span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment"> /** Returns the number of elements in the %vector. */</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  size_type</div><div class="line"><a name="l00654"></a><span class="lineno"><a class="line" href="a06825.html#aedc1ee21f6ca2b8304b4f1f430125c8d"> 654</a></span>  <a class="code" href="a06825.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  { <span class="keywordflow">return</span> size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="comment"></span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="comment"> /** Returns the size() of the largest possible %vector. */</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  size_type</div><div class="line"><a name="l00659"></a><span class="lineno"><a class="line" href="a06825.html#a7abf19c35e087a2d4596f651e340fb89"> 659</a></span>  <a class="code" href="a06825.html#a7abf19c35e087a2d4596f651e340fb89">max_size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  { <span class="keywordflow">return</span> _Alloc_traits::max_size(_M_get_Tp_allocator()); }</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> </div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment"> /**</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="comment"> * @brief Resizes the %vector to the specified number of elements.</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="comment"> * @param __new_size Number of elements the %vector should contain.</span></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="comment"> *</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> <span class="comment"> * This function will %resize the %vector to the specified</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> <span class="comment"> * number of elements. If the number is smaller than the</span></div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="comment"> * %vector's current size the %vector is truncated, otherwise</span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="comment"> * default constructed elements are appended.</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"> */</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00673"></a><span class="lineno"><a class="line" href="a06825.html#a1134bcc83ff6c70cf78bab3cd426feaf"> 673</a></span>  <a class="code" href="a06825.html#a1134bcc83ff6c70cf78bab3cd426feaf">resize</a>(size_type __new_size)</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  {</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">if</span> (__new_size > size())</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  _M_default_append(__new_size - size());</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__new_size < size())</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  _M_erase_at_end(this->_M_impl._M_start + __new_size);</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  }</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"></span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment"> /**</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment"> * @brief Resizes the %vector to the specified number of elements.</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="comment"> * @param __new_size Number of elements the %vector should contain.</span></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> <span class="comment"> * @param __x Data with which new elements should be populated.</span></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span> <span class="comment"> *</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> <span class="comment"> * This function will %resize the %vector to the specified</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> <span class="comment"> * number of elements. If the number is smaller than the</span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span> <span class="comment"> * %vector's current size the %vector is truncated, otherwise</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> <span class="comment"> * the %vector is extended and new elements are populated with</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="comment"> * given data.</span></div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="comment"> */</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00693"></a><span class="lineno"><a class="line" href="a06825.html#a53e627a12d33d2df15d4a9c25c872785"> 693</a></span>  <a class="code" href="a06825.html#a53e627a12d33d2df15d4a9c25c872785">resize</a>(size_type __new_size, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  {</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">if</span> (__new_size > size())</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  insert(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __new_size - size(), __x);</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__new_size < size())</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  _M_erase_at_end(this->_M_impl._M_start + __new_size);</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  }</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> /**</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"> * @brief Resizes the %vector to the specified number of elements.</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> * @param __new_size Number of elements the %vector should contain.</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="comment"> * @param __x Data with which new elements should be populated.</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="comment"> *</span></div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="comment"> * This function will %resize the %vector to the specified</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="comment"> * number of elements. If the number is smaller than the</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="comment"> * %vector's current size the %vector is truncated, otherwise</span></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment"> * the %vector is extended and new elements are populated with</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> * given data.</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> */</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  resize(size_type __new_size, value_type __x = value_type())</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  {</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">if</span> (__new_size > size())</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  insert(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __new_size - size(), __x);</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__new_size < size())</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  _M_erase_at_end(this->_M_impl._M_start + __new_size);</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> </div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment"> /** A non-binding request to reduce capacity() to size(). */</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00725"></a><span class="lineno"><a class="line" href="a06825.html#a4f4dc31fc105124cd9a5e4a90ae99c44"> 725</a></span>  <a class="code" href="a06825.html#a4f4dc31fc105124cd9a5e4a90ae99c44">shrink_to_fit</a>()</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  { _M_shrink_to_fit(); }</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment"></span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span> <span class="comment"> /**</span></div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> <span class="comment"> * Returns the total number of elements that the %vector can</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="comment"> * hold before needing to allocate more memory.</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"> */</span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  size_type</div><div class="line"><a name="l00734"></a><span class="lineno"><a class="line" href="a06825.html#aeec23a5238eb60cd3bb5ec960e9b430e"> 734</a></span>  <a class="code" href="a06825.html#aeec23a5238eb60cd3bb5ec960e9b430e">capacity</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  { <span class="keywordflow">return</span> size_type(this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  - this->_M_impl._M_start); }</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"></span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> /**</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"> * Returns true if the %vector is empty. (Thus begin() would</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> * equal end().)</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> */</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00743"></a><span class="lineno"><a class="line" href="a06825.html#a2c527667d502c53e377b49b8c1ce4214"> 743</a></span>  <a class="code" href="a06825.html#a2c527667d502c53e377b49b8c1ce4214">empty</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  { <span class="keywordflow">return</span> <a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() == <a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>(); }</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="comment"></span></div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="comment"> /**</span></div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="comment"> * @brief Attempt to preallocate enough memory for specified number of</span></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="comment"> * elements.</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> <span class="comment"> * @param __n Number of elements required.</span></div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> <span class="comment"> * @throw std::length_error If @a n exceeds @c max_size().</span></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment"> *</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment"> * This function attempts to reserve enough memory for the</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"> * %vector to hold the specified number of elements. If the</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="comment"> * number requested is more than max_size(), length_error is</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment"> * thrown.</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="comment"> *</span></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment"> * The advantage of this function is that if optimal code is a</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> * necessity and the user can determine the number of elements</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"> * that will be required, the user can reserve the memory in</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"> * %advance, and thus prevent a possible reallocation of memory</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"> * and copying of %vector data.</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> */</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  reserve(size_type __n);</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> </div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// element access</span><span class="comment"></span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment"> /**</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment"> * @brief Subscript access to the data contained in the %vector.</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> * @return Read/write reference to data.</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> *</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * This operator allows for easy, array-style, data access.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> * Note that data access with this operator is unchecked and</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> <span class="comment"> * out_of_range lookups are not defined. (For checked lookups</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="comment"> * see at().)</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="comment"> */</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  reference</div><div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="a06825.html#afdb93693c1129f8f23406e8a9f4dc27e"> 779</a></span>  <a class="code" href="a06825.html#afdb93693c1129f8f23406e8a9f4dc27e">operator[]</a>(size_type __n) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  { <span class="keywordflow">return</span> *(this->_M_impl._M_start + __n); }</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> <span class="comment"></span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="comment"> /**</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="comment"> * @brief Subscript access to the data contained in the %vector.</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> <span class="comment"> * @return Read-only (constant) reference to data.</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="comment"> *</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> <span class="comment"> * This operator allows for easy, array-style, data access.</span></div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="comment"> * Note that data access with this operator is unchecked and</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span> <span class="comment"> * out_of_range lookups are not defined. (For checked lookups</span></div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> <span class="comment"> * see at().)</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span> <span class="comment"> */</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  const_reference</div><div class="line"><a name="l00794"></a><span class="lineno"><a class="line" href="a06825.html#a75bd59d9586be7f6d3e43e1afeac3d08"> 794</a></span>  <a class="code" href="a06825.html#a75bd59d9586be7f6d3e43e1afeac3d08">operator[]</a>(size_type __n) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  { <span class="keywordflow">return</span> *(this->_M_impl._M_start + __n); }</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> </div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keyword">protected</span>:<span class="comment"></span></div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="comment"> /// Safety check used only from at().</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="comment"></span> <span class="keywordtype">void</span></div><div class="line"><a name="l00800"></a><span class="lineno"><a class="line" href="a06825.html#a84c7c47a337f0e2dfbdad2c5719c13f5"> 800</a></span>  <a class="code" href="a06825.html#a84c7c47a337f0e2dfbdad2c5719c13f5">_M_range_check</a>(size_type __n)<span class="keyword"> const</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">if</span> (__n >= this->size())</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  __throw_out_of_range_fmt(__N(<span class="stringliteral">"vector::_M_range_check: __n "</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="stringliteral">"(which is %zu) >= this->size() "</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="stringliteral">"(which is %zu)"</span>),</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  __n, this->size());</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  }</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> </div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> <span class="comment"> /**</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> <span class="comment"> * @brief Provides access to the data contained in the %vector.</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment"> * @return Read/write reference to data.</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="comment"> * @throw std::out_of_range If @a __n is an invalid index.</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment"> *</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment"> * This function provides for safer data access. The parameter</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <span class="comment"> * is first checked that it is in the range of the vector. The</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> <span class="comment"> * function throws out_of_range if the check fails.</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="comment"> */</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  reference</div><div class="line"><a name="l00822"></a><span class="lineno"><a class="line" href="a06825.html#a11362894b61f87331541b5268d0cb033"> 822</a></span>  <a class="code" href="a06825.html#a11362894b61f87331541b5268d0cb033">at</a>(size_type __n)</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  {</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  _M_range_check(__n);</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">return</span> (*<span class="keyword">this</span>)[__n]; </div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  }</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> <span class="comment"></span></div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment"> /**</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment"> * @brief Provides access to the data contained in the %vector.</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="comment"> * @return Read-only (constant) reference to data.</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment"> * @throw std::out_of_range If @a __n is an invalid index.</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"> *</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> <span class="comment"> * This function provides for safer data access. The parameter</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="comment"> * is first checked that it is in the range of the vector. The</span></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment"> * function throws out_of_range if the check fails.</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> <span class="comment"> */</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  const_reference</div><div class="line"><a name="l00840"></a><span class="lineno"><a class="line" href="a06825.html#aaa0004f67abf317a8923d549a0e74987"> 840</a></span>  <a class="code" href="a06825.html#aaa0004f67abf317a8923d549a0e74987">at</a>(size_type __n)<span class="keyword"> const</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  _M_range_check(__n);</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">return</span> (*<span class="keyword">this</span>)[__n];</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  }</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="comment"></span></div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="comment"> /**</span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span> <span class="comment"> * Returns a read/write reference to the data at the first</span></div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> <span class="comment"> * element of the %vector.</span></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="comment"> */</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  reference</div><div class="line"><a name="l00851"></a><span class="lineno"><a class="line" href="a06825.html#a460e9d810eb0009f44d8584662672a6b"> 851</a></span>  <a class="code" href="a06825.html#a460e9d810eb0009f44d8584662672a6b">front</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  { <span class="keywordflow">return</span> *<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(); }</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="comment"></span></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="comment"> /**</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the first</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span> <span class="comment"> * element of the %vector.</span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span> <span class="comment"> */</span></div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  const_reference</div><div class="line"><a name="l00859"></a><span class="lineno"><a class="line" href="a06825.html#a1a3f9b081e24c3932472aff316308554"> 859</a></span>  <a class="code" href="a06825.html#a1a3f9b081e24c3932472aff316308554">front</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  { <span class="keywordflow">return</span> *<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(); }</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span> <span class="comment"></span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> <span class="comment"> /**</span></div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> <span class="comment"> * Returns a read/write reference to the data at the last</span></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> <span class="comment"> * element of the %vector.</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> <span class="comment"> */</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  reference</div><div class="line"><a name="l00867"></a><span class="lineno"><a class="line" href="a06825.html#ac7c4da8f17ac32164def63407dec54cb"> 867</a></span>  <a class="code" href="a06825.html#ac7c4da8f17ac32164def63407dec54cb">back</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  { <span class="keywordflow">return</span> *(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>() - 1); }</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="comment"></span></div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span> <span class="comment"> /**</span></div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="comment"> * last element of the %vector.</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> <span class="comment"> */</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  const_reference</div><div class="line"><a name="l00875"></a><span class="lineno"><a class="line" href="a06825.html#ad185eab26722975ac46eb977c7b2627b"> 875</a></span>  <a class="code" href="a06825.html#ad185eab26722975ac46eb977c7b2627b">back</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  { <span class="keywordflow">return</span> *(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>() - 1); }</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> </div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="comment">// DR 464. Suggestion for new member functions in standard containers.</span></div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="comment">// data access</span><span class="comment"></span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span> <span class="comment"> /**</span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> <span class="comment"> * Returns a pointer such that [data(), data() + size()) is a valid</span></div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> <span class="comment"> * range. For a non-empty %vector, data() == &front().</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="comment"> */</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  _Tp*</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  pointer</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00890"></a><span class="lineno"><a class="line" href="a06825.html#abee0514d69c004f06f06e37e33b6104b"> 890</a></span>  <a class="code" href="a06825.html#abee0514d69c004f06f06e37e33b6104b">data</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  { <span class="keywordflow">return</span> _M_data_ptr(this->_M_impl._M_start); }</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span> </div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">const</span> _Tp*</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  const_pointer</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  data() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  { <span class="keywordflow">return</span> _M_data_ptr(this->_M_impl._M_start); }</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> </div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// [23.2.4.3] modifiers</span><span class="comment"></span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="comment"> /**</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="comment"> * @brief Add data to the end of the %vector.</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> <span class="comment"> *</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> <span class="comment"> * This is a typical stack operation. The function creates an</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> <span class="comment"> * element at the end of the %vector and assigns the given data</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> <span class="comment"> * to it. Due to the nature of a %vector this operation can be</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> * done in constant time if the %vector has preallocated space</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"> * available.</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> */</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00913"></a><span class="lineno"><a class="line" href="a06825.html#a6f2144e852790296d3c62cdec92c95ce"> 913</a></span>  <a class="code" href="a06825.html#a6f2144e852790296d3c62cdec92c95ce">push_back</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  {</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  {</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  __x);</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  _M_emplace_back_aux(__x);</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  _M_insert_aux(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __x);</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  }</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> </div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  push_back(value_type&& __x)</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  { emplace_back(std::move(__x)); }</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> </div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  emplace_back(_Args&&... __args);</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="comment"></span></div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="comment"> /**</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="comment"> * @brief Removes last element.</span></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="comment"> *</span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <span class="comment"> * This is a typical stack operation. It shrinks the %vector by one.</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> <span class="comment"> *</span></div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> <span class="comment"> * Note that no data is returned, and if the last element's</span></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> <span class="comment"> * data is needed, it should be retrieved before pop_back() is</span></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> <span class="comment"> * called.</span></div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span> <span class="comment"> */</span></div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00949"></a><span class="lineno"><a class="line" href="a06825.html#a99e26d28529b0d7e6dfc3aff0400e8bd"> 949</a></span>  <a class="code" href="a06825.html#a99e26d28529b0d7e6dfc3aff0400e8bd">pop_back</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  {</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  --this->_M_impl._M_finish;</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  }</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> </div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="comment"> /**</span></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> <span class="comment"> * @brief Inserts an object in %vector before specified iterator.</span></div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="comment"> * @param __position A const_iterator into the %vector.</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="comment"> * @param __args Arguments.</span></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span> <span class="comment"> *</span></div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> <span class="comment"> * This function will insert an object of type T constructed</span></div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span> <span class="comment"> * with T(std::forward<Args>(args)...) before the specified location.</span></div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="comment"> * Note that this kind of operation could be expensive for a %vector</span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="comment"> * and if it is frequently used the user should consider using</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="comment"> * std::list.</span></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="comment"> */</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  iterator</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  emplace(const_iterator __position, _Args&&... __args);</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"></span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="comment"> /**</span></div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="comment"> * @brief Inserts given value into %vector before specified iterator.</span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"> * @param __position A const_iterator into the %vector.</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"> *</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> * This function will insert a copy of the given value before</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"> * the specified location. Note that this kind of operation</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> <span class="comment"> * could be expensive for a %vector and if it is frequently</span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment"> * used the user should consider using std::list.</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment"> */</span></div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  iterator</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  insert(const_iterator __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment"> /**</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="comment"> * @brief Inserts given value into %vector before specified iterator.</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="comment"> * @param __position An iterator into the %vector.</span></div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="comment"> *</span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> <span class="comment"> * This function will insert a copy of the given value before</span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> <span class="comment"> * the specified location. Note that this kind of operation</span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> <span class="comment"> * could be expensive for a %vector and if it is frequently</span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="comment"> * used the user should consider using std::list.</span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"> */</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  iterator</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  insert(iterator __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> </div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> <span class="comment"> /**</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> <span class="comment"> * @brief Inserts given rvalue into %vector before specified iterator.</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> <span class="comment"> * @param __position A const_iterator into the %vector.</span></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="comment"> *</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> <span class="comment"> * This function will insert a copy of the given rvalue before</span></div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> <span class="comment"> * the specified location. Note that this kind of operation</span></div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> <span class="comment"> * could be expensive for a %vector and if it is frequently</span></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> <span class="comment"> * used the user should consider using std::list.</span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> <span class="comment"> */</span></div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  iterator</div><div class="line"><a name="l01014"></a><span class="lineno"><a class="line" href="a06825.html#a84793dbae69ddcd84cc26199e6a9e898"> 1014</a></span>  <a class="code" href="a06825.html#a84793dbae69ddcd84cc26199e6a9e898">insert</a>(const_iterator __position, value_type&& __x)</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  { <span class="keywordflow">return</span> emplace(__position, std::move(__x)); }</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> <span class="comment"></span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> <span class="comment"> /**</span></div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> <span class="comment"> * @brief Inserts an initializer_list into the %vector.</span></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> <span class="comment"> * @param __position An iterator into the %vector.</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="comment"> *</span></div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> <span class="comment"> * This function will insert copies of the data in the </span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment"> * initializer_list @a l into the %vector before the location</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="comment"> * specified by @a position.</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="comment"> *</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="comment"> * Note that this kind of operation could be expensive for a</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="comment"> * %vector and if it is frequently used the user should</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment"> * consider using std::list.</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment"> */</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  iterator</div><div class="line"><a name="l01031"></a><span class="lineno"><a class="line" href="a06825.html#a1a1db200194fca60d689aacce652d616"> 1031</a></span>  <a class="code" href="a06825.html#a1a1db200194fca60d689aacce652d616">insert</a>(const_iterator __position, <a class="code" href="a01601.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  { <span class="keywordflow">return</span> this->insert(__position, __l.begin(), __l.end()); }</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> </div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="comment"> /**</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="comment"> * @brief Inserts a number of copies of given data into the %vector.</span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> <span class="comment"> * @param __position A const_iterator into the %vector.</span></div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> <span class="comment"> * @param __n Number of elements to be inserted.</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> <span class="comment"> *</span></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span> <span class="comment"> * This function will insert a specified number of copies of</span></div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span> <span class="comment"> * the given data before the location specified by @a position.</span></div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> <span class="comment"> *</span></div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> <span class="comment"> * Note that this kind of operation could be expensive for a</span></div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> <span class="comment"> * %vector and if it is frequently used the user should</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> <span class="comment"> * consider using std::list.</span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> <span class="comment"> */</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  iterator</div><div class="line"><a name="l01051"></a><span class="lineno"><a class="line" href="a06825.html#a4922c571c2d3e9006f68813656f36587"> 1051</a></span>  <a class="code" href="a06825.html#a4922c571c2d3e9006f68813656f36587">insert</a>(const_iterator __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  {</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  difference_type __offset = __position - <a class="code" href="a01487.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>();</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  _M_fill_insert(<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __offset, __n, __x);</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">return</span> <a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __offset;</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  }</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="comment"> /**</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="comment"> * @brief Inserts a number of copies of given data into the %vector.</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> <span class="comment"> * @param __position An iterator into the %vector.</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="comment"> * @param __n Number of elements to be inserted.</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="comment"> *</span></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> <span class="comment"> * This function will insert a specified number of copies of</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="comment"> * the given data before the location specified by @a position.</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="comment"> *</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="comment"> * Note that this kind of operation could be expensive for a</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="comment"> * %vector and if it is frequently used the user should</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> <span class="comment"> * consider using std::list.</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"> */</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  insert(iterator __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  { _M_fill_insert(__position, __n, __x); }</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> </div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> <span class="comment"> /**</span></div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> <span class="comment"> * @brief Inserts a range into the %vector.</span></div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> <span class="comment"> * @param __position A const_iterator into the %vector.</span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="comment"> *</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> <span class="comment"> * This function will insert copies of the data in the range</span></div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> <span class="comment"> * [__first,__last) into the %vector before the location specified</span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> <span class="comment"> * by @a pos.</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> <span class="comment"> *</span></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> <span class="comment"> * Note that this kind of operation could be expensive for a</span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> <span class="comment"> * %vector and if it is frequently used the user should</span></div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="comment"> * consider using std::list.</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="comment"> */</span></div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  iterator</div><div class="line"><a name="l01095"></a><span class="lineno"><a class="line" href="a06825.html#a35cc226f8730266ed04ca5dd0fd3077c"> 1095</a></span>  <a class="code" href="a06825.html#a35cc226f8730266ed04ca5dd0fd3077c">insert</a>(const_iterator __position, _InputIterator __first,</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  _InputIterator __last)</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  {</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  difference_type __offset = __position - <a class="code" href="a01487.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>();</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  _M_insert_dispatch(<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __offset,</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  __first, __last, __false_type());</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">return</span> <a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __offset;</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  }</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="comment"> /**</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="comment"> * @brief Inserts a range into the %vector.</span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <span class="comment"> * @param __position An iterator into the %vector.</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> <span class="comment"> *</span></div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> <span class="comment"> * This function will insert copies of the data in the range</span></div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> <span class="comment"> * [__first,__last) into the %vector before the location specified</span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> <span class="comment"> * by @a pos.</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> <span class="comment"> *</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="comment"> * Note that this kind of operation could be expensive for a</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> <span class="comment"> * %vector and if it is frequently used the user should</span></div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> <span class="comment"> * consider using std::list.</span></div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> <span class="comment"> */</span></div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  insert(iterator __position, _InputIterator __first,</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  _InputIterator __last)</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  {</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  _M_insert_dispatch(__position, __first, __last, _Integral());</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  }</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="comment"></span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span> <span class="comment"> /**</span></div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> <span class="comment"> * @brief Remove element at given position.</span></div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> <span class="comment"> * @param __position Iterator pointing to element to be erased.</span></div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> <span class="comment"> * @return An iterator pointing to the next element (or end()).</span></div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> <span class="comment"> *</span></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span> <span class="comment"> * This function will erase the element at the given position and thus</span></div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> <span class="comment"> * shorten the %vector by one.</span></div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> <span class="comment"> *</span></div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> <span class="comment"> * Note This operation could be expensive and if it is</span></div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span> <span class="comment"> * frequently used the user should consider using std::list.</span></div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> <span class="comment"> * The user is also cautioned that this function only erases</span></div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span> <span class="comment"> * the element, and that if the element is itself a pointer,</span></div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> <span class="comment"> * the pointed-to memory is not touched in any way. Managing</span></div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span> <span class="comment"> * the pointer is the user's responsibility.</span></div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> <span class="comment"> */</span></div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  iterator</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01146"></a><span class="lineno"><a class="line" href="a06825.html#a1c8b8734443a1028d00ad364190bac76"> 1146</a></span>  <a class="code" href="a06825.html#a1c8b8734443a1028d00ad364190bac76">erase</a>(const_iterator __position)</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  { <span class="keywordflow">return</span> _M_erase(<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + (__position - <a class="code" href="a01487.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>())); }</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  erase(iterator __position)</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  { <span class="keywordflow">return</span> _M_erase(__position); }</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> <span class="comment"></span></div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> <span class="comment"> /**</span></div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> <span class="comment"> * @brief Remove a range of elements.</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="comment"> * @param __first Iterator pointing to the first element to be erased.</span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="comment"> * @param __last Iterator pointing to one past the last element to be</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="comment"> * @return An iterator pointing to the element pointed to by @a __last</span></div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="comment"> * prior to erasing (or end()).</span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> <span class="comment"> *</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> <span class="comment"> * This function will erase the elements in the range</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> <span class="comment"> * [__first,__last) and shorten the %vector accordingly.</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> <span class="comment"> *</span></div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="comment"> * Note This operation could be expensive and if it is</span></div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="comment"> * frequently used the user should consider using std::list.</span></div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> <span class="comment"> * The user is also cautioned that this function only erases</span></div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> <span class="comment"> * the elements, and that if the elements themselves are</span></div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> <span class="comment"> * pointers, the pointed-to memory is not touched in any way.</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span> <span class="comment"> * Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> <span class="comment"> */</span></div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  iterator</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01173"></a><span class="lineno"><a class="line" href="a06825.html#aae89e304cceda4179427223add91eebb"> 1173</a></span>  <a class="code" href="a06825.html#aae89e304cceda4179427223add91eebb">erase</a>(const_iterator __first, const_iterator __last)</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  {</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __beg = <a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __cbeg = <a class="code" href="a01487.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>();</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keywordflow">return</span> _M_erase(__beg + (__first - __cbeg), __beg + (__last - __cbeg));</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  erase(iterator __first, iterator __last)</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  { <span class="keywordflow">return</span> _M_erase(__first, __last); }</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> <span class="comment"></span></div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> <span class="comment"> /**</span></div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span> <span class="comment"> * @brief Swaps data with another %vector.</span></div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="comment"> * @param __x A %vector of the same element and allocator types.</span></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span> <span class="comment"> *</span></div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span> <span class="comment"> * This exchanges the elements between two vectors in constant time.</span></div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span> <span class="comment"> * (Three pointers, so it should be quite fast.)</span></div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> <span class="comment"> * std::swap(v1,v2) will feed to this function.</span></div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span> <span class="comment"> */</span></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01194"></a><span class="lineno"><a class="line" href="a06825.html#a00719b69ec3de30de46d095fee951835"> 1194</a></span>  <a class="code" href="a06825.html#a00719b69ec3de30de46d095fee951835">swap</a>(<a class="code" href="a06825.html">vector</a>& __x)</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  noexcept(_Alloc_traits::_S_nothrow_swap())</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  {</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  this->_M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  _Alloc_traits::_S_on_swap(_M_get_Tp_allocator(),</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  __x._M_get_Tp_allocator());</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  }</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> <span class="comment"></span></div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> <span class="comment"> /**</span></div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span> <span class="comment"> * Erases all the elements. Note that this function only erases the</span></div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span> <span class="comment"> * elements, and that if the elements themselves are pointers, the</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="comment"> * pointed-to memory is not touched in any way. Managing the pointer is</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> <span class="comment"> * the user's responsibility.</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="comment"> */</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01211"></a><span class="lineno"><a class="line" href="a06825.html#a57ef261b05f9ea1457d6f54494902e84"> 1211</a></span>  <a class="code" href="a06825.html#a57ef261b05f9ea1457d6f54494902e84">clear</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  { _M_erase_at_end(this->_M_impl._M_start); }</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> </div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="keyword">protected</span>:<span class="comment"></span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="comment"> /**</span></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment"> * Memory expansion handler. Uses the member allocation function to</span></div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="comment"> * obtain @a n bytes of memory, and then copies [first,last) into it.</span></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="comment"> */</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  pointer</div><div class="line"><a name="l01221"></a><span class="lineno"><a class="line" href="a06825.html#a283e72373f613c3d74ccf35b529a8393"> 1221</a></span>  <a class="code" href="a06825.html#a283e72373f613c3d74ccf35b529a8393">_M_allocate_and_copy</a>(size_type __n,</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  _ForwardIterator __first, _ForwardIterator __last)</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  {</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  pointer __result = this->_M_allocate(__n);</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  __try</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  {</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  std::__uninitialized_copy_a(__first, __last, __result,</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  }</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  __catch(...)</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  {</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  _M_deallocate(__result, __n);</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  __throw_exception_again;</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  }</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  }</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span> </div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> </div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="comment">// Internal constructor functions follow.</span></div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> </div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="comment">// Called by the range constructor to implement [23.1.1]/9</span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> </div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  {</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  this->_M_impl._M_start = _M_allocate(static_cast<size_type>(__n));</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  this->_M_impl._M_end_of_storage =</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  this->_M_impl._M_start + <span class="keyword">static_cast<</span>size_type<span class="keyword">></span>(__n);</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  _M_fill_initialize(static_cast<size_type>(__n), __value);</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  }</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> </div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="comment">// Called by the range constructor to implement [23.1.1]/9</span></div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  __false_type)</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  {</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_InputIterator>::</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  iterator_category _IterCategory;</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  _M_range_initialize(__first, __last, _IterCategory());</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span> </div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="comment">// Called by the second initialize_dispatch above</span></div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  _M_range_initialize(_InputIterator __first,</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  _InputIterator __last, <a class="code" href="a06585.html">std::input_iterator_tag</a>)</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  {</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span> #<span class="keywordflow">if</span> __cplusplus >= 201103L</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  emplace_back(*__first);</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  push_back(*__first);</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  }</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> </div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="comment">// Called by the second initialize_dispatch above</span></div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  _M_range_initialize(_ForwardIterator __first,</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  _ForwardIterator __last, <a class="code" href="a06593.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  {</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="keyword">const</span> size_type __n = <a class="code" href="a01487.html#a5852ded2c7147a161b33951ef37ecba8">std::distance</a>(__first, __last);</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  this->_M_impl._M_start = this->_M_allocate(__n);</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  std::__uninitialized_copy_a(__first, __last,</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  this->_M_impl._M_start,</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  }</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> </div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  <span class="comment">// Called by the first initialize_dispatch above and by the</span></div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="comment">// vector(n,value,a) constructor.</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  _M_fill_initialize(size_type __n, <span class="keyword">const</span> value_type& __value)</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  {</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value,</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  }</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> </div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="comment">// Called by the vector(n) constructor.</span></div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  _M_default_initialize(size_type __n)</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  {</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  std::__uninitialized_default_n_a(this->_M_impl._M_start, __n,</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  }</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> </div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="comment">// Internal assign functions follow. The *_aux functions do the actual</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="comment">// assignment work for the range versions.</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> </div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="comment">// Called by the range assign to implement [23.1.1]/9</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> </div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  { _M_fill_assign(__n, __val); }</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> </div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <span class="comment">// Called by the range assign to implement [23.1.1]/9</span></div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  _M_assign_dispatch(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  __false_type)</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  {</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_InputIterator>::</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  iterator_category _IterCategory;</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  _M_assign_aux(__first, __last, _IterCategory());</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  }</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> </div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="comment">// Called by the second assign_dispatch above</span></div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  _M_assign_aux(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <a class="code" href="a06585.html">std::input_iterator_tag</a>);</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span> </div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="comment">// Called by the second assign_dispatch above</span></div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <a class="code" href="a06593.html">std::forward_iterator_tag</a>);</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> </div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="comment">// Called by assign(n,t), and the range assign when it turns out</span></div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="comment">// to be the same thing.</span></div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  _M_fill_assign(size_type __n, <span class="keyword">const</span> value_type& __val);</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span> </div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> </div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="comment">// Internal insert functions follow.</span></div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> </div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="comment">// Called by the range insert to implement [23.1.1]/9</span></div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> </div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  __true_type)</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  { _M_fill_insert(__pos, __n, __val); }</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span> </div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="comment">// Called by the range insert to implement [23.1.1]/9</span></div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  _M_insert_dispatch(iterator __pos, _InputIterator __first,</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  _InputIterator __last, __false_type)</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  {</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_InputIterator>::</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  iterator_category _IterCategory;</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  _M_range_insert(__pos, __first, __last, _IterCategory());</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  }</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span> </div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="comment">// Called by the second insert_dispatch above</span></div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  _M_range_insert(iterator __pos, _InputIterator __first,</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  _InputIterator __last, <a class="code" href="a06585.html">std::input_iterator_tag</a>);</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> </div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="comment">// Called by the second insert_dispatch above</span></div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  _M_range_insert(iterator __pos, _ForwardIterator __first,</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  _ForwardIterator __last, <a class="code" href="a06593.html">std::forward_iterator_tag</a>);</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> </div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="comment">// Called by insert(p,n,x), and the range insert when it turns out to be</span></div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="comment">// the same thing.</span></div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  _M_fill_insert(iterator __pos, size_type __n, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> </div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  <span class="comment">// Called by resize(n).</span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  _M_default_append(size_type __n);</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> </div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  _M_shrink_to_fit();</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span> </div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="comment">// Called by insert(p,x)</span></div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  _M_insert_aux(iterator __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  _M_insert_aux(iterator __position, _Args&&... __args);</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span> </div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  _M_emplace_back_aux(_Args&&... __args);</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span> </div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="comment">// Called by the latter.</span></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  size_type</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  _M_check_len(size_type __n, <span class="keyword">const</span> <span class="keywordtype">char</span>* __s)<span class="keyword"> const</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <span class="keywordflow">if</span> (max_size() - size() < __n)</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  __throw_length_error(__N(__s));</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> </div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="keyword">const</span> size_type __len = size() + <a class="code" href="a01436.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a>(size(), __n);</div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="keywordflow">return</span> (__len < size() || __len > max_size()) ? max_size() : __len;</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  }</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span> </div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="comment">// Internal erase functions follow.</span></div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span> </div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <span class="comment">// Called by erase(q1,q2), clear(), resize(), _M_fill_assign,</span></div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="comment">// _M_assign_aux.</span></div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  _M_erase_at_end(pointer __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  {</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  <a class="code" href="a01487.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator());</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  this->_M_impl._M_finish = __pos;</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  }</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> </div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  iterator</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  _M_erase(iterator __position);</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> </div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  iterator</div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  _M_erase(iterator __first, iterator __last);</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> </div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  <span class="comment">// Constant-time move assignment when source object's memory can be</span></div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="comment">// moved, either because the source's allocator will move too</span></div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <span class="comment">// or because the allocators are equal.</span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  _M_move_assign(<a class="code" href="a06825.html">vector</a>&& __x, <a class="code" href="a03485.html">std::true_type</a>) noexcept</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  {</div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <a class="code" href="a06825.html">vector</a> __tmp(get_allocator());</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  this->_M_impl._M_swap_data(__tmp._M_impl);</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  this->_M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  std::__alloc_on_move(_M_get_Tp_allocator(), __x._M_get_Tp_allocator());</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  }</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span> </div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  <span class="comment">// Do move assignment when it might not be possible to move source</span></div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  <span class="comment">// object's memory, resulting in a linear-time operation.</span></div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  _M_move_assign(<a class="code" href="a06825.html">vector</a>&& __x, <a class="code" href="a03485.html">std::false_type</a>)</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  {</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="keywordflow">if</span> (__x._M_get_Tp_allocator() == this->_M_get_Tp_allocator())</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  _M_move_assign(std::move(__x), <a class="code" href="a01430.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a>());</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  {</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="comment">// The rvalue's allocator cannot be moved and is not equal,</span></div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <span class="comment">// so we need to individually move each element.</span></div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  this->assign(std::__make_move_if_noexcept_iterator(__x.begin()),</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  std::__make_move_if_noexcept_iterator(__x.end()));</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  __x.clear();</div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  }</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  }</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> </div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Up></div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  _Up*</div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  _M_data_ptr(_Up* __ptr)<span class="keyword"> const</span></div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> __ptr; }</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span> </div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <span class="keyword">typename</span> <a class="code" href="a05741.html#afbe577731214ffde229449018dac1124">std::pointer_traits<_Ptr>::element_type</a>*</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  _M_data_ptr(_Ptr __ptr)<span class="keyword"> const</span></div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> empty() ? nullptr : <a class="code" href="a01431.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a>(*__ptr); }</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  _Ptr</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  _M_data_ptr(_Ptr __ptr)<span class="keyword"> const</span></div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> __ptr; }</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  };</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span> </div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="comment"></span></div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> <span class="comment"> /**</span></div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="comment"> * @brief Vector equality comparison.</span></div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> <span class="comment"> * @param __x A %vector.</span></div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span> <span class="comment"> * @param __y A %vector of the same type as @a __x.</span></div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span> <span class="comment"> * @return True iff the size and elements of the vectors are equal.</span></div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span> <span class="comment"> *</span></div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span> <span class="comment"> * This is an equivalence relation. It is linear in the size of the</span></div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span> <span class="comment"> * vectors. Vectors are considered equivalent if their sizes are equal,</span></div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> <span class="comment"> * and if corresponding elements compare equal.</span></div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span> <span class="comment"> */</span></div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01511"></a><span class="lineno"><a class="line" href="a01487.html#aa823b88deb57ba1b2494ea0dbcc028a8"> 1511</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  { <span class="keywordflow">return</span> (__x.<a class="code" href="a06825.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() == __y.<a class="code" href="a06825.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>()</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  && <a class="code" href="a01435.html#ga8e56a22bed21e9134369f4b2a47ba407">std::equal</a>(__x.<a class="code" href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __x.<a class="code" href="a06825.html#ae957699b810eb3313916800773e103d7">end</a>(), __y.<a class="code" href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>())); }</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span> <span class="comment"></span></div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span> <span class="comment"> /**</span></div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> <span class="comment"> * @brief Vector ordering relation.</span></div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span> <span class="comment"> * @param __x A %vector.</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> <span class="comment"> * @param __y A %vector of the same type as @a __x.</span></div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> <span class="comment"> * @return True iff @a __x is lexicographically less than @a __y.</span></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> <span class="comment"> *</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span></div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> <span class="comment"> * vectors. The elements must be comparable with @c <.</span></div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> <span class="comment"> *</span></div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span> <span class="comment"> */</span></div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01528"></a><span class="lineno"><a class="line" href="a01487.html#a8fcefae1f44d9e5656f2231d04742454"> 1528</a></span>  operator<(const vector<_Tp, _Alloc>& __x, <span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  { <span class="keywordflow">return</span> <a class="code" href="a01436.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a>(__x.begin(), __x.end(),</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  __y.begin(), __y.end()); }</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> <span class="comment"></span></div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span> <span class="comment"> /// Based on operator==</span></div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01535"></a><span class="lineno"><a class="line" href="a01487.html#aa8e4871fc2d47ad1f14e43949b9ce938"> 1535</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span> <span class="comment"></span></div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01541"></a><span class="lineno"><a class="line" href="a01487.html#a3a727df15fd08af612b872262e50a95f"> 1541</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> <span class="comment"></span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01547"></a><span class="lineno"><a class="line" href="a01487.html#acc2c10d2a7234cc66fd327a6f65954f7"> 1547</a></span>  operator<=(const vector<_Tp, _Alloc>& __x, <span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> <span class="comment"></span></div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01553"></a><span class="lineno"><a class="line" href="a01487.html#a9a32938be630f180eddc69f0402d13ca"> 1553</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> <span class="comment"></span></div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> <span class="comment"> /// See std::vector::swap().</span></div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01559"></a><span class="lineno"><a class="line" href="a01487.html#a5311b4d3732b7f16d7f629ff94540256"> 1559</a></span>  swap(<a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __x, <a class="code" href="a06825.html">vector<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  { __x.<a class="code" href="a06825.html#a00719b69ec3de30de46d095fee951835">swap</a>(__y); }</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span> </div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span> </div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_VECTOR_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a06601_html"><div class="ttname"><a href="a06601.html">std::random_access_iterator_tag</a></div><div class="ttdoc">Random-access iterators support a superset of bidirectional iterator operations. </div><div class="ttdef"><b>Definition:</b> <a href="a00509_source.html#l00103">stl_iterator_base_types.h:103</a></div></div> <div class="ttc" id="a06825_html_acaab0c546279a999bcba3ed54478c83d"><div class="ttname"><a href="a06825.html#acaab0c546279a999bcba3ed54478c83d">std::vector::assign</a></div><div class="ttdeci">void assign(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Assigns a range to a vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00507">stl_vector.h:507</a></div></div> <div class="ttc" id="a03485_html"><div class="ttname"><a href="a03485.html">std::integral_constant</a></div><div class="ttdoc">integral_constant </div><div class="ttdef"><b>Definition:</b> <a href="a00161_source.html#l00069">type_traits:69</a></div></div> <div class="ttc" id="a01487_html_ac10e18b5c09f39bc07430a9d47e584a5"><div class="ttname"><a href="a01487.html#ac10e18b5c09f39bc07430a9d47e584a5">std::cbegin</a></div><div class="ttdeci">constexpr auto cbegin(const _Container &__cont) noexcept(noexcept(std::begin(__cont))) -> decltype(std::begin(__cont))</div><div class="ttdoc">Return an iterator pointing to the first element of the const container. </div><div class="ttdef"><b>Definition:</b> <a href="a00428_source.html#l00116">range_access.h:116</a></div></div> <div class="ttc" id="a01436_html_gae179ce2d015dc0908973644687dce4c6"><div class="ttname"><a href="a01436.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a></div><div class="ttdeci">bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp)</div><div class="ttdoc">Performs dictionary comparison on ranges. </div><div class="ttdef"><b>Definition:</b> <a href="a00485_source.html#l01253">stl_algobase.h:1253</a></div></div> <div class="ttc" id="a01487_html_a5852ded2c7147a161b33951ef37ecba8"><div class="ttname"><a href="a01487.html#a5852ded2c7147a161b33951ef37ecba8">std::distance</a></div><div class="ttdeci">iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic. </div><div class="ttdef"><b>Definition:</b> <a href="a00506_source.html#l00114">stl_iterator_base_funcs.h:114</a></div></div> <div class="ttc" id="a06825_html_a943d35baf02f390b9870351f0f78c1d7"><div class="ttname"><a href="a06825.html#a943d35baf02f390b9870351f0f78c1d7">std::vector::assign</a></div><div class="ttdeci">void assign(size_type __n, const value_type &__val)</div><div class="ttdoc">Assigns a given value to a vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00488">stl_vector.h:488</a></div></div> <div class="ttc" id="a06825_html_a4f4dc31fc105124cd9a5e4a90ae99c44"><div class="ttname"><a href="a06825.html#a4f4dc31fc105124cd9a5e4a90ae99c44">std::vector::shrink_to_fit</a></div><div class="ttdeci">void shrink_to_fit()</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00725">stl_vector.h:725</a></div></div> <div class="ttc" id="a01436_html_ga84d30d8c4b3f2cbe8ec2055c34a578da"><div class="ttname"><a href="a01436.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does. </div><div class="ttdef"><b>Definition:</b> <a href="a00485_source.html#l00219">stl_algobase.h:219</a></div></div> <div class="ttc" id="a06825_html_aeec23a5238eb60cd3bb5ec960e9b430e"><div class="ttname"><a href="a06825.html#aeec23a5238eb60cd3bb5ec960e9b430e">std::vector::capacity</a></div><div class="ttdeci">size_type capacity() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00734">stl_vector.h:734</a></div></div> <div class="ttc" id="a06825_html_aae7e855d48dc6fc90c9f746d2098c263"><div class="ttname"><a href="a06825.html#aae7e855d48dc6fc90c9f746d2098c263">std::vector::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00629">stl_vector.h:629</a></div></div> <div class="ttc" id="a06825_html_a1134bcc83ff6c70cf78bab3cd426feaf"><div class="ttname"><a href="a06825.html#a1134bcc83ff6c70cf78bab3cd426feaf">std::vector::resize</a></div><div class="ttdeci">void resize(size_type __new_size)</div><div class="ttdoc">Resizes the vector to the specified number of elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00673">stl_vector.h:673</a></div></div> <div class="ttc" id="a06825_html_a325e3dbc4cd5c50fbfa108ff9e1a9bb9"><div class="ttname"><a href="a06825.html#a325e3dbc4cd5c50fbfa108ff9e1a9bb9">std::vector::vector</a></div><div class="ttdeci">vector(const vector &__x, const allocator_type &__a)</div><div class="ttdoc">Copy constructor with alternative allocator. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00339">stl_vector.h:339</a></div></div> <div class="ttc" id="a06825_html_a84793dbae69ddcd84cc26199e6a9e898"><div class="ttname"><a href="a06825.html#a84793dbae69ddcd84cc26199e6a9e898">std::vector::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, value_type &&__x)</div><div class="ttdoc">Inserts given rvalue into vector before specified iterator. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01014">stl_vector.h:1014</a></div></div> <div class="ttc" id="a00023_html"><div class="ttname"><a href="a00023.html">initializer_list</a></div></div> <div class="ttc" id="a06825_html_a7abf19c35e087a2d4596f651e340fb89"><div class="ttname"><a href="a06825.html#a7abf19c35e087a2d4596f651e340fb89">std::vector::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00659">stl_vector.h:659</a></div></div> <div class="ttc" id="a06825_html_a71ef09bb9b5003131ec404461fbdfa13"><div class="ttname"><a href="a06825.html#a71ef09bb9b5003131ec404461fbdfa13">std::vector::~vector</a></div><div class="ttdeci">~vector() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00423">stl_vector.h:423</a></div></div> <div class="ttc" id="a06825_html_a283e72373f613c3d74ccf35b529a8393"><div class="ttname"><a href="a06825.html#a283e72373f613c3d74ccf35b529a8393">std::vector::_M_allocate_and_copy</a></div><div class="ttdeci">pointer _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last)</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01221">stl_vector.h:1221</a></div></div> <div class="ttc" id="a06825_html_a35cc226f8730266ed04ca5dd0fd3077c"><div class="ttname"><a href="a06825.html#a35cc226f8730266ed04ca5dd0fd3077c">std::vector::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, _InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Inserts a range into the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01095">stl_vector.h:1095</a></div></div> <div class="ttc" id="a06825_html_a00719b69ec3de30de46d095fee951835"><div class="ttname"><a href="a06825.html#a00719b69ec3de30de46d095fee951835">std::vector::swap</a></div><div class="ttdeci">void swap(vector &__x) noexcept(_Alloc_traits::_S_nothrow_swap())</div><div class="ttdoc">Swaps data with another vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01194">stl_vector.h:1194</a></div></div> <div class="ttc" id="a06825_html_afdb93693c1129f8f23406e8a9f4dc27e"><div class="ttname"><a href="a06825.html#afdb93693c1129f8f23406e8a9f4dc27e">std::vector::operator[]</a></div><div class="ttdeci">reference operator[](size_type __n) noexcept</div><div class="ttdoc">Subscript access to the data contained in the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00779">stl_vector.h:779</a></div></div> <div class="ttc" id="a06825_html_a825800ea90d4e7367b5361ae53f864c7"><div class="ttname"><a href="a06825.html#a825800ea90d4e7367b5361ae53f864c7">std::vector::crend</a></div><div class="ttdeci">const_reverse_iterator crend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00647">stl_vector.h:647</a></div></div> <div class="ttc" id="a01601_html"><div class="ttname"><a href="a01601.html">std::initializer_list</a></div><div class="ttdoc">initializer_list </div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00047">initializer_list:47</a></div></div> <div class="ttc" id="a06825_html_abee0514d69c004f06f06e37e33b6104b"><div class="ttname"><a href="a06825.html#abee0514d69c004f06f06e37e33b6104b">std::vector::data</a></div><div class="ttdeci">_Tp * data() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00890">stl_vector.h:890</a></div></div> <div class="ttc" id="a06825_html_a6f2144e852790296d3c62cdec92c95ce"><div class="ttname"><a href="a06825.html#a6f2144e852790296d3c62cdec92c95ce">std::vector::push_back</a></div><div class="ttdeci">void push_back(const value_type &__x)</div><div class="ttdoc">Add data to the end of the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00913">stl_vector.h:913</a></div></div> <div class="ttc" id="a06825_html_a1a1db200194fca60d689aacce652d616"><div class="ttname"><a href="a06825.html#a1a1db200194fca60d689aacce652d616">std::vector::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, initializer_list< value_type > __l)</div><div class="ttdoc">Inserts an initializer_list into the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01031">stl_vector.h:1031</a></div></div> <div class="ttc" id="a06825_html_a99e26d28529b0d7e6dfc3aff0400e8bd"><div class="ttname"><a href="a06825.html#a99e26d28529b0d7e6dfc3aff0400e8bd">std::vector::pop_back</a></div><div class="ttdeci">void pop_back() noexcept</div><div class="ttdoc">Removes last element. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00949">stl_vector.h:949</a></div></div> <div class="ttc" id="a00506_html"><div class="ttname"><a href="a00506.html">stl_iterator_base_funcs.h</a></div></div> <div class="ttc" id="a06825_html_a002b00e3596af506a260bd957bee0212"><div class="ttname"><a href="a06825.html#a002b00e3596af506a260bd957bee0212">std::vector::vector</a></div><div class="ttdeci">vector(const vector &__x)</div><div class="ttdoc">Vector copy constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00318">stl_vector.h:318</a></div></div> <div class="ttc" id="a06825_html_acda096d477c2ef09ee0b3e7fb3ca558c"><div class="ttname"><a href="a06825.html#acda096d477c2ef09ee0b3e7fb3ca558c">std::vector::assign</a></div><div class="ttdeci">void assign(initializer_list< value_type > __l)</div><div class="ttdoc">Assigns an initializer list to a vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00533">stl_vector.h:533</a></div></div> <div class="ttc" id="a06817_html"><div class="ttname"><a href="a06817.html">std::_Vector_base</a></div><div class="ttdoc">See bits/stl_deque.h&#39;s _Deque_base for an explanation. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00072">stl_vector.h:72</a></div></div> <div class="ttc" id="a06825_html_aae89e304cceda4179427223add91eebb"><div class="ttname"><a href="a06825.html#aae89e304cceda4179427223add91eebb">std::vector::erase</a></div><div class="ttdeci">iterator erase(const_iterator __first, const_iterator __last)</div><div class="ttdoc">Remove a range of elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01173">stl_vector.h:1173</a></div></div> <div class="ttc" id="a06825_html_aaa0004f67abf317a8923d549a0e74987"><div class="ttname"><a href="a06825.html#aaa0004f67abf317a8923d549a0e74987">std::vector::at</a></div><div class="ttdeci">const_reference at(size_type __n) const</div><div class="ttdoc">Provides access to the data contained in the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00840">stl_vector.h:840</a></div></div> <div class="ttc" id="a01487_html_a468dae7cc599699643eafa95cc9999af"><div class="ttname"><a href="a01487.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a></div><div class="ttdeci">void _Destroy(_Tp *__pointer)</div><div class="ttdef"><b>Definition:</b> <a href="a00491_source.html#l00092">stl_construct.h:92</a></div></div> <div class="ttc" id="a06825_html_a53e627a12d33d2df15d4a9c25c872785"><div class="ttname"><a href="a06825.html#a53e627a12d33d2df15d4a9c25c872785">std::vector::resize</a></div><div class="ttdeci">void resize(size_type __new_size, const value_type &__x)</div><div class="ttdoc">Resizes the vector to the specified number of elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00693">stl_vector.h:693</a></div></div> <div class="ttc" id="a06825_html_a4922c571c2d3e9006f68813656f36587"><div class="ttname"><a href="a06825.html#a4922c571c2d3e9006f68813656f36587">std::vector::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, size_type __n, const value_type &__x)</div><div class="ttdoc">Inserts a number of copies of given data into the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01051">stl_vector.h:1051</a></div></div> <div class="ttc" id="a06825_html_a75bd59d9586be7f6d3e43e1afeac3d08"><div class="ttname"><a href="a06825.html#a75bd59d9586be7f6d3e43e1afeac3d08">std::vector::operator[]</a></div><div class="ttdeci">const_reference operator[](size_type __n) const noexcept</div><div class="ttdoc">Subscript access to the data contained in the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00794">stl_vector.h:794</a></div></div> <div class="ttc" id="a08925_html"><div class="ttname"><a href="a08925.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++0x allocators. </div><div class="ttdef"><b>Definition:</b> <a href="a14749_source.html#l00095">ext/alloc_traits.h:95</a></div></div> <div class="ttc" id="a06825_html_affbc2a0599ddf5a0e87475e4e65775a0"><div class="ttname"><a href="a06825.html#affbc2a0599ddf5a0e87475e4e65775a0">std::vector::vector</a></div><div class="ttdeci">vector(vector &&__rv, const allocator_type &__m) noexcept(_Alloc_traits::_S_always_equal())</div><div class="ttdoc">Move constructor with alternative allocator. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00348">stl_vector.h:348</a></div></div> <div class="ttc" id="a06825_html_a84c7c47a337f0e2dfbdad2c5719c13f5"><div class="ttname"><a href="a06825.html#a84c7c47a337f0e2dfbdad2c5719c13f5">std::vector::_M_range_check</a></div><div class="ttdeci">void _M_range_check(size_type __n) const</div><div class="ttdoc">Safety check used only from at(). </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00800">stl_vector.h:800</a></div></div> <div class="ttc" id="a06825_html_a6b8074967f8051c5fbcbe5c7057775ec"><div class="ttname"><a href="a06825.html#a6b8074967f8051c5fbcbe5c7057775ec">std::vector::vector</a></div><div class="ttdeci">vector(size_type __n, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a vector with default constructed elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00277">stl_vector.h:277</a></div></div> <div class="ttc" id="a01431_html_ga145a38ffdb1e846f389c2841897665b7"><div class="ttname"><a href="a01431.html#ga145a38ffdb1e846f389c2841897665b7">std::__addressof</a></div><div class="ttdeci">_Tp * __addressof(_Tp &__r) noexcept</div><div class="ttdoc">Same as C++11 std::addressof. </div><div class="ttdef"><b>Definition:</b> <a href="a00395_source.html#l00047">move.h:47</a></div></div> <div class="ttc" id="a01487_html"><div class="ttname"><a href="a01487.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std. </div></div> <div class="ttc" id="a06825_html_a010e6e6c437a7eb67dae7c052790cf94"><div class="ttname"><a href="a06825.html#a010e6e6c437a7eb67dae7c052790cf94">std::vector::vector</a></div><div class="ttdeci">vector(initializer_list< value_type > __l, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a vector from an initializer list. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00373">stl_vector.h:373</a></div></div> <div class="ttc" id="a06825_html"><div class="ttname"><a href="a06825.html">std::vector</a></div><div class="ttdoc">A standard container which offers fixed time access to individual elements in any order...</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00214">stl_vector.h:214</a></div></div> <div class="ttc" id="a06825_html_ac1f157333783a401dd4a0c23edaddf1c"><div class="ttname"><a href="a06825.html#ac1f157333783a401dd4a0c23edaddf1c">std::vector::rbegin</a></div><div class="ttdeci">const_reverse_iterator rbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00592">stl_vector.h:592</a></div></div> <div class="ttc" id="a06825_html_aa5ce64abecf486fbdb7914ae9734d289"><div class="ttname"><a href="a06825.html#aa5ce64abecf486fbdb7914ae9734d289">std::vector::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00620">stl_vector.h:620</a></div></div> <div class="ttc" id="a06825_html_a2c527667d502c53e377b49b8c1ce4214"><div class="ttname"><a href="a06825.html#a2c527667d502c53e377b49b8c1ce4214">std::vector::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00743">stl_vector.h:743</a></div></div> <div class="ttc" id="a06825_html_a1c8b8734443a1028d00ad364190bac76"><div class="ttname"><a href="a06825.html#a1c8b8734443a1028d00ad364190bac76">std::vector::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Remove element at given position. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01146">stl_vector.h:1146</a></div></div> <div class="ttc" id="a06569_html"><div class="ttname"><a href="a06569.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a00503_source.html#l00097">stl_iterator.h:97</a></div></div> <div class="ttc" id="a06825_html_a3bcd2b28b84df51df419171868014a84"><div class="ttname"><a href="a06825.html#a3bcd2b28b84df51df419171868014a84">std::vector::operator=</a></div><div class="ttdeci">vector & operator=(vector &&__x) noexcept(_Alloc_traits::_S_nothrow_move())</div><div class="ttdoc">Vector move assignment operator. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00448">stl_vector.h:448</a></div></div> <div class="ttc" id="a00332_html"><div class="ttname"><a href="a00332.html">functexcept.h</a></div></div> <div class="ttc" id="a06825_html_ac219a7abc1e291dfe0a57189895d04d1"><div class="ttname"><a href="a06825.html#ac219a7abc1e291dfe0a57189895d04d1">std::vector::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00547">stl_vector.h:547</a></div></div> <div class="ttc" id="a06825_html_ae3d969a640523603b2c51341c975b30c"><div class="ttname"><a href="a06825.html#ae3d969a640523603b2c51341c975b30c">std::vector::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00574">stl_vector.h:574</a></div></div> <div class="ttc" id="a06825_html_a460e9d810eb0009f44d8584662672a6b"><div class="ttname"><a href="a06825.html#a460e9d810eb0009f44d8584662672a6b">std::vector::front</a></div><div class="ttdeci">reference front() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00851">stl_vector.h:851</a></div></div> <div class="ttc" id="a01435_html_ga8e56a22bed21e9134369f4b2a47ba407"><div class="ttname"><a href="a01435.html#ga8e56a22bed21e9134369f4b2a47ba407">std::equal</a></div><div class="ttdeci">bool equal(_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _IIter2 __last2, _BinaryPredicate __binary_pred)</div><div class="ttdoc">Tests a range for element-wise equality. </div><div class="ttdef"><b>Definition:</b> <a href="a00485_source.html#l01170">stl_algobase.h:1170</a></div></div> <div class="ttc" id="a06825_html_ab6d52bbbf36c0b4c6a61075ae2b87654"><div class="ttname"><a href="a06825.html#ab6d52bbbf36c0b4c6a61075ae2b87654">std::vector::vector</a></div><div class="ttdeci">vector(const allocator_type &__a) noexcept</div><div class="ttdoc">Creates a vector with no elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00264">stl_vector.h:264</a></div></div> <div class="ttc" id="a06825_html_a1a3f9b081e24c3932472aff316308554"><div class="ttname"><a href="a06825.html#a1a3f9b081e24c3932472aff316308554">std::vector::front</a></div><div class="ttdeci">const_reference front() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00859">stl_vector.h:859</a></div></div> <div class="ttc" id="a06825_html_aa32a4b05a4c404e012c787360d7518a8"><div class="ttname"><a href="a06825.html#aa32a4b05a4c404e012c787360d7518a8">std::vector::rend</a></div><div class="ttdeci">const_reverse_iterator rend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00610">stl_vector.h:610</a></div></div> <div class="ttc" id="a01487_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initializer_list. </div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00089">initializer_list:89</a></div></div> <div class="ttc" id="a06825_html_a11362894b61f87331541b5268d0cb033"><div class="ttname"><a href="a06825.html#a11362894b61f87331541b5268d0cb033">std::vector::at</a></div><div class="ttdeci">reference at(size_type __n)</div><div class="ttdoc">Provides access to the data contained in the vector. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00822">stl_vector.h:822</a></div></div> <div class="ttc" id="a06825_html_ac7c4da8f17ac32164def63407dec54cb"><div class="ttname"><a href="a06825.html#ac7c4da8f17ac32164def63407dec54cb">std::vector::back</a></div><div class="ttdeci">reference back() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00867">stl_vector.h:867</a></div></div> <div class="ttc" id="a06825_html_a67a4f190d61c7b35fa951357cf96a10f"><div class="ttname"><a href="a06825.html#a67a4f190d61c7b35fa951357cf96a10f">std::vector::vector</a></div><div class="ttdeci">vector() noexcept(is_nothrow_default_constructible< _Alloc >::value)</div><div class="ttdoc">Creates a vector with no elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00253">stl_vector.h:253</a></div></div> <div class="ttc" id="a05741_html_afbe577731214ffde229449018dac1124"><div class="ttname"><a href="a05741.html#afbe577731214ffde229449018dac1124">std::pointer_traits::element_type</a></div><div class="ttdeci">__ptrtr_elt_type< _Ptr >::__type element_type</div><div class="ttdoc">The type pointed to. </div><div class="ttdef"><b>Definition:</b> <a href="a00416_source.html#l00137">ptr_traits.h:137</a></div></div> <div class="ttc" id="a06825_html_aedc1ee21f6ca2b8304b4f1f430125c8d"><div class="ttname"><a href="a06825.html#aedc1ee21f6ca2b8304b4f1f430125c8d">std::vector::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00654">stl_vector.h:654</a></div></div> <div class="ttc" id="a06825_html_a52d47db7d19a815e22d1cefdfa94d93c"><div class="ttname"><a href="a06825.html#a52d47db7d19a815e22d1cefdfa94d93c">std::vector::rend</a></div><div class="ttdeci">reverse_iterator rend() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00601">stl_vector.h:601</a></div></div> <div class="ttc" id="a06825_html_a5badc45ac5ba40fafcbb6ec5a0b8a745"><div class="ttname"><a href="a06825.html#a5badc45ac5ba40fafcbb6ec5a0b8a745">std::vector::operator=</a></div><div class="ttdeci">vector & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Vector list assignment operator. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00470">stl_vector.h:470</a></div></div> <div class="ttc" id="a06585_html"><div class="ttname"><a href="a06585.html">std::input_iterator_tag</a></div><div class="ttdoc">Marking input iterators. </div><div class="ttdef"><b>Definition:</b> <a href="a00509_source.html#l00089">stl_iterator_base_types.h:89</a></div></div> <div class="ttc" id="a06825_html_a8ecd17bf8b6b1b1ddbdb045e0553ba75"><div class="ttname"><a href="a06825.html#a8ecd17bf8b6b1b1ddbdb045e0553ba75">std::vector::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00556">stl_vector.h:556</a></div></div> <div class="ttc" id="a01487_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01487.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initializer_list. ...</div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00099">initializer_list:99</a></div></div> <div class="ttc" id="a06825_html_a20e5ca3edaf43348d346614730c8b637"><div class="ttname"><a href="a06825.html#a20e5ca3edaf43348d346614730c8b637">std::vector::rbegin</a></div><div class="ttdeci">reverse_iterator rbegin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00583">stl_vector.h:583</a></div></div> <div class="ttc" id="a06593_html"><div class="ttname"><a href="a06593.html">std::forward_iterator_tag</a></div><div class="ttdoc">Forward iterators support a superset of input iterator operations. </div><div class="ttdef"><b>Definition:</b> <a href="a00509_source.html#l00095">stl_iterator_base_types.h:95</a></div></div> <div class="ttc" id="a00302_html"><div class="ttname"><a href="a00302.html">concept_check.h</a></div></div> <div class="ttc" id="a06825_html_ad185eab26722975ac46eb977c7b2627b"><div class="ttname"><a href="a06825.html#ad185eab26722975ac46eb977c7b2627b">std::vector::back</a></div><div class="ttdeci">const_reference back() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00875">stl_vector.h:875</a></div></div> <div class="ttc" id="a06825_html_a30f4698eae082ffd64ed80c8cb648360"><div class="ttname"><a href="a06825.html#a30f4698eae082ffd64ed80c8cb648360">std::vector::crbegin</a></div><div class="ttdeci">const_reverse_iterator crbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00638">stl_vector.h:638</a></div></div> <div class="ttc" id="a06825_html_a57ef261b05f9ea1457d6f54494902e84"><div class="ttname"><a href="a06825.html#a57ef261b05f9ea1457d6f54494902e84">std::vector::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l01211">stl_vector.h:1211</a></div></div> <div class="ttc" id="a01430_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01430.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant< bool, true > true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value. </div><div class="ttdef"><b>Definition:</b> <a href="a00161_source.html#l00087">type_traits:87</a></div></div> <div class="ttc" id="a06825_html_a928812d75ac8e43de2346603cfef2d4b"><div class="ttname"><a href="a06825.html#a928812d75ac8e43de2346603cfef2d4b">std::vector::vector</a></div><div class="ttdeci">vector(vector &&__x) noexcept</div><div class="ttdoc">Vector move constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00335">stl_vector.h:335</a></div></div> <div class="ttc" id="a06825_html_ae957699b810eb3313916800773e103d7"><div class="ttname"><a href="a06825.html#ae957699b810eb3313916800773e103d7">std::vector::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00565">stl_vector.h:565</a></div></div> <div class="ttc" id="a06825_html_a8d611ffc7e37ca37dff8acabba2897a5"><div class="ttname"><a href="a06825.html#a8d611ffc7e37ca37dff8acabba2897a5">std::vector::vector</a></div><div class="ttdeci">vector(_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a vector from a range. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00401">stl_vector.h:401</a></div></div> <div class="ttc" id="a06825_html_a501b56f5a3b8558587ca1be9029e1de5"><div class="ttname"><a href="a06825.html#a501b56f5a3b8558587ca1be9029e1de5">std::vector::vector</a></div><div class="ttdeci">vector(size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a vector with copies of an exemplar element. </div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00289">stl_vector.h:289</a></div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_599c955538774c0249d4ddd97c0a9ae8.html">bits</a></li><li class="navelem"><a class="el" href="a00554.html">stl_vector.h</a></li> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.13 </li> </ul> </div> </body> </html>