<!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++: deque.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('a00320_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">deque.tcc</div> </div> </div><!--header--> <div class="contents"> <a href="a00320.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">// Deque 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) 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/deque.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{deque}</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 _DEQUE_TCC</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _DEQUE_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="a01538.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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  _M_default_initialize()</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  {</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  _Map_pointer __cur;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  __try</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">for</span> (__cur = this->_M_impl._M_start._M_node;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  __cur < this->_M_impl._M_finish._M_node;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  ++__cur)</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  std::__uninitialized_default_a(*__cur, *__cur + _S_buffer_size(),</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::__uninitialized_default_a(this->_M_impl._M_finish._M_first,</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  this->_M_impl._M_finish._M_cur,</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  __catch(...)</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>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, iterator(*__cur, __cur),</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  __throw_exception_again;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor">#endif</span></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>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  deque<_Tp, _Alloc>&</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="a07304.html#acbbd2ced11be9e416c030bf3dcaeacad">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="a07304.html#acbbd2ced11be9e416c030bf3dcaeacad"> 94</a></span> <a class="code" href="a07304.html#acbbd2ced11be9e416c030bf3dcaeacad"> operator=</a>(<span class="keyword">const</span> <a class="code" href="a07304.html">deque</a>& __x)</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (&__x != <span class="keyword">this</span>)</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (_Alloc_traits::_S_propagate_on_copy_assign())</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (!_Alloc_traits::_S_always_equal()</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  && _M_get_Tp_allocator() != __x._M_get_Tp_allocator())</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// Replacement allocator cannot free existing storage,</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// so deallocate everything and take copy of __x's data.</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  _M_replace_map(__x, __x.<a class="code" href="a07304.html#a40d6b0cbbd61cda2b99f5fc4a274fe02">get_allocator</a>());</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  std::__alloc_on_copy(_M_get_Tp_allocator(),</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  __x._M_get_Tp_allocator());</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  std::__alloc_on_copy(_M_get_Tp_allocator(),</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  __x._M_get_Tp_allocator());</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">const</span> size_type __len = size();</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (__len >= __x.<a class="code" href="a07304.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _M_erase_at_end(std::copy(__x.<a class="code" href="a07304.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __x.<a class="code" href="a07304.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(),</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  this->_M_impl._M_start));</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="a07292.html">const_iterator</a> __mid = __x.<a class="code" href="a07304.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>() + difference_type(__len);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::copy(__x.<a class="code" href="a07304.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __mid, this->_M_impl._M_start);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  _M_range_insert_aux(this->_M_impl._M_finish, __mid, __x.<a class="code" href="a07304.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(),</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="a07668.html">std::random_access_iterator_tag</a>());</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">typename</span> deque<_Tp, _Alloc>::reference</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="a07304.html">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <a class="code" href="a07304.html"> emplace_front</a>(_Args&&... __args)</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  this->_M_impl._M_start._M_cur - 1,</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  --this->_M_impl._M_start._M_cur;</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="keywordflow">else</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  _M_push_front_aux(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> front();</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">typename</span> deque<_Tp, _Alloc>::reference</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  emplace_back(_Args&&... __args)</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  {</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish._M_cur</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  != this->_M_impl._M_finish._M_last - 1)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  this->_M_impl._M_finish._M_cur,</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  ++this->_M_impl._M_finish._M_cur;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  _M_push_back_aux(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> back();</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="preprocessor">#endif</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="preprocessor">#endif</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">typename</span> deque<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <a class="code" href="a07304.html#a3ea67e3e7fc5c84e92d9868bb57ae05a">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="a07304.html#a3ea67e3e7fc5c84e92d9868bb57ae05a"> 186</a></span> <a class="code" href="a07304.html#a3ea67e3e7fc5c84e92d9868bb57ae05a"> emplace</a>(<a class="code" href="a07292.html">const_iterator</a> __position, _Args&&... __args)</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">if</span> (__position._M_cur == this->_M_impl._M_start._M_cur)</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>  emplace_front(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</span> this->_M_impl._M_start;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__position._M_cur == this->_M_impl._M_finish._M_cur)</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  emplace_back(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="a07292.html">iterator</a> __tmp = this->_M_impl._M_finish;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  --__tmp;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> _M_insert_aux(__position._M_const_cast(),</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">typename</span> <a class="code" href="a07292.html">deque<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="code" href="a07304.html">deque<_Tp, _Alloc></a>::</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="a07304.html#a69b4ca4a5aad67e979d6e6db9b31781a"> 210</a></span>  insert(<a class="code" href="a07292.html">const_iterator</a> __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  insert(<a class="code" href="a07292.html">iterator</a> __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">if</span> (__position._M_cur == this->_M_impl._M_start._M_cur)</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>  push_front(__x);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">return</span> this->_M_impl._M_start;</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>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__position._M_cur == this->_M_impl._M_finish._M_cur)</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>  push_back(__x);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="a07292.html">iterator</a> __tmp = this->_M_impl._M_finish;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  --__tmp;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> __tmp;</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">else</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> _M_insert_aux(__position._M_const_cast(), __x);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">typename</span> <a class="code" href="a07292.html">deque<_Tp, _Alloc>::iterator</a></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="a07304.html">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <a class="code" href="a07304.html"> _M_erase</a>(<a class="code" href="a07672.html">iterator</a> __position)</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>  <a class="code" href="a07672.html">iterator</a> __next = __position;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  ++__next;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">const</span> difference_type __index = __position - <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">if</span> (static_cast<size_type>(__index) < (size() >> 1))</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (__position != <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>())</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  _GLIBCXX_MOVE_BACKWARD3(<a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(), __position, __next);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  pop_front();</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">else</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (__next != <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  _GLIBCXX_MOVE3(__next, <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __position);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  pop_back();</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="keywordflow">return</span> <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __index;</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> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">typename</span> deque<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  _M_erase(iterator __first, iterator __last)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__first == <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() && __last == <a class="code" href="a01538.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>  clear();</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">return</span> <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">const</span> difference_type __n = __last - __first;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> difference_type __elems_before = __first - <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (static_cast<size_type>(__elems_before) <= (size() - __n) / 2)</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="keywordflow">if</span> (__first != <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>())</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  _GLIBCXX_MOVE_BACKWARD3(<a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(), __first, __last);</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  _M_erase_at_begin(<a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __n);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (__last != <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  _GLIBCXX_MOVE3(__last, <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __first);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  _M_erase_at_end(<a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>() - __n);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">return</span> <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() + __elems_before;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Alloc></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  _M_assign_aux(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="a07652.html">std::input_iterator_tag</a>)</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>  iterator __cur = <a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">for</span> (; __first != __last && __cur != <a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>(); ++__cur, ++__first)</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  *__cur = *__first;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (__first == __last)</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  _M_erase_at_end(__cur);</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>  _M_range_insert_aux(<a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>(), __first, __last,</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="a01504.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first));</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</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>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  _M_fill_insert(iterator __pos, size_type __n, <span class="keyword">const</span> value_type& __x)</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="keywordflow">if</span> (__pos._M_cur == this->_M_impl._M_start._M_cur)</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  iterator __new_start = _M_reserve_elements_at_front(__n);</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  __try</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  {</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start,</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  __x, _M_get_Tp_allocator());</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  this->_M_impl._M_start = __new_start;</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>  __catch(...)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  {</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  _M_destroy_nodes(__new_start._M_node,</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  this->_M_impl._M_start._M_node);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  __throw_exception_again;</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="keywordflow">else</span> <span class="keywordflow">if</span> (__pos._M_cur == this->_M_impl._M_finish._M_cur)</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  {</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  iterator __new_finish = _M_reserve_elements_at_back(__n);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  __try</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  std::__uninitialized_fill_a(this->_M_impl._M_finish,</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  __new_finish, __x,</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  __catch(...)</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  {</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  __new_finish._M_node + 1);</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  __throw_exception_again;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  }</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  _M_insert_aux(__pos, __n, __x);</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></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>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  _M_default_append(size_type __n)</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="keywordflow">if</span> (__n)</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  iterator __new_finish = _M_reserve_elements_at_back(__n);</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  __try</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>  std::__uninitialized_default_a(this->_M_impl._M_finish,</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  __new_finish,</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  __catch(...)</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>  _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  __new_finish._M_node + 1);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  __throw_exception_again;</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>  }</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>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  _M_shrink_to_fit()</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  {</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> difference_type __front_capacity</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  = (this->_M_impl._M_start._M_cur - this->_M_impl._M_start._M_first);</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">if</span> (__front_capacity == 0)</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">return</span> <span class="keyword">false</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="keyword">const</span> difference_type __back_capacity</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  = (this->_M_impl._M_finish._M_last - this->_M_impl._M_finish._M_cur);</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">if</span> (__front_capacity + __back_capacity < _S_buffer_size())</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">return</span> std::__shrink_to_fit_aux<deque>::_S_do_it(*<span class="keyword">this</span>);</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="preprocessor">#endif</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">typename</span> _Alloc></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="a07304.html#a67647a3b7f00d3ca89b27980a1f2b7ee">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00392"></a><span class="lineno"><a class="line" href="a07304.html#a67647a3b7f00d3ca89b27980a1f2b7ee"> 392</a></span> <a class="code" href="a07304.html#a67647a3b7f00d3ca89b27980a1f2b7ee"> _M_fill_initialize</a>(<span class="keyword">const</span> value_type& __value)</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  {</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  _Map_pointer __cur;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  __try</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">for</span> (__cur = this->_M_impl._M_start._M_node;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  __cur < this->_M_impl._M_finish._M_node;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  ++__cur)</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(),</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  __value, _M_get_Tp_allocator());</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first,</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  this->_M_impl._M_finish._M_cur,</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  __value, _M_get_Tp_allocator());</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  __catch(...)</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>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start, <a class="code" href="a07292.html">iterator</a>(*__cur, __cur),</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  __throw_exception_again;</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</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> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <a class="code" href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00418"></a><span class="lineno"><a class="line" href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa"> 418</a></span> <a class="code" href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa"> _M_range_initialize</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <a class="code" href="a07652.html">std::input_iterator_tag</a>)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  this->_M_initialize_map(0);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  __try</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  {</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> #<span class="keywordflow">if</span> __cplusplus >= 201103L</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  emplace_back(*__first);</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  push_back(*__first);</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="preprocessor">#endif</span></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>  __catch(...)</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>  clear();</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  __throw_exception_again;</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>  }</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <a class="code" href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00442"></a><span class="lineno"><a class="line" href="a07304.html#aa453821f9b3b8666764d4e6bbd5d091c"> 442</a></span> <a class="code" href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa"> _M_range_initialize</a>(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="a07660.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  {</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">const</span> size_type __n = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  this->_M_initialize_map(__n);</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>  _Map_pointer __cur_node;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  __try</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  {</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">for</span> (__cur_node = this->_M_impl._M_start._M_node;</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  __cur_node < this->_M_impl._M_finish._M_node;</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  ++__cur_node)</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>  _ForwardIterator __mid = __first;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <a class="code" href="a01538.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__mid, _S_buffer_size());</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  std::__uninitialized_copy_a(__first, __mid, *__cur_node,</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  __first = __mid;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  }</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  std::__uninitialized_copy_a(__first, __last,</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  this->_M_impl._M_finish._M_first,</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  _M_get_Tp_allocator());</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>  __catch(...)</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  {</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(this->_M_impl._M_start,</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <a class="code" href="a07292.html">iterator</a>(*__cur_node, __cur_node),</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  __throw_exception_again;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="comment">// Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1.</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00480"></a><span class="lineno"><a class="line" href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2"> 480</a></span> <a class="code" href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2"> _M_push_back_aux</a>(_Args&&... __args)</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <a class="code" href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <a class="code" href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2"> _M_push_back_aux</a>(<span class="keyword">const</span> value_type& __t)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="preprocessor">#endif</span></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>  _M_reserve_map_at_back();</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node();</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  __try</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  this->_M_impl._M_finish._M_cur,</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t);</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  + 1);</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first;</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  __catch(...)</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  {</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1));</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  __throw_exception_again;</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</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>  <span class="comment">// Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first.</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></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="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00515"></a><span class="lineno"><a class="line" href="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068"> 515</a></span> <a class="code" href="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068"> _M_push_front_aux</a>(_Args&&... __args)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <a class="code" href="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068"> _M_push_front_aux</a>(<span class="keyword">const</span> value_type& __t)</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  {</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  _M_reserve_map_at_front();</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node();</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  __try</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  {</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  - 1);</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1;</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  this->_M_impl._M_start._M_cur,</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t);</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  }</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  __catch(...)</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  {</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  ++this->_M_impl._M_start;</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1));</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  __throw_exception_again;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="comment">// Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_first.</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordtype">void</span> <a class="code" href="a07304.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00548"></a><span class="lineno"><a class="line" href="a07304.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7"> 548</a></span> <a class="code" href="a07304.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7"> _M_pop_back_aux</a>()</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>  _M_deallocate_node(this->_M_impl._M_finish._M_first);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  _Alloc_traits::destroy(_M_get_Tp_allocator(),</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  this->_M_impl._M_finish._M_cur);</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> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_last - 1.</span></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// Note that if the deque has at least one element (a precondition for this</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// member function), and if</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// _M_impl._M_start._M_cur == _M_impl._M_start._M_last,</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// then the deque must have at least two nodes.</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordtype">void</span> <a class="code" href="a07304.html#a21cfe1ac5af07d0cfa9dee315faec368">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00564"></a><span class="lineno"><a class="line" href="a07304.html#a21cfe1ac5af07d0cfa9dee315faec368"> 564</a></span> <a class="code" href="a07304.html#a21cfe1ac5af07d0cfa9dee315faec368"> _M_pop_front_aux</a>()</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>  _Alloc_traits::destroy(_M_get_Tp_allocator(),</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  this->_M_impl._M_start._M_cur);</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  _M_deallocate_node(this->_M_impl._M_start._M_first);</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1);</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first;</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> </div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <a class="code" href="a07304.html">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <a class="code" href="a07304.html"> _M_range_insert_aux</a>(<a class="code" href="a07672.html">iterator</a> __pos,</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  _InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <a class="code" href="a07652.html">std::input_iterator_tag</a>)</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  { std::copy(__first, __last, <a class="code" href="a01504.html#ga289787d62ed6190c55ce9f2ea65aaa41">std::inserter</a>(*<span class="keyword">this</span>, __pos)); }</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  _M_range_insert_aux(iterator __pos,</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  _ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <a class="code" href="a07660.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  {</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keyword">const</span> size_type __n = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (__pos._M_cur == this->_M_impl._M_start._M_cur)</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  {</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  iterator __new_start = _M_reserve_elements_at_front(__n);</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  __try</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>  std::__uninitialized_copy_a(__first, __last, __new_start,</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  }</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  __catch(...)</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  {</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  _M_destroy_nodes(__new_start._M_node,</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  this->_M_impl._M_start._M_node);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  __throw_exception_again;</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  }</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__pos._M_cur == this->_M_impl._M_finish._M_cur)</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  {</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  iterator __new_finish = _M_reserve_elements_at_back(__n);</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  __try</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  {</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  std::__uninitialized_copy_a(__first, __last,</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  __catch(...)</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  {</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  __new_finish._M_node + 1);</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  __throw_exception_again;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  _M_insert_aux(__pos, __first, __last, __n);</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> </div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keyword">typename</span> deque<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  _M_insert_aux(iterator __pos, _Args&&... __args)</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  {</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  value_type __x_copy(std::forward<_Args>(__args)...); <span class="comment">// XXX copy</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">typename</span> deque<_Tp, _Alloc>::iterator</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  _M_insert_aux(iterator __pos, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  {</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  value_type __x_copy = __x; <span class="comment">// XXX copy</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  difference_type __index = __pos - this->_M_impl._M_start;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">if</span> (static_cast<size_type>(__index) < size() / 2)</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  {</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  push_front(_GLIBCXX_MOVE(front()));</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  iterator __front1 = this->_M_impl._M_start;</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  ++__front1;</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  iterator __front2 = __front1;</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  ++__front2;</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  __pos = this->_M_impl._M_start + __index;</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  iterator __pos1 = __pos;</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  ++__pos1;</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  _GLIBCXX_MOVE3(__front2, __pos1, __front1);</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  }</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  {</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  push_back(_GLIBCXX_MOVE(back()));</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  iterator __back1 = this->_M_impl._M_finish;</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  --__back1;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  iterator __back2 = __back1;</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  --__back2;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  __pos = this->_M_impl._M_start + __index;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  _GLIBCXX_MOVE_BACKWARD3(__pos, __back2, __back1);</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  *__pos = _GLIBCXX_MOVE(__x_copy);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">return</span> __pos;</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  }</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> </div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  _M_insert_aux(iterator __pos, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  {</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">const</span> difference_type __elems_before = __pos - this->_M_impl._M_start;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keyword">const</span> size_type __length = this->size();</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  value_type __x_copy = __x;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">if</span> (__elems_before < difference_type(__length / 2))</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  {</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  iterator __new_start = _M_reserve_elements_at_front(__n);</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  iterator __old_start = this->_M_impl._M_start;</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  __pos = this->_M_impl._M_start + __elems_before;</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  __try</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">if</span> (__elems_before >= difference_type(__n))</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  {</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  iterator __start_n = (this->_M_impl._M_start</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  + difference_type(__n));</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  std::__uninitialized_move_a(this->_M_impl._M_start,</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  __start_n, __new_start,</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  _GLIBCXX_MOVE3(__start_n, __pos, __old_start);</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  std::fill(__pos - difference_type(__n), __pos, __x_copy);</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  }</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  {</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  std::__uninitialized_move_fill(this->_M_impl._M_start,</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  __pos, __new_start,</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  __x_copy,</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  std::fill(__old_start, __pos, __x_copy);</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  }</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  }</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  __catch(...)</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  {</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  _M_destroy_nodes(__new_start._M_node,</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  this->_M_impl._M_start._M_node);</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  __throw_exception_again;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  }</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  {</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  iterator __new_finish = _M_reserve_elements_at_back(__n);</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  iterator __old_finish = this->_M_impl._M_finish;</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keyword">const</span> difference_type __elems_after =</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  difference_type(__length) - __elems_before;</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  __pos = this->_M_impl._M_finish - __elems_after;</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  __try</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  {</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordflow">if</span> (__elems_after > difference_type(__n))</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  {</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  iterator __finish_n = (this->_M_impl._M_finish</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  - difference_type(__n));</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  std::__uninitialized_move_a(__finish_n,</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  std::fill(__pos, __pos + difference_type(__n), __x_copy);</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  }</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  std::__uninitialized_fill_move(this->_M_impl._M_finish,</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  __pos + difference_type(__n),</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  __x_copy, __pos,</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  std::fill(__pos, __old_finish, __x_copy);</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  }</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  __catch(...)</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  {</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  __new_finish._M_node + 1);</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  __throw_exception_again;</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  }</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  }</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  }</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> </div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  _M_insert_aux(iterator __pos,</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  _ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  size_type __n)</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keyword">const</span> difference_type __elemsbefore = __pos - this->_M_impl._M_start;</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keyword">const</span> size_type __length = size();</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">if</span> (static_cast<size_type>(__elemsbefore) < __length / 2)</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  iterator __new_start = _M_reserve_elements_at_front(__n);</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  iterator __old_start = this->_M_impl._M_start;</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  __pos = this->_M_impl._M_start + __elemsbefore;</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  __try</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  {</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordflow">if</span> (__elemsbefore >= difference_type(__n))</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  {</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  iterator __start_n = (this->_M_impl._M_start</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  + difference_type(__n));</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  std::__uninitialized_move_a(this->_M_impl._M_start,</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  __start_n, __new_start,</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  _GLIBCXX_MOVE3(__start_n, __pos, __old_start);</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  std::copy(__first, __last, __pos - difference_type(__n));</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  }</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  {</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  _ForwardIterator __mid = __first;</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <a class="code" href="a01538.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__mid, difference_type(__n) - __elemsbefore);</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  std::__uninitialized_move_copy(this->_M_impl._M_start,</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  __pos, __first, __mid,</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  __new_start,</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  this->_M_impl._M_start = __new_start;</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  std::copy(__mid, __last, __old_start);</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  }</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  }</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  __catch(...)</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  {</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  _M_destroy_nodes(__new_start._M_node,</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  this->_M_impl._M_start._M_node);</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  __throw_exception_again;</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  {</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  iterator __new_finish = _M_reserve_elements_at_back(__n);</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  iterator __old_finish = this->_M_impl._M_finish;</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keyword">const</span> difference_type __elemsafter =</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  difference_type(__length) - __elemsbefore;</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  __pos = this->_M_impl._M_finish - __elemsafter;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  __try</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  {</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keywordflow">if</span> (__elemsafter > difference_type(__n))</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  {</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  iterator __finish_n = (this->_M_impl._M_finish</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  - difference_type(__n));</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  std::__uninitialized_move_a(__finish_n,</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  std::copy(__first, __last, __pos);</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  {</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  _ForwardIterator __mid = __first;</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <a class="code" href="a01538.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__mid, __elemsafter);</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  std::__uninitialized_copy_move(__mid, __last, __pos,</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  this->_M_impl._M_finish,</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  this->_M_impl._M_finish = __new_finish;</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  std::copy(__first, __mid, __pos);</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  }</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  __catch(...)</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  {</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  __new_finish._M_node + 1);</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  __throw_exception_again;</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  }</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  }</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> </div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  deque<_Tp, _Alloc>::</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  _M_destroy_data_aux(iterator __first, iterator __last)</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  {</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">for</span> (_Map_pointer __node = __first._M_node + 1;</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  __node < __last._M_node; ++__node)</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(*__node, *__node + _S_buffer_size(),</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> </div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">if</span> (__first._M_node != __last._M_node)</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  {</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__first._M_cur, __first._M_last,</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__last._M_first, __last._M_cur,</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  }</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <a class="code" href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a>(__first._M_cur, __last._M_cur,</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  }</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> </div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <a class="code" href="a07304.html#a9397000b47d5f39fff457ac11a728c50">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00869"></a><span class="lineno"><a class="line" href="a07304.html#a9397000b47d5f39fff457ac11a728c50"> 869</a></span> <a class="code" href="a07304.html#a9397000b47d5f39fff457ac11a728c50"> _M_new_elements_at_front</a>(size_type __new_elems)</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  {</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">if</span> (this->max_size() - this->size() < __new_elems)</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  __throw_length_error(__N(<span class="stringliteral">"deque::_M_new_elements_at_front"</span>));</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> </div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keyword">const</span> size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1)</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  / _S_buffer_size());</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  _M_reserve_map_at_front(__new_nodes);</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  size_type __i;</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  __try</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  {</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">for</span> (__i = 1; __i <= __new_nodes; ++__i)</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node();</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  __catch(...)</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  {</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">for</span> (size_type __j = 1; __j < __i; ++__j)</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j));</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  __throw_exception_again;</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  }</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  }</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> </div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <a class="code" href="a07304.html#a71853b49ee48f7f429287d1a78964911">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00894"></a><span class="lineno"><a class="line" href="a07304.html#a71853b49ee48f7f429287d1a78964911"> 894</a></span> <a class="code" href="a07304.html#a71853b49ee48f7f429287d1a78964911"> _M_new_elements_at_back</a>(size_type __new_elems)</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  {</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">if</span> (this->max_size() - this->size() < __new_elems)</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  __throw_length_error(__N(<span class="stringliteral">"deque::_M_new_elements_at_back"</span>));</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> </div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keyword">const</span> size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1)</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  / _S_buffer_size());</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  _M_reserve_map_at_back(__new_nodes);</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  size_type __i;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  __try</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  {</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordflow">for</span> (__i = 1; __i <= __new_nodes; ++__i)</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node();</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  __catch(...)</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  {</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordflow">for</span> (size_type __j = 1; __j < __i; ++__j)</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j));</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  __throw_exception_again;</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  }</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  }</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> </div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <a class="code" href="a07304.html#a27ce26ccde84a7aacb2326cb7969149e">deque<_Tp, _Alloc>::</a></div><div class="line"><a name="l00919"></a><span class="lineno"><a class="line" href="a07304.html#a27ce26ccde84a7aacb2326cb7969149e"> 919</a></span> <a class="code" href="a07304.html#a27ce26ccde84a7aacb2326cb7969149e"> _M_reallocate_map</a>(size_type __nodes_to_add, <span class="keywordtype">bool</span> __add_at_front)</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  {</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">const</span> size_type __old_num_nodes</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keyword">const</span> size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> </div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  _Map_pointer __new_nstart;</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">if</span> (this->_M_impl._M_map_size > 2 * __new_num_nodes)</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  {</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  - __new_num_nodes) / 2</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  + (__add_at_front ? __nodes_to_add : 0);</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordflow">if</span> (__new_nstart < this->_M_impl._M_start._M_node)</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  std::copy(this->_M_impl._M_start._M_node,</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  __new_nstart);</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  std::copy_backward(this->_M_impl._M_start._M_node,</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  __new_nstart + __old_num_nodes);</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  {</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  size_type __new_map_size = this->_M_impl._M_map_size</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  + <a class="code" href="a01482.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a>(this->_M_impl._M_map_size,</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  __nodes_to_add) + 2;</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> </div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  _Map_pointer __new_map = this->_M_allocate_map(__new_map_size);</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  + (__add_at_front ? __nodes_to_add : 0);</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  std::copy(this->_M_impl._M_start._M_node,</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  this->_M_impl._M_finish._M_node + 1,</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  __new_nstart);</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> </div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  this->_M_impl._M_map = __new_map;</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  this->_M_impl._M_map_size = __new_map_size;</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  }</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> </div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  this->_M_impl._M_start._M_set_node(__new_nstart);</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  }</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span> </div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="comment">// Overload for deque::iterators, exploiting the "segmented-iterator</span></div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="comment">// optimization".</span></div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  fill(<span class="keyword">const</span> <a class="code" href="a07292.html">_Deque_iterator<_Tp, _Tp&, _Tp*></a>& __first,</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keyword">const</span> <a class="code" href="a07292.html">_Deque_iterator<_Tp, _Tp&, _Tp*></a>& __last, <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  {</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07292.html">_Deque_iterator<_Tp, _Tp&, _Tp*>::_Self</a> _Self;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> </div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> _Self::_Map_pointer __node = __first._M_node + 1;</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  __node < __last._M_node; ++__node)</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  std::fill(*__node, *__node + _Self::_S_buffer_size(), __value);</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> </div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">if</span> (__first._M_node != __last._M_node)</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  {</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  std::fill(__first._M_cur, __first._M_last, __value);</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  std::fill(__last._M_first, __last._M_cur, __value);</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  }</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  std::fill(__first._M_cur, __last._M_cur, __value);</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  }</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> </div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  {</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Self::difference_type difference_type;</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> </div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  difference_type __len = __last - __first;</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordflow">while</span> (__len > 0)</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  {</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keyword">const</span> difference_type __clen</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__len, <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__first._M_last - __first._M_cur,</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  __result._M_last - __result._M_cur));</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  std::copy(__first._M_cur, __first._M_cur + __clen, __result._M_cur);</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  __first += __clen;</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  __result += __clen;</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  __len -= __clen;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  }</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> </div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  copy_backward(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  {</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Self::difference_type difference_type;</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> </div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  difference_type __len = __last - __first;</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">while</span> (__len > 0)</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  {</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  difference_type __llen = __last._M_cur - __last._M_first;</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  _Tp* __lend = __last._M_cur;</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> </div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  difference_type __rlen = __result._M_cur - __result._M_first;</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  _Tp* __rend = __result._M_cur;</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> </div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">if</span> (!__llen)</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  {</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  __llen = _Self::_S_buffer_size();</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  __lend = *(__last._M_node - 1) + __llen;</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  }</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keywordflow">if</span> (!__rlen)</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  {</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  __rlen = _Self::_S_buffer_size();</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  __rend = *(__result._M_node - 1) + __rlen;</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> </div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keyword">const</span> difference_type __clen = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__len,</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__llen, __rlen));</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  std::copy_backward(__lend - __clen, __lend, __rend);</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  __last -= __clen;</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  __result -= __clen;</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  __len -= __clen;</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  }</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> </div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  move(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  {</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Self::difference_type difference_type;</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> </div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  difference_type __len = __last - __first;</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">while</span> (__len > 0)</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  {</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keyword">const</span> difference_type __clen</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__len, <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__first._M_last - __first._M_cur,</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  __result._M_last - __result._M_cur));</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  std::move(__first._M_cur, __first._M_cur + __clen, __result._M_cur);</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  __first += __clen;</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  __result += __clen;</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  __len -= __clen;</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  }</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  }</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> </div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  move_backward(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  {</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Self::difference_type difference_type;</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> </div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  difference_type __len = __last - __first;</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordflow">while</span> (__len > 0)</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  {</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  difference_type __llen = __last._M_cur - __last._M_first;</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  _Tp* __lend = __last._M_cur;</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> </div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  difference_type __rlen = __result._M_cur - __result._M_first;</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  _Tp* __rend = __result._M_cur;</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> </div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">if</span> (!__llen)</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  {</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  __llen = _Self::_S_buffer_size();</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  __lend = *(__last._M_node - 1) + __llen;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">if</span> (!__rlen)</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  {</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  __rlen = _Self::_S_buffer_size();</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  __rend = *(__result._M_node - 1) + __rlen;</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  }</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> </div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keyword">const</span> difference_type __clen = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__len,</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__llen, __rlen));</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  std::move_backward(__lend - __clen, __lend, __rend);</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  __last -= __clen;</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  __result -= __clen;</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  __len -= __clen;</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  }</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  }</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> </div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> </div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="a07304_html_a71853b49ee48f7f429287d1a78964911"><div class="ttname"><a href="a07304.html#a71853b49ee48f7f429287d1a78964911">std::deque::_M_new_elements_at_back</a></div><div class="ttdeci">void _M_new_elements_at_back(size_type __new_elements)</div><div class="ttdoc">Memory-handling helpers for the previous internal insert functions.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00894">deque.tcc:894</a></div></div> <div class="ttc" id="a07304_html_a9cacda81743ab1d5447c31ecc1a988d2"><div class="ttname"><a href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2">std::deque::_M_push_back_aux</a></div><div class="ttdeci">void _M_push_back_aux(_Args &&... __args)</div><div class="ttdoc">Helper functions for push_* and pop_*.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00480">deque.tcc:480</a></div></div> <div class="ttc" id="a07304_html_af71a8fc9a6dff2b04bfd8b219c40a940"><div class="ttname"><a href="a07304.html#af71a8fc9a6dff2b04bfd8b219c40a940">std::deque::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01176">stl_deque.h:1176</a></div></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="a07304_html_a24d5150e384f657ca3b317ced4dadc5d"><div class="ttname"><a href="a07304.html#a24d5150e384f657ca3b317ced4dadc5d">std::deque::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01281">stl_deque.h:1281</a></div></div> <div class="ttc" id="a07304_html_a67647a3b7f00d3ca89b27980a1f2b7ee"><div class="ttname"><a href="a07304.html#a67647a3b7f00d3ca89b27980a1f2b7ee">std::deque::_M_fill_initialize</a></div><div class="ttdeci">void _M_fill_initialize(const value_type &__value)</div><div class="ttdoc">Fills the deque with copies of value.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00392">deque.tcc:392</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="a01504_html_ga289787d62ed6190c55ce9f2ea65aaa41"><div class="ttname"><a href="a01504.html#ga289787d62ed6190c55ce9f2ea65aaa41">std::inserter</a></div><div class="ttdeci">insert_iterator< _Container > inserter(_Container &__x, _Iterator __i)</div><div class="ttdef"><b>Definition:</b> <a href="a17142_source.html#l00739">bits/stl_iterator.h:739</a></div></div> <div class="ttc" id="a07304_html_aaf55754b5eef8f7f949e56a7ccf80068"><div class="ttname"><a href="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068">std::deque::_M_push_front_aux</a></div><div class="ttdeci">void _M_push_front_aux(_Args &&... __args)</div><div class="ttdoc">Helper functions for push_* and pop_*.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00515">deque.tcc:515</a></div></div> <div class="ttc" id="a07652_html"><div class="ttname"><a href="a07652.html">std::input_iterator_tag</a></div><div class="ttdoc">Marking input iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00089">stl_iterator_base_types.h:89</a></div></div> <div class="ttc" id="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="a07660_html"><div class="ttname"><a href="a07660.html">std::forward_iterator_tag</a></div><div class="ttdoc">Forward iterators support a superset of input iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00095">stl_iterator_base_types.h:95</a></div></div> <div class="ttc" id="a07304_html_ae2b6ab89b51f74b7de15e6494fc03caa"><div class="ttname"><a href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa">std::deque::_M_range_initialize</a></div><div class="ttdeci">void _M_range_initialize(_InputIterator __first, _InputIterator __last, std::input_iterator_tag)</div><div class="ttdoc">Fills the deque with whatever is in [first,last).</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00418">deque.tcc:418</a></div></div> <div class="ttc" id="a01538_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01538.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="a01482_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</a></div></div> <div class="ttc" id="a07292_html"><div class="ttname"><a href="a07292.html">std::_Deque_iterator</a></div><div class="ttdoc">A deque::iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00109">stl_deque.h:109</a></div></div> <div class="ttc" id="a07304_html_a78b2da6c6329349581db042e6bbe2a40"><div class="ttname"><a href="a07304.html#a78b2da6c6329349581db042e6bbe2a40">std::deque::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01193">stl_deque.h:1193</a></div></div> <div class="ttc" id="a07304_html"><div class="ttname"><a href="a07304.html">std::deque</a></div><div class="ttdoc">A standard container using fixed-size memory allocation and constant-time manipulation of elements at...</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00832">stl_deque.h:832</a></div></div> <div class="ttc" id="a07304_html_a40d6b0cbbd61cda2b99f5fc4a274fe02"><div class="ttname"><a href="a07304.html#a40d6b0cbbd61cda2b99f5fc4a274fe02">std::deque::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Get a copy of the memory allocation object.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01167">stl_deque.h:1167</a></div></div> <div class="ttc" id="a07304_html_a9397000b47d5f39fff457ac11a728c50"><div class="ttname"><a href="a07304.html#a9397000b47d5f39fff457ac11a728c50">std::deque::_M_new_elements_at_front</a></div><div class="ttdeci">void _M_new_elements_at_front(size_type __new_elements)</div><div class="ttdoc">Memory-handling helpers for the previous internal insert functions.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00869">deque.tcc:869</a></div></div> <div class="ttc" id="a01538_html_a468dae7cc599699643eafa95cc9999af"><div class="ttname"><a href="a01538.html#a468dae7cc599699643eafa95cc9999af">std::_Destroy</a></div><div class="ttdeci">void _Destroy(_Tp *__pointer)</div><div class="ttdef"><b>Definition:</b> <a href="a00536_source.html#l00097">stl_construct.h:97</a></div></div> <div class="ttc" id="a07304_html_acbbd2ced11be9e416c030bf3dcaeacad"><div class="ttname"><a href="a07304.html#acbbd2ced11be9e416c030bf3dcaeacad">std::deque::operator=</a></div><div class="ttdeci">deque & operator=(const deque &__x)</div><div class="ttdoc">Deque assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00094">deque.tcc:94</a></div></div> <div class="ttc" id="a01538_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01538.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="a07668_html"><div class="ttname"><a href="a07668.html">std::random_access_iterator_tag</a></div><div class="ttdoc">Random-access iterators support a superset of bidirectional iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00103">stl_iterator_base_types.h:103</a></div></div> <div class="ttc" id="a07304_html_a21cfe1ac5af07d0cfa9dee315faec368"><div class="ttname"><a href="a07304.html#a21cfe1ac5af07d0cfa9dee315faec368">std::deque::_M_pop_front_aux</a></div><div class="ttdeci">void _M_pop_front_aux()</div><div class="ttdoc">Helper functions for push_* and pop_*.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00564">deque.tcc:564</a></div></div> <div class="ttc" id="a07304_html_a27ce26ccde84a7aacb2326cb7969149e"><div class="ttname"><a href="a07304.html#a27ce26ccde84a7aacb2326cb7969149e">std::deque::_M_reallocate_map</a></div><div class="ttdeci">void _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)</div><div class="ttdoc">Memory-handling helpers for the major map.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00919">deque.tcc:919</a></div></div> <div class="ttc" id="a01504_html_ga89d3a7d239086516917bb7f6f9da213c"><div class="ttname"><a href="a01504.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a></div><div class="ttdeci">constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00205">stl_iterator_base_types.h:205</a></div></div> <div class="ttc" id="a01482_html_ga84d30d8c4b3f2cbe8ec2055c34a578da"><div class="ttname"><a href="a01482.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00219">stl_algobase.h:219</a></div></div> <div class="ttc" id="a07304_html_ae125f10bcc0c0b97d7a4f5c582ebe9b7"><div class="ttname"><a href="a07304.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7">std::deque::_M_pop_back_aux</a></div><div class="ttdeci">void _M_pop_back_aux()</div><div class="ttdoc">Helper functions for push_* and pop_*.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00548">deque.tcc:548</a></div></div> <div class="ttc" id="a07304_html_a3ea67e3e7fc5c84e92d9868bb57ae05a"><div class="ttname"><a href="a07304.html#a3ea67e3e7fc5c84e92d9868bb57ae05a">std::deque::emplace</a></div><div class="ttdeci">iterator emplace(const_iterator __position, _Args &&... __args)</div><div class="ttdoc">Inserts an object in deque before specified iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00186">deque.tcc:186</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_e0ca5f9b79afec9781b100dc0e5c7504.html">include</a></li><li class="navelem"><a class="el" href="dir_cc8360f73f5c90d613e6e3bb45ea0165.html">bits</a></li><li class="navelem"><a class="el" href="a00320.html">deque.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>