<!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++: forward_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('a00338_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">forward_list.tcc</div> </div> </div><!--header--> <div class="contents"> <a href="a00338.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">// <forward_list.tcc> -*- 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) 2008-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> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file bits/forward_list.tcc</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Do not attempt to use it directly. @headername{forward_list}</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#ifndef _FORWARD_LIST_TCC</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define _FORWARD_LIST_TCC 1</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span><a class="code" href="a01538.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  _Fwd_list_base<_Tp, _Alloc>::</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  _Fwd_list_base(_Fwd_list_base&& __lst, _Node_alloc_type&& __a)</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  : _M_impl(<a class="code" href="a01538.html">std</a>::move(__a))</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">if</span> (__lst._M_get_Node_allocator() == _M_get_Node_allocator())</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  this->_M_impl._M_head = std::move(__lst._M_impl._M_head);</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  _Fwd_list_node_base*</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  _Fwd_list_base<_Tp, _Alloc>::</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  _M_insert_after(const_iterator __pos, _Args&&... __args)</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  _Fwd_list_node_base* __to</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  = const_cast<_Fwd_list_node_base*>(__pos._M_node);</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  _Node* __thing = _M_create_node(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  __thing->_M_next = __to->_M_next;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  __to->_M_next = __thing;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">return</span> __to->_M_next;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  _Fwd_list_node_base*</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  _Fwd_list_base<_Tp, _Alloc>::</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  _M_erase_after(_Fwd_list_node_base* __pos)</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _Node* __curr = static_cast<_Node*>(__pos->_M_next);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  __pos->_M_next = __curr->_M_next;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  _Node_alloc_traits::destroy(_M_get_Node_allocator(),</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  __curr->_M_valptr());</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  __curr->~_Node();</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  _M_put_node(__curr);</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">return</span> __pos->_M_next;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  _Fwd_list_node_base*</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _Fwd_list_base<_Tp, _Alloc>::</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  _M_erase_after(_Fwd_list_node_base* __pos,</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  _Fwd_list_node_base* __last)</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  _Node* __curr = static_cast<_Node*>(__pos->_M_next);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">while</span> (__curr != __last)</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>  _Node* __temp = __curr;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  __curr = static_cast<_Node*>(__curr->_M_next);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  _Node_alloc_traits::destroy(_M_get_Node_allocator(),</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  __temp->_M_valptr());</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  __temp->~_Node();</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  _M_put_node(__temp);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  __pos->_M_next = __last;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> __last;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Called by the range constructor to implement [23.3.4.2]/9</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  _M_range_initialize(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  _Node_base* __to = &this->_M_impl._M_head;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  __to->_M_next = this->_M_create_node(*__first);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  __to = __to->_M_next;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// Called by forward_list(n,v,a).</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  _M_fill_initialize(size_type __n, <span class="keyword">const</span> value_type& __value)</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  _Node_base* __to = &this->_M_impl._M_head;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">for</span> (; __n; --__n)</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  __to->_M_next = this->_M_create_node(__value);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  __to = __to->_M_next;</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>  }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  _M_default_initialize(size_type __n)</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>  _Node_base* __to = &this->_M_impl._M_head;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">for</span> (; __n; --__n)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  __to->_M_next = this->_M_create_node();</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __to = __to->_M_next;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  forward_list<_Tp, _Alloc>&</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="a05456.html#a78c1273fb53228cab655addd77f9cd25"> 140</a></span>  operator=(<span class="keyword">const</span> <a class="code" href="a05456.html">forward_list</a>& __list)</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (<a class="code" href="a01477.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__list) != <span class="keyword">this</span>)</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">if</span> (_Node_alloc_traits::_S_propagate_on_copy_assign())</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="keyword">auto</span>& __this_alloc = this->_M_get_Node_allocator();</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">auto</span>& __that_alloc = __list._M_get_Node_allocator();</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (!_Node_alloc_traits::_S_always_equal()</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  && __this_alloc != __that_alloc)</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  {</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// replacement allocator cannot free existing storage</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  clear();</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  std::__alloc_on_copy(__this_alloc, __that_alloc);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  assign(__list.<a class="code" href="a05456.html#ace31decae76d75133e08418f392a78b3">cbegin</a>(), __list.<a class="code" href="a05456.html#aaa651df81ec5161454becd5198407986">cend</a>());</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <a class="code" href="a05456.html"> _M_default_insert_after</a>(const_iterator __pos, size_type __n)</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  const_iterator __saved_pos = __pos;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  __try</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">for</span> (; __n; --__n)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  __pos = emplace_after(__pos);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  __catch(...)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  erase_after(__saved_pos, ++__pos);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  __throw_exception_again;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="a05456.html#a73ffca07b591237200b852caf7040057"> 182</a></span>  resize(size_type __sz)</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  {</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <a class="code" href="a05440.html">iterator</a> __k = before_begin();</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  size_type __len = 0;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">while</span> (__k._M_next() != <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>() && __len < __sz)</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  {</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  ++__k;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  ++__len;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (__len == __sz)</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  erase_after(__k, <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  _M_default_insert_after(__k, __sz - __len);</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> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="a05456.html#abfb248e17d0392a8caf5c46683102332"> 201</a></span> <a class="code" href="a05456.html"> resize</a>(size_type __sz, <span class="keyword">const</span> value_type& __val)</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>  <a class="code" href="a05440.html">iterator</a> __k = before_begin();</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  size_type __len = 0;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">while</span> (__k._M_next() != <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>() && __len < __sz)</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>  ++__k;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  ++__len;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (__len == __sz)</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  erase_after(__k, <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>());</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  insert_after(__k, __sz - __len, __val);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">typename</span> <a class="code" href="a05440.html">forward_list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <a class="code" href="a05456.html"> _M_splice_after</a>(const_iterator __pos,</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  const_iterator __before, const_iterator __last)</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  _Node_base* __tmp = const_cast<_Node_base*>(__pos._M_node);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  _Node_base* __b = const_cast<_Node_base*>(__before._M_node);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  _Node_base* __end = __b;</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>  <span class="keywordflow">while</span> (__end && __end->_M_next != __last._M_node)</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  __end = __end->_M_next;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">if</span> (__b != __end)</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> <a class="code" href="a07672.html">iterator</a>(__tmp->_M_transfer_after(__b, __end));</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span> <a class="code" href="a07672.html">iterator</a>(__tmp);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00239"></a><span class="lineno"><a class="line" href="a05456.html#aa3a2a989959206263a683014f575cdc3"> 239</a></span>  splice_after(<a class="code" href="a05444.html">const_iterator</a> __pos, <a class="code" href="a05456.html">forward_list</a>&&,</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <a class="code" href="a05444.html">const_iterator</a> __i) noexcept</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="a05444.html">const_iterator</a> __j = __i;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  ++__j;</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>  <span class="keywordflow">if</span> (__pos == __i || __pos == __j)</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="a05432.html">_Node_base</a>* __tmp = const_cast<_Node_base*>(__pos._M_node);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  __tmp->_M_transfer_after(const_cast<_Node_base*>(__i._M_node),</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  const_cast<_Node_base*>(__j._M_node));</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">typename</span> <a class="code" href="a05440.html">forward_list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="a05456.html#a4921af283fd230d563266ca0ce14a455"> 256</a></span> <a class="code" href="a05456.html"> insert_after</a>(<a class="code" href="a05444.html">const_iterator</a> __pos, size_type __n, <span class="keyword">const</span> _Tp& __val)</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  {</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (__n)</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="a05456.html">forward_list</a> __tmp(__n, __val, get_allocator());</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">return</span> _M_splice_after(__pos, __tmp.<a class="code" href="a05456.html#a4becc964d2aa37c756215139094d8ff8">before_begin</a>(), __tmp.<a class="code" href="a05456.html#a7f64feff678dd8cb85d35bd9b08fde54">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="keywordflow">else</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">return</span> <a class="code" href="a05440.html">iterator</a>(const_cast<_Node_base*>(__pos._M_node));</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span>></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">typename</span> <a class="code" href="a05440.html">forward_list<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="a05456.html#a03cc027e568ad94dbbbc25da7d485fe7"> 271</a></span> <a class="code" href="a05456.html"> insert_after</a>(<a class="code" href="a05444.html">const_iterator</a> __pos,</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  _InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="code" href="a05456.html">forward_list</a> __tmp(__first, __last, get_allocator());</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (!__tmp.<a class="code" href="a05456.html#ab0a3479429315d1735f3d6b15817b01e">empty</a>())</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">return</span> _M_splice_after(__pos, __tmp.<a class="code" href="a05456.html#a4becc964d2aa37c756215139094d8ff8">before_begin</a>(), __tmp.<a class="code" href="a05456.html#a7f64feff678dd8cb85d35bd9b08fde54">end</a>());</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">return</span> <a class="code" href="a05440.html">iterator</a>(const_cast<_Node_base*>(__pos._M_node));</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> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="a05456.html#aea8b894eab1beaf02326b7c118bc5c5c"> 284</a></span> <a class="code" href="a05456.html"> remove</a>(<span class="keyword">const</span> _Tp& __val)</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="a05432.html">_Node_base</a>* __curr = &this->_M_impl._M_head;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="a05432.html">_Node_base</a>* __extra = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">while</span> (<a class="code" href="a05436.html">_Node</a>* __tmp = static_cast<_Node*>(__curr->_M_next))</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="keywordflow">if</span> (*__tmp->_M_valptr() == __val)</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (__tmp->_M_valptr() != <a class="code" href="a01477.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__val))</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  this->_M_erase_after(__curr);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  __extra = __curr;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  }</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  __curr = __curr->_M_next;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  }</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (__extra)</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  this->_M_erase_after(__extra);</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00312"></a><span class="lineno"><a class="line" href="a05456.html#ab4f0f2dbdbfbd38a94a2241ccfe6c3d8"> 312</a></span> <a class="code" href="a05456.html"> remove_if</a>(_Pred __pred)</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  {</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="a05432.html">_Node_base</a>* __curr = &this->_M_impl._M_head;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">while</span> (<a class="code" href="a05436.html">_Node</a>* __tmp = static_cast<_Node*>(__curr->_M_next))</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (__pred(*__tmp->_M_valptr()))</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  this->_M_erase_after(__curr);</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>  __curr = __curr->_M_next;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BinPred></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="a05456.html#a1daa70e14ec845a288cec10962d3585b"> 328</a></span> <a class="code" href="a05456.html"> unique</a>(_BinPred __binary_pred)</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  {</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="a05440.html">iterator</a> __first = <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="a05440.html">iterator</a> __last = <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="a05440.html">iterator</a> __next = __first;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">while</span> (++__next != __last)</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="keywordflow">if</span> (__binary_pred(*__first, *__next))</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  erase_after(__first);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  __first = __next;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  __next = __first;</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Comp></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <a class="code" href="a05456.html">forward_list<_Tp, _Alloc>::</a></div><div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="a05456.html#a0de7b075b73cc0a843447ad75cba4b87"> 349</a></span> <a class="code" href="a05456.html"> merge</a>(<a class="code" href="a05456.html">forward_list</a>&& __list, _Comp __comp)</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>  <a class="code" href="a05432.html">_Node_base</a>* __node = &this->_M_impl._M_head;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">while</span> (__node->_M_next && __list._M_impl._M_head._M_next)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> (__comp(*static_cast<_Node*></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  (__list._M_impl._M_head._M_next)->_M_valptr(),</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  *static_cast<_Node*></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  (__node->_M_next)->_M_valptr()))</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  __node->_M_transfer_after(&__list._M_impl._M_head,</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  __list._M_impl._M_head._M_next);</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  __node = __node->_M_next;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</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> (__list._M_impl._M_head._M_next)</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  *__node = std::move(__list._M_impl._M_head);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00369"></a><span class="lineno"><a class="line" href="a01538.html#ada41d3682184f0d0d8525907fdfcbea8"> 369</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a05456.html">forward_list<_Tp, _Alloc></a>& __lx,</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">const</span> <a class="code" href="a05456.html">forward_list<_Tp, _Alloc></a>& __ly)</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="comment">// We don't have size() so we need to walk through both lists</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// making sure both iterators are valid.</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">auto</span> __ix = __lx.<a class="code" href="a05456.html#ace31decae76d75133e08418f392a78b3">cbegin</a>();</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">auto</span> __iy = __ly.<a class="code" href="a05456.html#ace31decae76d75133e08418f392a78b3">cbegin</a>();</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">while</span> (__ix != __lx.<a class="code" href="a05456.html#aaa651df81ec5161454becd5198407986">cend</a>() && __iy != __ly.<a class="code" href="a05456.html#aaa651df81ec5161454becd5198407986">cend</a>())</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">if</span> (!(*__ix == *__iy))</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  ++__ix;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  ++__iy;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (__ix == __lx.<a class="code" href="a05456.html#aaa651df81ec5161454becd5198407986">cend</a>() && __iy == __ly.<a class="code" href="a05456.html#aaa651df81ec5161454becd5198407986">cend</a>())</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Comp></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  forward_list<_Tp, _Alloc>::</div><div class="line"><a name="l00393"></a><span class="lineno"><a class="line" href="a05456.html#a3f59eaf1f58f480eafa906d68d408682"> 393</a></span>  sort(_Comp __comp)</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>  <span class="comment">// If `next' is nullptr, return immediately.</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <a class="code" href="a05436.html">_Node</a>* __list = static_cast<_Node*>(this->_M_impl._M_head._M_next);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span> (!__list)</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __insize = 1;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">while</span> (1)</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>  <a class="code" href="a05436.html">_Node</a>* __p = __list;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  __list = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <a class="code" href="a05436.html">_Node</a>* __tail = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> </div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// Count number of merges we do in this pass.</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __nmerges = 0;</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> </div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">while</span> (__p)</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  {</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  ++__nmerges;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">// There exists a merge to be done.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="comment">// Step `insize' places along from p.</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <a class="code" href="a05436.html">_Node</a>* __q = __p;</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __psize = 0;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __i = 0; __i < __insize; ++__i)</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  {</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  ++__psize;</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  __q = static_cast<_Node*>(__q->_M_next);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (!__q)</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">// If q hasn't fallen off end, we have two lists to merge.</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __qsize = __insize;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="comment">// Now we have two lists; merge them.</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">while</span> (__psize > 0 || (__qsize > 0 && __q))</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  {</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="comment">// Decide whether next node of merge comes from p or q.</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="a05436.html">_Node</a>* __e;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordflow">if</span> (__psize == 0)</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  {</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// p is empty; e must come from q.</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  __e = __q;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  __q = static_cast<_Node*>(__q->_M_next);</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  --__qsize;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  }</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__qsize == 0 || !__q)</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>  <span class="comment">// q is empty; e must come from p.</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  __e = __p;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __p = static_cast<_Node*>(__p->_M_next);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  --__psize;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!__comp(*__q->_M_valptr(), *__p->_M_valptr()))</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// First node of q is not lower; e must come from p.</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  __e = __p;</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  __p = static_cast<_Node*>(__p->_M_next);</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  --__psize;</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>  <span class="keywordflow">else</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  {</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// First node of q is lower; e must come from q.</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  __e = __q;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  __q = static_cast<_Node*>(__q->_M_next);</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  --__qsize;</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>  <span class="comment">// Add the next node to the merged list.</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (__tail)</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  __tail->_M_next = __e;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  __list = __e;</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  __tail = __e;</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> </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// Now p has stepped `insize' places along, and q has too.</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  __p = __q;</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>  __tail->_M_next = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="comment">// If we have done only one merge, we're finished.</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// Allow for nmerges == 0, the empty list case.</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">if</span> (__nmerges <= 1)</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>  this->_M_impl._M_head._M_next = __list;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="comment">// Otherwise repeat, merging lists twice the size.</span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  __insize *= 2;</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="preprocessor">#endif </span><span class="comment">/* _FORWARD_LIST_TCC */</span><span class="preprocessor"></span></div><div class="ttc" id="a01538_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01538.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="a05456_html_aaa651df81ec5161454becd5198407986"><div class="ttname"><a href="a05456.html#aaa651df81ec5161454becd5198407986">std::forward_list::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00775">forward_list.h:775</a></div></div> <div class="ttc" id="a01538_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01538.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="a05456_html_ab0a3479429315d1735f3d6b15817b01e"><div class="ttname"><a href="a05456.html#ab0a3479429315d1735f3d6b15817b01e">std::forward_list::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00783">forward_list.h:783</a></div></div> <div class="ttc" id="a05456_html_ace31decae76d75133e08418f392a78b3"><div class="ttname"><a href="a05456.html#ace31decae76d75133e08418f392a78b3">std::forward_list::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00757">forward_list.h:757</a></div></div> <div class="ttc" id="a01477_html_ga1954d5552e24586051011312041033f6"><div class="ttname"><a href="a01477.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="a05432_html"><div class="ttname"><a href="a05432.html">std::_Fwd_list_node_base</a></div><div class="ttdoc">A helper basic node class for forward_list. This is just a linked list with nothing inside it....</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00054">forward_list.h:54</a></div></div> <div class="ttc" id="a05440_html"><div class="ttname"><a href="a05440.html">std::_Fwd_list_iterator</a></div><div class="ttdoc">A forward_list::iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00135">forward_list.h:135</a></div></div> <div class="ttc" id="a07672_html"><div class="ttname"><a href="a07672.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="a01538_html"><div class="ttname"><a href="a01538.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div> <div class="ttc" id="a05456_html_a4becc964d2aa37c756215139094d8ff8"><div class="ttname"><a href="a05456.html#a4becc964d2aa37c756215139094d8ff8">std::forward_list::before_begin</a></div><div class="ttdeci">iterator before_begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00704">forward_list.h:704</a></div></div> <div class="ttc" id="a05436_html"><div class="ttname"><a href="a05436.html">std::_Fwd_list_node</a></div><div class="ttdoc">A helper node class for forward_list. This is just a linked list with uninitialized storage for a dat...</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00113">forward_list.h:113</a></div></div> <div class="ttc" id="a05456_html_a7f64feff678dd8cb85d35bd9b08fde54"><div class="ttname"><a href="a05456.html#a7f64feff678dd8cb85d35bd9b08fde54">std::forward_list::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00739">forward_list.h:739</a></div></div> <div class="ttc" id="a05456_html"><div class="ttname"><a href="a05456.html">std::forward_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="a00335_source.html#l00425">forward_list.h:425</a></div></div> <div class="ttc" id="a05444_html"><div class="ttname"><a href="a05444.html">std::_Fwd_list_const_iterator</a></div><div class="ttdoc">A forward_list::const_iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00335_source.html#l00202">forward_list.h:202</a></div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_599c955538774c0249d4ddd97c0a9ae8.html">bits</a></li><li class="navelem"><a class="el" href="a00338.html">forward_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>