<!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++: stl_construct.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(initResizable); /* @license-end */</script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.15 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(function(){initNavTree('a00536_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">stl_construct.h</div> </div> </div><!--header--> <div class="contents"> <a href="a00536.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">// nonstandard construct and destroy functions -*- 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,1997</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** @file bits/stl_construct.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{memory}</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef _STL_CONSTRUCT_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_CONSTRUCT_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00032.html">new</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00422.html">bits/move.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a16479.html">ext/alloc_traits.h</a>></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"></span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> /**</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * Constructs an object in existing memory by invoking an allocated</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * object's constructor with an initializer.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> */</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _T1, <span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="a01541.html#ae0f6a1883f4e98bc2ca573c992447fc2"> 74</a></span>  <a class="code" href="a01541.html#ae0f6a1883f4e98bc2ca573c992447fc2">_Construct</a>(_T1* __p, _Args&&... __args)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _T1, <span class="keyword">typename</span> _T2></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="a01541.html#ae0f6a1883f4e98bc2ca573c992447fc2">_Construct</a>(_T1* __p, <span class="keyword">const</span> _T2& __value)</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// 402. wrong new expression in [some_]allocator::construct</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  ::new(static_cast<void*>(__p)) _T1(__value);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor">#endif</span></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>  <span class="keyword">template</span><<span class="keyword">typename</span> _T1></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  _Construct_novalue(_T1* __p)</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  { ::new(static_cast<void*>(__p)) _T1; }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"></span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> /**</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * Destroy the object pointed to by a pointer type.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> */</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="a01541.html#a468dae7cc599699643eafa95cc9999af"> 97</a></span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(_Tp* __pointer)</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  { __pointer->~_Tp(); }</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="keyword">template</span><<span class="keywordtype">bool</span>></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">struct </span>_Destroy_aux</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  __destroy(_ForwardIterator __first, _ForwardIterator __last)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__first));</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  };</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">struct </span>_Destroy_aux<true></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  __destroy(_ForwardIterator, _ForwardIterator) { }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  };</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"></span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> /**</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> * Destroy a range of objects. If the value_type of the object has</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * a trivial destructor, the compiler should optimize all of this</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> * away, otherwise the objects' destructors must be invoked.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> */</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="a01541.html#a861bec05eddf4c399633ec8ac1d20844"> 127</a></span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(_ForwardIterator __first, _ForwardIterator __last)</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>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  _Value_type;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// A deleted destructor is trivial, this ensures we reject such types:</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  static_assert(<a class="code" href="a03543.html">is_destructible<_Value_type>::value</a>,</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="stringliteral">"value type is destructible"</span>);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  std::_Destroy_aux<__has_trivial_destructor(_Value_type)>::</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  __destroy(__first, __last);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span>></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">struct </span>_Destroy_n_aux</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Size></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">static</span> _ForwardIterator</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  __destroy_n(_ForwardIterator __first, _Size __count)</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">for</span> (; __count > 0; (void)++__first, --__count)</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__first));</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  };</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">struct </span>_Destroy_n_aux<true></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>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Size></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">static</span> _ForwardIterator</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  __destroy_n(_ForwardIterator __first, _Size __count)</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  {</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__first, __count);</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  };</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"></span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> /**</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> * Destroy a range of objects. If the value_type of the object has</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> * a trivial destructor, the compiler should optimize all of this</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> * away, otherwise the objects' destructors must be invoked.</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> */</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Size></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keyword">inline</span> _ForwardIterator</div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="a01541.html#aa2c8dbc3c44d5ffc170cd6cff9afd5b4"> 172</a></span>  <a class="code" href="a01541.html#aa2c8dbc3c44d5ffc170cd6cff9afd5b4">_Destroy_n</a>(_ForwardIterator __first, _Size __count)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _Value_type;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// A deleted destructor is trivial, this ensures we reject such types:</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  static_assert(<a class="code" href="a03543.html">is_destructible<_Value_type>::value</a>,</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="stringliteral">"value type is destructible"</span>);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">return</span> std::_Destroy_n_aux<__has_trivial_destructor(_Value_type)>::</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  __destroy_n(__first, __count);</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="comment"></span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> /**</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * Destroy a range of objects using the supplied allocator. For</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> * nondefault allocators we do not optimize away invocation of </span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * destroy() even if _Tp has a trivial destructor.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> */</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Allocator></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="a01541.html#aaebc2b9c5255ef8ceb7851484e83e0fa"> 193</a></span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  _Allocator& __alloc)</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  {</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Allocator></a> __traits;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  __traits::destroy(__alloc, <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__first));</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  allocator<_Tp>&)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  {</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">_Destroy</a>(__first, __last);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  destroy_at(_Tp* __location)</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>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__location);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  destroy(_ForwardIterator __first, _ForwardIterator __last)</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="a01541.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__first, __last);</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</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="keyword">template</span> <<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Size></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">inline</span> _ForwardIterator</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  destroy_n(_ForwardIterator __first, _Size __count)</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> <a class="code" href="a01541.html#aa2c8dbc3c44d5ffc170cd6cff9afd5b4">std::_Destroy_n</a>(__first, __count);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_CONSTRUCT_H */</span><span class="preprocessor"></span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="ttc" id="a00422_html"><div class="ttname"><a href="a00422.html">move.h</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="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="a03543_html"><div class="ttname"><a href="a03543.html">std::is_destructible</a></div><div class="ttdoc">is_destructible</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00818">type_traits:818</a></div></div> <div class="ttc" id="a01541_html_aa2c8dbc3c44d5ffc170cd6cff9afd5b4"><div class="ttname"><a href="a01541.html#aa2c8dbc3c44d5ffc170cd6cff9afd5b4">std::_Destroy_n</a></div><div class="ttdeci">_ForwardIterator _Destroy_n(_ForwardIterator __first, _Size __count)</div><div class="ttdef"><b>Definition:</b> <a href="a00536_source.html#l00172">stl_construct.h:172</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="a00032_html"><div class="ttname"><a href="a00032.html">new</a></div></div> <div class="ttc" id="a16479_html"><div class="ttname"><a href="a16479.html">alloc_traits.h</a></div></div> <div class="ttc" id="a10159_html"><div class="ttname"><a href="a10159.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++11 allocators.</div><div class="ttdef"><b>Definition:</b> <a href="a16479_source.html#l00050">ext/alloc_traits.h:50</a></div></div> <div class="ttc" id="a01541_html_ae0f6a1883f4e98bc2ca573c992447fc2"><div class="ttname"><a href="a01541.html#ae0f6a1883f4e98bc2ca573c992447fc2">std::_Construct</a></div><div class="ttdeci">void _Construct(_T1 *__p, _Args &&... __args)</div><div class="ttdef"><b>Definition:</b> <a href="a00536_source.html#l00074">stl_construct.h:74</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="a00536.html">stl_construct.h</a></li> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li> </ul> </div> </body> </html>