<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: vector.tcc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00644_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">vector.tcc</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00644.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 (out of line) -*- 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-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </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/vector.tcc</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 _VECTOR_TCC</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _VECTOR_TCC 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="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="a07923.html#a8ab62036345a72d8126fa30425dfe869">vector<_Tp, _Alloc>::</a></div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="a07923.html#a8ab62036345a72d8126fa30425dfe869"> 67</a></span> <a class="code" href="a07923.html#a8ab62036345a72d8126fa30425dfe869"> reserve</a>(size_type __n)</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (__n > this->max_size())</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  __throw_length_error(__N(<span class="stringliteral">"vector::reserve"</span>));</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (this->capacity() < __n)</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">const</span> size_type __old_size = size();</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  pointer __tmp = _M_allocate_and_copy(__n,</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(this->_M_impl._M_start),</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(this->_M_impl._M_finish));</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  this->_M_impl._M_start = __tmp;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  this->_M_impl._M_finish = __tmp + __old_size;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">typename</span> vector<_Tp, _Alloc>::reference</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="a07923.html">vector<_Tp, _Alloc>::</a></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <a class="code" href="a07923.html"> emplace_back</a>(_Args&&... __args)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(1);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(1);</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>  <span class="keywordflow">else</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  _M_realloc_insert(<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), std::forward<_Args>(__args)...);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> back();</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor">#endif</span></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">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="a07923.html#ace70e223402de9cdd87a09bd4ff0e76b"> 120</a></span>  insert(const_iterator __position, <span class="keyword">const</span> <a class="code" href="a06707.html">value_type</a>& __x)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  insert(iterator __position, <span class="keyword">const</span> <a class="code" href="a06707.html">value_type</a>& __x)</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> size_type __n = __position - <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (__position == <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(1);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  __x);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(1);</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __pos = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + (__position - <a class="code" href="a01541.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>());</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// __x could be an existing element of this vector, so make a</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// copy of it before _M_insert_aux moves elements around.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  _Temporary_value __x_copy(<span class="keyword">this</span>, __x);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  _M_insert_aux(__pos, std::move(__x_copy._M_val()));</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _M_insert_aux(__position, __x);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  _M_realloc_insert(<a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + (__position - <a class="code" href="a01541.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>()), __x);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  _M_realloc_insert(__position, __x);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">return</span> iterator(this->_M_impl._M_start + __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="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="code" href="a07923.html">vector<_Tp, _Alloc>::</a></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <a class="code" href="a07923.html"> _M_erase</a>(<a class="code" href="a07675.html">iterator</a> __position)</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (__position + 1 != <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  _GLIBCXX_MOVE3(__position + 1, <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __position);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  --this->_M_impl._M_finish;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  _GLIBCXX_ASAN_ANNOTATE_SHRINK(1);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">return</span> __position;</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> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">typename</span> vector<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  _M_erase(iterator __first, iterator __last)</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (__first != __last)</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  {</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (__last != <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  _GLIBCXX_MOVE3(__last, <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __first);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  _M_erase_at_end(__first.base() + (<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>() - __last));</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="keywordflow">return</span> __first;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  vector<_Tp, _Alloc>&</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="a07923.html#a9c56711f1fdb6aeb4a287570da90a688">vector<_Tp, _Alloc>::</a></div><div class="line"><a name="l00187"></a><span class="lineno"><a class="line" href="a07923.html#a9c56711f1fdb6aeb4a287570da90a688"> 187</a></span> <a class="code" href="a07923.html#a9c56711f1fdb6aeb4a287570da90a688"> operator=</a>(<span class="keyword">const</span> <a class="code" href="a07923.html">vector<_Tp, _Alloc></a>& __x)</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>  <span class="keywordflow">if</span> (&__x != <span class="keyword">this</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>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (_Alloc_traits::_S_propagate_on_copy_assign())</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">if</span> (!_Alloc_traits::_S_always_equal()</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  && _M_get_Tp_allocator() != __x._M_get_Tp_allocator())</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  {</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// replacement allocator cannot free existing storage</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  this->clear();</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  this->_M_impl._M_start = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  this->_M_impl._M_finish = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  this->_M_impl._M_end_of_storage = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::__alloc_on_copy(_M_get_Tp_allocator(),</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  __x._M_get_Tp_allocator());</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> size_type __xlen = __x.<a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>();</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (__xlen > capacity())</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  pointer __tmp = _M_allocate_and_copy(__xlen, __x.<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(),</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  __x.<a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>());</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  this->_M_impl._M_start = __tmp;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size() >= __xlen)</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(std::copy(__x.<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __x.<a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(), <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>()),</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), _M_get_Tp_allocator());</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  {</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  this->_M_impl._M_start);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  std::__uninitialized_copy_a(__x._M_impl._M_start + size(),</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  __x._M_impl._M_finish,</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;</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="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="a07923.html">vector<_Tp, _Alloc>::</a></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <a class="code" href="a07923.html"> _M_fill_assign</a>(<span class="keywordtype">size_t</span> __n, <span class="keyword">const</span> value_type& __val)</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  {</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (__n > capacity())</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <a class="code" href="a07923.html">vector</a> __tmp(__n, __val, _M_get_Tp_allocator());</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  __tmp._M_impl._M_swap_data(this->_M_impl);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__n > size())</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  {</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  std::fill(<a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(), <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __val);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">const</span> size_type __add = __n - size();</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__add);</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  std::__uninitialized_fill_n_a(this->_M_impl._M_finish,</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  __add, __val, _M_get_Tp_allocator());</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__add);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</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="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  _M_assign_aux(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="code" href="a07655.html">std::input_iterator_tag</a>)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  pointer __cur(this->_M_impl._M_start);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">for</span> (; __first != __last && __cur != this->_M_impl._M_finish;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  ++__cur, ++__first)</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  *__cur = *__first;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  _M_erase_at_end(__cur);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  _M_range_insert(<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __first, __last,</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first));</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="code" href="a07663.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">const</span> size_type __len = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (__len > capacity())</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  {</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  pointer __tmp(_M_allocate_and_copy(__len, __first, __last));</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  this->_M_impl._M_start = __tmp;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  this->_M_impl._M_finish = this->_M_impl._M_start + __len;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (size() >= __len)</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  _ForwardIterator __mid = __first;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__mid, size());</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  std::copy(__first, __mid, this->_M_impl._M_start);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">const</span> size_type __attribute__((__unused__)) __n = __len - size();</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__n);</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  std::__uninitialized_copy_a(__mid, __last,</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__n);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  _M_insert_rval(const_iterator __position, value_type&& __v) -> iterator</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  {</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __n = __position - <a class="code" href="a01541.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>();</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (__position == <a class="code" href="a01541.html#a6cd5aaabed869c9d96801743fb4d7f6f">cend</a>())</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  {</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(1);</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  std::move(__v));</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(1);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  _M_insert_aux(<a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __n, std::move(__v));</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  _M_realloc_insert(<a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __n, std::move(__v));</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keywordflow">return</span> iterator(this->_M_impl._M_start + __n);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  _M_emplace_aux(const_iterator __position, _Args&&... __args)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  -> iterator</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">const</span> <span class="keyword">auto</span> __n = __position - <a class="code" href="a01541.html#ac10e18b5c09f39bc07430a9d47e584a5">cbegin</a>();</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">if</span> (__position == <a class="code" href="a01541.html#a6cd5aaabed869c9d96801743fb4d7f6f">cend</a>())</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  {</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(1);</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(1);</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  {</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// We need to construct a temporary because something in __args...</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="comment">// could alias one of the elements of the container and so we</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// need to use it before _M_insert_aux moves elements around.</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  _Temporary_value __tmp(<span class="keyword">this</span>, std::forward<_Args>(__args)...);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  _M_insert_aux(<a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __n, std::move(__tmp._M_val()));</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  _M_realloc_insert(<a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __n, std::forward<_Args>(__args)...);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> iterator(this->_M_impl._M_start + __n);</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Arg></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  _M_insert_aux(iterator __position, _Arg&& __arg)</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  _M_insert_aux(iterator __position, <span class="keyword">const</span> _Tp& __x)</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  {</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(1);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  _GLIBCXX_MOVE(*(this->_M_impl._M_finish - 1)));</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(1);</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  _Tp __x_copy = __x;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  _GLIBCXX_MOVE_BACKWARD3(__position.base(),</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  this->_M_impl._M_finish - 2,</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  this->_M_impl._M_finish - 1);</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  *__position = __x_copy;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  *__position = std::forward<_Arg>(__arg);</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> </div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  _M_realloc_insert(iterator __position, _Args&&... __args)</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  _M_realloc_insert(iterator __position, <span class="keyword">const</span> _Tp& __x)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keyword">const</span> size_type __len =</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  _M_check_len(size_type(1), <span class="stringliteral">"vector::_M_realloc_insert"</span>);</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  pointer __old_start = this->_M_impl._M_start;</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  pointer __old_finish = this->_M_impl._M_finish;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">const</span> size_type __elems_before = __position - <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  pointer __new_start(this->_M_allocate(__len));</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  pointer __new_finish(__new_start);</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  __try</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="comment">// The order of the three operations is dictated by the C++11</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="comment">// case, where the moves could alter a new element belonging</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="comment">// to the existing vector. This is an issue only for callers</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// taking the element by lvalue ref (see last bullet of C++11</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">// [res.on.arguments]).</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  __new_start + __elems_before,</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> #<span class="keywordflow">if</span> __cplusplus >= 201103L</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  __x);</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  __new_finish = pointer();</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __new_finish</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  = std::__uninitialized_move_if_noexcept_a</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  (__old_start, __position.base(),</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  __new_start, _M_get_Tp_allocator());</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>  ++__new_finish;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  __new_finish</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  = std::__uninitialized_move_if_noexcept_a</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  (__position.base(), __old_finish,</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  __new_finish, _M_get_Tp_allocator());</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>  __catch(...)</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  {</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">if</span> (!__new_finish)</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  _Alloc_traits::destroy(this->_M_impl,</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  __new_start + __elems_before);</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__new_start, __new_finish, _M_get_Tp_allocator());</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  _M_deallocate(__new_start, __len);</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  __throw_exception_again;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  }</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__old_start, __old_finish, _M_get_Tp_allocator());</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  _M_deallocate(__old_start,</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  this->_M_impl._M_end_of_storage - __old_start);</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  this->_M_impl._M_end_of_storage = __new_start + __len;</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> </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  _M_fill_insert(iterator __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">if</span> (__n != 0)</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  {</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">if</span> (size_type(this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  - this->_M_impl._M_finish) >= __n)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  value_type __x_copy = __x;</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  _Temporary_value __tmp(<span class="keyword">this</span>, __x);</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  value_type& __x_copy = __tmp._M_val();</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keyword">const</span> size_type __elems_after = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>() - __position;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  pointer __old_finish(this->_M_impl._M_finish);</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">if</span> (__elems_after > __n)</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  {</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__n);</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  std::__uninitialized_move_a(this->_M_impl._M_finish - __n,</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  this->_M_impl._M_finish += __n;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__n);</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  _GLIBCXX_MOVE_BACKWARD3(__position.base(),</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  __old_finish - __n, __old_finish);</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  std::fill(__position.base(), __position.base() + __n,</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  __x_copy);</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  {</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__n);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  std::__uninitialized_fill_n_a(this->_M_impl._M_finish,</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  __n - __elems_after,</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  __x_copy,</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  std::__uninitialized_move_a(__position.base(), __old_finish,</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  this->_M_impl._M_finish += __elems_after;</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  std::fill(__position.base(), __old_finish, __x_copy);</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  }</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  {</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">const</span> size_type __len =</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  _M_check_len(__n, <span class="stringliteral">"vector::_M_fill_insert"</span>);</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">const</span> size_type __elems_before = __position - <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  pointer __new_start(this->_M_allocate(__len));</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  pointer __new_finish(__new_start);</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  __try</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  {</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// See _M_realloc_insert above.</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  std::__uninitialized_fill_n_a(__new_start + __elems_before,</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  __n, __x,</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  __new_finish = pointer();</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>  __new_finish</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  = std::__uninitialized_move_if_noexcept_a</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  (this->_M_impl._M_start, __position.base(),</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  __new_start, _M_get_Tp_allocator());</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  __new_finish += __n;</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  __new_finish</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  = std::__uninitialized_move_if_noexcept_a</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  (__position.base(), this->_M_impl._M_finish,</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  __new_finish, _M_get_Tp_allocator());</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  }</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  __catch(...)</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  {</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">if</span> (!__new_finish)</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__new_start + __elems_before,</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  __new_start + __elems_before + __n,</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__new_start, __new_finish,</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  _M_deallocate(__new_start, __len);</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  __throw_exception_again;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  this->_M_impl._M_end_of_storage = __new_start + __len;</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  }</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> </div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  _M_default_append(size_type __n)</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  {</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (__n != 0)</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</span> size_type __size = size();</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  size_type __navail = size_type(this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  - this->_M_impl._M_finish);</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> </div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">if</span> (__size > max_size() || __navail > max_size() - __size)</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  __builtin_unreachable();</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">if</span> (__navail >= __n)</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  {</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__n);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  this->_M_impl._M_finish =</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  std::__uninitialized_default_n_a(this->_M_impl._M_finish,</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  __n, _M_get_Tp_allocator());</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__n);</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  {</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> size_type __len =</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  _M_check_len(__n, <span class="stringliteral">"vector::_M_default_append"</span>);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  pointer __new_start(this->_M_allocate(__len));</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  pointer __destroy_from = pointer();</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  __try</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  {</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  std::__uninitialized_default_n_a(__new_start + __size,</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  __n, _M_get_Tp_allocator());</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  __destroy_from = __new_start + __size;</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  std::__uninitialized_move_if_noexcept_a(</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  __new_start, _M_get_Tp_allocator());</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  __catch(...)</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  {</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">if</span> (__destroy_from)</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__destroy_from, __destroy_from + __n,</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  _M_deallocate(__new_start, __len);</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  __throw_exception_again;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  this->_M_impl._M_finish = __new_start + __size + __n;</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  this->_M_impl._M_end_of_storage = __new_start + __len;</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> </div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  _M_shrink_to_fit()</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  {</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">if</span> (capacity() == size())</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">return</span> std::__shrink_to_fit_aux<vector>::_S_do_it(*<span class="keyword">this</span>);</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  _M_range_insert(iterator __pos, _InputIterator __first,</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  _InputIterator __last, <a class="code" href="a07655.html">std::input_iterator_tag</a>)</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  {</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">if</span> (__pos == <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  {</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  insert(<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), *__first);</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__first != __last)</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>  vector __tmp(__first, __last, _M_get_Tp_allocator());</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  insert(__pos,</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.begin()),</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.end()));</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  }</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  }</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  vector<_Tp, _Alloc>::</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  _M_range_insert(iterator __position, _ForwardIterator __first,</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  _ForwardIterator __last, <a class="code" href="a07663.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  {</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">if</span> (__first != __last)</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  {</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keyword">const</span> size_type __n = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">if</span> (size_type(this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  - this->_M_impl._M_finish) >= __n)</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  {</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keyword">const</span> size_type __elems_after = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>() - __position;</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  pointer __old_finish(this->_M_impl._M_finish);</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordflow">if</span> (__elems_after > __n)</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  {</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__n);</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  std::__uninitialized_move_a(this->_M_impl._M_finish - __n,</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  this->_M_impl._M_finish += __n;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__n);</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  _GLIBCXX_MOVE_BACKWARD3(__position.base(),</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  __old_finish - __n, __old_finish);</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  std::copy(__first, __last, __position);</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  }</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  {</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  _ForwardIterator __mid = __first;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__mid, __elems_after);</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  _GLIBCXX_ASAN_ANNOTATE_GROW(__n);</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  std::__uninitialized_copy_a(__mid, __last,</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  this->_M_impl._M_finish += __n - __elems_after;</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  std::__uninitialized_move_a(__position.base(),</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  __old_finish,</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  this->_M_impl._M_finish += __elems_after;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  std::copy(__first, __mid, __position);</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>  }</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  {</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keyword">const</span> size_type __len =</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  _M_check_len(__n, <span class="stringliteral">"vector::_M_range_insert"</span>);</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  pointer __new_start(this->_M_allocate(__len));</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  pointer __new_finish(__new_start);</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  __try</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  {</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  __new_finish</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  = std::__uninitialized_move_if_noexcept_a</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  (this->_M_impl._M_start, __position.base(),</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  __new_start, _M_get_Tp_allocator());</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  __new_finish</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  = std::__uninitialized_copy_a(__first, __last,</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  __new_finish,</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  __new_finish</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  = std::__uninitialized_move_if_noexcept_a</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  (__position.base(), this->_M_impl._M_finish,</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  __new_finish, _M_get_Tp_allocator());</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  }</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  __catch(...)</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  {</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__new_start, __new_finish,</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  _M_deallocate(__new_start, __len);</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  __throw_exception_again;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  _GLIBCXX_ASAN_ANNOTATE_REINIT;</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, this->_M_impl._M_finish,</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  _M_deallocate(this->_M_impl._M_start,</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  this->_M_impl._M_end_of_storage</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  - this->_M_impl._M_start);</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  this->_M_impl._M_end_of_storage = __new_start + __len;</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  }</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  }</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> </div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// vector<bool></span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  _M_reallocate(size_type __n)</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  {</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  _Bit_pointer __q = this->_M_allocate(__n);</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  iterator __start(<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__q), 0);</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  iterator __finish(_M_copy_aligned(<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(), __start));</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  this->_M_deallocate();</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  this->_M_impl._M_start = __start;</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  this->_M_impl._M_finish = __finish;</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  this->_M_impl._M_end_of_storage = __q + _S_nword(__n);</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> </div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  _M_fill_insert(iterator __position, size_type __n, <span class="keywordtype">bool</span> __x)</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  {</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (__n == 0)</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">if</span> (<a class="code" href="a07923.html#aeec23a5238eb60cd3bb5ec960e9b430e">capacity</a>() - <a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() >= __n)</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  {</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  std::copy_backward(__position, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(),</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  this->_M_impl._M_finish + difference_type(__n));</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  std::fill(__position, __position + difference_type(__n), __x);</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  this->_M_impl._M_finish += difference_type(__n);</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  }</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  {</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keyword">const</span> size_type __len = </div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  _M_check_len(__n, <span class="stringliteral">"vector<bool>::_M_fill_insert"</span>);</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  _Bit_pointer __q = this->_M_allocate(__len);</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  iterator __start(<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__q), 0);</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  iterator __i = _M_copy_aligned(<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __position, __start);</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  std::fill(__i, __i + difference_type(__n), __x);</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  iterator __finish = std::copy(__position, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(),</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  __i + difference_type(__n));</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  this->_M_deallocate();</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  this->_M_impl._M_end_of_storage = __q + _S_nword(__len);</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  this->_M_impl._M_start = __start;</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  this->_M_impl._M_finish = __finish;</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> </div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  _M_insert_range(iterator __position, _ForwardIterator __first, </div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  _ForwardIterator __last, <a class="code" href="a07663.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  {</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">if</span> (__first != __last)</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  {</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  size_type __n = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">if</span> (<a class="code" href="a07923.html#aeec23a5238eb60cd3bb5ec960e9b430e">capacity</a>() - <a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() >= __n)</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  {</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  std::copy_backward(__position, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(),</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  this->_M_impl._M_finish</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  + difference_type(__n));</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  std::copy(__first, __last, __position);</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  this->_M_impl._M_finish += difference_type(__n);</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="keywordflow">else</span></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>  <span class="keyword">const</span> size_type __len =</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  _M_check_len(__n, <span class="stringliteral">"vector<bool>::_M_insert_range"</span>);</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  _Bit_pointer __q = this->_M_allocate(__len);</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  iterator __start(<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__q), 0);</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  iterator __i = _M_copy_aligned(<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __position, __start);</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  __i = std::copy(__first, __last, __i);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  iterator __finish = std::copy(__position, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(), __i);</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  this->_M_deallocate();</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  this->_M_impl._M_end_of_storage = __q + _S_nword(__len);</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  this->_M_impl._M_start = __start;</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  this->_M_impl._M_finish = __finish;</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  }</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  }</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> </div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  _M_insert_aux(iterator __position, <span class="keywordtype">bool</span> __x)</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  {</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  {</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  std::copy_backward(__position, this->_M_impl._M_finish, </div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  this->_M_impl._M_finish + 1);</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  *__position = __x;</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  ++this->_M_impl._M_finish;</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  }</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  {</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keyword">const</span> size_type __len =</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  _M_check_len(size_type(1), <span class="stringliteral">"vector<bool>::_M_insert_aux"</span>);</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  _Bit_pointer __q = this->_M_allocate(__len);</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  iterator __start(<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__q), 0);</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  iterator __i = _M_copy_aligned(<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(), __position, __start);</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  *__i++ = __x;</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  iterator __finish = std::copy(__position, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(), __i);</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  this->_M_deallocate();</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  this->_M_impl._M_end_of_storage = __q + _S_nword(__len);</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  this->_M_impl._M_start = __start;</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  this->_M_impl._M_finish = __finish;</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  }</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> </div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keyword">typename</span> vector<bool, _Alloc>::iterator</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  _M_erase(iterator __position)</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  {</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">if</span> (__position + 1 != <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>())</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  std::copy(__position + 1, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(), __position);</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  --this->_M_impl._M_finish;</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">return</span> __position;</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</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="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keyword">typename</span> vector<bool, _Alloc>::iterator</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  _M_erase(iterator __first, iterator __last)</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  {</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keywordflow">if</span> (__first != __last)</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  _M_erase_at_end(std::copy(__last, <a class="code" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a>(), __first));</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  }</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> </div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  vector<bool, _Alloc>::</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  _M_shrink_to_fit()</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  {</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keywordflow">if</span> (<a class="code" href="a07923.html#aeec23a5238eb60cd3bb5ec960e9b430e">capacity</a>() - <a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() < <span class="keywordtype">int</span>(_S_word_bit))</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  __try</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  {</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  _M_reallocate(<a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>());</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  __catch(...)</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  }</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> </div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> </div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> </div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> {</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> </div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>::</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  operator()(<span class="keyword">const</span> _GLIBCXX_STD_C::vector<bool, _Alloc>& __b) <span class="keyword">const</span> noexcept</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="keywordtype">size_t</span> __hash = 0;</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keyword">using</span> _GLIBCXX_STD_C::_S_word_bit;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keyword">using</span> _GLIBCXX_STD_C::_Bit_type;</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> </div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __words = __b.size() / _S_word_bit;</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">if</span> (__words)</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>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __clength = __words * <span class="keyword">sizeof</span>(_Bit_type);</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  __hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  }</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> </div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __extrabits = __b.size() % _S_word_bit;</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keywordflow">if</span> (__extrabits)</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  {</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  _Bit_type __hiword = *__b._M_impl._M_finish._M_p;</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  __hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> </div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __clength</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  = (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">if</span> (__words)</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  __hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  __hash = std::_Hash_impl::hash(&__hiword, __clength);</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  }</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> </div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keywordflow">return</span> __hash;</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> </div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> </div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> <span class="preprocessor">#endif // C++11</span></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> <span class="preprocessor">#undef _GLIBCXX_ASAN_ANNOTATE_REINIT</span></div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="preprocessor">#undef _GLIBCXX_ASAN_ANNOTATE_GROW</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="preprocessor">#undef _GLIBCXX_ASAN_ANNOTATE_GREW</span></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> <span class="preprocessor">#undef _GLIBCXX_ASAN_ANNOTATE_SHRINK</span></div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> </div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="preprocessor">#endif </span><span class="comment">/* _VECTOR_TCC */</span><span class="preprocessor"></span></div><div class="ttc" id="a07923_html"><div class="ttname"><a href="a07923.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="a00599_source.html#l00339">stl_vector.h:339</a></div></div>
<div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a07655_html"><div class="ttname"><a href="a07655.html">std::input_iterator_tag</a></div><div class="ttdoc">Marking input iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00089">stl_iterator_base_types.h:89</a></div></div>
<div class="ttc" id="a01541_html_a468dae7cc599699643eafa95cc9999af"><div class="ttname"><a href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a></div><div class="ttdeci">void _Destroy(_Tp *__pointer)</div><div class="ttdef"><b>Definition:</b> <a href="a00536_source.html#l00097">stl_construct.h:97</a></div></div>
<div class="ttc" id="a07675_html"><div class="ttname"><a href="a07675.html">std::iterator</a></div><div class="ttdoc">Common iterator class.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00118">stl_iterator_base_types.h:118</a></div></div>
<div class="ttc" id="a07663_html"><div class="ttname"><a href="a07663.html">std::forward_iterator_tag</a></div><div class="ttdoc">Forward iterators support a superset of input iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00095">stl_iterator_base_types.h:95</a></div></div>
<div class="ttc" id="a01480_html_ga1954d5552e24586051011312041033f6"><div class="ttname"><a href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a></div><div class="ttdeci">constexpr _Tp * __addressof(_Tp &__r) noexcept</div><div class="ttdoc">Same as C++11 std::addressof.</div><div class="ttdef"><b>Definition:</b> <a href="a00422_source.html#l00047">move.h:47</a></div></div>
<div class="ttc" id="a01541_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00202">stl_iterator_base_funcs.h:202</a></div></div>
<div class="ttc" id="a07923_html_a9c56711f1fdb6aeb4a287570da90a688"><div class="ttname"><a href="a07923.html#a9c56711f1fdb6aeb4a287570da90a688">std::vector::operator=</a></div><div class="ttdeci">vector & operator=(const vector &__x)</div><div class="ttdoc">Vector assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00644_source.html#l00187">vector.tcc:187</a></div></div>
<div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a07923_html_ac219a7abc1e291dfe0a57189895d04d1"><div class="ttname"><a href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">std::vector::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00698">stl_vector.h:698</a></div></div>
<div class="ttc" id="a01507_html_ga89d3a7d239086516917bb7f6f9da213c"><div class="ttname"><a href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a></div><div class="ttdeci">constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00205">stl_iterator_base_types.h:205</a></div></div>
<div class="ttc" id="a01541_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01541.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="a00029_source.html#l00099">initializer_list:99</a></div></div>
<div class="ttc" id="a07923_html_aeec23a5238eb60cd3bb5ec960e9b430e"><div class="ttname"><a href="a07923.html#aeec23a5238eb60cd3bb5ec960e9b430e">std::vector::capacity</a></div><div class="ttdeci">size_type capacity() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00885">stl_vector.h:885</a></div></div>
<div class="ttc" id="a01541_html_ac10e18b5c09f39bc07430a9d47e584a5"><div class="ttname"><a href="a01541.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="a00458_source.html#l00116">range_access.h:116</a></div></div>
<div class="ttc" id="a07923_html_a8ab62036345a72d8126fa30425dfe869"><div class="ttname"><a href="a07923.html#a8ab62036345a72d8126fa30425dfe869">std::vector::reserve</a></div><div class="ttdeci">void reserve(size_type __n)</div><div class="ttdoc">Attempt to preallocate enough memory for specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00644_source.html#l00067">vector.tcc:67</a></div></div>
<div class="ttc" id="a01541_html_a6cd5aaabed869c9d96801743fb4d7f6f"><div class="ttname"><a href="a01541.html#a6cd5aaabed869c9d96801743fb4d7f6f">std::cend</a></div><div class="ttdeci">constexpr auto cend(const _Container &__cont) noexcept(noexcept(std::end(__cont))) -> decltype(std::end(__cont))</div><div class="ttdoc">Return an iterator pointing to one past the last element of the const container.</div><div class="ttdef"><b>Definition:</b> <a href="a00458_source.html#l00127">range_access.h:127</a></div></div>
<div class="ttc" id="a07923_html_ae957699b810eb3313916800773e103d7"><div class="ttname"><a href="a07923.html#ae957699b810eb3313916800773e103d7">std::vector::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00716">stl_vector.h:716</a></div></div>
<div class="ttc" id="a06707_html"><div class="ttname"><a href="a06707.html">std::sub_match< _Bi_iter ></a></div></div>
<div class="ttc" id="a01541_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01541.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="a00029_source.html#l00089">initializer_list:89</a></div></div>
<div class="ttc" id="a07923_html_aedc1ee21f6ca2b8304b4f1f430125c8d"><div class="ttname"><a href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">std::vector::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00805">stl_vector.h:805</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00644.html">vector.tcc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
589
