<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: stl_deque.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00539_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_deque.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00539.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 -*- 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/stl_deque.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{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 _STL_DEQUE_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_DEQUE_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00308.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00554.html">bits/stl_iterator_base_types.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a00551.html">bits/stl_iterator_base_funcs.h</a>></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <<a class="code" href="a00029.html">initializer_list</a>></span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#include <<a class="code" href="a00743.html">debug/assertions.h</a>></span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</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> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"></span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> /**</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * @brief This function controls the size of memory nodes.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * @param __size The size of an element.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @return The number (not byte size) of elements per node.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> *</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * This function started off as a compiler kludge from SGI, but</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * seems to be a useful wrapper around a repeated constant</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * expression. The @b 512 is tunable (and no other code needs to</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * change), but no investigation has been done since inheriting the</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * SGI code. Touch _GLIBCXX_DEQUE_BUF_SIZE only if you know what</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * you are doing, however: changing it breaks the binary</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * compatibility!!</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> */</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor">#ifndef _GLIBCXX_DEQUE_BUF_SIZE</span></div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="a00539.html#a87949eb8a238d15bbc7d30d84cd3b8cf"> 88</a></span> <span class="preprocessor">#define _GLIBCXX_DEQUE_BUF_SIZE 512</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>  _GLIBCXX_CONSTEXPR <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  __deque_buf_size(<span class="keywordtype">size_t</span> __size)</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  { <span class="keywordflow">return</span> (__size < <a class="code" href="a00539.html#a87949eb8a238d15bbc7d30d84cd3b8cf">_GLIBCXX_DEQUE_BUF_SIZE</a></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  ? <span class="keywordtype">size_t</span>(<a class="code" href="a00539.html#a87949eb8a238d15bbc7d30d84cd3b8cf">_GLIBCXX_DEQUE_BUF_SIZE</a> / __size) : <span class="keywordtype">size_t</span>(1)); }</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="comment"></span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> /**</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * @brief A deque::iterator.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> *</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * Quite a bit of intelligence here. Much of the functionality of</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> * deque is actually passed off to this class. A deque holds two</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> * of these internally, marking its valid range. Access to</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> * elements is done as offsets of either of those two, relying on</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> * operator overloading in this class.</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> *</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> * All the functions are op overloads except for _M_set_node.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> */</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="a07295.html"> 109</a></span>  <span class="keyword">struct </span><a class="code" href="a07295.html">_Deque_iterator</a></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> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">_Deque_iterator<_Tp, _Tp&, _Tp*></a> <a class="code" href="a07295.html">iterator</a>;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">_Deque_iterator<_Tp, const _Tp&, const _Tp*></a> <a class="code" href="a07295.html">const_iterator</a>;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typedef</span> _Tp* _Elt_pointer;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">typedef</span> _Tp** _Map_pointer;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Up></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">using</span> __ptr_to = <span class="keyword">typename</span> <a class="code" href="a06251.html">pointer_traits<_Ptr>::template</a> rebind<_Up>;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CvTp></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">using</span> <a class="code" href="a07295.html">__iter</a> = <a class="code" href="a07295.html">_Deque_iterator<_Tp, _CvTp&, __ptr_to<_CvTp></a>>;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">__iter<_Tp></a> <a class="code" href="a07295.html">iterator</a>;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">__iter<const _Tp></a> <a class="code" href="a07295.html">const_iterator</a>;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">typedef</span> __ptr_to<_Tp> _Elt_pointer;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typedef</span> __ptr_to<_Elt_pointer> _Map_pointer;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor">#endif</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>  <span class="keyword">static</span> <span class="keywordtype">size_t</span> _S_buffer_size() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  { <span class="keywordflow">return</span> __deque_buf_size(<span class="keyword">sizeof</span>(_Tp)); }</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typedef</span> <a class="code" href="a07671.html">std::random_access_iterator_tag</a> <a class="code" href="a07671.html">iterator_category</a>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">typedef</span> _Ptr pointer;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">typedef</span> _Ref reference;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">_Deque_iterator</a> <a class="code" href="a07295.html">_Self</a>;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  _Elt_pointer _M_cur;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  _Elt_pointer _M_first;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  _Elt_pointer _M_last;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  _Map_pointer _M_node;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="code" href="a07295.html">_Deque_iterator</a>(_Elt_pointer __x, _Map_pointer __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  : _M_cur(__x), _M_first(*__y),</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  _M_last(*__y + _S_buffer_size()), _M_node(__y) { }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="a07295.html">_Deque_iterator</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  : _M_cur(), _M_first(), _M_last(), _M_node() { }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="a07295.html">_Deque_iterator</a>(<span class="keyword">const</span> <a class="code" href="a07295.html">iterator</a>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  : _M_cur(__x._M_cur), _M_first(__x._M_first),</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _M_last(__x._M_last), _M_node(__x._M_node) { }</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="a07295.html">iterator</a></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  _M_const_cast() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  { <span class="keywordflow">return</span> <a class="code" href="a07295.html">iterator</a>(_M_cur, _M_node); }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  reference</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  operator*() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  { <span class="keywordflow">return</span> *_M_cur; }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  pointer</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  operator->() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  { <span class="keywordflow">return</span> _M_cur; }</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>  <a class="code" href="a07295.html">_Self</a>&</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  operator++() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  ++_M_cur;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span> (_M_cur == _M_last)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="a07295.html#a8d2581de34cff0de15953128185cbe55">_M_set_node</a>(_M_node + 1);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _M_cur = _M_first;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span> *<span class="keyword">this</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> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="a07295.html">_Self</a></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  operator++(<span class="keywordtype">int</span>) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="a07295.html">_Self</a> __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  ++*<span class="keyword">this</span>;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="a07295.html">_Self</a>&</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  operator--() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (_M_cur == _M_first)</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>  <a class="code" href="a07295.html#a8d2581de34cff0de15953128185cbe55">_M_set_node</a>(_M_node - 1);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  _M_cur = _M_last;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  --_M_cur;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="a07295.html">_Self</a></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  operator--(<span class="keywordtype">int</span>) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <a class="code" href="a07295.html">_Self</a> __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  --*<span class="keyword">this</span>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> __tmp;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="code" href="a07295.html">_Self</a>&</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  operator+=(difference_type __n) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> difference_type __offset = __n + (_M_cur - _M_first);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (__offset >= 0 && __offset < difference_type(_S_buffer_size()))</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  _M_cur += __n;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">const</span> difference_type __node_offset =</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  __offset > 0 ? __offset / difference_type(_S_buffer_size())</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  : -difference_type((-__offset - 1)</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  / _S_buffer_size()) - 1;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="a07295.html#a8d2581de34cff0de15953128185cbe55">_M_set_node</a>(_M_node + __node_offset);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  _M_cur = _M_first + (__offset - __node_offset</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  * difference_type(_S_buffer_size()));</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="a07295.html">_Self</a></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  operator+(difference_type __n) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</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>  <a class="code" href="a07295.html">_Self</a> __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> __tmp += __n;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="a07295.html">_Self</a>&</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  operator-=(difference_type __n) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  { <span class="keywordflow">return</span> *<span class="keyword">this</span> += -__n; }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="a07295.html">_Self</a></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  operator-(difference_type __n) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <a class="code" href="a07295.html">_Self</a> __tmp = *<span class="keyword">this</span>;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">return</span> __tmp -= __n;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</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>  reference</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  operator[](difference_type __n) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  { <span class="keywordflow">return</span> *(*<span class="keyword">this</span> + __n); }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"></span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> /**</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> * Prepares to traverse new_node. Sets everything except</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> * _M_cur, which should therefore be set by the caller</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> * immediately afterwards, based on _M_first and _M_last.</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> */</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00255"></a><span class="lineno"><a class="line" href="a07295.html#a8d2581de34cff0de15953128185cbe55"> 255</a></span>  <a class="code" href="a07295.html#a8d2581de34cff0de15953128185cbe55">_M_set_node</a>(_Map_pointer __new_node) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  {</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  _M_node = __new_node;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  _M_first = *__new_node;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  _M_last = _M_first + difference_type(_S_buffer_size());</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  };</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// Note: we also provide overloads whose operands are of the same type in</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// order to avoid ambiguous overload resolution when std::rel_ops operators</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// are in scope (for additional details, see libstdc++/3628)</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  operator==(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  { <span class="keywordflow">return</span> __x._M_cur == __y._M_cur; }</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="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  operator==(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  { <span class="keywordflow">return</span> __x._M_cur == __y._M_cur; }</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  operator!=(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> </div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  operator!=(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  operator<(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  { <span class="keywordflow">return</span> (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  : (__x._M_node < __y._M_node); }</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  operator<(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  { <span class="keywordflow">return</span> (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  : (__x._M_node < __y._M_node); }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  operator>(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  { <span class="keywordflow">return</span> __y < __x; }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  operator>(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> </div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  operator<=(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  { <span class="keywordflow">return</span> !(__y < __x); }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  operator<=(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> </div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  operator>=(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  operator>=(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// According to the resolution of DR179 not only the various comparison</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// operators but also operator- must accept mixed iterator/const_iterator</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// parameters.</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <a class="code" href="a01470.html#gaef6e5c353285e48d39f7dbd566c19a2e">operator-</a>(<span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x,</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">return</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  (_Deque_iterator<_Tp, _Ref, _Ptr>::_S_buffer_size())</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  + (__y._M_last - __y._M_cur);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RefL, <span class="keyword">typename</span> _PtrL,</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">typename</span> _RefR, <span class="keyword">typename</span> _PtrR></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <a class="code" href="a01470.html#gaef6e5c353285e48d39f7dbd566c19a2e">operator-</a>(<span class="keyword">const</span> _Deque_iterator<_Tp, _RefL, _PtrL>& __x,</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _RefR, _PtrR>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  {</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">return</span> <span class="keyword">typename</span> _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  (_Deque_iterator<_Tp, _RefL, _PtrL>::_S_buffer_size())</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  + (__y._M_last - __y._M_cur);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Ref, <span class="keyword">typename</span> _Ptr></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">inline</span> _Deque_iterator<_Tp, _Ref, _Ptr></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <a class="code" href="a01470.html#gaf2a59d9d4f1421dcdba7b5ce55ca9358">operator+</a>(ptrdiff_t __n, <span class="keyword">const</span> _Deque_iterator<_Tp, _Ref, _Ptr>& __x)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  { <span class="keywordflow">return</span> __x + __n; }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  fill(<span class="keyword">const</span> _Deque_iterator<_Tp, _Tp&, _Tp*>&,</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">const</span> _Deque_iterator<_Tp, _Tp&, _Tp*>&, <span class="keyword">const</span> _Tp&);</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  _Deque_iterator<_Tp, _Tp&, _Tp*>);</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keyword">inline</span> _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  copy(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __last,</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  { <span class="keywordflow">return</span> std::copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  __result); }</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  copy_backward(_Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  _Deque_iterator<_Tp, _Tp&, _Tp*>);</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">inline</span> _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  copy_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __last,</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  { <span class="keywordflow">return</span> std::copy_backward(_Deque_iterator<_Tp,</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keyword">const</span> _Tp&, <span class="keyword">const</span> _Tp*>(__first),</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  _Deque_iterator<_Tp,</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">const</span> _Tp&, <span class="keyword">const</span> _Tp*>(__last),</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  __result); }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  _Deque_iterator<_Tp, _Tp&, _Tp*>);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keyword">inline</span> _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  move(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __last,</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  { <span class="keywordflow">return</span> std::move(_Deque_iterator<_Tp, const _Tp&, const _Tp*>(__first),</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*>(__last),</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  __result); }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  move_backward(_Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  _Deque_iterator<_Tp, const _Tp&, const _Tp*>,</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  _Deque_iterator<_Tp, _Tp&, _Tp*>);</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></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">inline</span> _Deque_iterator<_Tp, _Tp&, _Tp*></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  move_backward(_Deque_iterator<_Tp, _Tp&, _Tp*> __first,</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __last,</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  { <span class="keywordflow">return</span> std::move_backward(_Deque_iterator<_Tp,</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">const</span> _Tp&, <span class="keyword">const</span> _Tp*>(__first),</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  _Deque_iterator<_Tp,</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keyword">const</span> _Tp&, <span class="keyword">const</span> _Tp*>(__last),</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  __result); }</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment"></span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment"> /**</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> * Deque base class. This class provides the unified face for %deque's</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"> * allocation. This class's constructor and destructor allocate and</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> * deallocate (but do not initialize) storage. This makes %exception</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> * safety easier.</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"> *</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> * Nothing in this class ever constructs or destroys an actual Tp element.</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment"> * (Deque handles that itself.) Only/All memory management is performed</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="comment"> * here.</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="comment"> */</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00461"></a><span class="lineno"><a class="line" href="a07299.html"> 461</a></span>  <span class="keyword">class </span><a class="code" href="a07299.html">_Deque_base</a></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  {</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Alloc>::template</a></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  rebind<_Tp>::other _Tp_alloc_type;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> <a class="code" href="a10159.html">_Alloc_traits</a>;</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">typedef</span> _Tp* _Ptr;</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp* _Ptr_const;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::pointer _Ptr;</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_pointer _Ptr_const;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::template rebind<_Ptr>::other</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  _Map_alloc_type;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Map_alloc_type></a> <a class="code" href="a10159.html">_Map_alloc_traits</a>;</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::size_type size_type;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  allocator_type</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  get_allocator() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  { <span class="keywordflow">return</span> allocator_type(_M_get_Tp_allocator()); }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">_Deque_iterator<_Tp, _Tp&, _Ptr></a> <a class="code" href="a07295.html">iterator</a>;</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">typedef</span> <a class="code" href="a07295.html">_Deque_iterator<_Tp, const _Tp&, _Ptr_const></a> <a class="code" href="a07295.html">const_iterator</a>;</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>  <a class="code" href="a07299.html">_Deque_base</a>()</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  : _M_impl()</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  { <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(0); }</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> </div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="a07299.html">_Deque_base</a>(<span class="keywordtype">size_t</span> __num_elements)</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  : _M_impl()</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  { <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(__num_elements); }</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <a class="code" href="a07299.html">_Deque_base</a>(<span class="keyword">const</span> allocator_type& __a, <span class="keywordtype">size_t</span> __num_elements)</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  : _M_impl(__a)</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  { <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(__num_elements); }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <a class="code" href="a07299.html">_Deque_base</a>(<span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  : _M_impl(__a)</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  { <span class="comment">/* Caller must initialize map. */</span> }</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <a class="code" href="a07299.html">_Deque_base</a>(<a class="code" href="a07299.html">_Deque_base</a>&& __x, <a class="code" href="a03043.html">false_type</a>)</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  : _M_impl(__x._M_move_impl())</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  { }</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span> </div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <a class="code" href="a07299.html">_Deque_base</a>(<a class="code" href="a07299.html">_Deque_base</a>&& __x, <a class="code" href="a03043.html">true_type</a>)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  : _M_impl(std::move(__x._M_get_Tp_allocator()))</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  {</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(0);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">if</span> (__x._M_impl._M_map)</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  this->_M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  }</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <a class="code" href="a07299.html">_Deque_base</a>(<a class="code" href="a07299.html">_Deque_base</a>&& __x)</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  : <a class="code" href="a07299.html">_Deque_base</a>(std::move(__x), <span class="keyword">typename</span> <a class="code" href="a04639.html#afae6957b1a6d68084b2b6114dff01ae8">_Alloc_traits::is_always_equal</a>{})</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  { }</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <a class="code" href="a07299.html">_Deque_base</a>(<a class="code" href="a07299.html">_Deque_base</a>&& __x, <span class="keyword">const</span> allocator_type& __a, size_type __n)</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  : _M_impl(__a)</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  {</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (__x.get_allocator() == __a)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">if</span> (__x._M_impl._M_map)</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  {</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(0);</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  this->_M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  }</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">else</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>  <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(__n);</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>  }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> </div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  ~<a class="code" href="a07299.html">_Deque_base</a>() _GLIBCXX_NOEXCEPT;</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>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator::_Map_pointer _Map_pointer;</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">//This struct encapsulates the implementation of the std::deque</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">//standard container and at the same time makes use of the EBO</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">//for empty allocators.</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">struct </span>_Deque_impl</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  : <span class="keyword">public</span> _Tp_alloc_type</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  {</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  _Map_pointer _M_map;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordtype">size_t</span> _M_map_size;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <a class="code" href="a07295.html">iterator</a> _M_start;</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <a class="code" href="a07295.html">iterator</a> _M_finish;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  _Deque_impl()</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  : _Tp_alloc_type(), _M_map(), _M_map_size(0),</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  _M_start(), _M_finish()</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  { }</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> </div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  _Deque_impl(<span class="keyword">const</span> _Tp_alloc_type& __a) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  : _Tp_alloc_type(__a), _M_map(), _M_map_size(0),</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  _M_start(), _M_finish()</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  { }</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> </div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  _Deque_impl(_Deque_impl&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> </div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  _Deque_impl(_Tp_alloc_type&& __a) noexcept</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  : _Tp_alloc_type(std::move(__a)), _M_map(), _M_map_size(0),</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  _M_start(), _M_finish()</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  { }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> </div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">void</span> _M_swap_data(_Deque_impl& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  {</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  swap(this->_M_start, __x._M_start);</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  swap(this->_M_finish, __x._M_finish);</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  swap(this->_M_map, __x._M_map);</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  swap(this->_M_map_size, __x._M_map_size);</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  };</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  _Tp_alloc_type&</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  _M_get_Tp_allocator() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  { <span class="keywordflow">return</span> *static_cast<_Tp_alloc_type*>(&this->_M_impl); }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">const</span> _Tp_alloc_type&</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  _M_get_Tp_allocator() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  { <span class="keywordflow">return</span> *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> </div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  _Map_alloc_type</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  _M_get_map_allocator() <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  { <span class="keywordflow">return</span> _Map_alloc_type(_M_get_Tp_allocator()); }</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  _Ptr</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  _M_allocate_node()</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>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> _Traits;</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">return</span> _Traits::allocate(_M_impl, __deque_buf_size(<span class="keyword">sizeof</span>(_Tp)));</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  }</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  _M_deallocate_node(_Ptr __p) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  {</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">typedef</span> <a class="code" href="a10159.html">__gnu_cxx::__alloc_traits<_Tp_alloc_type></a> _Traits;</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  _Traits::deallocate(_M_impl, __p, __deque_buf_size(<span class="keyword">sizeof</span>(_Tp)));</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> </div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  _Map_pointer</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  _M_allocate_map(<span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  {</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  _Map_alloc_type __map_alloc = _M_get_map_allocator();</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">return</span> <a class="code" href="a04639.html#a1afbf725286c9e82ba6166dcc04b10bc">_Map_alloc_traits::allocate</a>(__map_alloc, __n);</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> </div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  _M_deallocate_map(_Map_pointer __p, <span class="keywordtype">size_t</span> __n) _GLIBCXX_NOEXCEPT</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>  _Map_alloc_type __map_alloc = _M_get_map_allocator();</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <a class="code" href="a04639.html#ae5f6b86b98b17e2ba39243ca8eaf4ee1">_Map_alloc_traits::deallocate</a>(__map_alloc, __p, __n);</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</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>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordtype">void</span> <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(<span class="keywordtype">size_t</span>);</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordtype">void</span> _M_create_nodes(_Map_pointer __nstart, _Map_pointer __nfinish);</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordtype">void</span> _M_destroy_nodes(_Map_pointer __nstart,</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  _Map_pointer __nfinish) _GLIBCXX_NOEXCEPT;</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keyword">enum</span> { _S_initial_map_size = 8 };</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> </div><div class="line"><a name="l00634"></a><span class="lineno"><a class="line" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63"> 634</a></span>  _Deque_impl _M_impl;</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> </div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  _Deque_impl</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  _M_move_impl()</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>  <span class="keywordflow">if</span> (!_M_impl._M_map)</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">return</span> std::move(_M_impl);</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// Create a copy of the current allocator.</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  _Tp_alloc_type __alloc{_M_get_Tp_allocator()};</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="comment">// Put that copy in a moved-from state.</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  _Tp_alloc_type __sink __attribute((__unused__)) {std::move(__alloc)};</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// Create an empty map that allocates using the moved-from allocator.</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <a class="code" href="a07299.html">_Deque_base</a> __empty{__alloc};</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  __empty.<a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(0);</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// Now safe to modify current allocator and perform non-throwing swaps.</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  _Deque_impl __ret{std::move(_M_get_Tp_allocator())};</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  _M_impl._M_swap_data(__ret);</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  _M_impl._M_swap_data(__empty._M_impl);</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> __ret;</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  };</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  _Deque_base<_Tp, _Alloc>::</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  ~_Deque_base() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  {</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">if</span> (this->_M_impl._M_map)</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>  _M_destroy_nodes(this->_M_impl._M_start._M_node,</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  this->_M_impl._M_finish._M_node + 1);</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</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>  }</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> <span class="comment"></span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="comment"> /**</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="comment"> * @brief Layout storage.</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment"> * @param __num_elements The count of T's for which to allocate space</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="comment"> * at first.</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="comment"> * @return Nothing.</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="comment"> *</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"> * The initial underlying memory layout is a bit complicated...</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> */</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_Deque_base<_Tp, _Alloc>::</a></div><div class="line"><a name="l00683"></a><span class="lineno"><a class="line" href="a07307.html#a0ba38b77ebabad6056d04d9f65ffa74c"> 683</a></span> <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c"> _M_initialize_map</a>(<span class="keywordtype">size_t</span> __num_elements)</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="keyword">const</span> <span class="keywordtype">size_t</span> __num_nodes = (__num_elements/ __deque_buf_size(<span class="keyword">sizeof</span>(_Tp))</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  + 1);</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> </div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  this->_M_impl._M_map_size = <a class="code" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a>((<span class="keywordtype">size_t</span>) _S_initial_map_size,</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keywordtype">size_t</span>(__num_nodes + 2));</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> </div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// For "small" maps (needing less than _M_map_size nodes), allocation</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// starts in the middle elements and grows outwards. So nstart may be</span></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// the beginning of _M_map, but for small maps it may be as far in as</span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// _M_map+3.</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> </div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  _Map_pointer __nstart = (this->_M_impl._M_map</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  + (this->_M_impl._M_map_size - __num_nodes) / 2);</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  _Map_pointer __nfinish = __nstart + __num_nodes;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> </div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  __try</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  { _M_create_nodes(__nstart, __nfinish); }</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  __catch(...)</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  {</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  this->_M_impl._M_map = _Map_pointer();</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  this->_M_impl._M_map_size = 0;</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  __throw_exception_again;</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  }</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> </div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  this->_M_impl._M_start._M_set_node(__nstart);</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  this->_M_impl._M_finish._M_set_node(__nfinish - 1);</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  + __num_elements</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  % __deque_buf_size(<span class="keyword">sizeof</span>(_Tp)));</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  }</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> </div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <a class="code" href="a07299.html">_Deque_base<_Tp, _Alloc>::</a></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <a class="code" href="a07299.html"> _M_create_nodes</a>(_Map_pointer __nstart, _Map_pointer __nfinish)</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  {</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  _Map_pointer __cur;</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  __try</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  {</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">for</span> (__cur = __nstart; __cur < __nfinish; ++__cur)</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  *__cur = this->_M_allocate_node();</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  }</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  __catch(...)</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  {</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  _M_destroy_nodes(__nstart, __cur);</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  __throw_exception_again;</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>  }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  _Deque_base<_Tp, _Alloc>::</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  _M_destroy_nodes(_Map_pointer __nstart,</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  _Map_pointer __nfinish) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  {</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">for</span> (_Map_pointer __n = __nstart; __n < __nfinish; ++__n)</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  _M_deallocate_node(*__n);</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> <span class="comment"></span></div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="comment"> /**</span></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="comment"> * @brief A standard container using fixed-size memory allocation and</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> <span class="comment"> * constant-time manipulation of elements at either end.</span></div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> <span class="comment"> *</span></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment"> * @ingroup sequences</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment"> *</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"> * @tparam _Tp Type of element.</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment"> *</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and a</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> * <a href="tables.html#67">sequence</a>, including the</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"> * <a href="tables.html#68">optional sequence requirements</a>.</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"> *</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"> * In previous HP/SGI versions of deque, there was an extra template</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> * parameter so users could control the node size. This extension turned</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"> * out to violate the C++ standard (it can be detected using template</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"> * template parameters), and it was removed.</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment"> *</span></div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"> * Here's how a deque<Tp> manages memory. Each deque has 4 members:</span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment"> *</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment"> * - Tp** _M_map</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment"> * - size_t _M_map_size</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"> * - iterator _M_start, _M_finish</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> *</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> * map_size is at least 8. %map is an array of map_size</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * pointers-to-@a nodes. (The name %map has nothing to do with the</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> * std::map class, and @b nodes should not be confused with</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> <span class="comment"> * std::list's usage of @a node.)</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="comment"> *</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="comment"> * A @a node has no specific type name as such, but it is referred</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> <span class="comment"> * to as @a node in this file. It is a simple array-of-Tp. If Tp</span></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> <span class="comment"> * is very large, there will be one Tp element per node (i.e., an</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="comment"> * @a array of one). For non-huge Tp's, node size is inversely</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> <span class="comment"> * related to Tp size: the larger the Tp, the fewer Tp's will fit</span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> <span class="comment"> * in a node. The goal here is to keep the total size of a node</span></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="comment"> * relatively small and constant over different Tp's, to improve</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="comment"> * allocator efficiency.</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="comment"> *</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> <span class="comment"> * Not every pointer in the %map array will point to a node. If</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="comment"> * the initial number of elements in the deque is small, the</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> <span class="comment"> * /middle/ %map pointers will be valid, and the ones at the edges</span></div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="comment"> * will be unused. This same situation will arise as the %map</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span> <span class="comment"> * grows: available %map pointers, if any, will be on the ends. As</span></div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> <span class="comment"> * new nodes are created, only a subset of the %map's pointers need</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span> <span class="comment"> * to be copied @a outward.</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> <span class="comment"> *</span></div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> <span class="comment"> * Class invariants:</span></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> <span class="comment"> * - For any nonsingular iterator i:</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> <span class="comment"> * - i.node points to a member of the %map array. (Yes, you read that</span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span> <span class="comment"> * correctly: i.node does not actually point to a node.) The member of</span></div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="comment"> * the %map array is what actually points to the node.</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> <span class="comment"> * - i.first == *(i.node) (This points to the node (first Tp element).)</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="comment"> * - i.last == i.first + node_size</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="comment"> * - i.cur is a pointer in the range [i.first, i.last). NOTE:</span></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="comment"> * the implication of this is that i.cur is always a dereferenceable</span></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> <span class="comment"> * pointer, even if i is a past-the-end iterator.</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="comment"> * - Start and Finish are always nonsingular iterators. NOTE: this</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="comment"> * means that an empty deque must have one node, a deque with <N</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="comment"> * elements (where N is the node buffer size) must have one node, a</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="comment"> * deque with N through (2N-1) elements must have two nodes, etc.</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="comment"> * - For every node other than start.node and finish.node, every</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> <span class="comment"> * element in the node is an initialized object. If start.node ==</span></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> <span class="comment"> * finish.node, then [start.cur, finish.cur) are initialized</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> <span class="comment"> * objects, and the elements outside that range are uninitialized</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> <span class="comment"> * storage. Otherwise, [start.cur, start.last) and [finish.first,</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> <span class="comment"> * finish.cur) are initialized objects, and [start.first, start.cur)</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment"> * and [finish.cur, finish.last) are uninitialized storage.</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="comment"> * - [%map, %map + map_size) is a valid, non-empty range.</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment"> * - [start.node, finish.node] is a valid range contained within</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment"> * [%map, %map + map_size).</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <span class="comment"> * - A pointer in the range [%map, %map + map_size) points to an allocated</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> <span class="comment"> * node if and only if the pointer is in the range</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="comment"> * [start.node, finish.node].</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> <span class="comment"> *</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment"> * Here's the magic: nothing in deque is @b aware of the discontiguous</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment"> * storage!</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="comment"> *</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> <span class="comment"> * The memory setup and layout occurs in the parent, _Base, and the iterator</span></div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> <span class="comment"> * class is entirely responsible for @a leaping from one node to the next.</span></div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span> <span class="comment"> * All the implementation routines for deque itself work only through the</span></div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment"> * start and finish iterators. This keeps the routines simple and sane,</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment"> * and we can use other standard algorithms as well.</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> <span class="comment"> */</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc = std::allocator<_Tp> ></div><div class="line"><a name="l00832"></a><span class="lineno"><a class="line" href="a07307.html"> 832</a></span>  <span class="keyword">class </span><a class="code" href="a07307.html">deque</a> : <span class="keyword">protected</span> <a class="code" href="a07299.html">_Deque_base</a><_Tp, _Alloc></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> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="preprocessor"># if __cplusplus < 201103L</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> <span class="preprocessor">#endif</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  static_assert(<a class="code" href="a03883.html">is_same</a><<span class="keyword">typename</span> remove_cv<_Tp>::type, _Tp>::value,</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="stringliteral">"std::deque must have a non-const, non-volatile value_type"</span>);</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> <span class="preprocessor"># ifdef __STRICT_ANSI__</span></div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  static_assert(<a class="code" href="a03883.html">is_same<typename _Alloc::value_type, _Tp>::value</a>,</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="stringliteral">"std::deque must have the same value_type as its allocator"</span>);</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span> </div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keyword">typedef</span> <a class="code" href="a07299.html">_Deque_base<_Tp, _Alloc></a> <a class="code" href="a07299.html">_Base</a>;</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::_Tp_alloc_type _Tp_alloc_type;</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10159.html">_Base::_Alloc_traits</a> <a class="code" href="a10159.html">_Alloc_traits</a>;</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::_Map_pointer _Map_pointer;</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span> </div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::pointer pointer;</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_pointer const_pointer;</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::reference reference;</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_reference const_reference;</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07295.html">_Base::iterator</a> <a class="code" href="a07295.html">iterator</a>;</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07295.html">_Base::const_iterator</a> <a class="code" href="a07295.html">const_iterator</a>;</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keyword">typedef</span> <a class="code" href="a07615.html">std::reverse_iterator<const_iterator></a> <a class="code" href="a07615.html">const_reverse_iterator</a>;</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keyword">typedef</span> <a class="code" href="a07615.html">std::reverse_iterator<iterator></a> <a class="code" href="a07615.html">reverse_iterator</a>;</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</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="keyword">protected</span>:</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keyword">static</span> <span class="keywordtype">size_t</span> _S_buffer_size() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  { <span class="keywordflow">return</span> __deque_buf_size(<span class="keyword">sizeof</span>(_Tp)); }</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> </div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="comment">// Functions controlling memory layout, and nothing else.</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keyword">using</span> <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_Base::_M_initialize_map</a>;</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keyword">using</span> _Base::_M_create_nodes;</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keyword">using</span> _Base::_M_destroy_nodes;</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keyword">using</span> _Base::_M_allocate_node;</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keyword">using</span> _Base::_M_deallocate_node;</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keyword">using</span> _Base::_M_allocate_map;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keyword">using</span> _Base::_M_deallocate_map;</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keyword">using</span> _Base::_M_get_Tp_allocator;</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="comment"></span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="comment"> /**</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="comment"> * A total of four data members accumulated down the hierarchy.</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="comment"> * May be accessed via _M_impl.*</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> <span class="comment"> */</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">using</span> _Base::_M_impl;</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">public</span>:</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">// [23.2.1.1] construct/copy/destroy</span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="comment">// (assign() and get_allocator() are also listed in this section)</span></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span> <span class="comment"></span></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> <span class="comment"> /**</span></div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span> <span class="comment"> * @brief Creates a %deque with no elements.</span></div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> <span class="comment"> */</span></div><div class="line"><a name="l00898"></a><span class="lineno"><a class="line" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756"> 898</a></span>  <a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>() : <a class="code" href="a07299.html">_Base</a>() { }</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="comment"></span></div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> <span class="comment"> /**</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> <span class="comment"> * @brief Creates a %deque with no elements.</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="comment"> */</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00905"></a><span class="lineno"><a class="line" href="a07307.html#aa8cf87c79a7c6bdf2cf07749fb1e2ff5"> 905</a></span>  <a class="code" href="a07307.html#aa8cf87c79a7c6bdf2cf07749fb1e2ff5">deque</a>(<span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a)</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  : <a class="code" href="a07299.html">_Base</a>(__a, 0) { }</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> /**</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"> * @brief Creates a %deque with default constructed elements.</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> <span class="comment"> *</span></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span> <span class="comment"> * This constructor fills the %deque with @a n default</span></div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span> <span class="comment"> * constructed elements.</span></div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span> <span class="comment"> */</span></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00918"></a><span class="lineno"><a class="line" href="a07307.html#a511a8f76d058f6bd0e2236abf8df23bc"> 918</a></span>  <a class="code" href="a07307.html#a511a8f76d058f6bd0e2236abf8df23bc">deque</a>(size_type __n, <span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a = <a class="code" href="a04707.html">allocator_type</a>())</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  : <a class="code" href="a07299.html">_Base</a>(__a, __n)</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  { _M_default_initialize(); }</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span> <span class="comment"></span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span> <span class="comment"> /**</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> <span class="comment"> * @brief Creates a %deque with copies of an exemplar element.</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="comment"> * @param __value An element to copy.</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="comment"> *</span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> <span class="comment"> * This constructor fills the %deque with @a __n copies of @a __value.</span></div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="comment"> */</span></div><div class="line"><a name="l00930"></a><span class="lineno"><a class="line" href="a07307.html#a858d7660a45a911f8ae7858246ea2f6d"> 930</a></span>  <a class="code" href="a07307.html#a858d7660a45a911f8ae7858246ea2f6d">deque</a>(size_type __n, <span class="keyword">const</span> value_type& __value,</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a = <a class="code" href="a04707.html">allocator_type</a>())</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  : <a class="code" href="a07299.html">_Base</a>(__a, __n)</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  { <a class="code" href="a07307.html#a67647a3b7f00d3ca89b27980a1f2b7ee">_M_fill_initialize</a>(__value); }</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="comment"> /**</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> <span class="comment"> * @brief Creates a %deque with copies of an exemplar element.</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="comment"> * @param __n The number of elements to initially create.</span></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="comment"> * @param __value An element to copy.</span></div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="comment"> * @param __a An allocator.</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="comment"> *</span></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="comment"> * This constructor fills the %deque with @a __n copies of @a __value.</span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <span class="comment"> */</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>(size_type __n, <span class="keyword">const</span> value_type& __value = value_type(),</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  : _Base(__a, __n)</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  { <a class="code" href="a07307.html#a67647a3b7f00d3ca89b27980a1f2b7ee">_M_fill_initialize</a>(__value); }</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> <span class="comment"></span></div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> <span class="comment"> /**</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> <span class="comment"> * @brief %Deque copy constructor.</span></div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> <span class="comment"> * @param __x A %deque of identical element and allocator types.</span></div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> <span class="comment"> *</span></div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="comment"> * The newly-created %deque uses a copy of the allocator object used</span></div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="comment"> * by @a __x (unless the allocator traits dictate a different object).</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="comment"> */</span></div><div class="line"><a name="l00957"></a><span class="lineno"><a class="line" href="a07307.html#a03515a6af7f959e28cec591ac5f0f8b2"> 957</a></span>  <a class="code" href="a07307.html#a03515a6af7f959e28cec591ac5f0f8b2">deque</a>(<span class="keyword">const</span> <a class="code" href="a07307.html">deque</a>& __x)</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  : <a class="code" href="a07299.html">_Base</a>(<a class="code" href="a10159.html">_Alloc_traits</a>::_S_select_on_copy(__x._M_get_Tp_allocator()),</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  __x.<a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  { std::__uninitialized_copy_a(__x.<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __x.<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(),</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  _M_get_Tp_allocator()); }</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span> </div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="comment"> /**</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> <span class="comment"> * @brief %Deque move constructor.</span></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> <span class="comment"> * @param __x A %deque of identical element and allocator types.</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span> <span class="comment"> *</span></div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span> <span class="comment"> * The newly-created %deque contains the exact contents of @a __x.</span></div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="comment"> * The contents of @a __x are a valid, but unspecified %deque.</span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> */</span></div><div class="line"><a name="l00972"></a><span class="lineno"><a class="line" href="a07307.html#a7d533f573a77a0f9bf33fa40dde1c9cd"> 972</a></span>  <a class="code" href="a07307.html#a7d533f573a77a0f9bf33fa40dde1c9cd">deque</a>(<a class="code" href="a07307.html">deque</a>&& __x)</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  : <a class="code" href="a07299.html">_Base</a>(<a class="code" href="a01541.html">std</a>::move(__x)) { }</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"></span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"> /// Copy constructor with alternative allocator</span></div><div class="line"><a name="l00976"></a><span class="lineno"><a class="line" href="a07307.html#a0948ee096c5387c1deb1e5885d06c112"> 976</a></span> <span class="comment"></span> <a class="code" href="a07307.html#a0948ee096c5387c1deb1e5885d06c112">deque</a>(<span class="keyword">const</span> <a class="code" href="a07307.html">deque</a>& __x, <span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a)</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  : <a class="code" href="a07299.html">_Base</a>(__a, __x.<a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  { std::__uninitialized_copy_a(__x.<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __x.<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(),</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  _M_get_Tp_allocator()); }</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment"></span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="comment"> /// Move constructor with alternative allocator</span></div><div class="line"><a name="l00983"></a><span class="lineno"><a class="line" href="a07307.html#a0bb7da7a228f22622f2e822252813d51"> 983</a></span> <span class="comment"></span> <a class="code" href="a07307.html#a0bb7da7a228f22622f2e822252813d51">deque</a>(<a class="code" href="a07307.html">deque</a>&& __x, <span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a)</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  : <a class="code" href="a07299.html">_Base</a>(<a class="code" href="a01541.html">std</a>::move(__x), __a, __x.<a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  {</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordflow">if</span> (__x.get_allocator() != __a)</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  {</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  std::__uninitialized_move_a(__x.begin(), __x.end(),</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  this->_M_impl._M_start,</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  _M_get_Tp_allocator());</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  __x.clear();</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>  }</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> <span class="comment"></span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="comment"> /**</span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"> * @brief Builds a %deque from an initializer list.</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> <span class="comment"> *</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> <span class="comment"> * Create a %deque consisting of copies of the elements in the</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="comment"> * initializer_list @a __l.</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> <span class="comment"> *</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> <span class="comment"> * This will call the element type's copy constructor N times</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> <span class="comment"> * (where N is __l.size()) and do no memory reallocation.</span></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="comment"> */</span></div><div class="line"><a name="l01006"></a><span class="lineno"><a class="line" href="a07307.html#abdc5fd34432d73edde92643c58d7db6d"> 1006</a></span>  <a class="code" href="a07307.html#abdc5fd34432d73edde92643c58d7db6d">deque</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a = <a class="code" href="a04707.html">allocator_type</a>())</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  : <a class="code" href="a07299.html">_Base</a>(__a)</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  {</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <a class="code" href="a07307.html#ae2b6ab89b51f74b7de15e6494fc03caa">_M_range_initialize</a>(__l.begin(), __l.end(),</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <a class="code" href="a07671.html">random_access_iterator_tag</a>());</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="preprocessor">#endif</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> <span class="comment"></span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> <span class="comment"> /**</span></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> <span class="comment"> * @brief Builds a %deque from a range.</span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="comment"> *</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="comment"> * Create a %deque consisting of copies of the elements from [__first,</span></div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> <span class="comment"> * __last).</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment"> *</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="comment"> * If the iterators are forward, bidirectional, or random-access, then</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="comment"> * this will call the elements' copy constructor N times (where N is</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="comment"> * distance(__first,__last)) and do no memory reallocation. But if only</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="comment"> * input iterators are used, then this will do at most 2N calls to the</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment"> * copy constructor, and logN memory reallocations.</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment"> */</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l01033"></a><span class="lineno"><a class="line" href="a07307.html#ac11b72c35c99798a8aa8428206af7b74"> 1033</a></span>  <a class="code" href="a07307.html#ac11b72c35c99798a8aa8428206af7b74">deque</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keyword">const</span> <a class="code" href="a04707.html">allocator_type</a>& __a = <a class="code" href="a04707.html">allocator_type</a>())</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  : <a class="code" href="a07299.html">_Base</a>(__a)</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  { _M_initialize_dispatch(__first, __last, __false_type()); }</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  : _Base(__a)</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="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  _M_initialize_dispatch(__first, __last, _Integral());</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  }</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> <span class="comment"></span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> <span class="comment"> /**</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span> <span class="comment"> * The dtor only erases the elements, and note that if the elements</span></div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> <span class="comment"> * themselves are pointers, the pointed-to memory is not touched in any</span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> <span class="comment"> * way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> <span class="comment"> */</span></div><div class="line"><a name="l01054"></a><span class="lineno"><a class="line" href="a07307.html#a8e7b8eb846862bae0ec76623338fa2a7"> 1054</a></span>  <a class="code" href="a07307.html#a8e7b8eb846862bae0ec76623338fa2a7">~deque</a>()</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  { _M_destroy_data(<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), _M_get_Tp_allocator()); }</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> <span class="comment"></span></div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="comment"> /**</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="comment"> * @brief %Deque assignment operator.</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="comment"> * @param __x A %deque of identical element and allocator types.</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> <span class="comment"> *</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="comment"> * All the elements of @a x are copied.</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="comment"> *</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="comment"> * The newly-created %deque uses a copy of the allocator object used</span></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> <span class="comment"> * by @a __x (unless the allocator traits dictate a different object).</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="comment"> */</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <a class="code" href="a07307.html">deque</a>&</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <a class="code" href="a07307.html#acbbd2ced11be9e416c030bf3dcaeacad">operator=</a>(<span class="keyword">const</span> <a class="code" href="a07307.html">deque</a>& __x);</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"> /**</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> <span class="comment"> * @brief %Deque move assignment operator.</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> <span class="comment"> * @param __x A %deque of identical element and allocator types.</span></div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="comment"> *</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> <span class="comment"> * The contents of @a __x are moved into this deque (without copying,</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> <span class="comment"> * if the allocators permit it).</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> <span class="comment"> * @a __x is a valid, but unspecified %deque.</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> <span class="comment"> */</span></div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <a class="code" href="a07307.html">deque</a>&</div><div class="line"><a name="l01079"></a><span class="lineno"><a class="line" href="a07307.html#a77734a257fa1c71752517d0ae6ae707d"> 1079</a></span>  <a class="code" href="a07307.html#a77734a257fa1c71752517d0ae6ae707d">operator=</a>(<a class="code" href="a07307.html">deque</a>&& __x) noexcept(_Alloc_traits::_S_always_equal())</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  {</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keyword">using</span> __always_equal = <span class="keyword">typename</span> <a class="code" href="a04639.html#afae6957b1a6d68084b2b6114dff01ae8">_Alloc_traits::is_always_equal</a>;</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  _M_move_assign1(std::move(__x), __always_equal{});</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</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> <span class="comment"></span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> <span class="comment"> /**</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> <span class="comment"> * @brief Assigns an initializer list to a %deque.</span></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> <span class="comment"> *</span></div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="comment"> * This function fills a %deque with copies of the elements in the</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="comment"> * initializer_list @a __l.</span></div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="comment"> *</span></div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> <span class="comment"> * Note that the assignment completely changes the %deque and that the</span></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <span class="comment"> * resulting %deque's size is the same as the number of elements</span></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span> <span class="comment"> * assigned.</span></div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span> <span class="comment"> */</span></div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <a class="code" href="a07307.html">deque</a>&</div><div class="line"><a name="l01098"></a><span class="lineno"><a class="line" href="a07307.html#a74898d8b495f47ced979e6ba66c4eef1"> 1098</a></span>  <a class="code" href="a07307.html#a74898d8b495f47ced979e6ba66c4eef1">operator=</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  {</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  _M_assign_aux(__l.begin(), __l.end(),</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <a class="code" href="a07671.html">random_access_iterator_tag</a>());</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  }</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="comment"></span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <span class="comment"> /**</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> <span class="comment"> * @brief Assigns a given value to a %deque.</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span> <span class="comment"> * @param __n Number of elements to be assigned.</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> <span class="comment"> * @param __val Value to be assigned.</span></div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> <span class="comment"> *</span></div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> <span class="comment"> * This function fills a %deque with @a n copies of the given</span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> <span class="comment"> * value. Note that the assignment completely changes the</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> <span class="comment"> * %deque and that the resulting %deque's size is the same as</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="comment"> * the number of elements assigned.</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span> <span class="comment"> */</span></div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01117"></a><span class="lineno"><a class="line" href="a07307.html#a65dabc6e005b7b5a19adf55792821e76"> 1117</a></span>  <a class="code" href="a07307.html#a65dabc6e005b7b5a19adf55792821e76">assign</a>(size_type __n, <span class="keyword">const</span> value_type& __val)</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  { _M_fill_assign(__n, __val); }</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span> <span class="comment"></span></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span> <span class="comment"> /**</span></div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span> <span class="comment"> * @brief Assigns a range to a %deque.</span></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> <span class="comment"> *</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> <span class="comment"> * This function fills a %deque with copies of the elements in the</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> <span class="comment"> * range [__first,__last).</span></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> <span class="comment"> *</span></div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="comment"> * Note that the assignment completely changes the %deque and that the</span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span> <span class="comment"> * resulting %deque's size is the same as the number of elements</span></div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> <span class="comment"> * assigned.</span></div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> <span class="comment"> */</span></div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01136"></a><span class="lineno"><a class="line" href="a07307.html#ac0579ff04738a923ad49b8b9398af642"> 1136</a></span>  <a class="code" href="a07307.html#ac0579ff04738a923ad49b8b9398af642">assign</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  { _M_assign_dispatch(__first, __last, __false_type()); }</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <a class="code" href="a07307.html#a65dabc6e005b7b5a19adf55792821e76">assign</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  {</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  _M_assign_dispatch(__first, __last, _Integral());</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  }</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> </div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> <span class="comment"> /**</span></div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span> <span class="comment"> * @brief Assigns an initializer list to a %deque.</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> <span class="comment"> *</span></div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> <span class="comment"> * This function fills a %deque with copies of the elements in the</span></div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> <span class="comment"> * initializer_list @a __l.</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="comment"> *</span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="comment"> * Note that the assignment completely changes the %deque and that the</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span> <span class="comment"> * resulting %deque's size is the same as the number of elements</span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span> <span class="comment"> * assigned.</span></div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span> <span class="comment"> */</span></div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01161"></a><span class="lineno"><a class="line" href="a07307.html#ab16028e538ba034ad569b6933c152cdb"> 1161</a></span>  <a class="code" href="a07307.html#ab16028e538ba034ad569b6933c152cdb">assign</a>(<a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  { _M_assign_aux(__l.begin(), __l.end(), <a class="code" href="a07671.html">random_access_iterator_tag</a>()); }</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="comment"></span></div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="comment"> /// Get a copy of the memory allocation object.</span></div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> <span class="comment"></span> allocator_type</div><div class="line"><a name="l01167"></a><span class="lineno"><a class="line" href="a07307.html#a40d6b0cbbd61cda2b99f5fc4a274fe02"> 1167</a></span>  <a class="code" href="a07307.html#a40d6b0cbbd61cda2b99f5fc4a274fe02">get_allocator</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  { <span class="keywordflow">return</span> _Base::get_allocator(); }</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span> </div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="comment">// iterators</span><span class="comment"></span></div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> <span class="comment"> /**</span></div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="comment"> * Returns a read/write iterator that points to the first element in the</span></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> <span class="comment"> * %deque. Iteration is done in ordinary element order.</span></div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> <span class="comment"> */</span></div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01176"></a><span class="lineno"><a class="line" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940"> 1176</a></span>  <a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  { <span class="keywordflow">return</span> this->_M_impl._M_start; }</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span> <span class="comment"></span></div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> <span class="comment"> /**</span></div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> <span class="comment"> * element in the %deque. Iteration is done in ordinary element order.</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> <span class="comment"> */</span></div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  const_iterator</div><div class="line"><a name="l01184"></a><span class="lineno"><a class="line" href="a07307.html#ac5c61891a706a301138fdc8dbf0d0209"> 1184</a></span>  <a class="code" href="a07307.html#ac5c61891a706a301138fdc8dbf0d0209">begin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  { <span class="keywordflow">return</span> this->_M_impl._M_start; }</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="comment"></span></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span> <span class="comment"> /**</span></div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span> <span class="comment"> * Returns a read/write iterator that points one past the last</span></div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span> <span class="comment"> * element in the %deque. Iteration is done in ordinary</span></div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> <span class="comment"> */</span></div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01193"></a><span class="lineno"><a class="line" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40"> 1193</a></span>  <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  { <span class="keywordflow">return</span> this->_M_impl._M_finish; }</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> <span class="comment"></span></div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> <span class="comment"> /**</span></div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> <span class="comment"> * the last element in the %deque. Iteration is done in</span></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> <span class="comment"> * ordinary element order.</span></div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span> <span class="comment"> */</span></div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  const_iterator</div><div class="line"><a name="l01202"></a><span class="lineno"><a class="line" href="a07307.html#ad1986c3313eec924e6a7531929a82b8d"> 1202</a></span>  <a class="code" href="a07307.html#ad1986c3313eec924e6a7531929a82b8d">end</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  { <span class="keywordflow">return</span> this->_M_impl._M_finish; }</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> <span class="comment"></span></div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span> <span class="comment"> /**</span></div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span> <span class="comment"> * Returns a read/write reverse iterator that points to the</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="comment"> * last element in the %deque. Iteration is done in reverse</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> <span class="comment"> * element order.</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="comment"> */</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <a class="code" href="a07615.html">reverse_iterator</a></div><div class="line"><a name="l01211"></a><span class="lineno"><a class="line" href="a07307.html#a00b51e916472a01d8d68945681ab8245"> 1211</a></span>  <a class="code" href="a07307.html#a00b51e916472a01d8d68945681ab8245">rbegin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">reverse_iterator</a>(this->_M_impl._M_finish); }</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="comment"></span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> <span class="comment"> /**</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment"> * to the last element in the %deque. Iteration is done in</span></div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="comment"> * reverse element order.</span></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="comment"> */</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  const_reverse_iterator</div><div class="line"><a name="l01220"></a><span class="lineno"><a class="line" href="a07307.html#af3714db48a222a584264a3e668bd5b3c"> 1220</a></span>  <a class="code" href="a07307.html#af3714db48a222a584264a3e668bd5b3c">rbegin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(this->_M_impl._M_finish); }</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span> <span class="comment"></span></div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span> <span class="comment"> /**</span></div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> <span class="comment"> * Returns a read/write reverse iterator that points to one</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> <span class="comment"> * before the first element in the %deque. Iteration is done</span></div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> <span class="comment"> * in reverse element order.</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> <span class="comment"> */</span></div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <a class="code" href="a07615.html">reverse_iterator</a></div><div class="line"><a name="l01229"></a><span class="lineno"><a class="line" href="a07307.html#a0daef1995ab8473dad46086c79ecb9f0"> 1229</a></span>  <a class="code" href="a07307.html#a0daef1995ab8473dad46086c79ecb9f0">rend</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">reverse_iterator</a>(this->_M_impl._M_start); }</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span> <span class="comment"></span></div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span> <span class="comment"> /**</span></div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span> <span class="comment"> * to one before the first element in the %deque. Iteration is</span></div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span> <span class="comment"> * done in reverse element order.</span></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> <span class="comment"> */</span></div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  const_reverse_iterator</div><div class="line"><a name="l01238"></a><span class="lineno"><a class="line" href="a07307.html#a2d4c0290323b6a5a78b2e30d2706d753"> 1238</a></span>  <a class="code" href="a07307.html#a2d4c0290323b6a5a78b2e30d2706d753">rend</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(this->_M_impl._M_start); }</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> </div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> <span class="comment"> /**</span></div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first</span></div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span> <span class="comment"> * element in the %deque. Iteration is done in ordinary element order.</span></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> <span class="comment"> */</span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  const_iterator</div><div class="line"><a name="l01247"></a><span class="lineno"><a class="line" href="a07307.html#a289af3aac006b9faa969fbdf090f8202"> 1247</a></span>  <a class="code" href="a07307.html#a289af3aac006b9faa969fbdf090f8202">cbegin</a>() const noexcept</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  { <span class="keywordflow">return</span> this->_M_impl._M_start; }</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"></span></div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> <span class="comment"> /**</span></div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past</span></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> <span class="comment"> * the last element in the %deque. Iteration is done in</span></div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span> <span class="comment"> * ordinary element order.</span></div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> <span class="comment"> */</span></div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  const_iterator</div><div class="line"><a name="l01256"></a><span class="lineno"><a class="line" href="a07307.html#ae56c2f3c25dc623eba9825a2e3eddd7c"> 1256</a></span>  <a class="code" href="a07307.html#ae56c2f3c25dc623eba9825a2e3eddd7c">cend</a>() const noexcept</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  { <span class="keywordflow">return</span> this->_M_impl._M_finish; }</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span> <span class="comment"></span></div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> <span class="comment"> /**</span></div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span> <span class="comment"> * to the last element in the %deque. Iteration is done in</span></div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> <span class="comment"> * reverse element order.</span></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> <span class="comment"> */</span></div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  const_reverse_iterator</div><div class="line"><a name="l01265"></a><span class="lineno"><a class="line" href="a07307.html#a86674e16182ecb624e854ce7a653c03e"> 1265</a></span>  <a class="code" href="a07307.html#a86674e16182ecb624e854ce7a653c03e">crbegin</a>() const noexcept</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(this->_M_impl._M_finish); }</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> <span class="comment"></span></div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span> <span class="comment"> /**</span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points</span></div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> <span class="comment"> * to one before the first element in the %deque. Iteration is</span></div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> <span class="comment"> * done in reverse element order.</span></div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> <span class="comment"> */</span></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  const_reverse_iterator</div><div class="line"><a name="l01274"></a><span class="lineno"><a class="line" href="a07307.html#a17d738d29f26320ce991399537a17bce"> 1274</a></span>  <a class="code" href="a07307.html#a17d738d29f26320ce991399537a17bce">crend</a>() const noexcept</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  { <span class="keywordflow">return</span> <a class="code" href="a07615.html">const_reverse_iterator</a>(this->_M_impl._M_start); }</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> </div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="comment">// [23.2.1.2] capacity</span><span class="comment"></span></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> <span class="comment"> /** Returns the number of elements in the %deque. */</span></div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  size_type</div><div class="line"><a name="l01281"></a><span class="lineno"><a class="line" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d"> 1281</a></span>  <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  { <span class="keywordflow">return</span> this->_M_impl._M_finish - this->_M_impl._M_start; }</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span> <span class="comment"></span></div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> <span class="comment"> /** Returns the size() of the largest possible %deque. */</span></div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  size_type</div><div class="line"><a name="l01286"></a><span class="lineno"><a class="line" href="a07307.html#a5aea8252ed76805923d591f878768f67"> 1286</a></span>  <a class="code" href="a07307.html#a5aea8252ed76805923d591f878768f67">max_size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  { <span class="keywordflow">return</span> <a class="code" href="a10159.html#a29c306bcb6a7676a516430a0e50b990a">_Alloc_traits::max_size</a>(_M_get_Tp_allocator()); }</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> </div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> <span class="comment"> /**</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> <span class="comment"> * @brief Resizes the %deque to the specified number of elements.</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> <span class="comment"> * @param __new_size Number of elements the %deque should contain.</span></div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> <span class="comment"> *</span></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> <span class="comment"> * This function will %resize the %deque to the specified</span></div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> <span class="comment"> * number of elements. If the number is smaller than the</span></div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> <span class="comment"> * %deque's current size the %deque is truncated, otherwise</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span> <span class="comment"> * default constructed elements are appended.</span></div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> <span class="comment"> */</span></div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01300"></a><span class="lineno"><a class="line" href="a07307.html#a2cb09fae5538690a6175b6e738f39b59"> 1300</a></span>  <a class="code" href="a07307.html#a2cb09fae5538690a6175b6e738f39b59">resize</a>(size_type __new_size)</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  {</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keyword">const</span> size_type __len = <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>();</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordflow">if</span> (__new_size > __len)</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  _M_default_append(__new_size - __len);</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__new_size < __len)</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  _M_erase_at_end(this->_M_impl._M_start</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  + difference_type(__new_size));</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  }</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> <span class="comment"></span></div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> <span class="comment"> /**</span></div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span> <span class="comment"> * @brief Resizes the %deque to the specified number of elements.</span></div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> <span class="comment"> * @param __new_size Number of elements the %deque should contain.</span></div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> <span class="comment"> * @param __x Data with which new elements should be populated.</span></div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="comment"> *</span></div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> <span class="comment"> * This function will %resize the %deque to the specified</span></div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> <span class="comment"> * number of elements. If the number is smaller than the</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> <span class="comment"> * %deque's current size the %deque is truncated, otherwise the</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="comment"> * %deque is extended and new elements are populated with given</span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> <span class="comment"> * data.</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> <span class="comment"> */</span></div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01322"></a><span class="lineno"><a class="line" href="a07307.html#a5f7f1a01f2d6a06b4c89a4c5a84a9002"> 1322</a></span>  <a class="code" href="a07307.html#a5f7f1a01f2d6a06b4c89a4c5a84a9002">resize</a>(size_type __new_size, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  {</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keyword">const</span> size_type __len = <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>();</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keywordflow">if</span> (__new_size > __len)</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  _M_fill_insert(this->_M_impl._M_finish, __new_size - __len, __x);</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__new_size < __len)</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  _M_erase_at_end(this->_M_impl._M_start</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  + difference_type(__new_size));</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  }</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span> <span class="comment"> /**</span></div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> <span class="comment"> * @brief Resizes the %deque to the specified number of elements.</span></div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span> <span class="comment"> * @param __new_size Number of elements the %deque should contain.</span></div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span> <span class="comment"> * @param __x Data with which new elements should be populated.</span></div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span> <span class="comment"> *</span></div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> <span class="comment"> * This function will %resize the %deque to the specified</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> <span class="comment"> * number of elements. If the number is smaller than the</span></div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> <span class="comment"> * %deque's current size the %deque is truncated, otherwise the</span></div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> <span class="comment"> * %deque is extended and new elements are populated with given</span></div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span> <span class="comment"> * data.</span></div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span> <span class="comment"> */</span></div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <a class="code" href="a07307.html#a2cb09fae5538690a6175b6e738f39b59">resize</a>(size_type __new_size, value_type __x = value_type())</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  {</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keyword">const</span> size_type __len = <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>();</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="keywordflow">if</span> (__new_size > __len)</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  _M_fill_insert(this->_M_impl._M_finish, __new_size - __len, __x);</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__new_size < __len)</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  _M_erase_at_end(this->_M_impl._M_start</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  + difference_type(__new_size));</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  }</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> </div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> <span class="comment"> /** A non-binding request to reduce memory use. */</span></div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01358"></a><span class="lineno"><a class="line" href="a07307.html#abe9c2e87fe6d96dbbbf7f50f750d3cf2"> 1358</a></span>  <a class="code" href="a07307.html#abe9c2e87fe6d96dbbbf7f50f750d3cf2">shrink_to_fit</a>() noexcept</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  { _M_shrink_to_fit(); }</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span> <span class="comment"></span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> <span class="comment"> /**</span></div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> <span class="comment"> * Returns true if the %deque is empty. (Thus begin() would</span></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> <span class="comment"> * equal end().)</span></div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> <span class="comment"> */</span></div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l01367"></a><span class="lineno"><a class="line" href="a07307.html#a512ed6c7e0dc244335b337da26d76f41"> 1367</a></span>  <a class="code" href="a07307.html#a512ed6c7e0dc244335b337da26d76f41">empty</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  { <span class="keywordflow">return</span> this->_M_impl._M_finish == this->_M_impl._M_start; }</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span> </div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="comment">// element access</span><span class="comment"></span></div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span> <span class="comment"> /**</span></div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> <span class="comment"> * @brief Subscript access to the data contained in the %deque.</span></div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span> <span class="comment"> * @return Read/write reference to data.</span></div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> <span class="comment"> *</span></div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> <span class="comment"> * This operator allows for easy, array-style, data access.</span></div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span> <span class="comment"> * Note that data access with this operator is unchecked and</span></div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span> <span class="comment"> * out_of_range lookups are not defined. (For checked lookups</span></div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span> <span class="comment"> * see at().)</span></div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> <span class="comment"> */</span></div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  reference</div><div class="line"><a name="l01383"></a><span class="lineno"><a class="line" href="a07307.html#a461a433ad999e2d22e10f45addf1bb67"> 1383</a></span>  <a class="code" href="a07307.html#a461a433ad999e2d22e10f45addf1bb67">operator[]</a>(size_type __n) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  {</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  __glibcxx_requires_subscript(__n);</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="keywordflow">return</span> this->_M_impl._M_start[difference_type(__n)];</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  }</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span> <span class="comment"></span></div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> <span class="comment"> /**</span></div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span> <span class="comment"> * @brief Subscript access to the data contained in the %deque.</span></div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span> <span class="comment"> * @return Read-only (constant) reference to data.</span></div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span> <span class="comment"> *</span></div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> <span class="comment"> * This operator allows for easy, array-style, data access.</span></div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> <span class="comment"> * Note that data access with this operator is unchecked and</span></div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> <span class="comment"> * out_of_range lookups are not defined. (For checked lookups</span></div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> <span class="comment"> * see at().)</span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <span class="comment"> */</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  const_reference</div><div class="line"><a name="l01401"></a><span class="lineno"><a class="line" href="a07307.html#a513a4ab26ac9df40d7ec95fc50e1218b"> 1401</a></span>  <a class="code" href="a07307.html#a513a4ab26ac9df40d7ec95fc50e1218b">operator[]</a>(size_type __n) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  {</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  __glibcxx_requires_subscript(__n);</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <span class="keywordflow">return</span> this->_M_impl._M_start[difference_type(__n)];</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  }</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> </div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="keyword">protected</span>:<span class="comment"></span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span> <span class="comment"> /// Safety check used only from at().</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> <span class="comment"></span> <span class="keywordtype">void</span></div><div class="line"><a name="l01410"></a><span class="lineno"><a class="line" href="a07307.html#ab0b41c4f880dd45f1278ce6233a3f513"> 1410</a></span>  <a class="code" href="a07307.html#ab0b41c4f880dd45f1278ce6233a3f513">_M_range_check</a>(size_type __n)<span class="keyword"> const</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordflow">if</span> (__n >= this-><a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  __throw_out_of_range_fmt(__N(<span class="stringliteral">"deque::_M_range_check: __n "</span></div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="stringliteral">"(which is %zu)>= this->size() "</span></div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="stringliteral">"(which is %zu)"</span>),</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  __n, this-><a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>());</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  }</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span> </div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> <span class="comment"> /**</span></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> <span class="comment"> * @brief Provides access to the data contained in the %deque.</span></div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span> <span class="comment"> * @return Read/write reference to data.</span></div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span> <span class="comment"> * @throw std::out_of_range If @a __n is an invalid index.</span></div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> <span class="comment"> *</span></div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> <span class="comment"> * This function provides for safer data access. The parameter</span></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span> <span class="comment"> * is first checked that it is in the range of the deque. The</span></div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span> <span class="comment"> * function throws out_of_range if the check fails.</span></div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span> <span class="comment"> */</span></div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  reference</div><div class="line"><a name="l01432"></a><span class="lineno"><a class="line" href="a07307.html#a4b0080ca0ed1a2222104a5fb776a454f"> 1432</a></span>  <a class="code" href="a07307.html#a4b0080ca0ed1a2222104a5fb776a454f">at</a>(size_type __n)</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  {</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <a class="code" href="a07307.html#ab0b41c4f880dd45f1278ce6233a3f513">_M_range_check</a>(__n);</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordflow">return</span> (*<span class="keyword">this</span>)[__n];</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  }</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> <span class="comment"></span></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> <span class="comment"> /**</span></div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span> <span class="comment"> * @brief Provides access to the data contained in the %deque.</span></div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span> <span class="comment"> * @param __n The index of the element for which data should be</span></div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> <span class="comment"> * accessed.</span></div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="comment"> * @return Read-only (constant) reference to data.</span></div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> <span class="comment"> * @throw std::out_of_range If @a __n is an invalid index.</span></div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> <span class="comment"> *</span></div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span> <span class="comment"> * This function provides for safer data access. The parameter is first</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> <span class="comment"> * checked that it is in the range of the deque. The function throws</span></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> <span class="comment"> * out_of_range if the check fails.</span></div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> <span class="comment"> */</span></div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  const_reference</div><div class="line"><a name="l01450"></a><span class="lineno"><a class="line" href="a07307.html#a03a10b684468f787e852fa360440ba7b"> 1450</a></span>  <a class="code" href="a07307.html#a03a10b684468f787e852fa360440ba7b">at</a>(size_type __n)<span class="keyword"> const</span></div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <a class="code" href="a07307.html#ab0b41c4f880dd45f1278ce6233a3f513">_M_range_check</a>(__n);</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <span class="keywordflow">return</span> (*<span class="keyword">this</span>)[__n];</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  }</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span> <span class="comment"></span></div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span> <span class="comment"> /**</span></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span> <span class="comment"> * Returns a read/write reference to the data at the first</span></div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> <span class="comment"> * element of the %deque.</span></div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span> <span class="comment"> */</span></div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  reference</div><div class="line"><a name="l01461"></a><span class="lineno"><a class="line" href="a07307.html#ae5172d8f3ab8a44f5f68f5d6256e5c7e"> 1461</a></span>  <a class="code" href="a07307.html#ae5172d8f3ab8a44f5f68f5d6256e5c7e">front</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  {</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keywordflow">return</span> *<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>();</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  }</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span> <span class="comment"></span></div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span> <span class="comment"> /**</span></div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the first</span></div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span> <span class="comment"> * element of the %deque.</span></div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span> <span class="comment"> */</span></div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  const_reference</div><div class="line"><a name="l01472"></a><span class="lineno"><a class="line" href="a07307.html#a62222a6cab13f17c0489a3d6242dd6a8"> 1472</a></span>  <a class="code" href="a07307.html#a62222a6cab13f17c0489a3d6242dd6a8">front</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  {</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keywordflow">return</span> *<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>();</div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  }</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span> <span class="comment"></span></div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> <span class="comment"> /**</span></div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> <span class="comment"> * Returns a read/write reference to the data at the last element of the</span></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="comment"> * %deque.</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span> <span class="comment"> */</span></div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  reference</div><div class="line"><a name="l01483"></a><span class="lineno"><a class="line" href="a07307.html#a9345d8aadac1295d32b7390ede8478f5"> 1483</a></span>  <a class="code" href="a07307.html#a9345d8aadac1295d32b7390ede8478f5">back</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  {</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <a class="code" href="a07295.html">iterator</a> __tmp = <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>();</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  --__tmp;</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  <span class="keywordflow">return</span> *__tmp;</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  }</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span> <span class="comment"></span></div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span> <span class="comment"> /**</span></div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the last</span></div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span> <span class="comment"> * element of the %deque.</span></div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> <span class="comment"> */</span></div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  const_reference</div><div class="line"><a name="l01496"></a><span class="lineno"><a class="line" href="a07307.html#a0ebb54615350e129c2ce3b51368402bb"> 1496</a></span>  <a class="code" href="a07307.html#a0ebb54615350e129c2ce3b51368402bb">back</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  {</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <a class="code" href="a07295.html">const_iterator</a> __tmp = <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>();</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  --__tmp;</div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <span class="keywordflow">return</span> *__tmp;</div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  }</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span> </div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="comment">// [23.2.1.2] modifiers</span><span class="comment"></span></div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span> <span class="comment"> /**</span></div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span> <span class="comment"> * @brief Add data to the front of the %deque.</span></div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span> <span class="comment"> *</span></div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span> <span class="comment"> * This is a typical stack operation. The function creates an</span></div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span> <span class="comment"> * element at the front of the %deque and assigns the given</span></div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span> <span class="comment"> * data to it. Due to the nature of a %deque this operation</span></div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span> <span class="comment"> * can be done in constant time.</span></div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span> <span class="comment"> */</span></div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01515"></a><span class="lineno"><a class="line" href="a07307.html#a5e23e99b8919a725e105786dd2bf20e9"> 1515</a></span>  <a class="code" href="a07307.html#a5e23e99b8919a725e105786dd2bf20e9">push_front</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  {</div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</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="l01518"></a><span class="lineno"> 1518</span>  {</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  this->_M_impl._M_start._M_cur - 1,</div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  __x);</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  --this->_M_impl._M_start._M_cur;</div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  }</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <a class="code" href="a07307.html#aaf55754b5eef8f7f949e56a7ccf80068">_M_push_front_aux</a>(__x);</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  }</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span> </div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <a class="code" href="a07307.html#a5e23e99b8919a725e105786dd2bf20e9">push_front</a>(value_type&& __x)</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  { emplace_front(std::move(__x)); }</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span> </div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  reference</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  emplace_front(_Args&&... __args);</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span> <span class="comment"></span></div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span> <span class="comment"> /**</span></div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> <span class="comment"> * @brief Add data to the end of the %deque.</span></div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> <span class="comment"> *</span></div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> <span class="comment"> * This is a typical stack operation. The function creates an</span></div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> <span class="comment"> * element at the end of the %deque and assigns the given data</span></div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span> <span class="comment"> * to it. Due to the nature of a %deque this operation can be</span></div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> <span class="comment"> * done in constant time.</span></div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> <span class="comment"> */</span></div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01552"></a><span class="lineno"><a class="line" href="a07307.html#aa261893d7576d53592700d030dedae78"> 1552</a></span>  <a class="code" href="a07307.html#aa261893d7576d53592700d030dedae78">push_back</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  {</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish._M_cur</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  != this->_M_impl._M_finish._M_last - 1)</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  {</div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  _Alloc_traits::construct(this->_M_impl,</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  this->_M_impl._M_finish._M_cur, __x);</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  ++this->_M_impl._M_finish._M_cur;</div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  }</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <a class="code" href="a07307.html#a9cacda81743ab1d5447c31ecc1a988d2">_M_push_back_aux</a>(__x);</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  }</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span> </div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <a class="code" href="a07307.html#aa261893d7576d53592700d030dedae78">push_back</a>(value_type&& __x)</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  { emplace_back(std::move(__x)); }</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span> </div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  reference</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  emplace_back(_Args&&... __args);</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span> <span class="comment"></span></div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span> <span class="comment"> /**</span></div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span> <span class="comment"> * @brief Removes first element.</span></div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span> <span class="comment"> *</span></div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span> <span class="comment"> * This is a typical stack operation. It shrinks the %deque by one.</span></div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> <span class="comment"> *</span></div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span> <span class="comment"> * Note that no data is returned, and if the first element's data is</span></div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> <span class="comment"> * needed, it should be retrieved before pop_front() is called.</span></div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> <span class="comment"> */</span></div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01588"></a><span class="lineno"><a class="line" href="a07307.html#a3f5c33f2728f70a589e11a2e8b013e78"> 1588</a></span>  <a class="code" href="a07307.html#a3f5c33f2728f70a589e11a2e8b013e78">pop_front</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  {</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  <span class="keywordflow">if</span> (this->_M_impl._M_start._M_cur</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  != this->_M_impl._M_start._M_last - 1)</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  {</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  _Alloc_traits::destroy(this->_M_impl,</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  this->_M_impl._M_start._M_cur);</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  ++this->_M_impl._M_start._M_cur;</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  }</div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <a class="code" href="a07307.html#a21cfe1ac5af07d0cfa9dee315faec368">_M_pop_front_aux</a>();</div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  }</div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span> <span class="comment"></span></div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> <span class="comment"> /**</span></div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span> <span class="comment"> * @brief Removes last element.</span></div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span> <span class="comment"> *</span></div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span> <span class="comment"> * This is a typical stack operation. It shrinks the %deque by one.</span></div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span> <span class="comment"> *</span></div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span> <span class="comment"> * Note that no data is returned, and if the last element's data is</span></div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span> <span class="comment"> * needed, it should be retrieved before pop_back() is called.</span></div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span> <span class="comment"> */</span></div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01611"></a><span class="lineno"><a class="line" href="a07307.html#a2299790b7c0080b2652ba374a2ea68fc"> 1611</a></span>  <a class="code" href="a07307.html#a2299790b7c0080b2652ba374a2ea68fc">pop_back</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  {</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keywordflow">if</span> (this->_M_impl._M_finish._M_cur</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  != this->_M_impl._M_finish._M_first)</div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  {</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  --this->_M_impl._M_finish._M_cur;</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  _Alloc_traits::destroy(this->_M_impl,</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  this->_M_impl._M_finish._M_cur);</div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  }</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <a class="code" href="a07307.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7">_M_pop_back_aux</a>();</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  }</div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span> </div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span> <span class="comment"> /**</span></div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span> <span class="comment"> * @brief Inserts an object in %deque before specified iterator.</span></div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span> <span class="comment"> * @param __position A const_iterator into the %deque.</span></div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span> <span class="comment"> * @param __args Arguments.</span></div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span> <span class="comment"> *</span></div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span> <span class="comment"> * This function will insert an object of type T constructed</span></div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span> <span class="comment"> * with T(std::forward<Args>(args)...) before the specified location.</span></div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> <span class="comment"> */</span></div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <a class="code" href="a07307.html#a3ea67e3e7fc5c84e92d9868bb57ae05a">emplace</a>(const_iterator __position, _Args&&... __args);</div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span> <span class="comment"></span></div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span> <span class="comment"> /**</span></div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span> <span class="comment"> * @brief Inserts given value into %deque before specified iterator.</span></div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span> <span class="comment"> * @param __position A const_iterator into the %deque.</span></div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span> <span class="comment"> *</span></div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span> <span class="comment"> * This function will insert a copy of the given value before the</span></div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span> <span class="comment"> * specified location.</span></div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span> <span class="comment"> */</span></div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <a class="code" href="a07307.html#a69b4ca4a5aad67e979d6e6db9b31781a">insert</a>(const_iterator __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span> <span class="comment"> /**</span></div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span> <span class="comment"> * @brief Inserts given value into %deque before specified iterator.</span></div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span> <span class="comment"> * @param __position An iterator into the %deque.</span></div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span> <span class="comment"> *</span></div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span> <span class="comment"> * This function will insert a copy of the given value before the</span></div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span> <span class="comment"> * specified location.</span></div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span> <span class="comment"> */</span></div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <a class="code" href="a07307.html#a69b4ca4a5aad67e979d6e6db9b31781a">insert</a>(<a class="code" href="a07675.html">iterator</a> __position, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span> </div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span> <span class="comment"> /**</span></div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> <span class="comment"> * @brief Inserts given rvalue into %deque before specified iterator.</span></div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span> <span class="comment"> * @param __position A const_iterator into the %deque.</span></div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> <span class="comment"> *</span></div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span> <span class="comment"> * This function will insert a copy of the given rvalue before the</span></div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span> <span class="comment"> * specified location.</span></div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span> <span class="comment"> */</span></div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01675"></a><span class="lineno"><a class="line" href="a07307.html#adec6ee2ba1f059f0addf6b9da5b596e1"> 1675</a></span>  <a class="code" href="a07307.html#adec6ee2ba1f059f0addf6b9da5b596e1">insert</a>(<a class="code" href="a07295.html">const_iterator</a> __position, value_type&& __x)</div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  { <span class="keywordflow">return</span> <a class="code" href="a07307.html#a3ea67e3e7fc5c84e92d9868bb57ae05a">emplace</a>(__position, std::move(__x)); }</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> <span class="comment"></span></div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span> <span class="comment"> /**</span></div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span> <span class="comment"> * @brief Inserts an initializer list into the %deque.</span></div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span> <span class="comment"> * @param __p An iterator into the %deque.</span></div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span> <span class="comment"> *</span></div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span> <span class="comment"> * This function will insert copies of the data in the</span></div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> <span class="comment"> * initializer_list @a __l into the %deque before the location</span></div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span> <span class="comment"> * specified by @a __p. This is known as <em>list insert</em>.</span></div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span> <span class="comment"> */</span></div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01688"></a><span class="lineno"><a class="line" href="a07307.html#a755a6d05ef2270de50ce270bea77250f"> 1688</a></span>  <a class="code" href="a07307.html#a755a6d05ef2270de50ce270bea77250f">insert</a>(<a class="code" href="a07295.html">const_iterator</a> __p, <a class="code" href="a01655.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  {</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="keyword">auto</span> __offset = __p - <a class="code" href="a07307.html#a289af3aac006b9faa969fbdf090f8202">cbegin</a>();</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  _M_range_insert_aux(__p._M_const_cast(), __l.begin(), __l.end(),</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <a class="code" href="a07671.html">std::random_access_iterator_tag</a>());</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  <span class="keywordflow">return</span> <a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>() + __offset;</div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  }</div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> </div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span> <span class="comment"> /**</span></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span> <span class="comment"> * @brief Inserts a number of copies of given data into the %deque.</span></div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> <span class="comment"> * @param __position A const_iterator into the %deque.</span></div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span> <span class="comment"> * @param __n Number of elements to be inserted.</span></div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span> <span class="comment"> *</span></div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span> <span class="comment"> * This function will insert a specified number of copies of the given</span></div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span> <span class="comment"> * data before the location specified by @a __position.</span></div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span> <span class="comment"> */</span></div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01709"></a><span class="lineno"><a class="line" href="a07307.html#ad645c0144212cbfee911daa80578e997"> 1709</a></span>  <a class="code" href="a07307.html#ad645c0144212cbfee911daa80578e997">insert</a>(<a class="code" href="a07295.html">const_iterator</a> __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  {</div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  difference_type __offset = __position - <a class="code" href="a07307.html#a289af3aac006b9faa969fbdf090f8202">cbegin</a>();</div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  _M_fill_insert(__position._M_const_cast(), __n, __x);</div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  <span class="keywordflow">return</span> <a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>() + __offset;</div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  }</div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span> <span class="comment"> /**</span></div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span> <span class="comment"> * @brief Inserts a number of copies of given data into the %deque.</span></div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span> <span class="comment"> * @param __position An iterator into the %deque.</span></div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span> <span class="comment"> * @param __n Number of elements to be inserted.</span></div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span> <span class="comment"> * @param __x Data to be inserted.</span></div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span> <span class="comment"> *</span></div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span> <span class="comment"> * This function will insert a specified number of copies of the given</span></div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span> <span class="comment"> * data before the location specified by @a __position.</span></div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span> <span class="comment"> */</span></div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <a class="code" href="a07307.html#a69b4ca4a5aad67e979d6e6db9b31781a">insert</a>(<a class="code" href="a07675.html">iterator</a> __position, size_type __n, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  { _M_fill_insert(__position, __n, __x); }</div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span> </div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span> <span class="comment"> /**</span></div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span> <span class="comment"> * @brief Inserts a range into the %deque.</span></div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span> <span class="comment"> * @param __position A const_iterator into the %deque.</span></div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span> <span class="comment"> * @return An iterator that points to the inserted data.</span></div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span> <span class="comment"> *</span></div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span> <span class="comment"> * This function will insert copies of the data in the range</span></div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span> <span class="comment"> * [__first,__last) into the %deque before the location specified</span></div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span> <span class="comment"> * by @a __position. This is known as <em>range insert</em>.</span></div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span> <span class="comment"> */</span></div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator,</div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="keyword">typename</span> = std::_RequireInputIter<_InputIterator>></div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  iterator</div><div class="line"><a name="l01745"></a><span class="lineno"><a class="line" href="a07307.html#aee2b0dd83e2d5c82db3b2df6918e484a"> 1745</a></span>  <a class="code" href="a07307.html#aee2b0dd83e2d5c82db3b2df6918e484a">insert</a>(<a class="code" href="a07295.html">const_iterator</a> __position, _InputIterator __first,</div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  _InputIterator __last)</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  {</div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  difference_type __offset = __position - <a class="code" href="a07307.html#a289af3aac006b9faa969fbdf090f8202">cbegin</a>();</div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  _M_insert_dispatch(__position._M_const_cast(),</div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  __first, __last, __false_type());</div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  <span class="keywordflow">return</span> <a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>() + __offset;</div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  }</div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span> <span class="comment"> /**</span></div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span> <span class="comment"> * @brief Inserts a range into the %deque.</span></div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span> <span class="comment"> * @param __position An iterator into the %deque.</span></div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span> <span class="comment"> *</span></div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span> <span class="comment"> * This function will insert copies of the data in the range</span></div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span> <span class="comment"> * [__first,__last) into the %deque before the location specified</span></div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span> <span class="comment"> * by @a __position. This is known as <em>range insert</em>.</span></div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span> <span class="comment"> */</span></div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  <a class="code" href="a07307.html#a69b4ca4a5aad67e979d6e6db9b31781a">insert</a>(<a class="code" href="a07675.html">iterator</a> __position, _InputIterator __first,</div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  _InputIterator __last)</div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  {</div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  <span class="comment">// Check whether it's an integral type. If so, it's not an iterator.</span></div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::__is_integer<_InputIterator>::__type _Integral;</div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  _M_insert_dispatch(__position, __first, __last, _Integral());</div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  }</div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span> <span class="comment"></span></div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span> <span class="comment"> /**</span></div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span> <span class="comment"> * @brief Remove element at given position.</span></div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span> <span class="comment"> * @param __position Iterator pointing to element to be erased.</span></div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span> <span class="comment"> * @return An iterator pointing to the next element (or end()).</span></div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span> <span class="comment"> *</span></div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span> <span class="comment"> * This function will erase the element at the given position and thus</span></div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span> <span class="comment"> * shorten the %deque by one.</span></div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span> <span class="comment"> *</span></div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span> <span class="comment"> * The user is cautioned that</span></div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> <span class="comment"> * this function only erases the element, and that if the element is</span></div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span> <span class="comment"> * itself a pointer, the pointed-to memory is not touched in any way.</span></div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span> <span class="comment"> * Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span> <span class="comment"> */</span></div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  iterator</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01790"></a><span class="lineno"><a class="line" href="a07307.html#a0e0812f0cacd5dfd1108455df4fda375"> 1790</a></span>  <a class="code" href="a07307.html#a0e0812f0cacd5dfd1108455df4fda375">erase</a>(<a class="code" href="a07295.html">const_iterator</a> __position)</div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  <a class="code" href="a07307.html#a0e0812f0cacd5dfd1108455df4fda375">erase</a>(<a class="code" href="a07295.html">iterator</a> __position)</div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  { <span class="keywordflow">return</span> _M_erase(__position._M_const_cast()); }</div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span> <span class="comment"></span></div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> <span class="comment"> /**</span></div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span> <span class="comment"> * @brief Remove a range of elements.</span></div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span> <span class="comment"> * @param __first Iterator pointing to the first element to be erased.</span></div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span> <span class="comment"> * @param __last Iterator pointing to one past the last element to be</span></div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span> <span class="comment"> * @return An iterator pointing to the element pointed to by @a last</span></div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span> <span class="comment"> * prior to erasing (or end()).</span></div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span> <span class="comment"> *</span></div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span> <span class="comment"> * This function will erase the elements in the range</span></div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span> <span class="comment"> * [__first,__last) and shorten the %deque accordingly.</span></div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span> <span class="comment"> *</span></div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span> <span class="comment"> * The user is cautioned that</span></div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span> <span class="comment"> * this function only erases the elements, and that if the elements</span></div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span> <span class="comment"> * themselves are pointers, the pointed-to memory is not touched in any</span></div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span> <span class="comment"> * way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span> <span class="comment"> */</span></div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01814"></a><span class="lineno"><a class="line" href="a07307.html#af8f15e04574604071004bcdcd3be22fc"> 1814</a></span>  <a class="code" href="a07307.html#af8f15e04574604071004bcdcd3be22fc">erase</a>(<a class="code" href="a07295.html">const_iterator</a> __first, <a class="code" href="a07295.html">const_iterator</a> __last)</div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <a class="code" href="a07307.html#a0e0812f0cacd5dfd1108455df4fda375">erase</a>(<a class="code" href="a07295.html">iterator</a> __first, <a class="code" href="a07295.html">iterator</a> __last)</div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  { <span class="keywordflow">return</span> _M_erase(__first._M_const_cast(), __last._M_const_cast()); }</div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span> <span class="comment"></span></div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span> <span class="comment"> /**</span></div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span> <span class="comment"> * @brief Swaps data with another %deque.</span></div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span> <span class="comment"> * @param __x A %deque of the same element and allocator types.</span></div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span> <span class="comment"> *</span></div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span> <span class="comment"> * This exchanges the elements between two deques in constant time.</span></div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span> <span class="comment"> * (Four pointers, so it should be quite fast.)</span></div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span> <span class="comment"> * Note that the global std::swap() function is specialized such that</span></div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span> <span class="comment"> * std::swap(d1,d2) will feed to this function.</span></div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span> <span class="comment"> *</span></div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span> <span class="comment"> * Whether the allocators are swapped depends on the allocator traits.</span></div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span> <span class="comment"> */</span></div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01832"></a><span class="lineno"><a class="line" href="a07307.html#a41f78615b6896d0b85bef3aea0e41f2f"> 1832</a></span>  <a class="code" href="a07307.html#a41f78615b6896d0b85bef3aea0e41f2f">swap</a>(<a class="code" href="a07307.html">deque</a>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  {</div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  __glibcxx_assert(_Alloc_traits::propagate_on_container_swap::value</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  || _M_get_Tp_allocator() == __x._M_get_Tp_allocator());</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  _M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  _Alloc_traits::_S_on_swap(_M_get_Tp_allocator(),</div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  __x._M_get_Tp_allocator());</div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  }</div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span> <span class="comment"></span></div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span> <span class="comment"> /**</span></div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span> <span class="comment"> * Erases all the elements. Note that this function only erases the</span></div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span> <span class="comment"> * elements, and that if the elements themselves are pointers, the</span></div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span> <span class="comment"> * pointed-to memory is not touched in any way. Managing the pointer is</span></div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> <span class="comment"> * the user's responsibility.</span></div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span> <span class="comment"> */</span></div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01850"></a><span class="lineno"><a class="line" href="a07307.html#a1a753bfa9e6b675bac7ee9ec4365fbdf"> 1850</a></span>  <a class="code" href="a07307.html#a1a753bfa9e6b675bac7ee9ec4365fbdf">clear</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  { _M_erase_at_end(<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>()); }</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span> </div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="comment">// Internal constructor functions follow.</span></div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span> </div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="comment">// called by the range constructor to implement [23.1.1]/9</span></div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span> </div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)</div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  {</div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <a class="code" href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(static_cast<size_type>(__n));</div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <a class="code" href="a07307.html#a67647a3b7f00d3ca89b27980a1f2b7ee">_M_fill_initialize</a>(__x);</div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  }</div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span> </div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  <span class="comment">// called by the range constructor to implement [23.1.1]/9</span></div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  __false_type)</div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  {</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <a class="code" href="a07307.html#ae2b6ab89b51f74b7de15e6494fc03caa">_M_range_initialize</a>(__first, __last,</div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first));</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  }</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span> </div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <span class="comment">// called by the second initialize_dispatch above</span><span class="comment"></span></div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span> <span class="comment"> * @brief Fills the deque with whatever is in [first,last).</span></div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> <span class="comment"> * @return Nothing.</span></div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> <span class="comment"> *</span></div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> <span class="comment"> * If the iterators are actually forward iterators (or better), then the</span></div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span> <span class="comment"> * memory layout can be done all at once. Else we move forward using</span></div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> <span class="comment"> * push_back on each value from the iterator.</span></div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span> <span class="comment"> */</span></div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <a class="code" href="a07307.html#ae2b6ab89b51f74b7de15e6494fc03caa">_M_range_initialize</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <a class="code" href="a07655.html">std::input_iterator_tag</a>);</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span> </div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <span class="comment">// called by the second initialize_dispatch above</span></div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  <a class="code" href="a07307.html#ae2b6ab89b51f74b7de15e6494fc03caa">_M_range_initialize</a>(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <a class="code" href="a07663.html">std::forward_iterator_tag</a>);<span class="comment"></span></div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span> <span class="comment"> /**</span></div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span> <span class="comment"> * @brief Fills the %deque with copies of value.</span></div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span> <span class="comment"> * @param __value Initial value.</span></div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span> <span class="comment"> * @return Nothing.</span></div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span> <span class="comment"> * @pre _M_start and _M_finish have already been initialized,</span></div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span> <span class="comment"> * but none of the %deque's elements have yet been constructed.</span></div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span> <span class="comment"> *</span></div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span> <span class="comment"> * This function is called only when the user provides an explicit size</span></div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span> <span class="comment"> * (with or without an explicit exemplar value).</span></div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span> <span class="comment"> */</span></div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  <a class="code" href="a07307.html#a67647a3b7f00d3ca89b27980a1f2b7ee">_M_fill_initialize</a>(<span class="keyword">const</span> value_type& __value);</div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span> </div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  <span class="comment">// called by deque(n).</span></div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  _M_default_initialize();</div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> </div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <span class="comment">// Internal assign functions follow. The *_aux functions do the actual</span></div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="comment">// assignment work for the range versions.</span></div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span> </div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="comment">// called by the range assign to implement [23.1.1]/9</span></div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span> </div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)</div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  { _M_fill_assign(__n, __val); }</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span> </div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  <span class="comment">// called by the range assign to implement [23.1.1]/9</span></div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  _M_assign_dispatch(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  __false_type)</div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  { _M_assign_aux(__first, __last, <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first)); }</div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span> </div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  <span class="comment">// called by the second assign_dispatch above</span></div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  _M_assign_aux(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  <a class="code" href="a07655.html">std::input_iterator_tag</a>);</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span> </div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  <span class="comment">// called by the second assign_dispatch above</span></div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  <a class="code" href="a07663.html">std::forward_iterator_tag</a>)</div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  {</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="keyword">const</span> size_type __len = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="keywordflow">if</span> (__len > <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  {</div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  _ForwardIterator __mid = __first;</div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__mid, <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>());</div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  std::copy(__first, __mid, <a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>());</div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  _M_range_insert_aux(<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), __mid, __last,</div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first));</div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  }</div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  _M_erase_at_end(std::copy(__first, __last, <a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>()));</div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  }</div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span> </div><div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  <span class="comment">// Called by assign(n,t), and the range assign when it turns out</span></div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="comment">// to be the same thing.</span></div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  _M_fill_assign(size_type __n, <span class="keyword">const</span> value_type& __val)</div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  {</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  <span class="keywordflow">if</span> (__n > <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>())</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  {</div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  std::fill(<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), __val);</div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  _M_fill_insert(<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), __n - <a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>(), __val);</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  }</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  {</div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  _M_erase_at_end(<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>() + difference_type(__n));</div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  std::fill(<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), __val);</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  }</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  }</div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span> <span class="comment"></span></div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span> <span class="comment"></span><span class="comment"> /// Helper functions for push_* and pop_*.</span></div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span> <span class="comment"></span><span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  <span class="keywordtype">void</span> <a class="code" href="a07307.html#a9cacda81743ab1d5447c31ecc1a988d2">_M_push_back_aux</a>(<span class="keyword">const</span> value_type&);</div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span> </div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  <span class="keywordtype">void</span> <a class="code" href="a07307.html#aaf55754b5eef8f7f949e56a7ccf80068">_M_push_front_aux</a>(<span class="keyword">const</span> value_type&);</div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  <span class="keywordtype">void</span> <a class="code" href="a07307.html#a9cacda81743ab1d5447c31ecc1a988d2">_M_push_back_aux</a>(_Args&&... __args);</div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span> </div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="keywordtype">void</span> <a class="code" href="a07307.html#aaf55754b5eef8f7f949e56a7ccf80068">_M_push_front_aux</a>(_Args&&... __args);</div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span> </div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  <span class="keywordtype">void</span> <a class="code" href="a07307.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7">_M_pop_back_aux</a>();</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span> </div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  <span class="keywordtype">void</span> <a class="code" href="a07307.html#a21cfe1ac5af07d0cfa9dee315faec368">_M_pop_front_aux</a>();<span class="comment"></span></div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span> <span class="comment"> //@}</span></div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span> <span class="comment"></span></div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  <span class="comment">// Internal insert functions follow. The *_aux functions do the actual</span></div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <span class="comment">// insertion work when all shortcuts fail.</span></div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span> </div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="comment">// called by the range insert to implement [23.1.1]/9</span></div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span> </div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <span class="comment">// 438. Ambiguity in the "do the right thing" clause</span></div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Integer></div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  _M_insert_dispatch(iterator __pos,</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  _Integer __n, _Integer __x, __true_type)</div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  { _M_fill_insert(__pos, __n, __x); }</div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span> </div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  <span class="comment">// called by the range insert to implement [23.1.1]/9</span></div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  _M_insert_dispatch(iterator __pos,</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  _InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  __false_type)</div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  {</div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  _M_range_insert_aux(__pos, __first, __last,</div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first));</div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  }</div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span> </div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  <span class="comment">// called by the second insert_dispatch above</span></div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  _M_range_insert_aux(iterator __pos, _InputIterator __first,</div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  _InputIterator __last, <a class="code" href="a07655.html">std::input_iterator_tag</a>);</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span> </div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <span class="comment">// called by the second insert_dispatch above</span></div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  _M_range_insert_aux(iterator __pos, _ForwardIterator __first,</div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  _ForwardIterator __last, <a class="code" href="a07663.html">std::forward_iterator_tag</a>);</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span> </div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="comment">// Called by insert(p,n,x), and the range insert when it turns out to be</span></div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="comment">// the same thing. Can use fill functions in optimal situations,</span></div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  <span class="comment">// otherwise passes off to insert_aux(p,n,x).</span></div><div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  _M_fill_insert(iterator __pos, size_type __n, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span> </div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  <span class="comment">// called by insert(p,x)</span></div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  iterator</div><div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  _M_insert_aux(iterator __pos, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  iterator</div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  _M_insert_aux(iterator __pos, _Args&&... __args);</div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span> </div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  <span class="comment">// called by insert(p,n,x) via fill_insert</span></div><div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  _M_insert_aux(iterator __pos, size_type __n, <span class="keyword">const</span> value_type& __x);</div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span> </div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <span class="comment">// called by range_insert_aux for forward iterators</span></div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  _M_insert_aux(iterator __pos,</div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  _ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  size_type __n);</div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span> </div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span> </div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <span class="comment">// Internal erase functions follow.</span></div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span> </div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  _M_destroy_data_aux(iterator __first, iterator __last);</div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span> </div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="comment">// Called by ~deque().</span></div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  <span class="comment">// NB: Doesn't deallocate the nodes.</span></div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc1></div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  _M_destroy_data(iterator __first, iterator __last, <span class="keyword">const</span> _Alloc1&)</div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  { _M_destroy_data_aux(__first, __last); }</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span> </div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  _M_destroy_data(iterator __first, iterator __last,</div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  <span class="keyword">const</span> <a class="code" href="a04707.html">std::allocator<_Tp></a>&)</div><div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  {</div><div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  <span class="keywordflow">if</span> (!__has_trivial_destructor(value_type))</div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  _M_destroy_data_aux(__first, __last);</div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  }</div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span> </div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="comment">// Called by erase(q1, q2).</span></div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  _M_erase_at_begin(iterator __pos)</div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  {</div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  _M_destroy_data(<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __pos, _M_get_Tp_allocator());</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  _M_destroy_nodes(this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_start._M_node, __pos._M_node);</div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_start = __pos;</div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  }</div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span> </div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  <span class="comment">// Called by erase(q1, q2), resize(), clear(), _M_assign_aux,</span></div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="comment">// _M_fill_assign, operator=.</span></div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  _M_erase_at_end(iterator __pos)</div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  {</div><div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  _M_destroy_data(__pos, <a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), _M_get_Tp_allocator());</div><div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  _M_destroy_nodes(__pos._M_node + 1,</div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  this->_M_impl._M_finish._M_node + 1);</div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_finish = __pos;</div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  }</div><div class="line"><a name="l02104"></a><span class="lineno"> 2104</span> </div><div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  iterator</div><div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  _M_erase(iterator __pos);</div><div class="line"><a name="l02107"></a><span class="lineno"> 2107</span> </div><div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  iterator</div><div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  _M_erase(iterator __first, iterator __last);</div><div class="line"><a name="l02110"></a><span class="lineno"> 2110</span> </div><div class="line"><a name="l02111"></a><span class="lineno"> 2111</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  <span class="comment">// Called by resize(sz).</span></div><div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  _M_default_append(size_type __n);</div><div class="line"><a name="l02115"></a><span class="lineno"> 2115</span> </div><div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  _M_shrink_to_fit();</div><div class="line"><a name="l02118"></a><span class="lineno"> 2118</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l02119"></a><span class="lineno"> 2119</span> <span class="comment"></span></div><div class="line"><a name="l02120"></a><span class="lineno"> 2120</span> <span class="comment"> //@{</span></div><div class="line"><a name="l02121"></a><span class="lineno"> 2121</span> <span class="comment"></span><span class="comment"> /// Memory-handling helpers for the previous internal insert functions.</span></div><div class="line"><a name="l02122"></a><span class="lineno"> 2122</span> <span class="comment"></span> iterator</div><div class="line"><a name="l02123"></a><span class="lineno"><a class="line" href="a07307.html#a2f8d8d37581896d79e8759a827bab9e0"> 2123</a></span>  <a class="code" href="a07307.html#a2f8d8d37581896d79e8759a827bab9e0">_M_reserve_elements_at_front</a>(size_type __n)</div><div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  {</div><div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="keyword">const</span> size_type __vacancies = this->_M_impl._M_start._M_cur</div><div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  - this->_M_impl._M_start._M_first;</div><div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  <span class="keywordflow">if</span> (__n > __vacancies)</div><div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  <a class="code" href="a07307.html#a9397000b47d5f39fff457ac11a728c50">_M_new_elements_at_front</a>(__n - __vacancies);</div><div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  <span class="keywordflow">return</span> this->_M_impl._M_start - difference_type(__n);</div><div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  }</div><div class="line"><a name="l02131"></a><span class="lineno"> 2131</span> </div><div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  <a class="code" href="a07675.html">iterator</a></div><div class="line"><a name="l02133"></a><span class="lineno"><a class="line" href="a07307.html#ae525555e5d42a93d328bdd620705ce94"> 2133</a></span>  <a class="code" href="a07307.html#ae525555e5d42a93d328bdd620705ce94">_M_reserve_elements_at_back</a>(size_type __n)</div><div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  {</div><div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  <span class="keyword">const</span> size_type __vacancies = (this->_M_impl._M_finish._M_last</div><div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  - this->_M_impl._M_finish._M_cur) - 1;</div><div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  <span class="keywordflow">if</span> (__n > __vacancies)</div><div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  <a class="code" href="a07307.html#a71853b49ee48f7f429287d1a78964911">_M_new_elements_at_back</a>(__n - __vacancies);</div><div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  <span class="keywordflow">return</span> this->_M_impl._M_finish + difference_type(__n);</div><div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  }</div><div class="line"><a name="l02141"></a><span class="lineno"> 2141</span> </div><div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <a class="code" href="a07307.html#a9397000b47d5f39fff457ac11a728c50">_M_new_elements_at_front</a>(size_type __new_elements);</div><div class="line"><a name="l02144"></a><span class="lineno"> 2144</span> </div><div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <a class="code" href="a07307.html#a71853b49ee48f7f429287d1a78964911">_M_new_elements_at_back</a>(size_type __new_elements);<span class="comment"></span></div><div class="line"><a name="l02147"></a><span class="lineno"> 2147</span> <span class="comment"> //@}</span></div><div class="line"><a name="l02148"></a><span class="lineno"> 2148</span> <span class="comment"></span></div><div class="line"><a name="l02149"></a><span class="lineno"> 2149</span> <span class="comment"></span></div><div class="line"><a name="l02150"></a><span class="lineno"> 2150</span> <span class="comment"> //@{</span></div><div class="line"><a name="l02151"></a><span class="lineno"> 2151</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l02152"></a><span class="lineno"> 2152</span> <span class="comment"> * @brief Memory-handling helpers for the major %map.</span></div><div class="line"><a name="l02153"></a><span class="lineno"> 2153</span> <span class="comment"> *</span></div><div class="line"><a name="l02154"></a><span class="lineno"> 2154</span> <span class="comment"> * Makes sure the _M_map has space for new nodes. Does not</span></div><div class="line"><a name="l02155"></a><span class="lineno"> 2155</span> <span class="comment"> * actually add the nodes. Can invalidate _M_map pointers.</span></div><div class="line"><a name="l02156"></a><span class="lineno"> 2156</span> <span class="comment"> * (And consequently, %deque iterators.)</span></div><div class="line"><a name="l02157"></a><span class="lineno"> 2157</span> <span class="comment"> */</span></div><div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02159"></a><span class="lineno"><a class="line" href="a07307.html#a8ebf868f4aae064167a0a05292b19093"> 2159</a></span>  <a class="code" href="a07307.html#a8ebf868f4aae064167a0a05292b19093">_M_reserve_map_at_back</a>(size_type __nodes_to_add = 1)</div><div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  {</div><div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  <span class="keywordflow">if</span> (__nodes_to_add + 1 > this->_M_impl._M_map_size</div><div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map))</div><div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  <a class="code" href="a07307.html#a27ce26ccde84a7aacb2326cb7969149e">_M_reallocate_map</a>(__nodes_to_add, <span class="keyword">false</span>);</div><div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  }</div><div class="line"><a name="l02165"></a><span class="lineno"> 2165</span> </div><div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02167"></a><span class="lineno"><a class="line" href="a07307.html#aa8eb5a8eedeacb9a0de37a42dfc5abc9"> 2167</a></span>  <a class="code" href="a07307.html#aa8eb5a8eedeacb9a0de37a42dfc5abc9">_M_reserve_map_at_front</a>(size_type __nodes_to_add = 1)</div><div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  {</div><div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  <span class="keywordflow">if</span> (__nodes_to_add > size_type(this->_M_impl._M_start._M_node</div><div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  - this->_M_impl._M_map))</div><div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  <a class="code" href="a07307.html#a27ce26ccde84a7aacb2326cb7969149e">_M_reallocate_map</a>(__nodes_to_add, <span class="keyword">true</span>);</div><div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  }</div><div class="line"><a name="l02173"></a><span class="lineno"> 2173</span> </div><div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  <a class="code" href="a07307.html#a27ce26ccde84a7aacb2326cb7969149e">_M_reallocate_map</a>(size_type __nodes_to_add, <span class="keywordtype">bool</span> __add_at_front);<span class="comment"></span></div><div class="line"><a name="l02176"></a><span class="lineno"> 2176</span> <span class="comment"> //@}</span></div><div class="line"><a name="l02177"></a><span class="lineno"> 2177</span> <span class="comment"></span></div><div class="line"><a name="l02178"></a><span class="lineno"> 2178</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  <span class="comment">// Constant-time, nothrow move assignment when source object's memory</span></div><div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  <span class="comment">// can be moved because the allocators are equal.</span></div><div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  _M_move_assign1(<a class="code" href="a07307.html">deque</a>&& __x, <span class="comment">/* always equal: */</span> <a class="code" href="a03043.html">true_type</a>) noexcept</div><div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  {</div><div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  this->_M_impl._M_swap_data(__x._M_impl);</div><div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  __x.clear();</div><div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  std::__alloc_on_move(_M_get_Tp_allocator(), __x._M_get_Tp_allocator());</div><div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  }</div><div class="line"><a name="l02188"></a><span class="lineno"> 2188</span> </div><div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  <span class="comment">// When the allocators are not equal the operation could throw, because</span></div><div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  <span class="comment">// we might need to allocate a new map for __x after moving from it</span></div><div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  <span class="comment">// or we might need to allocate new elements for *this.</span></div><div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  _M_move_assign1(<a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>&& __x, <span class="comment">/* always equal: */</span> <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</div><div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  {</div><div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  constexpr <span class="keywordtype">bool</span> __move_storage =</div><div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  _Alloc_traits::_S_propagate_on_move_assign();</div><div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  _M_move_assign2(std::move(__x), __bool_constant<__move_storage>());</div><div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  }</div><div class="line"><a name="l02199"></a><span class="lineno"> 2199</span> </div><div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  <span class="comment">// Destroy all elements and deallocate all memory, then replace</span></div><div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  <span class="comment">// with elements created from __args.</span></div><div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  _M_replace_map(_Args&&... __args)</div><div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  {</div><div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  <span class="comment">// Create new data first, so if allocation fails there are no effects.</span></div><div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  <a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a> __newobj(std::forward<_Args>(__args)...);</div><div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  <span class="comment">// Free existing storage using existing allocator.</span></div><div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  <a class="code" href="a07307.html#a1a753bfa9e6b675bac7ee9ec4365fbdf">clear</a>();</div><div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  _M_deallocate_node(*<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>()._M_node); <span class="comment">// one node left after clear()</span></div><div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  _M_deallocate_map(this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_map, this->_M_impl._M_map_size);</div><div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_map = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_map_size = 0;</div><div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  <span class="comment">// Take ownership of replacement memory.</span></div><div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  this-><a class="code" href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a>._M_swap_data(__newobj._M_impl);</div><div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  }</div><div class="line"><a name="l02217"></a><span class="lineno"> 2217</span> </div><div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  <span class="comment">// Do move assignment when the allocator propagates.</span></div><div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  _M_move_assign2(<a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>&& __x, <span class="comment">/* propagate: */</span> <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>)</div><div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  {</div><div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  <span class="comment">// Make a copy of the original allocator state.</span></div><div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  <span class="keyword">auto</span> __alloc = __x._M_get_Tp_allocator();</div><div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  <span class="comment">// The allocator propagates so storage can be moved from __x,</span></div><div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  <span class="comment">// leaving __x in a valid empty state with a moved-from allocator.</span></div><div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  _M_replace_map(std::move(__x));</div><div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  <span class="comment">// Move the corresponding allocator state too.</span></div><div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  _M_get_Tp_allocator() = std::move(__alloc);</div><div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  }</div><div class="line"><a name="l02230"></a><span class="lineno"> 2230</span> </div><div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  <span class="comment">// Do move assignment when it may not be possible to move source</span></div><div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  <span class="comment">// object's memory, resulting in a linear-time operation.</span></div><div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  _M_move_assign2(<a class="code" href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>&& __x, <span class="comment">/* propagate: */</span> <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</div><div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  {</div><div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  <span class="keywordflow">if</span> (__x._M_get_Tp_allocator() == this->_M_get_Tp_allocator())</div><div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  {</div><div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  <span class="comment">// The allocators are equal so storage can be moved from __x,</span></div><div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  <span class="comment">// leaving __x in a valid empty state with its current allocator.</span></div><div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  _M_replace_map(std::move(__x), __x.get_allocator());</div><div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  }</div><div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  {</div><div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  <span class="comment">// The rvalue's allocator cannot be moved and is not equal,</span></div><div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  <span class="comment">// so we need to individually move each element.</span></div><div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  _M_assign_aux(std::__make_move_if_noexcept_iterator(__x.begin()),</div><div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  std::__make_move_if_noexcept_iterator(__x.end()),</div><div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  <a class="code" href="a07671.html">std::random_access_iterator_tag</a>());</div><div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  __x.clear();</div><div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  }</div><div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  }</div><div class="line"><a name="l02252"></a><span class="lineno"> 2252</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  };</div><div class="line"><a name="l02254"></a><span class="lineno"> 2254</span> </div><div class="line"><a name="l02255"></a><span class="lineno"> 2255</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _ValT</div><div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  = <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type,</div><div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  <span class="keyword">typename</span> _Allocator = allocator<_ValT>,</div><div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  <span class="keyword">typename</span> = _RequireAllocator<_Allocator>></div><div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  deque(_InputIterator, _InputIterator, _Allocator = _Allocator())</div><div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  -> deque<_ValT, _Allocator>;</div><div class="line"><a name="l02263"></a><span class="lineno"> 2263</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l02264"></a><span class="lineno"> 2264</span> <span class="comment"></span></div><div class="line"><a name="l02265"></a><span class="lineno"> 2265</span> <span class="comment"> /**</span></div><div class="line"><a name="l02266"></a><span class="lineno"> 2266</span> <span class="comment"> * @brief Deque equality comparison.</span></div><div class="line"><a name="l02267"></a><span class="lineno"> 2267</span> <span class="comment"> * @param __x A %deque.</span></div><div class="line"><a name="l02268"></a><span class="lineno"> 2268</span> <span class="comment"> * @param __y A %deque of the same type as @a __x.</span></div><div class="line"><a name="l02269"></a><span class="lineno"> 2269</span> <span class="comment"> * @return True iff the size and elements of the deques are equal.</span></div><div class="line"><a name="l02270"></a><span class="lineno"> 2270</span> <span class="comment"> *</span></div><div class="line"><a name="l02271"></a><span class="lineno"> 2271</span> <span class="comment"> * This is an equivalence relation. It is linear in the size of the</span></div><div class="line"><a name="l02272"></a><span class="lineno"> 2272</span> <span class="comment"> * deques. Deques are considered equivalent if their sizes are equal,</span></div><div class="line"><a name="l02273"></a><span class="lineno"> 2273</span> <span class="comment"> * and if corresponding elements compare equal.</span></div><div class="line"><a name="l02274"></a><span class="lineno"> 2274</span> <span class="comment"> */</span></div><div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02277"></a><span class="lineno"><a class="line" href="a01541.html#a60c2de42339c226dbeaeb60ef54b7bd2"> 2277</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __x,</div><div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  <span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  { <span class="keywordflow">return</span> __x.<a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>() == __y.<a class="code" href="a07307.html#a24d5150e384f657ca3b317ced4dadc5d">size</a>()</div><div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  && <a class="code" href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407">std::equal</a>(__x.<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __x.<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(), __y.<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>()); }</div><div class="line"><a name="l02281"></a><span class="lineno"> 2281</span> <span class="comment"></span></div><div class="line"><a name="l02282"></a><span class="lineno"> 2282</span> <span class="comment"> /**</span></div><div class="line"><a name="l02283"></a><span class="lineno"> 2283</span> <span class="comment"> * @brief Deque ordering relation.</span></div><div class="line"><a name="l02284"></a><span class="lineno"> 2284</span> <span class="comment"> * @param __x A %deque.</span></div><div class="line"><a name="l02285"></a><span class="lineno"> 2285</span> <span class="comment"> * @param __y A %deque of the same type as @a __x.</span></div><div class="line"><a name="l02286"></a><span class="lineno"> 2286</span> <span class="comment"> * @return True iff @a x is lexicographically less than @a __y.</span></div><div class="line"><a name="l02287"></a><span class="lineno"> 2287</span> <span class="comment"> *</span></div><div class="line"><a name="l02288"></a><span class="lineno"> 2288</span> <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span></div><div class="line"><a name="l02289"></a><span class="lineno"> 2289</span> <span class="comment"> * deques. The elements must be comparable with @c <.</span></div><div class="line"><a name="l02290"></a><span class="lineno"> 2290</span> <span class="comment"> *</span></div><div class="line"><a name="l02291"></a><span class="lineno"> 2291</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div><div class="line"><a name="l02292"></a><span class="lineno"> 2292</span> <span class="comment"> */</span></div><div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02295"></a><span class="lineno"><a class="line" href="a01541.html#a15c710c3bf507d1a7bdf5f8de40cafe2"> 2295</a></span>  operator<(<span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __x,</div><div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  <span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  { <span class="keywordflow">return</span> <a class="code" href="a01485.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a>(__x.<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __x.<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>(),</div><div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  __y.<a class="code" href="a07307.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a>(), __y.<a class="code" href="a07307.html#a78b2da6c6329349581db042e6bbe2a40">end</a>()); }</div><div class="line"><a name="l02299"></a><span class="lineno"> 2299</span> <span class="comment"></span></div><div class="line"><a name="l02300"></a><span class="lineno"> 2300</span> <span class="comment"> /// Based on operator==</span></div><div class="line"><a name="l02301"></a><span class="lineno"> 2301</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02303"></a><span class="lineno"><a class="line" href="a01541.html#a01fe16a0529fecdacda453c5cb1ce28a"> 2303</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __x,</div><div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  <span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l02306"></a><span class="lineno"> 2306</span> <span class="comment"></span></div><div class="line"><a name="l02307"></a><span class="lineno"> 2307</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l02308"></a><span class="lineno"> 2308</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02310"></a><span class="lineno"><a class="line" href="a01541.html#af745511bf2598950056525a3fd7a346b"> 2310</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __x,</div><div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  <span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l02313"></a><span class="lineno"> 2313</span> <span class="comment"></span></div><div class="line"><a name="l02314"></a><span class="lineno"> 2314</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l02315"></a><span class="lineno"> 2315</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02317"></a><span class="lineno"><a class="line" href="a01541.html#a8921c2d57c14b7e9702a9500bde8aba9"> 2317</a></span>  operator<=(<span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __x,</div><div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  <span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l02320"></a><span class="lineno"> 2320</span> <span class="comment"></span></div><div class="line"><a name="l02321"></a><span class="lineno"> 2321</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l02322"></a><span class="lineno"> 2322</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l02324"></a><span class="lineno"><a class="line" href="a01541.html#a5e3f58e54e9cbbcda75328fada9fa1a5"> 2324</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __x,</div><div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  <span class="keyword">const</span> <a class="code" href="a07307.html">deque<_Tp, _Alloc></a>& __y)</div><div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l02327"></a><span class="lineno"> 2327</span> <span class="comment"></span></div><div class="line"><a name="l02328"></a><span class="lineno"> 2328</span> <span class="comment"> /// See std::deque::swap().</span></div><div class="line"><a name="l02329"></a><span class="lineno"> 2329</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l02331"></a><span class="lineno"><a class="line" href="a01541.html#a7e6765b86dfe7f33455aec5b8a7f7e2e"> 2331</a></span>  swap(<a class="code" href="a07307.html">deque<_Tp,_Alloc></a>& __x, <a class="code" href="a07307.html">deque<_Tp,_Alloc></a>& __y)</div><div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))</div><div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  { __x.swap(__y); }</div><div class="line"><a name="l02334"></a><span class="lineno"> 2334</span> </div><div class="line"><a name="l02335"></a><span class="lineno"> 2335</span> <span class="preprocessor">#undef _GLIBCXX_DEQUE_BUF_SIZE</span></div><div class="line"><a name="l02336"></a><span class="lineno"> 2336</span> </div><div class="line"><a name="l02337"></a><span class="lineno"> 2337</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l02338"></a><span class="lineno"> 2338</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l02339"></a><span class="lineno"> 2339</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l02340"></a><span class="lineno"> 2340</span> </div><div class="line"><a name="l02341"></a><span class="lineno"> 2341</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_DEQUE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07307_html_a27ce26ccde84a7aacb2326cb7969149e"><div class="ttname"><a href="a07307.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="a07307_html_ae56c2f3c25dc623eba9825a2e3eddd7c"><div class="ttname"><a href="a07307.html#ae56c2f3c25dc623eba9825a2e3eddd7c">std::deque::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01256">stl_deque.h:1256</a></div></div>
<div class="ttc" id="a01470_html_gaef6e5c353285e48d39f7dbd566c19a2e"><div class="ttname"><a href="a01470.html#gaef6e5c353285e48d39f7dbd566c19a2e">std::operator-</a></div><div class="ttdeci">complex< _Tp > operator-(const complex< _Tp > &__x, const complex< _Tp > &__y)</div><div class="ttdoc">Return new complex value x minus y.</div><div class="ttdef"><b>Definition:</b> <a href="a00053_source.html#l00356">complex:356</a></div></div>
<div class="ttc" id="a07307_html_af3714db48a222a584264a3e668bd5b3c"><div class="ttname"><a href="a07307.html#af3714db48a222a584264a3e668bd5b3c">std::deque::rbegin</a></div><div class="ttdeci">const_reverse_iterator rbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01220">stl_deque.h:1220</a></div></div>
<div class="ttc" id="a07307_html_a21cfe1ac5af07d0cfa9dee315faec368"><div class="ttname"><a href="a07307.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="a07307_html_ac11b72c35c99798a8aa8428206af7b74"><div class="ttname"><a href="a07307.html#ac11b72c35c99798a8aa8428206af7b74">std::deque::deque</a></div><div class="ttdeci">deque(_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a deque from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01033">stl_deque.h:1033</a></div></div>
<div class="ttc" id="a07307_html_ab0b41c4f880dd45f1278ce6233a3f513"><div class="ttname"><a href="a07307.html#ab0b41c4f880dd45f1278ce6233a3f513">std::deque::_M_range_check</a></div><div class="ttdeci">void _M_range_check(size_type __n) const</div><div class="ttdoc">Safety check used only from at().</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01410">stl_deque.h:1410</a></div></div>
<div class="ttc" id="a07307_html_a03515a6af7f959e28cec591ac5f0f8b2"><div class="ttname"><a href="a07307.html#a03515a6af7f959e28cec591ac5f0f8b2">std::deque::deque</a></div><div class="ttdeci">deque(const deque &__x)</div><div class="ttdoc">Deque copy constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00957">stl_deque.h:957</a></div></div>
<div class="ttc" id="a01479_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant< bool, true > true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00075">type_traits:75</a></div></div>
<div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a01470_html_gaf2a59d9d4f1421dcdba7b5ce55ca9358"><div class="ttname"><a href="a01470.html#gaf2a59d9d4f1421dcdba7b5ce55ca9358">std::operator+</a></div><div class="ttdeci">complex< _Tp > operator+(const complex< _Tp > &__x, const complex< _Tp > &__y)</div><div class="ttdoc">Return new complex value x plus y.</div><div class="ttdef"><b>Definition:</b> <a href="a00053_source.html#l00326">complex:326</a></div></div>
<div class="ttc" id="a07655_html"><div class="ttname"><a href="a07655.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="a04707_html"><div class="ttname"><a href="a04707.html">std::allocator</a></div><div class="ttdoc">The standard allocator, as per [20.4].</div><div class="ttdef"><b>Definition:</b> <a href="a00272_source.html#l00108">allocator.h:108</a></div></div>
<div class="ttc" id="a07307_html_a1a753bfa9e6b675bac7ee9ec4365fbdf"><div class="ttname"><a href="a07307.html#a1a753bfa9e6b675bac7ee9ec4365fbdf">std::deque::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01850">stl_deque.h:1850</a></div></div>
<div class="ttc" id="a10159_html_a29c306bcb6a7676a516430a0e50b990a"><div class="ttname"><a href="a10159.html#a29c306bcb6a7676a516430a0e50b990a">__gnu_cxx::__alloc_traits< _Tp_alloc_type >::max_size</a></div><div class="ttdeci">static size_type max_size(const _Tp_alloc_type &__a) noexcept</div><div class="ttdoc">The maximum supported allocation size.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00366">bits/alloc_traits.h:366</a></div></div>
<div class="ttc" id="a07307_html_aa8eb5a8eedeacb9a0de37a42dfc5abc9"><div class="ttname"><a href="a07307.html#aa8eb5a8eedeacb9a0de37a42dfc5abc9">std::deque::_M_reserve_map_at_front</a></div><div class="ttdeci">void _M_reserve_map_at_front(size_type __nodes_to_add=1)</div><div class="ttdoc">Memory-handling helpers for the major map.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l02167">stl_deque.h:2167</a></div></div>
<div class="ttc" id="a07299_html"><div class="ttname"><a href="a07299.html">std::_Deque_base</a></div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00461">stl_deque.h:461</a></div></div>
<div class="ttc" id="a07307_html_a17d738d29f26320ce991399537a17bce"><div class="ttname"><a href="a07307.html#a17d738d29f26320ce991399537a17bce">std::deque::crend</a></div><div class="ttdeci">const_reverse_iterator crend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01274">stl_deque.h:1274</a></div></div>
<div class="ttc" id="a07307_html_a5f7f1a01f2d6a06b4c89a4c5a84a9002"><div class="ttname"><a href="a07307.html#a5f7f1a01f2d6a06b4c89a4c5a84a9002">std::deque::resize</a></div><div class="ttdeci">void resize(size_type __new_size, const value_type &__x)</div><div class="ttdoc">Resizes the deque to the specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01322">stl_deque.h:1322</a></div></div>
<div class="ttc" id="a07675_html"><div class="ttname"><a href="a07675.html">std::iterator</a></div><div class="ttdoc">Common iterator class.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00118">stl_iterator_base_types.h:118</a></div></div>
<div class="ttc" id="a07307_html_a0ebb54615350e129c2ce3b51368402bb"><div class="ttname"><a href="a07307.html#a0ebb54615350e129c2ce3b51368402bb">std::deque::back</a></div><div class="ttdeci">const_reference back() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01496">stl_deque.h:1496</a></div></div>
<div class="ttc" id="a04639_html_afae6957b1a6d68084b2b6114dff01ae8"><div class="ttname"><a href="a04639.html#afae6957b1a6d68084b2b6114dff01ae8">std::allocator_traits< _Tp_alloc_type >::is_always_equal</a></div><div class="ttdeci">__detected_or_t< typename is_empty< _Tp_alloc_type >::type, __equal, _Tp_alloc_type > is_always_equal</div><div class="ttdoc">Whether all instances of the allocator type compare equal.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00203">bits/alloc_traits.h:203</a></div></div>
<div class="ttc" id="a07307_html_a2299790b7c0080b2652ba374a2ea68fc"><div class="ttname"><a href="a07307.html#a2299790b7c0080b2652ba374a2ea68fc">std::deque::pop_back</a></div><div class="ttdeci">void pop_back() noexcept</div><div class="ttdoc">Removes last element.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01611">stl_deque.h:1611</a></div></div>
<div class="ttc" id="a07663_html"><div class="ttname"><a href="a07663.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="a04639_html_a1afbf725286c9e82ba6166dcc04b10bc"><div class="ttname"><a href="a04639.html#a1afbf725286c9e82ba6166dcc04b10bc">std::allocator_traits::allocate</a></div><div class="ttdeci">static pointer allocate(_Alloc &__a, size_type __n)</div><div class="ttdoc">Allocate memory.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00300">bits/alloc_traits.h:300</a></div></div>
<div class="ttc" id="a07307_html_a40d6b0cbbd61cda2b99f5fc4a274fe02"><div class="ttname"><a href="a07307.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="a07307_html_ac5c61891a706a301138fdc8dbf0d0209"><div class="ttname"><a href="a07307.html#ac5c61891a706a301138fdc8dbf0d0209">std::deque::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01184">stl_deque.h:1184</a></div></div>
<div class="ttc" id="a07295_html"><div class="ttname"><a href="a07295.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="a07307_html_ae125f10bcc0c0b97d7a4f5c582ebe9b7"><div class="ttname"><a href="a07307.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="a07307_html_a67647a3b7f00d3ca89b27980a1f2b7ee"><div class="ttname"><a href="a07307.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="a01541_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00202">stl_iterator_base_funcs.h:202</a></div></div>
<div class="ttc" id="a07307_html_adec6ee2ba1f059f0addf6b9da5b596e1"><div class="ttname"><a href="a07307.html#adec6ee2ba1f059f0addf6b9da5b596e1">std::deque::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, value_type &&__x)</div><div class="ttdoc">Inserts given rvalue into deque before specified iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01675">stl_deque.h:1675</a></div></div>
<div class="ttc" id="a07307_html_a00b51e916472a01d8d68945681ab8245"><div class="ttname"><a href="a07307.html#a00b51e916472a01d8d68945681ab8245">std::deque::rbegin</a></div><div class="ttdeci">reverse_iterator rbegin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01211">stl_deque.h:1211</a></div></div>
<div class="ttc" id="a00743_html"><div class="ttname"><a href="a00743.html">assertions.h</a></div></div>
<div class="ttc" id="a07307_html_ae68c6ac05cd6e788a90c9b8a47c56756"><div class="ttname"><a href="a07307.html#ae68c6ac05cd6e788a90c9b8a47c56756">std::deque::deque</a></div><div class="ttdeci">deque()</div><div class="ttdoc">Creates a deque with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00898">stl_deque.h:898</a></div></div>
<div class="ttc" id="a07307_html_ab16028e538ba034ad569b6933c152cdb"><div class="ttname"><a href="a07307.html#ab16028e538ba034ad569b6933c152cdb">std::deque::assign</a></div><div class="ttdeci">void assign(initializer_list< value_type > __l)</div><div class="ttdoc">Assigns an initializer list to a deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01161">stl_deque.h:1161</a></div></div>
<div class="ttc" id="a07307_html_a74898d8b495f47ced979e6ba66c4eef1"><div class="ttname"><a href="a07307.html#a74898d8b495f47ced979e6ba66c4eef1">std::deque::operator=</a></div><div class="ttdeci">deque & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Assigns an initializer list to a deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01098">stl_deque.h:1098</a></div></div>
<div class="ttc" id="a07307_html_a41f78615b6896d0b85bef3aea0e41f2f"><div class="ttname"><a href="a07307.html#a41f78615b6896d0b85bef3aea0e41f2f">std::deque::swap</a></div><div class="ttdeci">void swap(deque &__x) noexcept</div><div class="ttdoc">Swaps data with another deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01832">stl_deque.h:1832</a></div></div>
<div class="ttc" id="a07307_html_a9cacda81743ab1d5447c31ecc1a988d2"><div class="ttname"><a href="a07307.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="a03043_html"><div class="ttname"><a href="a03043.html">std::integral_constant</a></div><div class="ttdoc">integral_constant</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00057">type_traits:57</a></div></div>
<div class="ttc" id="a07307_html_a461a433ad999e2d22e10f45addf1bb67"><div class="ttname"><a href="a07307.html#a461a433ad999e2d22e10f45addf1bb67">std::deque::operator[]</a></div><div class="ttdeci">reference operator[](size_type __n) noexcept</div><div class="ttdoc">Subscript access to the data contained in the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01383">stl_deque.h:1383</a></div></div>
<div class="ttc" id="a07307_html_a5aea8252ed76805923d591f878768f67"><div class="ttname"><a href="a07307.html#a5aea8252ed76805923d591f878768f67">std::deque::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01286">stl_deque.h:1286</a></div></div>
<div class="ttc" id="a07307_html_a69b4ca4a5aad67e979d6e6db9b31781a"><div class="ttname"><a href="a07307.html#a69b4ca4a5aad67e979d6e6db9b31781a">std::deque::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, const value_type &__x)</div><div class="ttdoc">Inserts given value into deque before specified iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a00320_source.html#l00210">deque.tcc:210</a></div></div>
<div class="ttc" id="a07307_html_a512ed6c7e0dc244335b337da26d76f41"><div class="ttname"><a href="a07307.html#a512ed6c7e0dc244335b337da26d76f41">std::deque::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01367">stl_deque.h:1367</a></div></div>
<div class="ttc" id="a01655_html"><div class="ttname"><a href="a01655.html">std::initializer_list</a></div><div class="ttdoc">initializer_list</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00047">initializer_list:47</a></div></div>
<div class="ttc" id="a07307_html_a62222a6cab13f17c0489a3d6242dd6a8"><div class="ttname"><a href="a07307.html#a62222a6cab13f17c0489a3d6242dd6a8">std::deque::front</a></div><div class="ttdeci">const_reference front() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01472">stl_deque.h:1472</a></div></div>
<div class="ttc" id="a07307_html_a0948ee096c5387c1deb1e5885d06c112"><div class="ttname"><a href="a07307.html#a0948ee096c5387c1deb1e5885d06c112">std::deque::deque</a></div><div class="ttdeci">deque(const deque &__x, const allocator_type &__a)</div><div class="ttdoc">Copy constructor with alternative allocator.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00976">stl_deque.h:976</a></div></div>
<div class="ttc" id="a07307_html_aaf55754b5eef8f7f949e56a7ccf80068"><div class="ttname"><a href="a07307.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="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a07307_html_a2d4c0290323b6a5a78b2e30d2706d753"><div class="ttname"><a href="a07307.html#a2d4c0290323b6a5a78b2e30d2706d753">std::deque::rend</a></div><div class="ttdeci">const_reverse_iterator rend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01238">stl_deque.h:1238</a></div></div>
<div class="ttc" id="a07307_html_abdc5fd34432d73edde92643c58d7db6d"><div class="ttname"><a href="a07307.html#abdc5fd34432d73edde92643c58d7db6d">std::deque::deque</a></div><div class="ttdeci">deque(initializer_list< value_type > __l, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a deque from an initializer list.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01006">stl_deque.h:1006</a></div></div>
<div class="ttc" id="a07307_html_acbbd2ced11be9e416c030bf3dcaeacad"><div class="ttname"><a href="a07307.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="a07307_html_a24d5150e384f657ca3b317ced4dadc5d"><div class="ttname"><a href="a07307.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="a07307_html_ae2b6ab89b51f74b7de15e6494fc03caa"><div class="ttname"><a href="a07307.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="a00029_html"><div class="ttname"><a href="a00029.html">initializer_list</a></div></div>
<div class="ttc" id="a07307_html_a0daef1995ab8473dad46086c79ecb9f0"><div class="ttname"><a href="a07307.html#a0daef1995ab8473dad46086c79ecb9f0">std::deque::rend</a></div><div class="ttdeci">reverse_iterator rend() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01229">stl_deque.h:1229</a></div></div>
<div class="ttc" id="a07307_html_a65dabc6e005b7b5a19adf55792821e76"><div class="ttname"><a href="a07307.html#a65dabc6e005b7b5a19adf55792821e76">std::deque::assign</a></div><div class="ttdeci">void assign(size_type __n, const value_type &__val)</div><div class="ttdoc">Assigns a given value to a deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01117">stl_deque.h:1117</a></div></div>
<div class="ttc" id="a07307_html_a4b0080ca0ed1a2222104a5fb776a454f"><div class="ttname"><a href="a07307.html#a4b0080ca0ed1a2222104a5fb776a454f">std::deque::at</a></div><div class="ttdeci">reference at(size_type __n)</div><div class="ttdoc">Provides access to the data contained in the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01432">stl_deque.h:1432</a></div></div>
<div class="ttc" id="a07307_html_a03a10b684468f787e852fa360440ba7b"><div class="ttname"><a href="a07307.html#a03a10b684468f787e852fa360440ba7b">std::deque::at</a></div><div class="ttdeci">const_reference at(size_type __n) const</div><div class="ttdoc">Provides access to the data contained in the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01450">stl_deque.h:1450</a></div></div>
<div class="ttc" id="a00539_html_a87949eb8a238d15bbc7d30d84cd3b8cf"><div class="ttname"><a href="a00539.html#a87949eb8a238d15bbc7d30d84cd3b8cf">_GLIBCXX_DEQUE_BUF_SIZE</a></div><div class="ttdeci">#define _GLIBCXX_DEQUE_BUF_SIZE</div><div class="ttdoc">This function controls the size of memory nodes.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00088">stl_deque.h:88</a></div></div>
<div class="ttc" id="a07307_html_a3f5c33f2728f70a589e11a2e8b013e78"><div class="ttname"><a href="a07307.html#a3f5c33f2728f70a589e11a2e8b013e78">std::deque::pop_front</a></div><div class="ttdeci">void pop_front() noexcept</div><div class="ttdoc">Removes first element.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01588">stl_deque.h:1588</a></div></div>
<div class="ttc" id="a07299_html_a0ba38b77ebabad6056d04d9f65ffa74c"><div class="ttname"><a href="a07299.html#a0ba38b77ebabad6056d04d9f65ffa74c">std::_Deque_base::_M_initialize_map</a></div><div class="ttdeci">void _M_initialize_map(size_t)</div><div class="ttdoc">Layout storage.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00683">stl_deque.h:683</a></div></div>
<div class="ttc" id="a07307_html_a0bb7da7a228f22622f2e822252813d51"><div class="ttname"><a href="a07307.html#a0bb7da7a228f22622f2e822252813d51">std::deque::deque</a></div><div class="ttdeci">deque(deque &&__x, const allocator_type &__a)</div><div class="ttdoc">Move constructor with alternative allocator.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00983">stl_deque.h:983</a></div></div>
<div class="ttc" id="a07307_html_a289af3aac006b9faa969fbdf090f8202"><div class="ttname"><a href="a07307.html#a289af3aac006b9faa969fbdf090f8202">std::deque::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01247">stl_deque.h:1247</a></div></div>
<div class="ttc" id="a07307_html_ae525555e5d42a93d328bdd620705ce94"><div class="ttname"><a href="a07307.html#ae525555e5d42a93d328bdd620705ce94">std::deque::_M_reserve_elements_at_back</a></div><div class="ttdeci">iterator _M_reserve_elements_at_back(size_type __n)</div><div class="ttdoc">Memory-handling helpers for the previous internal insert functions.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l02133">stl_deque.h:2133</a></div></div>
<div class="ttc" id="a07307_html_a7d533f573a77a0f9bf33fa40dde1c9cd"><div class="ttname"><a href="a07307.html#a7d533f573a77a0f9bf33fa40dde1c9cd">std::deque::deque</a></div><div class="ttdeci">deque(deque &&__x)</div><div class="ttdoc">Deque move constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00972">stl_deque.h:972</a></div></div>
<div class="ttc" id="a01507_html_ga89d3a7d239086516917bb7f6f9da213c"><div class="ttname"><a href="a01507.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="a07307_html_a78b2da6c6329349581db042e6bbe2a40"><div class="ttname"><a href="a07307.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="a03883_html"><div class="ttname"><a href="a03883.html">std::is_same</a></div><div class="ttdoc">is_same</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l01286">type_traits:1286</a></div></div>
<div class="ttc" id="a07307_html_aa8cf87c79a7c6bdf2cf07749fb1e2ff5"><div class="ttname"><a href="a07307.html#aa8cf87c79a7c6bdf2cf07749fb1e2ff5">std::deque::deque</a></div><div class="ttdeci">deque(const allocator_type &__a)</div><div class="ttdoc">Creates a deque with no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00905">stl_deque.h:905</a></div></div>
<div class="ttc" id="a07307_html_a71853b49ee48f7f429287d1a78964911"><div class="ttname"><a href="a07307.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="a04639_html_ae5f6b86b98b17e2ba39243ca8eaf4ee1"><div class="ttname"><a href="a04639.html#ae5f6b86b98b17e2ba39243ca8eaf4ee1">std::allocator_traits::deallocate</a></div><div class="ttdeci">static void deallocate(_Alloc &__a, pointer __p, size_type __n)</div><div class="ttdoc">Deallocate memory.</div><div class="ttdef"><b>Definition:</b> <a href="a16476_source.html#l00327">bits/alloc_traits.h:327</a></div></div>
<div class="ttc" id="a07307_html_a9345d8aadac1295d32b7390ede8478f5"><div class="ttname"><a href="a07307.html#a9345d8aadac1295d32b7390ede8478f5">std::deque::back</a></div><div class="ttdeci">reference back() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01483">stl_deque.h:1483</a></div></div>
<div class="ttc" id="a01479_html_gaebe6729ab5488ecc76c762873d226857"><div class="ttname"><a href="a01479.html#gaebe6729ab5488ecc76c762873d226857">std::false_type</a></div><div class="ttdeci">integral_constant< bool, false > false_type</div><div class="ttdoc">The type used as a compile-time boolean with false value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00078">type_traits:78</a></div></div>
<div class="ttc" id="a07307_html_a0e0812f0cacd5dfd1108455df4fda375"><div class="ttname"><a href="a07307.html#a0e0812f0cacd5dfd1108455df4fda375">std::deque::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Remove element at given position.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01790">stl_deque.h:1790</a></div></div>
<div class="ttc" id="a00554_html"><div class="ttname"><a href="a00554.html">stl_iterator_base_types.h</a></div></div>
<div class="ttc" id="a07295_html_a8d2581de34cff0de15953128185cbe55"><div class="ttname"><a href="a07295.html#a8d2581de34cff0de15953128185cbe55">std::_Deque_iterator::_M_set_node</a></div><div class="ttdeci">void _M_set_node(_Map_pointer __new_node) noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00255">stl_deque.h:255</a></div></div>
<div class="ttc" id="a07307_html_a9397000b47d5f39fff457ac11a728c50"><div class="ttname"><a href="a07307.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="a07307_html_aee2b0dd83e2d5c82db3b2df6918e484a"><div class="ttname"><a href="a07307.html#aee2b0dd83e2d5c82db3b2df6918e484a">std::deque::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, _InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Inserts a range into the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01745">stl_deque.h:1745</a></div></div>
<div class="ttc" id="a07307_html_a77734a257fa1c71752517d0ae6ae707d"><div class="ttname"><a href="a07307.html#a77734a257fa1c71752517d0ae6ae707d">std::deque::operator=</a></div><div class="ttdeci">deque & operator=(deque &&__x) noexcept(_Alloc_traits::_S_always_equal())</div><div class="ttdoc">Deque move assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01079">stl_deque.h:1079</a></div></div>
<div class="ttc" id="a07307_html_a511a8f76d058f6bd0e2236abf8df23bc"><div class="ttname"><a href="a07307.html#a511a8f76d058f6bd0e2236abf8df23bc">std::deque::deque</a></div><div class="ttdeci">deque(size_type __n, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a deque with default constructed elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00918">stl_deque.h:918</a></div></div>
<div class="ttc" id="a06251_html"><div class="ttname"><a href="a06251.html">std::pointer_traits</a></div><div class="ttdoc">Uniform interface to all pointer-like types.</div><div class="ttdef"><b>Definition:</b> <a href="a00446_source.html#l00078">ptr_traits.h:78</a></div></div>
<div class="ttc" id="a07307_html_a3ea67e3e7fc5c84e92d9868bb57ae05a"><div class="ttname"><a href="a07307.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 class="ttc" id="a10159_html"><div class="ttname"><a href="a10159.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++11 allocators.</div><div class="ttdef"><b>Definition:</b> <a href="a16479_source.html#l00050">ext/alloc_traits.h:50</a></div></div>
<div class="ttc" id="a07307_html_aa261893d7576d53592700d030dedae78"><div class="ttname"><a href="a07307.html#aa261893d7576d53592700d030dedae78">std::deque::push_back</a></div><div class="ttdeci">void push_back(const value_type &__x)</div><div class="ttdoc">Add data to the end of the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01552">stl_deque.h:1552</a></div></div>
<div class="ttc" id="a07307_html"><div class="ttname"><a href="a07307.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="a07671_html"><div class="ttname"><a href="a07671.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="a07307_html_ae5172d8f3ab8a44f5f68f5d6256e5c7e"><div class="ttname"><a href="a07307.html#ae5172d8f3ab8a44f5f68f5d6256e5c7e">std::deque::front</a></div><div class="ttdeci">reference front() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01461">stl_deque.h:1461</a></div></div>
<div class="ttc" id="a07307_html_a8e7b8eb846862bae0ec76623338fa2a7"><div class="ttname"><a href="a07307.html#a8e7b8eb846862bae0ec76623338fa2a7">std::deque::~deque</a></div><div class="ttdeci">~deque()</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01054">stl_deque.h:1054</a></div></div>
<div class="ttc" id="a00308_html"><div class="ttname"><a href="a00308.html">concept_check.h</a></div></div>
<div class="ttc" id="a07307_html_a2f8d8d37581896d79e8759a827bab9e0"><div class="ttname"><a href="a07307.html#a2f8d8d37581896d79e8759a827bab9e0">std::deque::_M_reserve_elements_at_front</a></div><div class="ttdeci">iterator _M_reserve_elements_at_front(size_type __n)</div><div class="ttdoc">Memory-handling helpers for the previous internal insert functions.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l02123">stl_deque.h:2123</a></div></div>
<div class="ttc" id="a07307_html_af71a8fc9a6dff2b04bfd8b219c40a940"><div class="ttname"><a href="a07307.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="a07307_html_a5e3339e8baafd02e6d232c5b25d42d63"><div class="ttname"><a href="a07307.html#a5e3339e8baafd02e6d232c5b25d42d63">std::deque::_M_impl</a></div><div class="ttdeci">_Deque_impl _M_impl</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00634">stl_deque.h:634</a></div></div>
<div class="ttc" id="a01485_html_gae179ce2d015dc0908973644687dce4c6"><div class="ttname"><a href="a01485.html#gae179ce2d015dc0908973644687dce4c6">std::lexicographical_compare</a></div><div class="ttdeci">bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp)</div><div class="ttdoc">Performs dictionary comparison on ranges.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l01257">stl_algobase.h:1257</a></div></div>
<div class="ttc" id="a01484_html_ga8e56a22bed21e9134369f4b2a47ba407"><div class="ttname"><a href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407">std::equal</a></div><div class="ttdeci">bool equal(_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _IIter2 __last2, _BinaryPredicate __binary_pred)</div><div class="ttdoc">Tests a range for element-wise equality.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l01190">stl_algobase.h:1190</a></div></div>
<div class="ttc" id="a07307_html_af8f15e04574604071004bcdcd3be22fc"><div class="ttname"><a href="a07307.html#af8f15e04574604071004bcdcd3be22fc">std::deque::erase</a></div><div class="ttdeci">iterator erase(const_iterator __first, const_iterator __last)</div><div class="ttdoc">Remove a range of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01814">stl_deque.h:1814</a></div></div>
<div class="ttc" id="a07307_html_a513a4ab26ac9df40d7ec95fc50e1218b"><div class="ttname"><a href="a07307.html#a513a4ab26ac9df40d7ec95fc50e1218b">std::deque::operator[]</a></div><div class="ttdeci">const_reference operator[](size_type __n) const noexcept</div><div class="ttdoc">Subscript access to the data contained in the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01401">stl_deque.h:1401</a></div></div>
<div class="ttc" id="a07307_html_a5e23e99b8919a725e105786dd2bf20e9"><div class="ttname"><a href="a07307.html#a5e23e99b8919a725e105786dd2bf20e9">std::deque::push_front</a></div><div class="ttdeci">void push_front(const value_type &__x)</div><div class="ttdoc">Add data to the front of the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01515">stl_deque.h:1515</a></div></div>
<div class="ttc" id="a07307_html_ac0579ff04738a923ad49b8b9398af642"><div class="ttname"><a href="a07307.html#ac0579ff04738a923ad49b8b9398af642">std::deque::assign</a></div><div class="ttdeci">void assign(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Assigns a range to a deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01136">stl_deque.h:1136</a></div></div>
<div class="ttc" id="a07307_html_a86674e16182ecb624e854ce7a653c03e"><div class="ttname"><a href="a07307.html#a86674e16182ecb624e854ce7a653c03e">std::deque::crbegin</a></div><div class="ttdeci">const_reverse_iterator crbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01265">stl_deque.h:1265</a></div></div>
<div class="ttc" id="a07615_html"><div class="ttname"><a href="a07615.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a17145_source.html#l00101">bits/stl_iterator.h:101</a></div></div>
<div class="ttc" id="a00551_html"><div class="ttname"><a href="a00551.html">stl_iterator_base_funcs.h</a></div></div>
<div class="ttc" id="a07307_html_ad645c0144212cbfee911daa80578e997"><div class="ttname"><a href="a07307.html#ad645c0144212cbfee911daa80578e997">std::deque::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, size_type __n, const value_type &__x)</div><div class="ttdoc">Inserts a number of copies of given data into the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01709">stl_deque.h:1709</a></div></div>
<div class="ttc" id="a07307_html_a858d7660a45a911f8ae7858246ea2f6d"><div class="ttname"><a href="a07307.html#a858d7660a45a911f8ae7858246ea2f6d">std::deque::deque</a></div><div class="ttdeci">deque(size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a deque with copies of an exemplar element.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l00930">stl_deque.h:930</a></div></div>
<div class="ttc" id="a07307_html_a2cb09fae5538690a6175b6e738f39b59"><div class="ttname"><a href="a07307.html#a2cb09fae5538690a6175b6e738f39b59">std::deque::resize</a></div><div class="ttdeci">void resize(size_type __new_size)</div><div class="ttdoc">Resizes the deque to the specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01300">stl_deque.h:1300</a></div></div>
<div class="ttc" id="a07307_html_ad1986c3313eec924e6a7531929a82b8d"><div class="ttname"><a href="a07307.html#ad1986c3313eec924e6a7531929a82b8d">std::deque::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01202">stl_deque.h:1202</a></div></div>
<div class="ttc" id="a07307_html_abe9c2e87fe6d96dbbbf7f50f750d3cf2"><div class="ttname"><a href="a07307.html#abe9c2e87fe6d96dbbbf7f50f750d3cf2">std::deque::shrink_to_fit</a></div><div class="ttdeci">void shrink_to_fit() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01358">stl_deque.h:1358</a></div></div>
<div class="ttc" id="a01485_html_ga84d30d8c4b3f2cbe8ec2055c34a578da"><div class="ttname"><a href="a01485.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="a07307_html_a755a6d05ef2270de50ce270bea77250f"><div class="ttname"><a href="a07307.html#a755a6d05ef2270de50ce270bea77250f">std::deque::insert</a></div><div class="ttdeci">iterator insert(const_iterator __p, initializer_list< value_type > __l)</div><div class="ttdoc">Inserts an initializer list into the deque.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l01688">stl_deque.h:1688</a></div></div>
<div class="ttc" id="a07307_html_a8ebf868f4aae064167a0a05292b19093"><div class="ttname"><a href="a07307.html#a8ebf868f4aae064167a0a05292b19093">std::deque::_M_reserve_map_at_back</a></div><div class="ttdeci">void _M_reserve_map_at_back(size_type __nodes_to_add=1)</div><div class="ttdoc">Memory-handling helpers for the major map.</div><div class="ttdef"><b>Definition:</b> <a href="a00539_source.html#l02159">stl_deque.h:2159</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00539.html">stl_deque.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
494
