<!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++: list.tcc Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00389_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">list.tcc</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00389.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 (out of line) -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2001-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996,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/list.tcc</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{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 _LIST_TCC</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _LIST_TCC 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _List_base<_Tp, _Alloc>::</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  _M_clear() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">typedef</span> _List_node<_Tp> _Node;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  __detail::_List_node_base* __cur = _M_impl._M_node._M_next;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">while</span> (__cur != &_M_impl._M_node)</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>  _Node* __tmp = static_cast<_Node*>(__cur);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  __cur = __tmp->_M_next;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  _Tp* __val = __tmp->_M_valptr();</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _Node_alloc_traits::destroy(_M_get_Node_allocator(), __val);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  _Tp_alloc_type(_M_get_Node_allocator()).destroy(__val);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  _M_put_node(__tmp);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typename</span> list<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <a class="code" href="a07719.html#a1b89836dea3d2950a96e485677fe3c30">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="a07719.html#a1b89836dea3d2950a96e485677fe3c30"> 90</a></span> <a class="code" href="a07719.html#a1b89836dea3d2950a96e485677fe3c30"> emplace</a>(<a class="code" href="a07651.html">const_iterator</a> __position, _Args&&... __args)</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>  <a class="code" href="a07707.html">_Node</a>* __tmp = _M_create_node(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  __tmp->_M_hook(__position._M_const_cast()._M_node);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  this->_M_inc_size(1);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">return</span> <a class="code" href="a07647.html">iterator</a>(__tmp);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typename</span> <a class="code" href="a07647.html">list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="a07719.html">list<_Tp, _Alloc></a>::</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd"> 103</a></span>  insert(<a class="code" href="a07651.html">const_iterator</a> __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  insert(<a class="code" href="a07647.html">iterator</a> __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="a07707.html">_Node</a>* __tmp = _M_create_node(__x);</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  __tmp->_M_hook(__position._M_const_cast()._M_node);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  this->_M_inc_size(1);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> <a class="code" href="a07647.html">iterator</a>(__tmp);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">typename</span> <a class="code" href="a07647.html">list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="a07719.html#a3660a3d042a5605cde9ecc59e4b9b17c"> 118</a></span> <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd"> insert</a>(<a class="code" href="a07651.html">const_iterator</a> __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (__n)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="a07719.html">list</a> __tmp(__n, __x, get_allocator());</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="a07647.html">iterator</a> __it = __tmp.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>();</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  splice(__position, __tmp);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> __it;</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>  <span class="keywordflow">return</span> __position._M_const_cast();</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span>></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typename</span> <a class="code" href="a07647.html">list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="a07719.html#a9a552f1f8f2fd43351184e6676b1fea1"> 134</a></span> <a class="code" href="a07719.html#a0b44f76b96a458895a1e8c6e4057b8dd"> insert</a>(<a class="code" href="a07651.html">const_iterator</a> __position, _InputIterator __first,</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  _InputIterator __last)</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="a07719.html">list</a> __tmp(__first, __last, get_allocator());</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (!__tmp.<a class="code" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">empty</a>())</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="a07647.html">iterator</a> __it = __tmp.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>();</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  splice(__position, __tmp);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">return</span> __it;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">return</span> __position._M_const_cast();</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="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">typename</span> <a class="code" href="a07647.html">list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="code" href="a07719.html">list<_Tp, _Alloc></a>::</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="a07719.html#aee5d29fe9b6e9494a71022ca980502be"> 152</a></span>  erase(<a class="code" href="a07651.html">const_iterator</a> __position) noexcept</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  erase(<a class="code" href="a07647.html">iterator</a> __position)</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#endif</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>  <a class="code" href="a07647.html">iterator</a> __ret = <a class="code" href="a07647.html">iterator</a>(__position._M_node->_M_next);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  _M_erase(__position._M_const_cast());</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">return</span> __ret;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</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>  <span class="comment">// Return a const_iterator indicating the position to start inserting or</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// erasing elements (depending whether the list is growing or shrinking),</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// and set __new_size to the number of new elements that must be appended.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Equivalent to the following, but performed optimally:</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// if (__new_size < size()) {</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// __new_size = 0;</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// return std::next(begin(), __new_size);</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// } else {</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// __newsize -= size();</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// return end();</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// }</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">typename</span> <a class="code" href="a07651.html">list<_Tp, _Alloc>::const_iterator</a></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="a07719.html">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <a class="code" href="a07719.html"> _M_resize_pos</a>(size_type& __new_size)<span class="keyword"> const</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  const_iterator __i;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#if _GLIBCXX_USE_CXX11_ABI</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">const</span> size_type __len = size();</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (__new_size < __len)</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">if</span> (__new_size <= __len / 2)</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  __i = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__i, __new_size);</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  __i = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  ptrdiff_t __num_erase = __len - __new_size;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__i, -__num_erase);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  __new_size = 0;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">return</span> __i;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  __i = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  size_type __len = 0;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">for</span> (__i = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(); __i != <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>() && __len < __new_size; ++__i, ++__len)</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  __new_size -= __len;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> __i;</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> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  list<_Tp, _Alloc>::</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  _M_default_append(size_type __n)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  size_type __i = 0;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  __try</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  {</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">for</span> (; __i < __n; ++__i)</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  emplace_back();</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  __catch(...)</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>  <span class="keywordflow">for</span> (; __i; --__i)</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  pop_back();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  __throw_exception_again;</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>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc"> 231</a></span> <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc"> resize</a>(size_type __new_size)</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  {</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="a07651.html">const_iterator</a> __i = _M_resize_pos(__new_size);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">if</span> (__new_size)</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  _M_default_append(__new_size);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  erase(__i, <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="a07719.html#a235d2bb37c9a5d9323c123ebd060cebc"> 243</a></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="l00244"></a><span class="lineno"> 244</span>  {</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="a07651.html">const_iterator</a> __i = _M_resize_pos(__new_size);</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (__new_size)</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  insert(<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __new_size, __x);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  erase(__i, <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <a class="code" href="a07719.html#a06a57b2ab785e15264e7f36742c4b0dc"> resize</a>(size_type __new_size, value_type __x)</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>  const_iterator __i = _M_resize_pos(__new_size);</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (__new_size)</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  insert(<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __new_size, __x);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  erase(__i._M_const_cast(), <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  list<_Tp, _Alloc>&</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="a07719.html#a35a994d029c0e0cf92abf1f468cfa140">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00268"></a><span class="lineno"><a class="line" href="a07719.html#a35a994d029c0e0cf92abf1f468cfa140"> 268</a></span> <a class="code" href="a07719.html#a35a994d029c0e0cf92abf1f468cfa140"> operator=</a>(<span class="keyword">const</span> <a class="code" href="a07719.html">list</a>& __x)</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="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="l00271"></a><span class="lineno"> 271</span>  {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span> (_Node_alloc_traits::_S_propagate_on_copy_assign())</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  {</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">auto</span>& __this_alloc = this->_M_get_Node_allocator();</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">auto</span>& __that_alloc = __x._M_get_Node_allocator();</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (!_Node_alloc_traits::_S_always_equal()</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  && __this_alloc != __that_alloc)</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  {</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// replacement allocator cannot free existing storage</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  clear();</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  std::__alloc_on_copy(__this_alloc, __that_alloc);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  _M_assign_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="l00287"></a><span class="lineno"> 287</span>  }</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</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="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="a07719.html">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <a class="code" href="a07719.html"> _M_fill_assign</a>(size_type __n, <span class="keyword">const</span> value_type& __val)</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>  <a class="code" href="a07675.html">iterator</a> __i = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">for</span> (; __i != <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>() && __n > 0; ++__i, --__n)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  *__i = __val;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">if</span> (__n > 0)</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  insert(<a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __n, __val);</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  erase(__i, <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  list<_Tp, _Alloc>::</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  __false_type)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  iterator __first1 = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  iterator __last1 = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (; __first1 != __last1 && __first2 != __last2;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  ++__first1, ++__first2)</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  *__first1 = *__first2;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (__first2 == __last2)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  erase(__first1, __last1);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  insert(__last1, __first2, __last2);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <a class="code" href="a07719.html#ad2334ed28f60c39412ac8cacfa14643d">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00326"></a><span class="lineno"><a class="line" href="a07719.html#ad2334ed28f60c39412ac8cacfa14643d"> 326</a></span> <a class="code" href="a07719.html#ad2334ed28f60c39412ac8cacfa14643d"> remove</a>(<span class="keyword">const</span> value_type& __value)</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="a07647.html">iterator</a> __first = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="a07647.html">iterator</a> __last = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="a07647.html">iterator</a> __extra = __last;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="a07647.html">iterator</a> __next = __first;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  ++__next;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">if</span> (*__first == __value)</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  {</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// 526. Is it undefined if a function in the standard changes</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// in parameters?</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span> (<a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(*__first) != <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__value))</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  _M_erase(__first);</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  __extra = __first;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  __first = __next;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span> (__extra != __last)</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  _M_erase(__extra);</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <a class="code" href="a07719.html#a30b4690883a5219b9dc98233364d2e49">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00354"></a><span class="lineno"><a class="line" href="a07719.html#a30b4690883a5219b9dc98233364d2e49"> 354</a></span> <a class="code" href="a07719.html#a30b4690883a5219b9dc98233364d2e49"> unique</a>()</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  {</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <a class="code" href="a07647.html">iterator</a> __first = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="a07647.html">iterator</a> __last = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <a class="code" href="a07647.html">iterator</a> __next = __first;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">while</span> (++__next != __last)</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">if</span> (*__first == *__next)</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  _M_erase(__next);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  __first = __next;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  __next = __first;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  }</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <a class="code" href="a07719.html">list<_Tp, _Alloc></a>::</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00375"></a><span class="lineno"><a class="line" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012"> 375</a></span>  merge(<a class="code" href="a07719.html">list</a>&& __x)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  merge(<a class="code" href="a07719.html">list</a>& __x)</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="preprocessor">#endif</span></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="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// 300. list::merge() specification incomplete</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</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="l00383"></a><span class="lineno"> 383</span>  {</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  _M_check_equal_allocators(__x);</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> </div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <a class="code" href="a07647.html">iterator</a> __first1 = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <a class="code" href="a07647.html">iterator</a> __last1 = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="a07647.html">iterator</a> __first2 = __x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>();</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="a07647.html">iterator</a> __last2 = __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>();</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __orig_size = __x.<a class="code" href="a07719.html#a4b6c305dd92e3c76213778feba213da2">size</a>();</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  __try {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">while</span> (__first1 != __last1 && __first2 != __last2)</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">if</span> (*__first2 < *__first1)</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>  <a class="code" href="a07647.html">iterator</a> __next = __first2;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  _M_transfer(__first1, __first2, ++__next);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  __first2 = __next;</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>  <span class="keywordflow">else</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  ++__first1;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">if</span> (__first2 != __last2)</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  _M_transfer(__last1, __first2, __last2);</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  this->_M_inc_size(__x._M_get_size());</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  __x._M_set_size(0);</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  }</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  __catch(...)</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __dist = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first2, __last2);</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  this->_M_inc_size(__orig_size - __dist);</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  __x._M_set_size(__dist);</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  __throw_exception_again;</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>  }</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> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _StrictWeakOrdering></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <a class="code" href="a07719.html">list<_Tp, _Alloc></a>::</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00422"></a><span class="lineno"><a class="line" href="a07719.html#a44306154a6f093d8168eff45b90aa3ad"> 422</a></span>  merge(<a class="code" href="a07719.html">list</a>&& __x, _StrictWeakOrdering __comp)</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  merge(<a class="code" href="a07719.html">list</a>& __x, _StrictWeakOrdering __comp)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="comment">// 300. list::merge() specification incomplete</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</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="l00430"></a><span class="lineno"> 430</span>  {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  _M_check_equal_allocators(__x);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="a07647.html">iterator</a> __first1 = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="a07647.html">iterator</a> __last1 = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <a class="code" href="a07647.html">iterator</a> __first2 = __x.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>();</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <a class="code" href="a07647.html">iterator</a> __last2 = __x.<a class="code" href="a07719.html#aba82f0b94c1ed15ccacea0e98aa6cff6">end</a>();</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __orig_size = __x.<a class="code" href="a07719.html#a4b6c305dd92e3c76213778feba213da2">size</a>();</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  __try</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  {</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">while</span> (__first1 != __last1 && __first2 != __last2)</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">if</span> (__comp(*__first2, *__first1))</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  {</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="a07647.html">iterator</a> __next = __first2;</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  _M_transfer(__first1, __first2, ++__next);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __first2 = __next;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  ++__first1;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (__first2 != __last2)</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  _M_transfer(__last1, __first2, __last2);</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>  this->_M_inc_size(__x._M_get_size());</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  __x._M_set_size(0);</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  __catch(...)</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  {</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __dist = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first2, __last2);</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  this->_M_inc_size(__orig_size - __dist);</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  __x._M_set_size(__dist);</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  __throw_exception_again;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</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>  }</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> </div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <a class="code" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00468"></a><span class="lineno"><a class="line" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b"> 468</a></span> <a class="code" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b"> sort</a>()</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  {</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// Do nothing if the list has length 0 or 1.</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">if</span> (this->_M_impl._M_node._M_next != &this->_M_impl._M_node</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node)</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  {</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <a class="code" href="a07719.html">list</a> __carry;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <a class="code" href="a07719.html">list</a> __tmp[64];</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <a class="code" href="a07719.html">list</a> * __fill = __tmp;</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <a class="code" href="a07719.html">list</a> * __counter;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  __try</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="keywordflow">do</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  {</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  __carry.<a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__carry.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), *<span class="keyword">this</span>, <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</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">for</span>(__counter = __tmp;</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  __counter != __fill && !__counter-><a class="code" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">empty</a>();</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  ++__counter)</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>  __counter-><a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(__carry);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  __carry.<a class="code" href="a07719.html#afca54335268365fbe964394a8fe5df1b">swap</a>(*__counter);</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  }</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  __carry.<a class="code" href="a07719.html#afca54335268365fbe964394a8fe5df1b">swap</a>(*__counter);</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">if</span> (__counter == __fill)</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  ++__fill;</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="keywordflow">while</span> ( !empty() );</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">for</span> (__counter = __tmp + 1; __counter != __fill; ++__counter)</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  __counter-><a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(*(__counter - 1));</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  swap( *(__fill - 1) );</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  __catch(...)</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  this->splice(this-><a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __carry);</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> __i = 0; __i < <span class="keyword">sizeof</span>(__tmp)/<span class="keyword">sizeof</span>(__tmp[0]); ++__i)</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  this->splice(this-><a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __tmp[__i]);</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  __throw_exception_again;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <a class="code" href="a07719.html#adbed771a216e1f1db299bf13c0049177">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00515"></a><span class="lineno"><a class="line" href="a07719.html#adbed771a216e1f1db299bf13c0049177"> 515</a></span> <a class="code" href="a07719.html#adbed771a216e1f1db299bf13c0049177"> remove_if</a>(_Predicate __pred)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  {</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <a class="code" href="a07647.html">iterator</a> __first = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="a07647.html">iterator</a> __last = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  {</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <a class="code" href="a07647.html">iterator</a> __next = __first;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  ++__next;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (__pred(*__first))</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  _M_erase(__first);</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  __first = __next;</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> </div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <a class="code" href="a07719.html#a30b4690883a5219b9dc98233364d2e49">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00533"></a><span class="lineno"><a class="line" href="a07719.html#a69c3de1ee48297d2d375a11044694cf5"> 533</a></span> <a class="code" href="a07719.html#a30b4690883a5219b9dc98233364d2e49"> unique</a>(_BinaryPredicate __binary_pred)</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  {</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <a class="code" href="a07647.html">iterator</a> __first = <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <a class="code" href="a07647.html">iterator</a> __last = <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <a class="code" href="a07647.html">iterator</a> __next = __first;</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">while</span> (++__next != __last)</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  {</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordflow">if</span> (__binary_pred(*__first, *__next))</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  _M_erase(__next);</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  __first = __next;</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  __next = __first;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> </div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _StrictWeakOrdering></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <a class="code" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b">list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00554"></a><span class="lineno"><a class="line" href="a07719.html#a96029060c6dd54dc811b3c0d59b06537"> 554</a></span> <a class="code" href="a07719.html#a150b5b104440ea65709e70a7f2eba06b"> sort</a>(_StrictWeakOrdering __comp)</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  {</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">// Do nothing if the list has length 0 or 1.</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">if</span> (this->_M_impl._M_node._M_next != &this->_M_impl._M_node</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node)</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  {</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <a class="code" href="a07719.html">list</a> __carry;</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <a class="code" href="a07719.html">list</a> __tmp[64];</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <a class="code" href="a07719.html">list</a> * __fill = __tmp;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <a class="code" href="a07719.html">list</a> * __counter;</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  __try</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="keywordflow">do</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  __carry.<a class="code" href="a07719.html#ae27f8110bc96c70775f1654e978b4c5f">splice</a>(__carry.<a class="code" href="a07719.html#a1a0d75e77ac53db35e3cdf85ad6d3fa3">begin</a>(), *<span class="keyword">this</span>, <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>());</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> </div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">for</span>(__counter = __tmp;</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  __counter != __fill && !__counter-><a class="code" href="a07719.html#af558a1b206e6fdf40921aeaba0383dbe">empty</a>();</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  ++__counter)</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  {</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  __counter-><a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(__carry, __comp);</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  __carry.<a class="code" href="a07719.html#afca54335268365fbe964394a8fe5df1b">swap</a>(*__counter);</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  __carry.<a class="code" href="a07719.html#afca54335268365fbe964394a8fe5df1b">swap</a>(*__counter);</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">if</span> (__counter == __fill)</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  ++__fill;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  }</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">while</span> ( !empty() );</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> </div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">for</span> (__counter = __tmp + 1; __counter != __fill; ++__counter)</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  __counter-><a class="code" href="a07719.html#a4d6a44991e6e9a4f1d74236e7d6fc012">merge</a>(*(__counter - 1), __comp);</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  swap(*(__fill - 1));</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  __catch(...)</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  this->splice(this-><a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __carry);</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> __i = 0; __i < <span class="keyword">sizeof</span>(__tmp)/<span class="keyword">sizeof</span>(__tmp[0]); ++__i)</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  this->splice(this-><a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __tmp[__i]);</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  __throw_exception_again;</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  }</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  }</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> </div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="preprocessor">#endif </span><span class="comment">/* _LIST_TCC */</span><span class="preprocessor"></span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</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_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="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="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_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_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_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_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="a01541_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00202">stl_iterator_base_funcs.h:202</a></div></div>
<div class="ttc" id="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_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_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="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="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_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_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="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="a01541_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01541.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00099">initializer_list:99</a></div></div>
<div class="ttc" id="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="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_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="a01541_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00089">initializer_list:89</a></div></div>
<div class="ttc" id="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="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><!-- 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="a00389.html">list.tcc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
359
