<!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_list.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('a00557_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_list.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00557.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">// List implementation -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2001-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_list.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{list}</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_LIST_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_LIST_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="a00308.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a16479.html">ext/alloc_traits.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#include <<a class="code" href="a00029.html">initializer_list</a>></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <<a class="code" href="a00269.html">bits/allocated_ptr.h</a>></span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#include <<a class="code" href="a01019.html">ext/aligned_buffer.h</a>></span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</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> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">namespace </span>__detail</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="comment">// Supporting structures are split into common and templated</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// types; the latter publicly inherits from the former in an</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// effort to reduce code duplication. This results in some</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// "needless" static_cast'ing later on, but it's all safe</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// downcasting.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"></span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> /// Common part of a node in the %list.</span></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="a07699.html"> 80</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a07699.html">_List_node_base</a></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="a07699.html">_List_node_base</a>* _M_next;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="a07699.html">_List_node_base</a>* _M_prev;</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="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  swap(<a class="code" href="a07699.html">_List_node_base</a>& __x, <a class="code" href="a07699.html">_List_node_base</a>& __y) _GLIBCXX_USE_NOEXCEPT;</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  _M_transfer(<a class="code" href="a07699.html">_List_node_base</a>* <span class="keyword">const</span> __first,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="a07699.html">_List_node_base</a>* <span class="keyword">const</span> __last) _GLIBCXX_USE_NOEXCEPT;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  _M_reverse() _GLIBCXX_USE_NOEXCEPT;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</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>  _M_hook(<a class="code" href="a07699.html">_List_node_base</a>* <span class="keyword">const</span> __position) _GLIBCXX_USE_NOEXCEPT;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  _M_unhook() _GLIBCXX_USE_NOEXCEPT;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  };</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"></span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> /// The %list node header.</span></div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="a07703.html"> 103</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a07703.html">_List_node_header</a> : <span class="keyword">public</span> <a class="code" href="a07699.html">_List_node_base</a></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::size_t _M_size;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="a07703.html">_List_node_header</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  { _M_init(); }</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="a07703.html">_List_node_header</a>(<a class="code" href="a07703.html">_List_node_header</a>&& __x) noexcept</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  : <a class="code" href="a07699.html">_List_node_base</a>{ __x._M_next, __x._M_prev }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor"># if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  , _M_size(__x._M_size)</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"># endif</span></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="keywordflow">if</span> (__x._M_base()->_M_next == __x._M_base())</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  this->_M_next = this->_M_prev = <span class="keyword">this</span>;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  {</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  this->_M_next->_M_prev = this->_M_prev->_M_next = this->_M_base();</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  __x._M_init();</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  _M_move_nodes(<a class="code" href="a07703.html">_List_node_header</a>&& __x)</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="a07699.html">_List_node_base</a>* <span class="keyword">const</span> __xnode = __x._M_base();</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span> (__xnode->_M_next == __xnode)</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  _M_init();</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="a07699.html">_List_node_base</a>* <span class="keyword">const</span> __node = this->_M_base();</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  __node->_M_next = __xnode->_M_next;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  __node->_M_prev = __xnode->_M_prev;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  __node->_M_next->_M_prev = __node->_M_prev->_M_next = __node;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="preprocessor"># if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  _M_size = __x._M_size;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  __x._M_init();</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  _M_init() _GLIBCXX_NOEXCEPT</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>  this->_M_next = this->_M_prev = <span class="keyword">this</span>;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  this->_M_size = 0;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="preprocessor">#endif</span></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">private</span>:</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="a07699.html">_List_node_base</a>* _M_base() { <span class="keywordflow">return</span> <span class="keyword">this</span>; }</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>  } <span class="comment">// namespace detail</span></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> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"></span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> /// An actual node in the %list.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="a07707.html"> 166</a></span>  <span class="keyword">struct </span><a class="code" href="a07707.html">_List_node</a> : <span class="keyword">public</span> <a class="code" href="a07699.html">__detail::_List_node_base</a></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  __gnu_cxx::__aligned_membuf<_Tp> _M_storage;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  _Tp* _M_valptr() { <span class="keywordflow">return</span> _M_storage._M_ptr(); }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  _Tp <span class="keyword">const</span>* _M_valptr()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_storage._M_ptr(); }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  _Tp _M_data;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  _Tp* _M_valptr() { <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(_M_data); }</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _Tp <span class="keyword">const</span>* _M_valptr()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(_M_data); }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  };</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"></span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> /**</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * @brief A list::iterator.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> *</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * All the functions are op overloads.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> */</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></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">struct </span><a class="code" href="a07647.html">_List_iterator</a></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">typedef</span> <a class="code" href="a07647.html">_List_iterator<_Tp></a> _Self;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">typedef</span> <a class="code" href="a07707.html">_List_node<_Tp></a> _Node;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">typedef</span> <a class="code" href="a07667.html">std::bidirectional_iterator_tag</a> iterator_category;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">typedef</span> _Tp* pointer;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">typedef</span> _Tp& reference;</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>  <a class="code" href="a07647.html">_List_iterator</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  : _M_node() { }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  _List_iterator(__detail::_List_node_base* __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  : _M_node(__x) { }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  _Self</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  _M_const_cast() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  { <span class="keywordflow">return</span> *<span class="keyword">this</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>  <span class="comment">// Must downcast from _List_node_base to _List_node to get to value.</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  reference</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  operator*() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  { <span class="keywordflow">return</span> *static_cast<_Node*>(_M_node)->_M_valptr(); }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  pointer</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  operator->() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  { <span class="keywordflow">return</span> static_cast<_Node*>(_M_node)->_M_valptr(); }</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>  _Self&</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  operator++() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  {</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  _M_node = _M_node->_M_next;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</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>  _Self</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  operator++(<span class="keywordtype">int</span>) _GLIBCXX_NOEXCEPT</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>  _Self __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  _M_node = _M_node->_M_next;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> __tmp;</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> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  _Self&</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  operator--() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  _M_node = _M_node->_M_prev;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</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>  _Self</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  operator--(<span class="keywordtype">int</span>) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  _Self __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  _M_node = _M_node->_M_prev;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  operator==(<span class="keyword">const</span> _Self& __x) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  { <span class="keywordflow">return</span> _M_node == __x._M_node; }</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>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  operator!=(<span class="keyword">const</span> _Self& __x) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  { <span class="keywordflow">return</span> _M_node != __x._M_node; }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// The only member points to the %list element.</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  __detail::_List_node_base* _M_node;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  };</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"></span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> /**</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> * @brief A list::const_iterator.</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> *</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> * All the functions are op overloads.</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> */</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">struct </span>_List_const_iterator</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>  <span class="keyword">typedef</span> _List_const_iterator<_Tp> _Self;</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _List_node<_Tp> _Node;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">typedef</span> _List_iterator<_Tp> iterator;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">typedef</span> <a class="code" href="a07667.html">std::bidirectional_iterator_tag</a> iterator_category;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp* pointer;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp& reference;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  _List_const_iterator() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  : _M_node() { }</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  _List_const_iterator(<span class="keyword">const</span> __detail::_List_node_base* __x)</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  : _M_node(__x) { }</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>  _List_const_iterator(<span class="keyword">const</span> iterator& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  : _M_node(__x._M_node) { }</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  iterator</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  _M_const_cast() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  { <span class="keywordflow">return</span> iterator(const_cast<__detail::_List_node_base*>(_M_node)); }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// Must downcast from List_node_base to _List_node to get to value.</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  reference</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  operator*() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  { <span class="keywordflow">return</span> *static_cast<_Node*>(_M_node)->_M_valptr(); }</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</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  operator->() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  { <span class="keywordflow">return</span> static_cast<_Node*>(_M_node)->_M_valptr(); }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  _Self&</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  operator++() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  _M_node = _M_node->_M_next;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</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>  _Self</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  operator++(<span class="keywordtype">int</span>) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  _Self __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  _M_node = _M_node->_M_next;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  _Self&</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  operator--() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  _M_node = _M_node->_M_prev;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</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>  _Self</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  operator--(<span class="keywordtype">int</span>) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  {</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  _Self __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  _M_node = _M_node->_M_prev;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</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="keywordtype">bool</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  operator==(<span class="keyword">const</span> _Self& __x) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  { <span class="keywordflow">return</span> _M_node == __x._M_node; }</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>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  operator!=(<span class="keyword">const</span> _Self& __x) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  { <span class="keywordflow">return</span> _M_node != __x._M_node; }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// The only member points to the %list element.</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">const</span> __detail::_List_node_base* _M_node;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  };</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Val></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  operator==(<span class="keyword">const</span> _List_iterator<_Val>& __x,</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">const</span> _List_const_iterator<_Val>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  { <span class="keywordflow">return</span> __x._M_node == __y._M_node; }</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> _Val></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  operator!=(<span class="keyword">const</span> _List_iterator<_Val>& __x,</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> _List_const_iterator<_Val>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  { <span class="keywordflow">return</span> __x._M_node != __y._M_node; }</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> _GLIBCXX_BEGIN_NAMESPACE_CXX11<span class="comment"></span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> /// See bits/stl_deque.h's _Deque_base for an explanation.</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00357"></a><span class="lineno"><a class="line" href="a07711.html"> 357</a></span>  <span class="keyword">class </span><a class="code" href="a07711.html">_List_base</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>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Alloc>::template</a></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  rebind<_Tp>::other _Tp_alloc_type;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> <a class="code" href="a10159.html">_Tp_alloc_traits</a>;</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp_alloc_traits::template</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  rebind<_List_node<_Tp> >::other _Node_alloc_type;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Node_alloc_type></a> <a class="code" href="a10159.html">_Node_alloc_traits</a>;</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="preprocessor">#if !_GLIBCXX_INLINE_VERSION</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keyword">static</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  _S_distance(<span class="keyword">const</span> <a class="code" href="a07699.html">__detail::_List_node_base</a>* __first,</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">const</span> <a class="code" href="a07699.html">__detail::_List_node_base</a>* __last)</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordtype">size_t</span> __n = 0;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  {</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  __first = __first->_M_next;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  ++__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>  <span class="keywordflow">return</span> __n;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">struct </span>_List_impl</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  : <span class="keyword">public</span> _Node_alloc_type</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  {</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="a07703.html">__detail::_List_node_header</a> _M_node;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _List_impl() _GLIBCXX_NOEXCEPT_IF(</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="a03631.html">is_nothrow_default_constructible<_Node_alloc_type>::value</a>)</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  : _Node_alloc_type()</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> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  _List_impl(<span class="keyword">const</span> _Node_alloc_type& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  : _Node_alloc_type(__a)</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  { }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </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>  _List_impl(_List_impl&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  _List_impl(_Node_alloc_type&& __a, _List_impl&& __x)</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  : _Node_alloc_type(std::move(__a)), _M_node(std::move(__x._M_node))</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  { }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> </div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  _List_impl(_Node_alloc_type&& __a) noexcept</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  : _Node_alloc_type(std::move(__a))</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  { }</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>  _List_impl _M_impl;</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> </div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordtype">size_t</span> _M_get_size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_impl._M_node._M_size; }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordtype">void</span> _M_set_size(<span class="keywordtype">size_t</span> __n) { _M_impl._M_node._M_size = __n; }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordtype">void</span> _M_inc_size(<span class="keywordtype">size_t</span> __n) { _M_impl._M_node._M_size += __n; }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordtype">void</span> _M_dec_size(<span class="keywordtype">size_t</span> __n) { _M_impl._M_node._M_size -= __n; }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="preprocessor"># if !_GLIBCXX_INLINE_VERSION</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  _M_distance(<span class="keyword">const</span> <a class="code" href="a07699.html">__detail::_List_node_base</a>* __first,</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">const</span> <a class="code" href="a07699.html">__detail::_List_node_base</a>* __last)<span class="keyword"> const</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _S_distance(__first, __last); }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">// return the stored size</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordtype">size_t</span> _M_node_count()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> _M_get_size(); }</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">// dummy implementations used when the size is not stored</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordtype">size_t</span> _M_get_size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 0; }</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordtype">void</span> _M_set_size(<span class="keywordtype">size_t</span>) { }</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordtype">void</span> _M_inc_size(<span class="keywordtype">size_t</span>) { }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordtype">void</span> _M_dec_size(<span class="keywordtype">size_t</span>) { }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="preprocessor"># if !_GLIBCXX_INLINE_VERSION</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordtype">size_t</span> _M_distance(<span class="keyword">const</span> <span class="keywordtype">void</span>*, <span class="keyword">const</span> <span class="keywordtype">void</span>*)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 0; }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> </div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// count the number of nodes</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordtype">size_t</span> _M_node_count()<span class="keyword"> const</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">return</span> _S_distance(_M_impl._M_node._M_next,</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(_M_impl._M_node));</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> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">typename</span> _Node_alloc_traits::pointer</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  _M_get_node()</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  { <span class="keywordflow">return</span> <a class="code" href="a04639.html#a1afbf725286c9e82ba6166dcc04b10bc">_Node_alloc_traits::allocate</a>(_M_impl, 1); }</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  _M_put_node(<span class="keyword">typename</span> _Node_alloc_traits::pointer __p) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  { <a class="code" href="a04639.html#ae5f6b86b98b17e2ba39243ca8eaf4ee1">_Node_alloc_traits::deallocate</a>(_M_impl, __p, 1); }</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> </div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</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>  _Node_alloc_type&</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  _M_get_Node_allocator() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  { <span class="keywordflow">return</span> _M_impl; }</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> </div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">const</span> _Node_alloc_type&</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  _M_get_Node_allocator() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  { <span class="keywordflow">return</span> _M_impl; }</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <a class="code" href="a07711.html">_List_base</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="a07711.html">_List_base</a>() { }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <a class="code" href="a07711.html">_List_base</a>(<span class="keyword">const</span> _Node_alloc_type& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  : _M_impl(__a)</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> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="a07711.html">_List_base</a>(<a class="code" href="a07711.html">_List_base</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="preprocessor"># if !_GLIBCXX_INLINE_VERSION</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <a class="code" href="a07711.html">_List_base</a>(<a class="code" href="a07711.html">_List_base</a>&& __x, _Node_alloc_type&& __a)</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  : _M_impl(std::move(__a))</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  {</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">if</span> (__x._M_get_Node_allocator() == _M_get_Node_allocator())</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  _M_move_nodes(std::move(__x));</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// else caller must move individual elements.</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// Used when allocator is_always_equal.</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <a class="code" href="a07711.html">_List_base</a>(_Node_alloc_type&& __a, <a class="code" href="a07711.html">_List_base</a>&& __x)</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  : _M_impl(std::move(__a), std::move(__x._M_impl))</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  { }</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> </div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// Used when allocator !is_always_equal.</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <a class="code" href="a07711.html">_List_base</a>(_Node_alloc_type&& __a)</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  : _M_impl(std::move(__a))</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  { }</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  _M_move_nodes(<a class="code" href="a07711.html">_List_base</a>&& __x)</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  { _M_impl._M_node._M_move_nodes(std::move(__x._M_impl._M_node)); }</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// This is what actually destroys the list.</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  ~<a class="code" href="a07711.html">_List_base</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  { _M_clear(); }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  _M_clear() _GLIBCXX_NOEXCEPT;</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  _M_init() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  { this->_M_impl._M_node._M_init(); }</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  };</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"></span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment"> /**</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment"> * @brief A standard container with linear time access to elements,</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment"> * and fixed time insertion/deletion at any point in the sequence.</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment"> *</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment"> * @ingroup sequences</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment"> *</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment"> * @tparam _Tp Type of element.</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment"> *</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and a</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"> * <a href="tables.html#67">sequence</a>, including the</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> * <a href="tables.html#68">optional sequence requirements</a> with the</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> * %exception of @c at and @c operator[].</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> *</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> * This is a @e doubly @e linked %list. Traversal up and down the</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment"> * %list requires linear time, but adding and removing elements (or</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> * @e nodes) is done in constant time, regardless of where the</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> * change takes place. Unlike std::vector and std::deque,</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> * random-access iterators are not provided, so subscripting ( @c</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> * [] ) access is not allowed. For algorithms which only need</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> * sequential access, this lack makes no difference.</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> *</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * Also unlike the other standard containers, std::list provides</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> * specialized algorithms %unique to linked lists, such as</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> * splicing, sorting, and in-place reversal.</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"> *</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment"> * A couple points on memory allocation for list<Tp>:</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment"> *</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="comment"> * First, we never actually allocate a Tp, we allocate</span></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="comment"> * List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment"> * that after elements from %list<X,Alloc1> are spliced into</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"> * %list<X,Alloc2>, destroying the memory of the second %list is a</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> *</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> * Second, a %list conceptually represented as</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment"> * @code</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"> * A <---> B <---> C <---> D</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment"> * @endcode</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment"> * is actually circular; a link exists between A and D. The %list</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment"> * class holds (as its only data member) a private list::iterator</span></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment"> * pointing to @e D, not to @e A! To get to the head of the %list,</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"> * we start at the tail and move forward by one. When this member</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="comment"> * iterator's next/previous pointers refer to itself, the %list is</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"> * %empty.</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> */</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc = std::allocator<_Tp> ></div><div class="line"><a name="l00564"></a><span class="lineno"><a class="line" href="a07719.html"> 564</a></span>  <span class="keyword">class </span><a class="code" href="a07719.html">list</a> : <span class="keyword">protected</span> <a class="code" href="a07711.html">_List_base</a><_Tp, _Alloc></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  {</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="preprocessor"># if __cplusplus < 201103L</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="preprocessor">#endif</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  static_assert(<a class="code" href="a03883.html">is_same</a><<span class="keyword">typename</span> remove_cv<_Tp>::type, _Tp>::value,</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="stringliteral">"std::list must have a non-const, non-volatile value_type"</span>);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="preprocessor"># ifdef __STRICT_ANSI__</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  static_assert(<a class="code" href="a03883.html">is_same<typename _Alloc::value_type, _Tp>::value</a>,</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="stringliteral">"std::list must have the same value_type as its allocator"</span>);</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> </div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">typedef</span> <a class="code" href="a07711.html">_List_base<_Tp, _Alloc></a> <a class="code" href="a07711.html">_Base</a>;</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::_Tp_alloc_type _Tp_alloc_type;</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10159.html">_Base::_Tp_alloc_traits</a> <a class="code" href="a10159.html">_Tp_alloc_traits</a>;</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::_Node_alloc_type _Node_alloc_type;</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10159.html">_Base::_Node_alloc_traits</a> <a class="code" href="a10159.html">_Node_alloc_traits</a>;</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> </div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp_alloc_traits::pointer pointer;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp_alloc_traits::const_pointer const_pointer;</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp_alloc_traits::reference reference;</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp_alloc_traits::const_reference const_reference;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keyword">typedef</span> <a class="code" href="a07647.html">_List_iterator<_Tp></a> <a class="code" href="a07647.html">iterator</a>;</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">typedef</span> <a class="code" href="a07651.html">_List_const_iterator<_Tp></a> <a class="code" href="a07651.html">const_iterator</a>;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keyword">typedef</span> <a class="code" href="a07615.html">std::reverse_iterator<const_iterator></a> <a class="code" href="a07615.html">const_reverse_iterator</a>;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keyword">typedef</span> <a class="code" href="a07615.html">std::reverse_iterator<iterator></a> <a class="code" href="a07615.html">reverse_iterator</a>;</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// Note that pointers-to-_Node's can be ctor-converted to</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="comment">// iterator types.</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keyword">typedef</span> <a class="code" href="a07707.html">_List_node<_Tp></a> <a class="code" href="a07707.html">_Node</a>;</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> </div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">using</span> _Base::_M_impl;</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keyword">using</span> _Base::_M_put_node;</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keyword">using</span> _Base::_M_get_node;</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keyword">using</span> _Base::_M_get_Node_allocator;</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment"></span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> /**</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment"> * @param __args An instance of user data.</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment"> *</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="comment"> * Allocates space for a new node and constructs a copy of</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment"> * @a __args in it.</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment"> */</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="a07707.html">_Node</a>*</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <a class="code" href="a07719.html#a751c5b84e439b1647db6b733bbaa570f">_M_create_node</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  {</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <a class="code" href="a07707.html">_Node</a>* __p = this->_M_get_node();</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  __try</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  {</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  _Tp_alloc_type __alloc(_M_get_Node_allocator());</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  __alloc.construct(__p->_M_valptr(), __x);</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  }</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  __catch(...)</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  {</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  _M_put_node(__p);</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  __throw_exception_again;</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>  <span class="keywordflow">return</span> __p;</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  }</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <a class="code" href="a07707.html">_Node</a>*</div><div class="line"><a name="l00640"></a><span class="lineno"><a class="line" href="a07719.html#a751c5b84e439b1647db6b733bbaa570f"> 640</a></span>  <a class="code" href="a07719.html#a751c5b84e439b1647db6b733bbaa570f">_M_create_node</a>(_Args&&... __args)</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  {</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">auto</span> __p = this->_M_get_node();</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keyword">auto</span>& __alloc = _M_get_Node_allocator();</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <a class="code" href="a04695.html">__allocated_ptr<_Node_alloc_type></a> __guard{__alloc, __p};</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  _Node_alloc_traits::construct(__alloc, __p->_M_valptr(),</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  __guard = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">return</span> __p;</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  }</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">static</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  _S_distance(const_iterator __first, const_iterator __last)</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  { <span class="keywordflow">return</span> <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last); }</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="comment">// return the stored size</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  _M_node_count()<span class="keyword"> const</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_get_size(); }</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// dummy implementations used when the size is not stored</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keyword">static</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  _S_distance(const_iterator, const_iterator)</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  { <span class="keywordflow">return</span> 0; }</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>  <span class="comment">// count the number of nodes</span></div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  _M_node_count()<span class="keyword"> const</span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), <a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>()); }</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> </div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// [23.2.2.1] construct/copy/destroy</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// (assign() and get_allocator() are also listed in this section)</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="comment"></span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> /**</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> * @brief Creates a %list with no elements.</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> */</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>() { }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span> <span class="comment"></span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> <span class="comment"> /**</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> <span class="comment"> * @brief Creates a %list with no elements.</span></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> <span class="comment"> */</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00691"></a><span class="lineno"><a class="line" href="a07719.html#a7b6d1424066dbfd18daebac90d143837"> 691</a></span>  <a class="code" href="a07719.html#a7b6d1424066dbfd18daebac90d143837">list</a>(<span class="keyword">const</span> allocator_type& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  : <a class="code" href="a07711.html">_Base</a>(_Node_alloc_type(__a)) { }</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span> </div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="comment"> /**</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"> * @brief Creates a %list with default constructed elements.</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="comment"> *</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment"> * This constructor fills the %list with @a __n default</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> * constructed elements.</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"> */</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00704"></a><span class="lineno"><a class="line" href="a07719.html#a3f6568813bbdefbd94cbde64e3e45366"> 704</a></span>  <a class="code" href="a07719.html#a3f6568813bbdefbd94cbde64e3e45366">list</a>(size_type __n, <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  : <a class="code" href="a07711.html">_Base</a>(_Node_alloc_type(__a))</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  { _M_default_initialize(__n); }</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="comment"></span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="comment"> /**</span></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment"> * @brief Creates a %list with copies of an exemplar element.</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> * @param __value An element to copy.</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment"> *</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment"> * This constructor fills the %list with @a __n copies of @a __value.</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment"> */</span></div><div class="line"><a name="l00716"></a><span class="lineno"><a class="line" href="a07719.html#ac739777416320440d35c6de1a42ba818"> 716</a></span>  <a class="code" href="a07719.html#ac739777416320440d35c6de1a42ba818">list</a>(size_type __n, <span class="keyword">const</span> value_type& __value,</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  : <a class="code" href="a07711.html">_Base</a>(_Node_alloc_type(__a))</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  { _M_fill_initialize(__n, __value); }</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment"> /**</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="comment"> * @brief Creates a %list with copies of an exemplar element.</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="comment"> * @param __value An element to copy.</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> <span class="comment"> *</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment"> * This constructor fills the %list with @a __n copies of @a __value.</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> <span class="comment"> */</span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(size_type __n, <span class="keyword">const</span> value_type& __value = value_type(),</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  : _Base(_Node_alloc_type(__a))</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  { _M_fill_initialize(__n, __value); }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment"></span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment"> /**</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"> * @brief %List copy constructor.</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> * @param __x A %list of identical element and allocator types.</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"> *</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> * The newly-created %list uses a copy of the allocation object used</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> * by @a __x (unless the allocator traits dictate a different object).</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span> <span class="comment"> */</span></div><div class="line"><a name="l00743"></a><span class="lineno"><a class="line" href="a07719.html#aec4657b924fb0c29b7d3e347a2da97f0"> 743</a></span>  <a class="code" href="a07719.html#aec4657b924fb0c29b7d3e347a2da97f0">list</a>(<span class="keyword">const</span> <a class="code" href="a07719.html">list</a>& __x)</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  : <a class="code" href="a07711.html">_Base</a>(<a class="code" href="a10159.html">_Node_alloc_traits</a>::</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  _S_select_on_copy(__x._M_get_Node_allocator()))</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  { _M_initialize_dispatch(__x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>(), __false_type()); }</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> <span class="comment"> /**</span></div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> <span class="comment"> * @brief %List move constructor.</span></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment"> *</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment"> * The newly-created %list contains the exact contents of the moved</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"> * instance. The contents of the moved instance are a valid, but</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="comment"> * unspecified %list.</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment"> */</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(<a class="code" href="a07719.html">list</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment"></span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> /**</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"> * @brief Builds a %list from an initializer_list</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"> * @param __l An initializer_list of value_type.</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> *</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"> * Create a %list consisting of copies of the elements in the</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"> * initializer_list @a __l. This is linear in __l.size().</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment"> */</span></div><div class="line"><a name="l00766"></a><span class="lineno"><a class="line" href="a07719.html#abc914a91c0740ca3f52168d0b631dbf8"> 766</a></span>  <a class="code" href="a07719.html#abc914a91c0740ca3f52168d0b631dbf8">list</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  : <a class="code" href="a07711.html">_Base</a>(_Node_alloc_type(__a))</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  { _M_initialize_dispatch(__l.begin(), __l.end(), __false_type()); }</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> </div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(<span class="keyword">const</span> <a class="code" href="a07719.html">list</a>& __x, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  : _Base(_Node_alloc_type(__a))</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  { _M_initialize_dispatch(__x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>(), __false_type()); }</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> </div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&& __x, <span class="keyword">const</span> allocator_type& __a, <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>) noexcept</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  : _Base(_Node_alloc_type(__a), std::move(__x))</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  { }</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> </div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&& __x, <span class="keyword">const</span> allocator_type& __a, <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  : _Base(_Node_alloc_type(__a))</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  {</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">if</span> (__x._M_get_Node_allocator() == this->_M_get_Node_allocator())</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  this->_M_move_nodes(std::move(__x));</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), std::__make_move_if_noexcept_iterator(__x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>()),</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  std::__make_move_if_noexcept_iterator(__x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>()));</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> </div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&& __x, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  noexcept(_Node_alloc_traits::_S_always_equal())</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  : <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(<a class="code" href="a01541.html">std</a>::move(__x), __a,</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  typename _Node_alloc_traits::is_always_equal{})</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  { }</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span> <span class="comment"></span></div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="comment"> /**</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="comment"> * @brief Builds a %list from a range.</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> <span class="comment"> *</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="comment"> * Create a %list consisting of copies of the elements from</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="comment"> * [@a __first,@a __last). This is linear in N (where N is</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="comment"> * distance(@a __first,@a __last)).</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="comment"> */</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l00811"></a><span class="lineno"><a class="line" href="a07719.html#ad905b1f7f844c8715c654439611804a1"> 811</a></span>  <a class="code" href="a07719.html#ad905b1f7f844c8715c654439611804a1">list</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  : <a class="code" href="a07711.html">_Base</a>(_Node_alloc_type(__a))</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  { _M_initialize_dispatch(__first, __last, __false_type()); }</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  : _Base(_Node_alloc_type(__a))</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  {</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  _M_initialize_dispatch(__first, __last, _Integral());</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  }</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> </div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment"> /**</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment"> * No explicit dtor needed as the _Base dtor takes care of</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment"> * things. The _Base dtor only erases the elements, and note</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span> <span class="comment"> * that if the elements themselves are pointers, the pointed-to</span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="comment"> * memory is not touched in any way. Managing the pointer is</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment"> * the user's responsibility.</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"> */</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <a class="code" href="a07719.html#a6520eeff66a82d7b6e5eacffdcb2da6e">~list</a>() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment"></span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> <span class="comment"> /**</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="comment"> * @brief %List assignment operator.</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> <span class="comment"> * @param __x A %list of identical element and allocator types.</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> <span class="comment"> *</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> <span class="comment"> * All the elements of @a __x are copied.</span></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> <span class="comment"> *</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> <span class="comment"> * Whether the allocator is copied depends on the allocator traits.</span></div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> <span class="comment"> */</span></div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <a class="code" href="a07719.html#a35a994d029c0e0cf92abf1f468cfa140">operator=</a>(<span class="keyword">const</span> <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>& __x);</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span> <span class="comment"> /**</span></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span> <span class="comment"> * @brief %List move assignment operator.</span></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span> <span class="comment"> * @param __x A %list of identical element and allocator types.</span></div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> <span class="comment"> *</span></div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="comment"> * The contents of @a __x are moved into this %list (without copying).</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="comment"> *</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span> <span class="comment"> * Afterwards @a __x is a valid, but unspecified %list</span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span> <span class="comment"> *</span></div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span> <span class="comment"> * Whether the allocator is moved depends on the allocator traits.</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span> <span class="comment"> */</span></div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&</div><div class="line"><a name="l00861"></a><span class="lineno"><a class="line" href="a07719.html#a8f9b65b72c23e8c124c5f4a6e11013e0"> 861</a></span>  <a class="code" href="a07719.html#a8f9b65b72c23e8c124c5f4a6e11013e0">operator=</a>(<a class="code" href="a07719.html">list</a>&& __x)</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  noexcept(_Node_alloc_traits::_S_nothrow_move())</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  {</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  constexpr <span class="keywordtype">bool</span> __move_storage =</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  _Node_alloc_traits::_S_propagate_on_move_assign()</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  || _Node_alloc_traits::_S_always_equal();</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  _M_move_assign(std::move(__x), <a class="code" href="a03043.html">__bool_constant<__move_storage></a>());</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span> <span class="comment"></span></div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span> <span class="comment"> /**</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="comment"> * @brief %List initializer list assignment operator.</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> <span class="comment"> * @param __l An initializer_list of value_type.</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="comment"> *</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span> <span class="comment"> * Replace the contents of the %list with copies of the elements</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span> <span class="comment"> * in the initializer_list @a __l. This is linear in l.size().</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> <span class="comment"> */</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <a class="code" href="a07719.html">list</a>&</div><div class="line"><a name="l00879"></a><span class="lineno"><a class="line" href="a07719.html#a7b554a6eab6e57e565eedb7da72a83c5"> 879</a></span>  <a class="code" href="a07719.html#a7b554a6eab6e57e565eedb7da72a83c5">operator=</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  {</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  this-><a class="code" href="a07719.html#a9f1a22c8bd2a8d5ecacab44644f513db">assign</a>(__l.begin(), __l.end());</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="comment"></span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="comment"> /**</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="comment"> * @brief Assigns a given value to a %list.</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> <span class="comment"> * @param __n Number of elements to be assigned.</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="comment"> * @param __val Value to be assigned.</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> <span class="comment"> *</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span> <span class="comment"> * This function fills a %list with @a __n copies of the given</span></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span> <span class="comment"> * value. Note that the assignment completely changes the %list</span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span> <span class="comment"> * and that the resulting %list's size is the same as the number</span></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span> <span class="comment"> * of elements assigned.</span></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> <span class="comment"> */</span></div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00897"></a><span class="lineno"><a class="line" href="a07719.html#a9f1a22c8bd2a8d5ecacab44644f513db"> 897</a></span>  <a class="code" href="a07719.html#a9f1a22c8bd2a8d5ecacab44644f513db">assign</a>(size_type __n, <span class="keyword">const</span> value_type& __val)</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  { _M_fill_assign(__n, __val); }</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="comment"></span></div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> <span class="comment"> /**</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> <span class="comment"> * @brief Assigns a range to a %list.</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> <span class="comment"> *</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> <span class="comment"> * This function fills a %list with copies of the elements in the</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> <span class="comment"> * range [@a __first,@a __last).</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> <span class="comment"> *</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> <span class="comment"> * Note that the assignment completely changes the %list and</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> * that the resulting %list's size is the same as the number of</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"> * elements assigned.</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> */</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00916"></a><span class="lineno"><a class="line" href="a07719.html#a6527fbbec76ab1a8a4a80c04e6fcac70"> 916</a></span>  <a class="code" href="a07719.html#a6527fbbec76ab1a8a4a80c04e6fcac70">assign</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  { _M_assign_dispatch(__first, __last, __false_type()); }</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <a class="code" href="a07719.html#a9f1a22c8bd2a8d5ecacab44644f513db">assign</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  {</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  _M_assign_dispatch(__first, __last, _Integral());</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> </div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment"> /**</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment"> * @brief Assigns an initializer_list to a %list.</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment"> * @param __l An initializer_list of value_type.</span></div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="comment"> *</span></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="comment"> * Replace the contents of the %list with copies of the elements</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="comment"> * in the initializer_list @a __l. This is linear in __l.size().</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> <span class="comment"> */</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00938"></a><span class="lineno"><a class="line" href="a07719.html#a396193b1480defeaa5f3367ca15ec35e"> 938</a></span>  <a class="code" href="a07719.html#a396193b1480defeaa5f3367ca15ec35e">assign</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  { this->_M_assign_dispatch(__l.begin(), __l.end(), __false_type()); }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="comment"></span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <span class="comment"> /// Get a copy of the memory allocation object.</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> <span class="comment"></span> allocator_type</div><div class="line"><a name="l00944"></a><span class="lineno"><a class="line" href="a07719.html#a31f6032941520f4d9187fdf8284ae914"> 944</a></span>  <a class="code" href="a07719.html#a31f6032941520f4d9187fdf8284ae914">get_allocator</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  { <span class="keywordflow">return</span> allocator_type(_Base::_M_get_Node_allocator()); }</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> </div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="comment">// iterators</span><span class="comment"></span></div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="comment"> /**</span></div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> <span class="comment"> * Returns a read/write iterator that points to the first element in the</span></div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> <span class="comment"> * %list. Iteration is done in ordinary element order.</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> <span class="comment"> */</span></div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00953"></a><span class="lineno"><a class="line" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3"> 953</a></span>  <a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  { <span class="keywordflow">return</span> <a class="code" href="a07647.html">iterator</a>(this->_M_impl._M_node._M_next); }</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="comment"></span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="comment"> /**</span></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the</span></div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="comment"> * first element in the %list. Iteration is done in ordinary</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span> <span class="comment"> */</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  const_iterator</div><div class="line"><a name="l00962"></a><span class="lineno"><a class="line" href="a07719.html#acd7d9dc641209c8e429d291db8f2de25"> 962</a></span>  <a class="code" href="a07719.html#acd7d9dc641209c8e429d291db8f2de25">begin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  { <span class="keywordflow">return</span> <a class="code" href="a07651.html">const_iterator</a>(this->_M_impl._M_node._M_next); }</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="comment"></span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="comment"> /**</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="comment"> * Returns a read/write iterator that points one past the last</span></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="comment"> * element in the %list. Iteration is done in ordinary element</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span> <span class="comment"> * order.</span></div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span> <span class="comment"> */</span></div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l00971"></a><span class="lineno"><a class="line" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6"> 971</a></span>  <a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  { <span class="keywordflow">return</span> <a class="code" href="a07647.html">iterator</a>(&this->_M_impl._M_node); }</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="comment"></span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"> /**</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment"> * the last element in the %list. Iteration is done in ordinary</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> */</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  const_iterator</div><div class="line"><a name="l00980"></a><span class="lineno"><a class="line" href="a07719.html#a39a7a20ed70dd4018608a3522d83124d"> 980</a></span>  <a class="code" href="a07719.html#a39a7a20ed70dd4018608a3522d83124d">end</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  { <span class="keywordflow">return</span> <a class="code" href="a07651.html">const_iterator</a>(&this->_M_impl._M_node); }</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment"></span></div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> <span class="comment"> /**</span></div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="comment"> * Returns a read/write reverse iterator that points to the last</span></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="comment"> * element in the %list. Iteration is done in reverse element</span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment"> * order.</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="comment"> */</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <a class="code" href="a07615.html">reverse_iterator</a></div><div class="line"><a name="l00989"></a><span class="lineno"><a class="line" href="a07719.html#a8a4cacefc7a58e913f2e9876df0d59de"> 989</a></span>  <a class="code" href="a07719.html#a8a4cacefc7a58e913f2e9876df0d59de">rbegin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">reverse_iterator</a>(<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>()); }</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="comment"></span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> <span class="comment"> /**</span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to</span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> <span class="comment"> * the last element in the %list. Iteration is done in reverse</span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"> */</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  const_reverse_iterator</div><div class="line"><a name="l00998"></a><span class="lineno"><a class="line" href="a07719.html#a3ba0b1fa92ccc5268e64c0023632aee7"> 998</a></span>  <a class="code" href="a07719.html#a3ba0b1fa92ccc5268e64c0023632aee7">rbegin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>()); }</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> <span class="comment"></span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="comment"> /**</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> <span class="comment"> * Returns a read/write reverse iterator that points to one</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> <span class="comment"> * before the first element in the %list. Iteration is done in</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> <span class="comment"> * reverse element order.</span></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="comment"> */</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <a class="code" href="a07615.html">reverse_iterator</a></div><div class="line"><a name="l01007"></a><span class="lineno"><a class="line" href="a07719.html#a4018c8137dc053cfd04641f1ab4b070e"> 1007</a></span>  <a class="code" href="a07719.html#a4018c8137dc053cfd04641f1ab4b070e">rend</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">reverse_iterator</a>(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>()); }</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> <span class="comment"></span></div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> <span class="comment"> /**</span></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to one</span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> <span class="comment"> * before the first element in the %list. Iteration is done in reverse</span></div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> <span class="comment"> */</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  const_reverse_iterator</div><div class="line"><a name="l01016"></a><span class="lineno"><a class="line" href="a07719.html#af134c3c02479d6b40c4b6dd9784ff9b2"> 1016</a></span>  <a class="code" href="a07719.html#af134c3c02479d6b40c4b6dd9784ff9b2">rend</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>()); }</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> </div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="comment"> /**</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the</span></div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> <span class="comment"> * first element in the %list. Iteration is done in ordinary</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="comment"> */</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  const_iterator</div><div class="line"><a name="l01026"></a><span class="lineno"><a class="line" href="a07719.html#aac9c52d90a45482d052dbb4b2040b6da"> 1026</a></span>  <a class="code" href="a07719.html#aac9c52d90a45482d052dbb4b2040b6da">cbegin</a>() const noexcept</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  { <span class="keywordflow">return</span> <a class="code" href="a07651.html">const_iterator</a>(this->_M_impl._M_node._M_next); }</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment"></span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment"> /**</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="comment"> * the last element in the %list. Iteration is done in ordinary</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="comment"> */</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  const_iterator</div><div class="line"><a name="l01035"></a><span class="lineno"><a class="line" href="a07719.html#a702400622789c3e0f1171369f803fcb8"> 1035</a></span>  <a class="code" href="a07719.html#a702400622789c3e0f1171369f803fcb8">cend</a>() const noexcept</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  { <span class="keywordflow">return</span> <a class="code" href="a07651.html">const_iterator</a>(&this->_M_impl._M_node); }</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="comment"></span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> <span class="comment"> /**</span></div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> <span class="comment"> * the last element in the %list. Iteration is done in reverse</span></div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> <span class="comment"> */</span></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  const_reverse_iterator</div><div class="line"><a name="l01044"></a><span class="lineno"><a class="line" href="a07719.html#ab0c1a4886327c94160ec35419c516f64"> 1044</a></span>  <a class="code" href="a07719.html#ab0c1a4886327c94160ec35419c516f64">crbegin</a>() const noexcept</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>()); }</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> <span class="comment"></span></div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> <span class="comment"> /**</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to one</span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> <span class="comment"> * before the first element in the %list. Iteration is done in reverse</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> <span class="comment"> */</span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  const_reverse_iterator</div><div class="line"><a name="l01053"></a><span class="lineno"><a class="line" href="a07719.html#af9bc7bbe49c3f41b0dfaa3acd5c89e12"> 1053</a></span>  <a class="code" href="a07719.html#af9bc7bbe49c3f41b0dfaa3acd5c89e12">crend</a>() const noexcept</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>()); }</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> </div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="comment">// [23.2.2.2] capacity</span><span class="comment"></span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="comment"> /**</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="comment"> * Returns true if the %list is empty. (Thus begin() would equal</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> <span class="comment"> * end().)</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="comment"> */</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01063"></a><span class="lineno"><a class="line" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe"> 1063</a></span>  <a class="code" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">empty</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  { <span class="keywordflow">return</span> this->_M_impl._M_node._M_next == &this->_M_impl._M_node; }</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="comment"></span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="comment"> /** Returns the number of elements in the %list. */</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  size_type</div><div class="line"><a name="l01068"></a><span class="lineno"><a class="line" href="a07719.html#a4b6c305dd92e3c76213778feba213da2"> 1068</a></span>  <a class="code" href="a07719.html#a4b6c305dd92e3c76213778feba213da2">size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  { <span class="keywordflow">return</span> _M_node_count(); }</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"></span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> <span class="comment"> /** Returns the size() of the largest possible %list. */</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  size_type</div><div class="line"><a name="l01073"></a><span class="lineno"><a class="line" href="a07719.html#ac0642b1d26b07dcf28d5fd72bfbdd6d1"> 1073</a></span>  <a class="code" href="a07719.html#ac0642b1d26b07dcf28d5fd72bfbdd6d1">max_size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  { <span class="keywordflow">return</span> <a class="code" href="a04639.html#a29c306bcb6a7676a516430a0e50b990a">_Node_alloc_traits::max_size</a>(_M_get_Node_allocator()); }</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> </div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> <span class="comment"> /**</span></div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> <span class="comment"> * @brief Resizes the %list to the specified number of elements.</span></div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> <span class="comment"> * @param __new_size Number of elements the %list should contain.</span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span> <span class="comment"> *</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> <span class="comment"> * This function will %resize the %list to the specified number</span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> <span class="comment"> * of elements. If the number is smaller than the %list's</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="comment"> * current size the %list is truncated, otherwise default</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> <span class="comment"> * constructed elements are appended.</span></div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> <span class="comment"> */</span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">resize</a>(size_type __new_size);</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> <span class="comment"></span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> <span class="comment"> /**</span></div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="comment"> * @brief Resizes the %list to the specified number of elements.</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="comment"> * @param __new_size Number of elements the %list should contain.</span></div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="comment"> * @param __x Data with which new elements should be populated.</span></div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> <span class="comment"> *</span></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <span class="comment"> * This function will %resize the %list to the specified number</span></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span> <span class="comment"> * of elements. If the number is smaller than the %list's</span></div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span> <span class="comment"> * current size the %list is truncated, otherwise the %list is</span></div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span> <span class="comment"> * extended and new elements are populated with given data.</span></div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> <span class="comment"> */</span></div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">resize</a>(size_type __new_size, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> <span class="comment"> /**</span></div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> <span class="comment"> * @brief Resizes the %list to the specified number of elements.</span></div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="comment"> * @param __new_size Number of elements the %list should contain.</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="comment"> * @param __x Data with which new elements should be populated.</span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <span class="comment"> *</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> <span class="comment"> * This function will %resize the %list to the specified number</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span> <span class="comment"> * of elements. If the number is smaller than the %list's</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> <span class="comment"> * current size the %list is truncated, otherwise the %list is</span></div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> <span class="comment"> * extended and new elements are populated with given data.</span></div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> <span class="comment"> */</span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">resize</a>(size_type __new_size, value_type __x = value_type());</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> </div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="comment">// element access</span><span class="comment"></span></div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> <span class="comment"> /**</span></div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> <span class="comment"> * Returns a read/write reference to the data at the first</span></div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span> <span class="comment"> * element of the %list.</span></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span> <span class="comment"> */</span></div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  reference</div><div class="line"><a name="l01122"></a><span class="lineno"><a class="line" href="a07719.html#ad4367625f1676f2fc0d56b891db683fe"> 1122</a></span>  <a class="code" href="a07719.html#ad4367625f1676f2fc0d56b891db683fe">front</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  { <span class="keywordflow">return</span> *<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(); }</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> <span class="comment"></span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> <span class="comment"> /**</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the first</span></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> <span class="comment"> * element of the %list.</span></div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="comment"> */</span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  const_reference</div><div class="line"><a name="l01130"></a><span class="lineno"><a class="line" href="a07719.html#a5393c199d92f965d065b677f2230e51e"> 1130</a></span>  <a class="code" href="a07719.html#a5393c199d92f965d065b677f2230e51e">front</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  { <span class="keywordflow">return</span> *<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(); }</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> <span class="comment"></span></div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> <span class="comment"> /**</span></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span> <span class="comment"> * Returns a read/write reference to the data at the last element</span></div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> <span class="comment"> * of the %list.</span></div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> <span class="comment"> */</span></div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  reference</div><div class="line"><a name="l01138"></a><span class="lineno"><a class="line" href="a07719.html#a9567c3ee9243b0159cb036f17ea74b53"> 1138</a></span>  <a class="code" href="a07719.html#a9567c3ee9243b0159cb036f17ea74b53">back</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  {</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <a class="code" href="a07647.html">iterator</a> __tmp = <a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>();</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  --__tmp;</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keywordflow">return</span> *__tmp;</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  }</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> <span class="comment"></span></div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> <span class="comment"> /**</span></div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the last</span></div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="comment"> * element of the %list.</span></div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="comment"> */</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  const_reference</div><div class="line"><a name="l01150"></a><span class="lineno"><a class="line" href="a07719.html#ac43aac14d7c69657442718428b082aaf"> 1150</a></span>  <a class="code" href="a07719.html#ac43aac14d7c69657442718428b082aaf">back</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  {</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <a class="code" href="a07651.html">const_iterator</a> __tmp = <a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>();</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  --__tmp;</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keywordflow">return</span> *__tmp;</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  }</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> </div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="comment">// [23.2.2.3] modifiers</span><span class="comment"></span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="comment"> /**</span></div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="comment"> * @brief Add data to the front of the %list.</span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> <span class="comment"> *</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> <span class="comment"> * This is a typical stack operation. The function creates an</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> <span class="comment"> * element at the front of the %list and assigns the given data</span></div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="comment"> * to it. Due to the nature of a %list this operation can be</span></div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="comment"> * done in constant time, and does not invalidate iterators and</span></div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> <span class="comment"> * references.</span></div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> <span class="comment"> */</span></div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01169"></a><span class="lineno"><a class="line" href="a07719.html#a43ce26ebd4c6a1789692b7d377f332f3"> 1169</a></span>  <a class="code" href="a07719.html#a43ce26ebd4c6a1789692b7d377f332f3">push_front</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  { this->_M_insert(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), __x); }</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> </div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <a class="code" href="a07719.html#a43ce26ebd4c6a1789692b7d377f332f3">push_front</a>(value_type&& __x)</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  { this->_M_insert(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), std::move(__x)); }</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> </div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  reference</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  emplace_front(_Args&&... __args)</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  {</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  this->_M_insert(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), std::forward<_Args>(__args)...);</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keywordflow">return</span> <a class="code" href="a07719.html#ad4367625f1676f2fc0d56b891db683fe">front</a>();</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  }</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> <span class="comment"></span></div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span> <span class="comment"> /**</span></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span> <span class="comment"> * @brief Removes first element.</span></div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span> <span class="comment"> *</span></div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> <span class="comment"> * This is a typical stack operation. It shrinks the %list by</span></div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> <span class="comment"> * one. Due to the nature of a %list this operation can be done</span></div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> <span class="comment"> * in constant time, and only invalidates iterators/references to</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> <span class="comment"> * the element being removed.</span></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> <span class="comment"> *</span></div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span> <span class="comment"> * Note that no data is returned, and if the first element's data</span></div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span> <span class="comment"> * is needed, it should be retrieved before pop_front() is</span></div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span> <span class="comment"> * called.</span></div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> <span class="comment"> */</span></div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01205"></a><span class="lineno"><a class="line" href="a07719.html#ad744f7f3b84fc57c973ed2d3bb25a33e"> 1205</a></span>  <a class="code" href="a07719.html#ad744f7f3b84fc57c973ed2d3bb25a33e">pop_front</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  { this->_M_erase(<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>()); }</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="comment"></span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> <span class="comment"> /**</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="comment"> * @brief Add data to the end of the %list.</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> <span class="comment"> *</span></div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> <span class="comment"> * This is a typical stack operation. The function creates an</span></div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="comment"> * element at the end of the %list and assigns the given data to</span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> <span class="comment"> * it. Due to the nature of a %list this operation can be done</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="comment"> * in constant time, and does not invalidate iterators and</span></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment"> * references.</span></div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="comment"> */</span></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01219"></a><span class="lineno"><a class="line" href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313"> 1219</a></span>  <a class="code" href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313">push_back</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  { this->_M_insert(<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>(), __x); }</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> </div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <a class="code" href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313">push_back</a>(value_type&& __x)</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  { this->_M_insert(<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>(), std::move(__x)); }</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> </div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  reference</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  emplace_back(_Args&&... __args)</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  {</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  this->_M_insert(<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>(), std::forward<_Args>(__args)...);</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="keywordflow">return</span> <a class="code" href="a07719.html#a9567c3ee9243b0159cb036f17ea74b53">back</a>();</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  }</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="comment"></span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> <span class="comment"> /**</span></div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> <span class="comment"> * @brief Removes last element.</span></div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span> <span class="comment"> *</span></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> <span class="comment"> * This is a typical stack operation. It shrinks the %list by</span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span> <span class="comment"> * one. Due to the nature of a %list this operation can be done</span></div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span> <span class="comment"> * in constant time, and only invalidates iterators/references to</span></div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> <span class="comment"> * the element being removed.</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"> *</span></div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> <span class="comment"> * Note that no data is returned, and if the last element's data</span></div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> <span class="comment"> * is needed, it should be retrieved before pop_back() is called.</span></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> <span class="comment"> */</span></div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01254"></a><span class="lineno"><a class="line" href="a07719.html#a437f35446fc4e342d4df581335191a69"> 1254</a></span>  <a class="code" href="a07719.html#a437f35446fc4e342d4df581335191a69">pop_back</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  { this->_M_erase(<a class="code" href="a07647.html">iterator</a>(this->_M_impl._M_node._M_prev)); }</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> </div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span> <span class="comment"> /**</span></div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> <span class="comment"> * @brief Constructs object in %list before specified iterator.</span></div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> <span class="comment"> * @param __position A const_iterator into the %list.</span></div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span> <span class="comment"> * @param __args Arguments.</span></div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> <span class="comment"> *</span></div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span> <span class="comment"> * This function will insert an object of type T constructed</span></div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span> <span class="comment"> * with T(std::forward<Args>(args)...) before the specified</span></div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span> <span class="comment"> * location. Due to the nature of a %list this operation can</span></div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> <span class="comment"> * be done in constant time, and does not invalidate iterators</span></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span> <span class="comment"> * and references.</span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span> <span class="comment"> */</span></div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <a class="code" href="a07719.html#a1b89836dea3d2950a96e485677fe3c30">emplace</a>(const_iterator __position, _Args&&... __args);</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span> <span class="comment"></span></div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> <span class="comment"> /**</span></div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> <span class="comment"> * @brief Inserts given value into %list before specified iterator.</span></div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> <span class="comment"> * @param __position A const_iterator into the %list.</span></div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> <span class="comment"> *</span></div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span> <span class="comment"> * This function will insert a copy of the given value before</span></div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> <span class="comment"> * the specified location. Due to the nature of a %list this</span></div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> <span class="comment"> * operation can be done in constant time, and does not</span></div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span> <span class="comment"> * invalidate iterators and references.</span></div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> <span class="comment"> */</span></div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(const_iterator __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="comment"> /**</span></div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> <span class="comment"> * @brief Inserts given value into %list before specified iterator.</span></div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> <span class="comment"> * @param __position An iterator into the %list.</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> <span class="comment"> *</span></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> <span class="comment"> * This function will insert a copy of the given value before</span></div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> <span class="comment"> * the specified location. Due to the nature of a %list this</span></div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> <span class="comment"> * operation can be done in constant time, and does not</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span> <span class="comment"> * invalidate iterators and references.</span></div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> <span class="comment"> */</span></div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(<a class="code" href="a07675.html">iterator</a> __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span> </div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> <span class="comment"> /**</span></div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span> <span class="comment"> * @brief Inserts given rvalue into %list before specified iterator.</span></div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> <span class="comment"> * @param __position A const_iterator into the %list.</span></div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> <span class="comment"> *</span></div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> <span class="comment"> * This function will insert a copy of the given rvalue before</span></div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span> <span class="comment"> * the specified location. Due to the nature of a %list this</span></div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> <span class="comment"> * operation can be done in constant time, and does not</span></div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> <span class="comment"> * invalidate iterators and references.</span></div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="comment"> */</span></div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01316"></a><span class="lineno"><a class="line" href="a07719.html#a2b70528dcf0f77ddb45429d463de07e4"> 1316</a></span>  <a class="code" href="a07719.html#a2b70528dcf0f77ddb45429d463de07e4">insert</a>(<a class="code" href="a07651.html">const_iterator</a> __position, value_type&& __x)</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  { <span class="keywordflow">return</span> <a class="code" href="a07719.html#a1b89836dea3d2950a96e485677fe3c30">emplace</a>(__position, std::move(__x)); }</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="comment"></span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> <span class="comment"> /**</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> <span class="comment"> * @brief Inserts the contents of an initializer_list into %list</span></div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span> <span class="comment"> * before specified const_iterator.</span></div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> <span class="comment"> * @param __p A const_iterator into the %list.</span></div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> <span class="comment"> * @param __l An initializer_list of value_type.</span></div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> <span class="comment"> * @return An iterator pointing to the first element inserted</span></div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> <span class="comment"> * (or __position).</span></div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> <span class="comment"> *</span></div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> <span class="comment"> * This function will insert copies of the data in the</span></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span> <span class="comment"> * initializer_list @a l into the %list before the location</span></div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span> <span class="comment"> * specified by @a p.</span></div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> <span class="comment"> *</span></div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> <span class="comment"> * This operation is linear in the number of elements inserted and</span></div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span> <span class="comment"> * does not invalidate iterators and references.</span></div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> <span class="comment"> */</span></div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01335"></a><span class="lineno"><a class="line" href="a07719.html#af9214e29cd05b8446678285415fb6f1e"> 1335</a></span>  <a class="code" href="a07719.html#af9214e29cd05b8446678285415fb6f1e">insert</a>(<a class="code" href="a07651.html">const_iterator</a> __p, <a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  { <span class="keywordflow">return</span> this-><a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(__p, __l.begin(), __l.end()); }</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> </div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> <span class="comment"> /**</span></div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span> <span class="comment"> * @brief Inserts a number of copies of given data into the %list.</span></div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span> <span class="comment"> * @param __position A const_iterator into the %list.</span></div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span> <span class="comment"> * @param __n Number of elements to be inserted.</span></div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span> <span class="comment"> * @return An iterator pointing to the first element inserted</span></div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> <span class="comment"> * (or __position).</span></div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> <span class="comment"> *</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span> <span class="comment"> * This function will insert a specified number of copies of the</span></div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span> <span class="comment"> * given data before the location specified by @a position.</span></div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> <span class="comment"> *</span></div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span> <span class="comment"> * This operation is linear in the number of elements inserted and</span></div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span> <span class="comment"> * does not invalidate iterators and references.</span></div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> <span class="comment"> */</span></div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(const_iterator __position, size_type __n, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span> <span class="comment"> /**</span></div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> <span class="comment"> * @brief Inserts a number of copies of given data into the %list.</span></div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> <span class="comment"> * @param __position An iterator into the %list.</span></div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="comment"> * @param __n Number of elements to be inserted.</span></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> <span class="comment"> *</span></div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> <span class="comment"> * This function will insert a specified number of copies of the</span></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> <span class="comment"> * given data before the location specified by @a position.</span></div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> <span class="comment"> *</span></div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> <span class="comment"> * This operation is linear in the number of elements inserted and</span></div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span> <span class="comment"> * does not invalidate iterators and references.</span></div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span> <span class="comment"> */</span></div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(<a class="code" href="a07675.html">iterator</a> __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  {</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <a class="code" href="a07719.html">list</a> __tmp(__n, __x, <a class="code" href="a07719.html#a31f6032941520f4d9187fdf8284ae914">get_allocator</a>());</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__position, __tmp);</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  }</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> </div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span> <span class="comment"> /**</span></div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span> <span class="comment"> * @brief Inserts a range into the %list.</span></div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span> <span class="comment"> * @param __position A const_iterator into the %list.</span></div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span> <span class="comment"> * @return An iterator pointing to the first element inserted</span></div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span> <span class="comment"> * (or __position).</span></div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> <span class="comment"> *</span></div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span> <span class="comment"> * This function will insert copies of the data in the range [@a</span></div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span> <span class="comment"> * first,@a last) into the %list before the location specified by</span></div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span> <span class="comment"> * @a position.</span></div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> <span class="comment"> *</span></div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span> <span class="comment"> * This operation is linear in the number of elements inserted and</span></div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> <span class="comment"> * does not invalidate iterators and references.</span></div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span> <span class="comment"> */</span></div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  iterator</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(const_iterator __position, _InputIterator __first,</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  _InputIterator __last);</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <span class="comment"> /**</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> <span class="comment"> * @brief Inserts a range into the %list.</span></div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> <span class="comment"> * @param __position An iterator into the %list.</span></div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="comment"> *</span></div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span> <span class="comment"> * This function will insert copies of the data in the range [@a</span></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> <span class="comment"> * first,@a last) into the %list before the location specified by</span></div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span> <span class="comment"> * @a position.</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span> <span class="comment"> *</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> <span class="comment"> * This operation is linear in the number of elements inserted and</span></div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="comment"> * does not invalidate iterators and references.</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <span class="comment"> */</span></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">insert</a>(iterator __position, _InputIterator __first,</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  _InputIterator __last)</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  {</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a> __tmp(__first, __last, <a class="code" href="a07719.html#a31f6032941520f4d9187fdf8284ae914">get_allocator</a>());</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__position, __tmp);</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  }</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> <span class="comment"></span></div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span> <span class="comment"> /**</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span> <span class="comment"> * @brief Remove element at given position.</span></div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span> <span class="comment"> * @param __position Iterator pointing to element to be erased.</span></div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span> <span class="comment"> * @return An iterator pointing to the next element (or end()).</span></div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> <span class="comment"> *</span></div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> <span class="comment"> * This function will erase the element at the given position and thus</span></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span> <span class="comment"> * shorten the %list by one.</span></div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span> <span class="comment"> *</span></div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span> <span class="comment"> * Due to the nature of a %list this operation can be done in</span></div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span> <span class="comment"> * constant time, and only invalidates iterators/references to</span></div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span> <span class="comment"> * the element being removed. The user is also cautioned that</span></div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> <span class="comment"> * this function only erases the element, and that if the element</span></div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span> <span class="comment"> * is itself a pointer, the pointed-to memory is not touched in</span></div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> <span class="comment"> * any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> <span class="comment"> */</span></div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  iterator</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <a class="code" href="a07719.html#aee5d29fe9b6e9494a71022ca980502be">erase</a>(const_iterator __position) noexcept;</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <a class="code" href="a07719.html#aee5d29fe9b6e9494a71022ca980502be">erase</a>(iterator __position);</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> <span class="comment"></span></div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> <span class="comment"> /**</span></div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span> <span class="comment"> * @brief Remove a range of elements.</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> <span class="comment"> * @param __first Iterator pointing to the first element to be erased.</span></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> <span class="comment"> * @param __last Iterator pointing to one past the last element to be</span></div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span> <span class="comment"> * @return An iterator pointing to the element pointed to by @a last</span></div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span> <span class="comment"> * prior to erasing (or end()).</span></div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> <span class="comment"> *</span></div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> <span class="comment"> * This function will erase the elements in the range @a</span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span> <span class="comment"> * [first,last) and shorten the %list accordingly.</span></div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span> <span class="comment"> *</span></div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span> <span class="comment"> * This operation is linear time in the size of the range and only</span></div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span> <span class="comment"> * invalidates iterators/references to the element being removed.</span></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span> <span class="comment"> * The user is also cautioned that this function only erases the</span></div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> <span class="comment"> * elements, and that if the elements themselves are pointers, the</span></div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span> <span class="comment"> * pointed-to memory is not touched in any way. Managing the pointer</span></div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span> <span class="comment"> * is the user's responsibility.</span></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span> <span class="comment"> */</span></div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  iterator</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01464"></a><span class="lineno"><a class="line" href="a07719.html#a927ad4d7e4673d4b2b33a16de379671b"> 1464</a></span>  <a class="code" href="a07719.html#a927ad4d7e4673d4b2b33a16de379671b">erase</a>(<a class="code" href="a07651.html">const_iterator</a> __first, <a class="code" href="a07651.html">const_iterator</a> __last) noexcept</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <a class="code" href="a07719.html#aee5d29fe9b6e9494a71022ca980502be">erase</a>(<a class="code" href="a07647.html">iterator</a> __first, <a class="code" href="a07647.html">iterator</a> __last)</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  {</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  __first = <a class="code" href="a07719.html#aee5d29fe9b6e9494a71022ca980502be">erase</a>(__first);</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="keywordflow">return</span> __last._M_const_cast();</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  }</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span> <span class="comment"></span></div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> <span class="comment"> /**</span></div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span> <span class="comment"> * @brief Swaps data with another %list.</span></div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span> <span class="comment"> * @param __x A %list of the same element and allocator types.</span></div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span> <span class="comment"> *</span></div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> <span class="comment"> * This exchanges the elements between two lists in constant</span></div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> <span class="comment"> * time. Note that the global std::swap() function is</span></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="comment"> * specialized such that std::swap(l1,l2) will feed to this</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span> <span class="comment"> * function.</span></div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> <span class="comment"> *</span></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> <span class="comment"> * Whether the allocators are swapped depends on the allocator traits.</span></div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span> <span class="comment"> */</span></div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01486"></a><span class="lineno"><a class="line" href="a07719.html#afca54335268365fbe964394a8fe5df1b"> 1486</a></span>  <a class="code" href="a07719.html#afca54335268365fbe964394a8fe5df1b">swap</a>(<a class="code" href="a07719.html">list</a>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  {</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  __detail::_List_node_base::swap(this->_M_impl._M_node,</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  __x._M_impl._M_node);</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span> </div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <span class="keywordtype">size_t</span> __xsize = __x._M_get_size();</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  __x._M_set_size(this->_M_get_size());</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  this->_M_set_size(__xsize);</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> </div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  _Node_alloc_traits::_S_on_swap(this->_M_get_Node_allocator(),</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  __x._M_get_Node_allocator());</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  }</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="comment"></span></div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> <span class="comment"> /**</span></div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> <span class="comment"> * Erases all the elements. Note that this function only erases</span></div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> <span class="comment"> * the elements, and that if the elements themselves are</span></div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span> <span class="comment"> * pointers, the pointed-to memory is not touched in any way.</span></div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span> <span class="comment"> * Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span> <span class="comment"> */</span></div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01506"></a><span class="lineno"><a class="line" href="a07719.html#ae36feac84d9e8125b700ce5189ed9e95"> 1506</a></span>  <a class="code" href="a07719.html#ae36feac84d9e8125b700ce5189ed9e95">clear</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  {</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  _Base::_M_clear();</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  _Base::_M_init();</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  }</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span> </div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="comment">// [23.2.2.4] list operations</span><span class="comment"></span></div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span> <span class="comment"> /**</span></div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span> <span class="comment"> * @brief Insert contents of another %list.</span></div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span> <span class="comment"> * @param __position Iterator referencing the element to insert before.</span></div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span> <span class="comment"> *</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span> <span class="comment"> * The elements of @a __x are inserted in constant time in front of</span></div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span> <span class="comment"> * the element referenced by @a __position. @a __x becomes an empty</span></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span> <span class="comment"> * list.</span></div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> <span class="comment"> *</span></div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> <span class="comment"> * Requires this != @a __x.</span></div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> <span class="comment"> */</span></div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01526"></a><span class="lineno"><a class="line" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f"> 1526</a></span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(<a class="code" href="a07651.html">const_iterator</a> __position, <a class="code" href="a07719.html">list</a>&& __x) noexcept</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(<a class="code" href="a07647.html">iterator</a> __position, <a class="code" href="a07719.html">list</a>& __x)</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  {</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="keywordflow">if</span> (!__x.<a class="code" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">empty</a>())</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  {</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  _M_check_equal_allocators(__x);</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span> </div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  this->_M_transfer(__position._M_const_cast(),</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  __x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>());</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span> </div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  this->_M_inc_size(__x._M_get_size());</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  __x._M_set_size(0);</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  }</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  }</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span> </div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(const_iterator __position, <a class="code" href="a07719.html">list</a>& __x) noexcept</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  { <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__position, std::move(__x)); }</div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span> </div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> <span class="comment"> /**</span></div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> <span class="comment"> * @brief Insert element from another %list.</span></div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span> <span class="comment"> * @param __position Const_iterator referencing the element to</span></div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span> <span class="comment"> * insert before.</span></div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> <span class="comment"> * @param __i Const_iterator referencing the element to move.</span></div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> <span class="comment"> *</span></div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span> <span class="comment"> * Removes the element in list @a __x referenced by @a __i and</span></div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span> <span class="comment"> * inserts it into the current list before @a __position.</span></div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span> <span class="comment"> */</span></div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01561"></a><span class="lineno"><a class="line" href="a07719.html#a11428bfeda40f933f26428bf432907db"> 1561</a></span>  <a class="code" href="a07719.html#a11428bfeda40f933f26428bf432907db">splice</a>(<a class="code" href="a07651.html">const_iterator</a> __position, <a class="code" href="a07719.html">list</a>&& __x, <a class="code" href="a07651.html">const_iterator</a> __i) noexcept</div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span> <span class="comment"> /**</span></div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span> <span class="comment"> * @brief Insert element from another %list.</span></div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span> <span class="comment"> * @param __position Iterator referencing the element to insert before.</span></div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span> <span class="comment"> * @param __i Iterator referencing the element to move.</span></div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span> <span class="comment"> *</span></div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> <span class="comment"> * Removes the element in list @a __x referenced by @a __i and</span></div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span> <span class="comment"> * inserts it into the current list before @a __position.</span></div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span> <span class="comment"> */</span></div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(<a class="code" href="a07647.html">iterator</a> __position, <a class="code" href="a07719.html">list</a>& __x, <a class="code" href="a07647.html">iterator</a> __i)</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  {</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  <a class="code" href="a07647.html">iterator</a> __j = __i._M_const_cast();</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  ++__j;</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keywordflow">if</span> (__position == __i || __position == __j)</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> </div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> != <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__x))</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  _M_check_equal_allocators(__x);</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> </div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  this->_M_transfer(__position._M_const_cast(),</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  __i._M_const_cast(), __j);</div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> </div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  this->_M_inc_size(1);</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  __x._M_dec_size(1);</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  }</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span> </div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span> <span class="comment"> /**</span></div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span> <span class="comment"> * @brief Insert element from another %list.</span></div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span> <span class="comment"> * @param __position Const_iterator referencing the element to</span></div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span> <span class="comment"> * insert before.</span></div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span> <span class="comment"> * @param __i Const_iterator referencing the element to move.</span></div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span> <span class="comment"> *</span></div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span> <span class="comment"> * Removes the element in list @a __x referenced by @a __i and</span></div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span> <span class="comment"> * inserts it into the current list before @a __position.</span></div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span> <span class="comment"> */</span></div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01603"></a><span class="lineno"><a class="line" href="a07719.html#aa9275ed20653d145bd3c324e0b0422c3"> 1603</a></span>  <a class="code" href="a07719.html#aa9275ed20653d145bd3c324e0b0422c3">splice</a>(<a class="code" href="a07651.html">const_iterator</a> __position, <a class="code" href="a07719.html">list</a>& __x, <a class="code" href="a07651.html">const_iterator</a> __i) noexcept</div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  { <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__position, std::move(__x), __i); }</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span> </div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span> <span class="comment"> /**</span></div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span> <span class="comment"> * @brief Insert range from another %list.</span></div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span> <span class="comment"> * @param __position Const_iterator referencing the element to</span></div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span> <span class="comment"> * insert before.</span></div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span> <span class="comment"> * @param __first Const_iterator referencing the start of range in x.</span></div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span> <span class="comment"> * @param __last Const_iterator referencing the end of range in x.</span></div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span> <span class="comment"> *</span></div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span> <span class="comment"> * Removes elements in the range [__first,__last) and inserts them</span></div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span> <span class="comment"> * before @a __position in constant time.</span></div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span> <span class="comment"> *</span></div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span> <span class="comment"> * Undefined if @a __position is in [__first,__last).</span></div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span> <span class="comment"> */</span></div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01622"></a><span class="lineno"><a class="line" href="a07719.html#aa4a9d0e45f35bc5c51ee5b1646304bb6"> 1622</a></span>  <a class="code" href="a07719.html#aa4a9d0e45f35bc5c51ee5b1646304bb6">splice</a>(<a class="code" href="a07651.html">const_iterator</a> __position, <a class="code" href="a07719.html">list</a>&& __x, <a class="code" href="a07651.html">const_iterator</a> __first,</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  <a class="code" href="a07651.html">const_iterator</a> __last) noexcept</div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span> <span class="comment"> /**</span></div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span> <span class="comment"> * @brief Insert range from another %list.</span></div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span> <span class="comment"> * @param __position Iterator referencing the element to insert before.</span></div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span> <span class="comment"> * @param __first Iterator referencing the start of range in x.</span></div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> <span class="comment"> * @param __last Iterator referencing the end of range in x.</span></div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span> <span class="comment"> *</span></div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span> <span class="comment"> * Removes elements in the range [__first,__last) and inserts them</span></div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span> <span class="comment"> * before @a __position in constant time.</span></div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> <span class="comment"> *</span></div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span> <span class="comment"> * Undefined if @a __position is in [__first,__last).</span></div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span> <span class="comment"> */</span></div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(<a class="code" href="a07647.html">iterator</a> __position, <a class="code" href="a07719.html">list</a>& __x, <a class="code" href="a07647.html">iterator</a> __first,</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  <a class="code" href="a07647.html">iterator</a> __last)</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  {</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  <span class="keywordflow">if</span> (__first != __last)</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  {</div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> != <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__x))</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  _M_check_equal_allocators(__x);</div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span> </div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  <span class="keywordtype">size_t</span> __n = _S_distance(__first, __last);</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  this->_M_inc_size(__n);</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  __x._M_dec_size(__n);</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span> </div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  this->_M_transfer(__position._M_const_cast(),</div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  __first._M_const_cast(),</div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  __last._M_const_cast());</div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  }</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  }</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span> </div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span> <span class="comment"> /**</span></div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span> <span class="comment"> * @brief Insert range from another %list.</span></div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span> <span class="comment"> * @param __position Const_iterator referencing the element to</span></div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span> <span class="comment"> * insert before.</span></div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span> <span class="comment"> * @param __x Source list.</span></div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span> <span class="comment"> * @param __first Const_iterator referencing the start of range in x.</span></div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span> <span class="comment"> * @param __last Const_iterator referencing the end of range in x.</span></div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span> <span class="comment"> *</span></div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> <span class="comment"> * Removes elements in the range [__first,__last) and inserts them</span></div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span> <span class="comment"> * before @a __position in constant time.</span></div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span> <span class="comment"> *</span></div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span> <span class="comment"> * Undefined if @a __position is in [__first,__last).</span></div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> <span class="comment"> */</span></div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01672"></a><span class="lineno"><a class="line" href="a07719.html#a5e2e8e3c78743063a5223b09a7f7abf6"> 1672</a></span>  <a class="code" href="a07719.html#a5e2e8e3c78743063a5223b09a7f7abf6">splice</a>(<a class="code" href="a07651.html">const_iterator</a> __position, <a class="code" href="a07719.html">list</a>& __x, <a class="code" href="a07651.html">const_iterator</a> __first,</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <a class="code" href="a07651.html">const_iterator</a> __last) noexcept</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  { <a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__position, std::move(__x), __first, __last); }</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span> <span class="comment"></span></div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> <span class="comment"> /**</span></div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span> <span class="comment"> * @brief Remove all elements equal to value.</span></div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span> <span class="comment"> * @param __value The value to remove.</span></div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span> <span class="comment"> *</span></div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span> <span class="comment"> * Removes every element in the list equal to @a value.</span></div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span> <span class="comment"> * Remaining elements stay in list order. Note that this</span></div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span> <span class="comment"> * function only erases the elements, and that if the elements</span></div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> <span class="comment"> * themselves are pointers, the pointed-to memory is not</span></div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span> <span class="comment"> * touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span> <span class="comment"> */</span></div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <a class="code" href="a07719.html#ad2334ed28f60c39412ac8cacfa14643d">remove</a>(<span class="keyword">const</span> _Tp& __value);</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span> <span class="comment"></span></div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span> <span class="comment"> /**</span></div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span> <span class="comment"> * @brief Remove all elements satisfying a predicate.</span></div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span> <span class="comment"> * @tparam _Predicate Unary predicate function or object.</span></div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span> <span class="comment"> *</span></div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span> <span class="comment"> * Removes every element in the list for which the predicate</span></div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> <span class="comment"> * returns true. Remaining elements stay in list order. Note</span></div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span> <span class="comment"> * that this function only erases the elements, and that if the</span></div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span> <span class="comment"> * elements themselves are pointers, the pointed-to memory is</span></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span> <span class="comment"> * not touched in any way. Managing the pointer is the user's</span></div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> <span class="comment"> * responsibility.</span></div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span> <span class="comment"> */</span></div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <a class="code" href="a07719.html#adbed771a216e1f1db299bf13c0049177">remove_if</a>(_Predicate);</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span> <span class="comment"></span></div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span> <span class="comment"> /**</span></div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span> <span class="comment"> * @brief Remove consecutive duplicate elements.</span></div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span> <span class="comment"> *</span></div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span> <span class="comment"> * For each consecutive set of elements with the same value,</span></div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span> <span class="comment"> * remove all but the first one. Remaining elements stay in</span></div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span> <span class="comment"> * list order. Note that this function only erases the</span></div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span> <span class="comment"> * elements, and that if the elements themselves are pointers,</span></div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span> <span class="comment"> * the pointed-to memory is not touched in any way. Managing</span></div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span> <span class="comment"> * the pointer is the user's responsibility.</span></div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span> <span class="comment"> */</span></div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <a class="code" href="a07719.html#a30b4690883a5219b9dc98233364d2e49">unique</a>();</div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span> <span class="comment"></span></div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span> <span class="comment"> /**</span></div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span> <span class="comment"> * @brief Remove consecutive elements satisfying a predicate.</span></div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span> <span class="comment"> * @tparam _BinaryPredicate Binary predicate function or object.</span></div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span> <span class="comment"> *</span></div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span> <span class="comment"> * For each consecutive set of elements [first,last) that</span></div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span> <span class="comment"> * satisfy predicate(first,i) where i is an iterator in</span></div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span> <span class="comment"> * [first,last), remove all but the first one. Remaining</span></div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span> <span class="comment"> * elements stay in list order. Note that this function only</span></div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span> <span class="comment"> * erases the elements, and that if the elements themselves are</span></div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span> <span class="comment"> * pointers, the pointed-to memory is not touched in any way.</span></div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> <span class="comment"> * Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span> <span class="comment"> */</span></div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  <a class="code" href="a07719.html#a30b4690883a5219b9dc98233364d2e49">unique</a>(_BinaryPredicate);</div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span> <span class="comment"></span></div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> <span class="comment"> /**</span></div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span> <span class="comment"> * @brief Merge sorted lists.</span></div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span> <span class="comment"> * @param __x Sorted list to merge.</span></div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span> <span class="comment"> *</span></div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span> <span class="comment"> * Assumes that both @a __x and this list are sorted according to</span></div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span> <span class="comment"> * operator<(). Merges elements of @a __x into this list in</span></div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span> <span class="comment"> * sorted order, leaving @a __x empty when complete. Elements in</span></div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span> <span class="comment"> * this list precede elements in @a __x that are equal.</span></div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span> <span class="comment"> */</span></div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(<a class="code" href="a07719.html">list</a>&& __x);</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span> </div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(<a class="code" href="a07719.html">list</a>& __x)</div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  { <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(std::move(__x)); }</div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>& __x);</div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span> <span class="comment"></span></div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span> <span class="comment"> /**</span></div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span> <span class="comment"> * @brief Merge sorted lists according to comparison function.</span></div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span> <span class="comment"> * @tparam _StrictWeakOrdering Comparison function defining</span></div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span> <span class="comment"> * sort order.</span></div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span> <span class="comment"> * @param __x Sorted list to merge.</span></div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span> <span class="comment"> * @param __comp Comparison functor.</span></div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span> <span class="comment"> *</span></div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span> <span class="comment"> * Assumes that both @a __x and this list are sorted according to</span></div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span> <span class="comment"> * StrictWeakOrdering. Merges elements of @a __x into this list</span></div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span> <span class="comment"> * in sorted order, leaving @a __x empty when complete. Elements</span></div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span> <span class="comment"> * in this list precede elements in @a __x that are equivalent</span></div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span> <span class="comment"> * according to StrictWeakOrdering().</span></div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span> <span class="comment"> */</span></div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _StrictWeakOrdering></div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&& __x, _StrictWeakOrdering __comp);</div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span> </div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _StrictWeakOrdering></div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>& __x, _StrictWeakOrdering __comp)</div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  { <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(std::move(__x), __comp); }</div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _StrictWeakOrdering></div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  <a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>& __x, _StrictWeakOrdering __comp);</div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span> <span class="comment"></span></div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> <span class="comment"> /**</span></div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span> <span class="comment"> * @brief Reverse the elements in list.</span></div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span> <span class="comment"> *</span></div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span> <span class="comment"> * Reverse the order of elements in the list in linear time.</span></div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span> <span class="comment"> */</span></div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01790"></a><span class="lineno"><a class="line" href="a07719.html#a7d420a62c310cd992f52c016293f969a"> 1790</a></span>  <a class="code" href="a07719.html#a7d420a62c310cd992f52c016293f969a">reverse</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  { this->_M_impl._M_node._M_reverse(); }</div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span> <span class="comment"></span></div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span> <span class="comment"> /**</span></div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span> <span class="comment"> * @brief Sort the elements.</span></div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span> <span class="comment"> *</span></div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> <span class="comment"> * Sorts the elements of this list in NlogN time. Equivalent</span></div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span> <span class="comment"> * elements remain in list order.</span></div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span> <span class="comment"> */</span></div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <a class="code" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b">sort</a>();</div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span> <span class="comment"></span></div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span> <span class="comment"> /**</span></div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span> <span class="comment"> * @brief Sort the elements according to comparison function.</span></div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span> <span class="comment"> *</span></div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span> <span class="comment"> * Sorts the elements of this list in NlogN time. Equivalent</span></div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span> <span class="comment"> * elements remain in list order.</span></div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span> <span class="comment"> */</span></div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _StrictWeakOrdering></div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  <a class="code" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b">sort</a>(_StrictWeakOrdering);</div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span> </div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="comment">// Internal constructor functions follow.</span></div><div class="line"><a name="l01814"></a><span class="lineno"> 1814</span> </div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  <span class="comment">// Called by the range constructor to implement [23.1.1]/9</span></div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span> </div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)</div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  { _M_fill_initialize(static_cast<size_type>(__n), __x); }</div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span> </div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="comment">// Called by the range constructor to implement [23.1.1]/9</span></div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  __false_type)</div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  {</div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span> #<span class="keywordflow">if</span> __cplusplus >= 201103L</div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  emplace_back(*__first);</div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <a class="code" href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313">push_back</a>(*__first);</div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  }</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span> </div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="comment">// Called by list(n,v,a), and the range constructor when it turns out</span></div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="comment">// to be the same thing.</span></div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  _M_fill_initialize(size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  {</div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="keywordflow">for</span> (; __n; --__n)</div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <a class="code" href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313">push_back</a>(__x);</div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  }</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span> </div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="comment">// Called by list(n).</span></div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  _M_default_initialize(size_type __n)</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  {</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  <span class="keywordflow">for</span> (; __n; --__n)</div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  emplace_back();</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  }</div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span> </div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="comment">// Called by resize(sz).</span></div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  _M_default_append(size_type __n);</div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span> </div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  <span class="comment">// Internal assign functions follow.</span></div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span> </div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  <span class="comment">// Called by the range assign to implement [23.1.1]/9</span></div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span> </div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  { _M_fill_assign(__n, __val); }</div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span> </div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  <span class="comment">// Called by the range assign to implement [23.1.1]/9</span></div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  _M_assign_dispatch(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  __false_type);</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span> </div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <span class="comment">// Called by assign(n,t), and the range assign when it turns out</span></div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  <span class="comment">// to be the same thing.</span></div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  _M_fill_assign(size_type __n, <span class="keyword">const</span> value_type& __val);</div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span> </div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span> </div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  <span class="comment">// Moves the elements from [first,last) before position.</span></div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  _M_transfer(iterator __position, iterator __first, iterator __last)</div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  { __position._M_node->_M_transfer(__first._M_node, __last._M_node); }</div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> </div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  <span class="comment">// Inserts new element at position given and with value given.</span></div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  _M_insert(iterator __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  {</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  _Node* __tmp = <a class="code" href="a07719.html#a751c5b84e439b1647db6b733bbaa570f">_M_create_node</a>(__x);</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  __tmp->_M_hook(__position._M_node);</div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  this->_M_inc_size(1);</div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  }</div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  _M_insert(iterator __position, _Args&&... __args)</div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  {</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  _Node* __tmp = <a class="code" href="a07719.html#a751c5b84e439b1647db6b733bbaa570f">_M_create_node</a>(std::forward<_Args>(__args)...);</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  __tmp->_M_hook(__position._M_node);</div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  this->_M_inc_size(1);</div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  }</div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span> </div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  <span class="comment">// Erases element at position given.</span></div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  _M_erase(iterator __position) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  {</div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  this->_M_dec_size(1);</div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  __position._M_node->_M_unhook();</div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  _Node* __n = static_cast<_Node*>(__position._M_node);</div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  _Node_alloc_traits::destroy(_M_get_Node_allocator(), __n->_M_valptr());</div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  _Tp_alloc_type(_M_get_Node_allocator()).destroy(__n->_M_valptr());</div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span> </div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  _M_put_node(__n);</div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  }</div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span> </div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  <span class="comment">// To implement the splice (and merge) bits of N1599.</span></div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  _M_check_equal_allocators(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  {</div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <span class="keywordflow">if</span> (std::__alloc_neq<typename _Base::_Node_alloc_type>::</div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()))</div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  __builtin_abort();</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  }</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span> </div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="comment">// Used to implement resize.</span></div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  const_iterator</div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  _M_resize_pos(size_type& __new_size) <span class="keyword">const</span>;</div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span> </div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  _M_move_assign(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&& __x, <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>) noexcept</div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  {</div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  this->_M_clear();</div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  this->_M_move_nodes(std::move(__x));</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  std::__alloc_on_move(this->_M_get_Node_allocator(),</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  __x._M_get_Node_allocator());</div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  }</div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span> </div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  _M_move_assign(<a class="code" href="a07719.html#a8bd45a3517b01002de6debdb401d9170">list</a>&& __x, <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  {</div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  <span class="keywordflow">if</span> (__x._M_get_Node_allocator() == this->_M_get_Node_allocator())</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  _M_move_assign(std::move(__x), <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>{});</div><div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  <span class="comment">// The rvalue's allocator cannot be moved, or is not equal,</span></div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="comment">// so we need to individually move each element.</span></div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  _M_assign_dispatch(std::__make_move_if_noexcept_iterator(__x.begin()),</div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  std::__make_move_if_noexcept_iterator(__x.end()),</div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  __false_type{});</div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  }</div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  };</div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span> </div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _ValT</div><div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  = <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type,</div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keyword">typename</span> _Allocator = allocator<_ValT>,</div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  list(_InputIterator, _InputIterator, _Allocator = _Allocator())</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  -> list<_ValT, _Allocator>;</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span> </div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span> _GLIBCXX_END_NAMESPACE_CXX11</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span> <span class="comment"></span></div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span> <span class="comment"> /**</span></div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span> <span class="comment"> * @brief List equality comparison.</span></div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span> <span class="comment"> * @param __x A %list.</span></div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span> <span class="comment"> * @param __y A %list of the same type as @a __x.</span></div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span> <span class="comment"> * @return True iff the size and elements of the lists are equal.</span></div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span> <span class="comment"> *</span></div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span> <span class="comment"> * This is an equivalence relation. It is linear in the size of</span></div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span> <span class="comment"> * the lists. Lists are considered equivalent if their sizes are</span></div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span> <span class="comment"> * equal, and if corresponding elements compare equal.</span></div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span> <span class="comment"> */</span></div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01987"></a><span class="lineno"><a class="line" href="a01541.html#aa2053d06d62313a4cde70f0f1d1f04c0"> 1987</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  {</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  <span class="keywordflow">if</span> (__x.<a class="code" href="a07719.html#a4b6c305dd92e3c76213778feba213da2">size</a>() != __y.<a class="code" href="a07719.html#a4b6c305dd92e3c76213778feba213da2">size</a>())</div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span> </div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07651.html">list<_Tp, _Alloc>::const_iterator</a> const_iterator;</div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  const_iterator __end1 = __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>();</div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  const_iterator __end2 = __y.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>();</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span> </div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  const_iterator __i1 = __x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>();</div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  const_iterator __i2 = __y.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>();</div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  <span class="keywordflow">while</span> (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2)</div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  {</div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  ++__i1;</div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  ++__i2;</div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  }</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  <span class="keywordflow">return</span> __i1 == __end1 && __i2 == __end2;</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  }</div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span> <span class="comment"></span></div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span> <span class="comment"> /**</span></div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span> <span class="comment"> * @brief List ordering relation.</span></div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span> <span class="comment"> * @param __x A %list.</span></div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span> <span class="comment"> * @param __y A %list of the same type as @a __x.</span></div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span> <span class="comment"> * @return True iff @a __x is lexicographically less than @a __y.</span></div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span> <span class="comment"> *</span></div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span> <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span></div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span> <span class="comment"> * lists. The elements must be comparable with @c <.</span></div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span> <span class="comment"> *</span></div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span> <span class="comment"> */</span></div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02021"></a><span class="lineno"><a class="line" href="a01541.html#a7b31ae4487ff01fcb215071c0f521caa"> 2021</a></span>  operator<(<span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  { <span class="keywordflow">return</span> <a class="code" href="a01485.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a>(__x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>(),</div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  __y.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), __y.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>()); }</div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span> <span class="comment"></span></div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span> <span class="comment"> /// Based on operator==</span></div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02028"></a><span class="lineno"><a class="line" href="a01541.html#a44ba4a39615cc57e58325da2c9a2372c"> 2028</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span> <span class="comment"></span></div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02034"></a><span class="lineno"><a class="line" href="a01541.html#a7788944c30c3070441dc376df8beb210"> 2034</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span> <span class="comment"></span></div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02040"></a><span class="lineno"><a class="line" href="a01541.html#ab0de944941fcbe6618dba4837b31deaa"> 2040</a></span>  operator<=(<span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span> <span class="comment"></span></div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02046"></a><span class="lineno"><a class="line" href="a01541.html#a628eda81f6cb2988d8f5908f631cdb46"> 2046</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <span class="keyword">const</span> <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span> <span class="comment"></span></div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span> <span class="comment"> /// See std::list::swap().</span></div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l02052"></a><span class="lineno"><a class="line" href="a01541.html#a335bd8d8bfd13a75e2e5c34552ec3daf"> 2052</a></span>  swap(<a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __x, <a class="code" href="a07719.html">list<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))</div><div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  { __x.swap(__y); }</div><div class="line"><a name="l02055"></a><span class="lineno"> 2055</span> </div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span> </div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span> </div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  <span class="comment">// Detect when distance is used to compute the size of the whole list.</span></div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  <span class="keyword">inline</span> ptrdiff_t</div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  __distance(_GLIBCXX_STD_C::_List_iterator<_Tp> __first,</div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  _GLIBCXX_STD_C::_List_iterator<_Tp> __last,</div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  input_iterator_tag __tag)</div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  {</div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="keyword">typedef</span> _GLIBCXX_STD_C::_List_const_iterator<_Tp> _CIter;</div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  <span class="keywordflow">return</span> std::__distance(_CIter(__first), _CIter(__last), __tag);</div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  }</div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span> </div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <span class="keyword">inline</span> ptrdiff_t</div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  __distance(_GLIBCXX_STD_C::_List_const_iterator<_Tp> __first,</div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  _GLIBCXX_STD_C::_List_const_iterator<_Tp> __last,</div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  input_iterator_tag)</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  {</div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  <span class="keyword">typedef</span> __detail::_List_node_header _Sentinel;</div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  _GLIBCXX_STD_C::_List_const_iterator<_Tp> __beyond = __last;</div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  ++__beyond;</div><div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> __whole = __first == __beyond;</div><div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  <span class="keywordflow">if</span> (__builtin_constant_p (__whole) && __whole)</div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <span class="keywordflow">return</span> static_cast<const _Sentinel*>(__last._M_node)->_M_size;</div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span> </div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  ptrdiff_t __n = 0;</div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  {</div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  ++__first;</div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  ++__n;</div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  }</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  <span class="keywordflow">return</span> __n;</div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  }</div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span> </div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span> </div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_LIST_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07719_html_aba82f0b94c1ed15ccacea0e98aa6cff6"><div class="ttname"><a href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">std::list::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00971">stl_list.h:971</a></div></div>
<div class="ttc" id="a07719_html_a8f9b65b72c23e8c124c5f4a6e11013e0"><div class="ttname"><a href="a07719.html#a8f9b65b72c23e8c124c5f4a6e11013e0">std::list::operator=</a></div><div class="ttdeci">list & operator=(list &&__x) noexcept(_Node_alloc_traits::_S_nothrow_move())</div><div class="ttdoc">List move assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00861">stl_list.h:861</a></div></div>
<div class="ttc" id="a07719_html_a6520eeff66a82d7b6e5eacffdcb2da6e"><div class="ttname"><a href="a07719.html#a6520eeff66a82d7b6e5eacffdcb2da6e">std::list::~list</a></div><div class="ttdeci">~list()=default</div></div>
<div class="ttc" id="a07667_html"><div class="ttname"><a href="a07667.html">std::bidirectional_iterator_tag</a></div><div class="ttdoc">Bidirectional iterators support a superset of forward iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00099">stl_iterator_base_types.h:99</a></div></div>
<div class="ttc" id="a07719_html_a06a57b2ab785e15264e7f36742c4b0dc"><div class="ttname"><a href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">std::list::resize</a></div><div class="ttdeci">void resize(size_type __new_size)</div><div class="ttdoc">Resizes the list to the specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00231">list.tcc:231</a></div></div>
<div class="ttc" id="a01479_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant< bool, true > true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00075">type_traits:75</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="a07719_html_a437f35446fc4e342d4df581335191a69"><div class="ttname"><a href="a07719.html#a437f35446fc4e342d4df581335191a69">std::list::pop_back</a></div><div class="ttdeci">void pop_back() noexcept</div><div class="ttdoc">Removes last element.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01254">stl_list.h:1254</a></div></div>
<div class="ttc" id="a01019_html"><div class="ttname"><a href="a01019.html">aligned_buffer.h</a></div></div>
<div class="ttc" id="a07719_html_a4018c8137dc053cfd04641f1ab4b070e"><div class="ttname"><a href="a07719.html#a4018c8137dc053cfd04641f1ab4b070e">std::list::rend</a></div><div class="ttdeci">reverse_iterator rend() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01007">stl_list.h:1007</a></div></div>
<div class="ttc" id="a07699_html"><div class="ttname"><a href="a07699.html">std::__detail::_List_node_base</a></div><div class="ttdoc">Common part of a node in the list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00080">stl_list.h:80</a></div></div>
<div class="ttc" id="a07719_html_a7d420a62c310cd992f52c016293f969a"><div class="ttname"><a href="a07719.html#a7d420a62c310cd992f52c016293f969a">std::list::reverse</a></div><div class="ttdeci">void reverse() noexcept</div><div class="ttdoc">Reverse the elements in list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01790">stl_list.h:1790</a></div></div>
<div class="ttc" id="a07719_html_af9214e29cd05b8446678285415fb6f1e"><div class="ttname"><a href="a07719.html#af9214e29cd05b8446678285415fb6f1e">std::list::insert</a></div><div class="ttdeci">iterator insert(const_iterator __p, initializer_list< value_type > __l)</div><div class="ttdoc">Inserts the contents of an initializer_list into list before specified const_iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01335">stl_list.h:1335</a></div></div>
<div class="ttc" id="a07719_html_aa9275ed20653d145bd3c324e0b0422c3"><div class="ttname"><a href="a07719.html#aa9275ed20653d145bd3c324e0b0422c3">std::list::splice</a></div><div class="ttdeci">void splice(const_iterator __position, list &__x, const_iterator __i) noexcept</div><div class="ttdoc">Insert element from another list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01603">stl_list.h:1603</a></div></div>
<div class="ttc" id="a07719_html_a11428bfeda40f933f26428bf432907db"><div class="ttname"><a href="a07719.html#a11428bfeda40f933f26428bf432907db">std::list::splice</a></div><div class="ttdeci">void splice(const_iterator __position, list &&__x, const_iterator __i) noexcept</div><div class="ttdoc">Insert element from another list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01561">stl_list.h:1561</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="a07719_html_aee5d29fe9b6e9494a71022ca980502be"><div class="ttname"><a href="a07719.html#aee5d29fe9b6e9494a71022ca980502be">std::list::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position) noexcept</div><div class="ttdoc">Remove element at given position.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00152">list.tcc:152</a></div></div>
<div class="ttc" id="a07719_html_a1a0d75e77ac53db35e3cdf85ad6d3fa3"><div class="ttname"><a href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">std::list::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00953">stl_list.h:953</a></div></div>
<div class="ttc" id="a07719_html_a43ce26ebd4c6a1789692b7d377f332f3"><div class="ttname"><a href="a07719.html#a43ce26ebd4c6a1789692b7d377f332f3">std::list::push_front</a></div><div class="ttdeci">void push_front(const value_type &__x)</div><div class="ttdoc">Add data to the front of the list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01169">stl_list.h:1169</a></div></div>
<div class="ttc" id="a04639_html_a1afbf725286c9e82ba6166dcc04b10bc"><div class="ttname"><a href="a04639.html#a1afbf725286c9e82ba6166dcc04b10bc">std::allocator_traits::allocate</a></div><div class="ttdeci">static pointer allocate(_Alloc &__a, size_type __n)</div><div class="ttdoc">Allocate memory.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00300">bits/alloc_traits.h:300</a></div></div>
<div class="ttc" id="a07719_html_af558a1b206e6fdf40921aeaba0383dbe"><div class="ttname"><a href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">std::list::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01063">stl_list.h:1063</a></div></div>
<div class="ttc" id="a07719_html_aa4a9d0e45f35bc5c51ee5b1646304bb6"><div class="ttname"><a href="a07719.html#aa4a9d0e45f35bc5c51ee5b1646304bb6">std::list::splice</a></div><div class="ttdeci">void splice(const_iterator __position, list &&__x, const_iterator __first, const_iterator __last) noexcept</div><div class="ttdoc">Insert range from another list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01622">stl_list.h:1622</a></div></div>
<div class="ttc" id="a07719_html_ad2334ed28f60c39412ac8cacfa14643d"><div class="ttname"><a href="a07719.html#ad2334ed28f60c39412ac8cacfa14643d">std::list::remove</a></div><div class="ttdeci">void remove(const _Tp &__value)</div><div class="ttdoc">Remove all elements equal to value.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00326">list.tcc:326</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="a07719_html_a35a994d029c0e0cf92abf1f468cfa140"><div class="ttname"><a href="a07719.html#a35a994d029c0e0cf92abf1f468cfa140">std::list::operator=</a></div><div class="ttdeci">list & operator=(const list &__x)</div><div class="ttdoc">List assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00268">list.tcc:268</a></div></div>
<div class="ttc" id="a07719_html_aec4657b924fb0c29b7d3e347a2da97f0"><div class="ttname"><a href="a07719.html#aec4657b924fb0c29b7d3e347a2da97f0">std::list::list</a></div><div class="ttdeci">list(const list &__x)</div><div class="ttdoc">List copy constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00743">stl_list.h:743</a></div></div>
<div class="ttc" id="a07719_html_a751c5b84e439b1647db6b733bbaa570f"><div class="ttname"><a href="a07719.html#a751c5b84e439b1647db6b733bbaa570f">std::list::_M_create_node</a></div><div class="ttdeci">_Node * _M_create_node(_Args &&... __args)</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00640">stl_list.h:640</a></div></div>
<div class="ttc" id="a07719_html_a0b44f76b96a458895a1e8c6e4057b8dd"><div class="ttname"><a href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">std::list::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, const value_type &__x)</div><div class="ttdoc">Inserts given value into list before specified iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00103">list.tcc:103</a></div></div>
<div class="ttc" id="a07719_html_a9567c3ee9243b0159cb036f17ea74b53"><div class="ttname"><a href="a07719.html#a9567c3ee9243b0159cb036f17ea74b53">std::list::back</a></div><div class="ttdeci">reference back() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01138">stl_list.h:1138</a></div></div>
<div class="ttc" id="a07719_html_ae27f8110bc96c70775f1654e978b4c5f"><div class="ttname"><a href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">std::list::splice</a></div><div class="ttdeci">void splice(const_iterator __position, list &&__x) noexcept</div><div class="ttdoc">Insert contents of another list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01526">stl_list.h:1526</a></div></div>
<div class="ttc" id="a07719_html_a3f6568813bbdefbd94cbde64e3e45366"><div class="ttname"><a href="a07719.html#a3f6568813bbdefbd94cbde64e3e45366">std::list::list</a></div><div class="ttdeci">list(size_type __n, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a list with default constructed elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00704">stl_list.h:704</a></div></div>
<div class="ttc" id="a07719_html_ad4367625f1676f2fc0d56b891db683fe"><div class="ttname"><a href="a07719.html#ad4367625f1676f2fc0d56b891db683fe">std::list::front</a></div><div class="ttdeci">reference front() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01122">stl_list.h:1122</a></div></div>
<div class="ttc" id="a07719_html_a30b4690883a5219b9dc98233364d2e49"><div class="ttname"><a href="a07719.html#a30b4690883a5219b9dc98233364d2e49">std::list::unique</a></div><div class="ttdeci">void unique()</div><div class="ttdoc">Remove consecutive duplicate elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00354">list.tcc:354</a></div></div>
<div class="ttc" id="a07719_html_a927ad4d7e4673d4b2b33a16de379671b"><div class="ttname"><a href="a07719.html#a927ad4d7e4673d4b2b33a16de379671b">std::list::erase</a></div><div class="ttdeci">iterator erase(const_iterator __first, const_iterator __last) noexcept</div><div class="ttdoc">Remove a range of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01464">stl_list.h:1464</a></div></div>
<div class="ttc" id="a07719_html_adbed771a216e1f1db299bf13c0049177"><div class="ttname"><a href="a07719.html#adbed771a216e1f1db299bf13c0049177">std::list::remove_if</a></div><div class="ttdeci">void remove_if(_Predicate)</div><div class="ttdoc">Remove all elements satisfying a predicate.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00515">list.tcc:515</a></div></div>
<div class="ttc" id="a03043_html"><div class="ttname"><a href="a03043.html">std::integral_constant</a></div><div class="ttdoc">integral_constant</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00057">type_traits:57</a></div></div>
<div class="ttc" id="a07719_html_aac9c52d90a45482d052dbb4b2040b6da"><div class="ttname"><a href="a07719.html#aac9c52d90a45482d052dbb4b2040b6da">std::list::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01026">stl_list.h:1026</a></div></div>
<div class="ttc" id="a07719_html_a2b70528dcf0f77ddb45429d463de07e4"><div class="ttname"><a href="a07719.html#a2b70528dcf0f77ddb45429d463de07e4">std::list::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, value_type &&__x)</div><div class="ttdoc">Inserts given rvalue into list before specified iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01316">stl_list.h:1316</a></div></div>
<div class="ttc" id="a07719_html_a4d6a44991e6e9a4f1d74236e7d6fc012"><div class="ttname"><a href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">std::list::merge</a></div><div class="ttdeci">void merge(list &&__x)</div><div class="ttdoc">Merge sorted lists.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00375">list.tcc:375</a></div></div>
<div class="ttc" id="a01655_html"><div class="ttname"><a href="a01655.html">std::initializer_list</a></div><div class="ttdoc">initializer_list</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00047">initializer_list:47</a></div></div>
<div class="ttc" id="a07719_html_a7b6d1424066dbfd18daebac90d143837"><div class="ttname"><a href="a07719.html#a7b6d1424066dbfd18daebac90d143837">std::list::list</a></div><div class="ttdeci">list(const allocator_type &__a) noexcept</div><div class="ttdoc">Creates a list with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00691">stl_list.h:691</a></div></div>
<div class="ttc" id="a07719_html_a39a7a20ed70dd4018608a3522d83124d"><div class="ttname"><a href="a07719.html#a39a7a20ed70dd4018608a3522d83124d">std::list::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00980">stl_list.h:980</a></div></div>
<div class="ttc" id="a07711_html"><div class="ttname"><a href="a07711.html">std::_List_base</a></div><div class="ttdoc">See bits/stl_deque.h's _Deque_base for an explanation.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00357">stl_list.h:357</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="a07719_html_a8a4cacefc7a58e913f2e9876df0d59de"><div class="ttname"><a href="a07719.html#a8a4cacefc7a58e913f2e9876df0d59de">std::list::rbegin</a></div><div class="ttdeci">reverse_iterator rbegin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00989">stl_list.h:989</a></div></div>
<div class="ttc" id="a00029_html"><div class="ttname"><a href="a00029.html">initializer_list</a></div></div>
<div class="ttc" id="a07719_html_a150b5b104440ea65709e70a7f2eba06b"><div class="ttname"><a href="a07719.html#a150b5b104440ea65709e70a7f2eba06b">std::list::sort</a></div><div class="ttdeci">void sort()</div><div class="ttdoc">Sort the elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00468">list.tcc:468</a></div></div>
<div class="ttc" id="a07719_html_a5393c199d92f965d065b677f2230e51e"><div class="ttname"><a href="a07719.html#a5393c199d92f965d065b677f2230e51e">std::list::front</a></div><div class="ttdeci">const_reference front() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01130">stl_list.h:1130</a></div></div>
<div class="ttc" id="a07719_html_af9bc7bbe49c3f41b0dfaa3acd5c89e12"><div class="ttname"><a href="a07719.html#af9bc7bbe49c3f41b0dfaa3acd5c89e12">std::list::crend</a></div><div class="ttdeci">const_reverse_iterator crend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01053">stl_list.h:1053</a></div></div>
<div class="ttc" id="a07719_html_ac739777416320440d35c6de1a42ba818"><div class="ttname"><a href="a07719.html#ac739777416320440d35c6de1a42ba818">std::list::list</a></div><div class="ttdeci">list(size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a list with copies of an exemplar element.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00716">stl_list.h:716</a></div></div>
<div class="ttc" id="a07719_html_a5e2e8e3c78743063a5223b09a7f7abf6"><div class="ttname"><a href="a07719.html#a5e2e8e3c78743063a5223b09a7f7abf6">std::list::splice</a></div><div class="ttdeci">void splice(const_iterator __position, list &__x, const_iterator __first, const_iterator __last) noexcept</div><div class="ttdoc">Insert range from another list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01672">stl_list.h:1672</a></div></div>
<div class="ttc" id="a07719_html_a9f1a22c8bd2a8d5ecacab44644f513db"><div class="ttname"><a href="a07719.html#a9f1a22c8bd2a8d5ecacab44644f513db">std::list::assign</a></div><div class="ttdeci">void assign(size_type __n, const value_type &__val)</div><div class="ttdoc">Assigns a given value to a list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00897">stl_list.h:897</a></div></div>
<div class="ttc" id="a07719_html_a7b554a6eab6e57e565eedb7da72a83c5"><div class="ttname"><a href="a07719.html#a7b554a6eab6e57e565eedb7da72a83c5">std::list::operator=</a></div><div class="ttdeci">list & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">List initializer list assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00879">stl_list.h:879</a></div></div>
<div class="ttc" id="a03883_html"><div class="ttname"><a href="a03883.html">std::is_same</a></div><div class="ttdoc">is_same</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l01286">type_traits:1286</a></div></div>
<div class="ttc" id="a04695_html"><div class="ttname"><a href="a04695.html">std::__allocated_ptr</a></div><div class="ttdoc">Non-standard RAII type for managing pointers obtained from allocators.</div><div class="ttdef"><b>Definition:</b> <a href="a00269_source.html#l00046">allocated_ptr.h:46</a></div></div>
<div class="ttc" id="a07719_html_ae36feac84d9e8125b700ce5189ed9e95"><div class="ttname"><a href="a07719.html#ae36feac84d9e8125b700ce5189ed9e95">std::list::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01506">stl_list.h:1506</a></div></div>
<div class="ttc" id="a04639_html_ae5f6b86b98b17e2ba39243ca8eaf4ee1"><div class="ttname"><a href="a04639.html#ae5f6b86b98b17e2ba39243ca8eaf4ee1">std::allocator_traits::deallocate</a></div><div class="ttdeci">static void deallocate(_Alloc &__a, pointer __p, size_type __n)</div><div class="ttdoc">Deallocate memory.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00327">bits/alloc_traits.h:327</a></div></div>
<div class="ttc" id="a07719_html_a1b89836dea3d2950a96e485677fe3c30"><div class="ttname"><a href="a07719.html#a1b89836dea3d2950a96e485677fe3c30">std::list::emplace</a></div><div class="ttdeci">iterator emplace(const_iterator __position, _Args &&... __args)</div><div class="ttdoc">Constructs object in list before specified iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00389_source.html#l00090">list.tcc:90</a></div></div>
<div class="ttc" id="a07719_html_acd7d9dc641209c8e429d291db8f2de25"><div class="ttname"><a href="a07719.html#acd7d9dc641209c8e429d291db8f2de25">std::list::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00962">stl_list.h:962</a></div></div>
<div class="ttc" id="a01479_html_gaebe6729ab5488ecc76c762873d226857"><div class="ttname"><a href="a01479.html#gaebe6729ab5488ecc76c762873d226857">std::false_type</a></div><div class="ttdeci">integral_constant< bool, false > false_type</div><div class="ttdoc">The type used as a compile-time boolean with false value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00078">type_traits:78</a></div></div>
<div class="ttc" id="a07651_html"><div class="ttname"><a href="a07651.html">std::_List_const_iterator</a></div><div class="ttdoc">A list::const_iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00074">stl_iterator_base_funcs.h:74</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="a07719_html_a3ba0b1fa92ccc5268e64c0023632aee7"><div class="ttname"><a href="a07719.html#a3ba0b1fa92ccc5268e64c0023632aee7">std::list::rbegin</a></div><div class="ttdeci">const_reverse_iterator rbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00998">stl_list.h:998</a></div></div>
<div class="ttc" id="a00269_html"><div class="ttname"><a href="a00269.html">allocated_ptr.h</a></div></div>
<div class="ttc" id="a07719_html_abc914a91c0740ca3f52168d0b631dbf8"><div class="ttname"><a href="a07719.html#abc914a91c0740ca3f52168d0b631dbf8">std::list::list</a></div><div class="ttdeci">list(initializer_list< value_type > __l, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a list from an initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00766">stl_list.h:766</a></div></div>
<div class="ttc" id="a07719_html_a396193b1480defeaa5f3367ca15ec35e"><div class="ttname"><a href="a07719.html#a396193b1480defeaa5f3367ca15ec35e">std::list::assign</a></div><div class="ttdeci">void assign(initializer_list< value_type > __l)</div><div class="ttdoc">Assigns an initializer_list to a list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00938">stl_list.h:938</a></div></div>
<div class="ttc" id="a07719_html"><div class="ttname"><a href="a07719.html">std::list</a></div><div class="ttdoc">A standard container with linear time access to elements, and fixed time insertion/deletion at any po...</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00564">stl_list.h:564</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="a07707_html"><div class="ttname"><a href="a07707.html">std::_List_node</a></div><div class="ttdoc">An actual node in the list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00166">stl_list.h:166</a></div></div>
<div class="ttc" id="a07719_html_ac43aac14d7c69657442718428b082aaf"><div class="ttname"><a href="a07719.html#ac43aac14d7c69657442718428b082aaf">std::list::back</a></div><div class="ttdeci">const_reference back() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01150">stl_list.h:1150</a></div></div>
<div class="ttc" id="a00308_html"><div class="ttname"><a href="a00308.html">concept_check.h</a></div></div>
<div class="ttc" id="a07719_html_a4b6c305dd92e3c76213778feba213da2"><div class="ttname"><a href="a07719.html#a4b6c305dd92e3c76213778feba213da2">std::list::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01068">stl_list.h:1068</a></div></div>
<div class="ttc" id="a07719_html_a8bd45a3517b01002de6debdb401d9170"><div class="ttname"><a href="a07719.html#a8bd45a3517b01002de6debdb401d9170">std::list::list</a></div><div class="ttdeci">list()=default</div><div class="ttdoc">Creates a list with no elements.</div></div>
<div class="ttc" id="a07719_html_a31f6032941520f4d9187fdf8284ae914"><div class="ttname"><a href="a07719.html#a31f6032941520f4d9187fdf8284ae914">std::list::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Get a copy of the memory allocation object.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00944">stl_list.h:944</a></div></div>
<div class="ttc" id="a07719_html_a702400622789c3e0f1171369f803fcb8"><div class="ttname"><a href="a07719.html#a702400622789c3e0f1171369f803fcb8">std::list::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01035">stl_list.h:1035</a></div></div>
<div class="ttc" id="a01485_html_gae179ce2d015dc0908973644687dce4c6"><div class="ttname"><a href="a01485.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a></div><div class="ttdeci">bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp)</div><div class="ttdoc">Performs dictionary comparison on ranges.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l01257">stl_algobase.h:1257</a></div></div>
<div class="ttc" id="a07719_html_a6527fbbec76ab1a8a4a80c04e6fcac70"><div class="ttname"><a href="a07719.html#a6527fbbec76ab1a8a4a80c04e6fcac70">std::list::assign</a></div><div class="ttdeci">void assign(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Assigns a range to a list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00916">stl_list.h:916</a></div></div>
<div class="ttc" id="a07719_html_ad744f7f3b84fc57c973ed2d3bb25a33e"><div class="ttname"><a href="a07719.html#ad744f7f3b84fc57c973ed2d3bb25a33e">std::list::pop_front</a></div><div class="ttdeci">void pop_front() noexcept</div><div class="ttdoc">Removes first element.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01205">stl_list.h:1205</a></div></div>
<div class="ttc" id="a07719_html_a164bc4a9a0f40d98579507cfa9bb0313"><div class="ttname"><a href="a07719.html#a164bc4a9a0f40d98579507cfa9bb0313">std::list::push_back</a></div><div class="ttdeci">void push_back(const value_type &__x)</div><div class="ttdoc">Add data to the end of the list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01219">stl_list.h:1219</a></div></div>
<div class="ttc" id="a07719_html_ad905b1f7f844c8715c654439611804a1"><div class="ttname"><a href="a07719.html#ad905b1f7f844c8715c654439611804a1">std::list::list</a></div><div class="ttdeci">list(_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a list from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00811">stl_list.h:811</a></div></div>
<div class="ttc" id="a04639_html_a29c306bcb6a7676a516430a0e50b990a"><div class="ttname"><a href="a04639.html#a29c306bcb6a7676a516430a0e50b990a">std::allocator_traits::max_size</a></div><div class="ttdeci">static size_type max_size(const _Alloc &__a) noexcept</div><div class="ttdoc">The maximum supported allocation size.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00366">bits/alloc_traits.h:366</a></div></div>
<div class="ttc" id="a03631_html"><div class="ttname"><a href="a03631.html">std::is_nothrow_default_constructible</a></div><div class="ttdoc">is_nothrow_default_constructible</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00940">type_traits:940</a></div></div>
<div class="ttc" id="a07615_html"><div class="ttname"><a href="a07615.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a17145_source.html#l00101">bits/stl_iterator.h:101</a></div></div>
<div class="ttc" id="a07719_html_ac0642b1d26b07dcf28d5fd72bfbdd6d1"><div class="ttname"><a href="a07719.html#ac0642b1d26b07dcf28d5fd72bfbdd6d1">std::list::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01073">stl_list.h:1073</a></div></div>
<div class="ttc" id="a07703_html"><div class="ttname"><a href="a07703.html">std::__detail::_List_node_header</a></div><div class="ttdoc">The list node header.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l00103">stl_list.h:103</a></div></div>
<div class="ttc" id="a07719_html_afca54335268365fbe964394a8fe5df1b"><div class="ttname"><a href="a07719.html#afca54335268365fbe964394a8fe5df1b">std::list::swap</a></div><div class="ttdeci">void swap(list &__x) noexcept</div><div class="ttdoc">Swaps data with another list.</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01486">stl_list.h:1486</a></div></div>
<div class="ttc" id="a07719_html_af134c3c02479d6b40c4b6dd9784ff9b2"><div class="ttname"><a href="a07719.html#af134c3c02479d6b40c4b6dd9784ff9b2">std::list::rend</a></div><div class="ttdeci">const_reverse_iterator rend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01016">stl_list.h:1016</a></div></div>
<div class="ttc" id="a07647_html"><div class="ttname"><a href="a07647.html">std::_List_iterator</a></div><div class="ttdoc">A list::iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00073">stl_iterator_base_funcs.h:73</a></div></div>
<div class="ttc" id="a07719_html_ab0c1a4886327c94160ec35419c516f64"><div class="ttname"><a href="a07719.html#ab0c1a4886327c94160ec35419c516f64">std::list::crbegin</a></div><div class="ttdeci">const_reverse_iterator crbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00557_source.html#l01044">stl_list.h:1044</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="a00557.html">stl_list.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>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
509
