You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1208 lines
142 KiB
1208 lines
142 KiB
3 years ago
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||
|
|
|
||
|
|
<html lang="en">
|
||
|
|
|
||
|
|
<head>
|
||
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
||
|
|
<title>LCOV - test.info - 9/bits/deque.tcc</title>
|
||
|
|
<link rel="stylesheet" type="text/css" href="../../gcov.css">
|
||
|
|
</head>
|
||
|
|
|
||
|
|
<body>
|
||
|
|
|
||
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
||
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
||
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td width="100%">
|
||
|
|
<table cellpadding=1 border=0 width="100%">
|
||
|
|
<tr>
|
||
|
|
<td width="10%" class="headerItem">Current view:</td>
|
||
|
|
<td width="35%" class="headerValue"><a href="../../index.html">top level</a> - <a href="index.html">9/bits</a> - deque.tcc<span style="font-size: 80%;"> (source / <a href="deque.tcc.func-sort-c.html">functions</a>)</span></td>
|
||
|
|
<td width="5%"></td>
|
||
|
|
<td width="15%"></td>
|
||
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
||
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
||
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
||
|
|
</tr>
|
||
|
|
<tr>
|
||
|
|
<td class="headerItem">Test:</td>
|
||
|
|
<td class="headerValue">test.info</td>
|
||
|
|
<td></td>
|
||
|
|
<td class="headerItem">Lines:</td>
|
||
|
|
<td class="headerCovTableEntry">6</td>
|
||
|
|
<td class="headerCovTableEntry">49</td>
|
||
|
|
<td class="headerCovTableEntryLo">12.2 %</td>
|
||
|
|
</tr>
|
||
|
|
<tr>
|
||
|
|
<td class="headerItem">Date:</td>
|
||
|
|
<td class="headerValue">2022-06-06 23:58:34</td>
|
||
|
|
<td></td>
|
||
|
|
<td class="headerItem">Functions:</td>
|
||
|
|
<td class="headerCovTableEntry">1</td>
|
||
|
|
<td class="headerCovTableEntry">5</td>
|
||
|
|
<td class="headerCovTableEntryLo">20.0 %</td>
|
||
|
|
</tr>
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
<td></td>
|
||
|
|
<td></td>
|
||
|
|
<td class="headerItem">Branches:</td>
|
||
|
|
<td class="headerCovTableEntry">1</td>
|
||
|
|
<td class="headerCovTableEntry">12</td>
|
||
|
|
<td class="headerCovTableEntryLo">8.3 %</td>
|
||
|
|
</tr>
|
||
|
|
<tr><td><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
||
|
|
</table>
|
||
|
|
</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
||
|
|
</table>
|
||
|
|
|
||
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
||
|
|
<tr>
|
||
|
|
<td><br></td>
|
||
|
|
</tr>
|
||
|
|
<tr>
|
||
|
|
<td>
|
||
|
|
<pre class="sourceHeading"> Branch data Line data Source code</pre>
|
||
|
|
<pre class="source">
|
||
|
|
<a name="1"><span class="lineNum"> 1 </span> : : // Deque implementation (out of line) -*- C++ -*-</a>
|
||
|
|
<a name="2"><span class="lineNum"> 2 </span> : : </a>
|
||
|
|
<a name="3"><span class="lineNum"> 3 </span> : : // Copyright (C) 2001-2019 Free Software Foundation, Inc.</a>
|
||
|
|
<a name="4"><span class="lineNum"> 4 </span> : : //</a>
|
||
|
|
<a name="5"><span class="lineNum"> 5 </span> : : // This file is part of the GNU ISO C++ Library. This library is free</a>
|
||
|
|
<a name="6"><span class="lineNum"> 6 </span> : : // software; you can redistribute it and/or modify it under the</a>
|
||
|
|
<a name="7"><span class="lineNum"> 7 </span> : : // terms of the GNU General Public License as published by the</a>
|
||
|
|
<a name="8"><span class="lineNum"> 8 </span> : : // Free Software Foundation; either version 3, or (at your option)</a>
|
||
|
|
<a name="9"><span class="lineNum"> 9 </span> : : // any later version.</a>
|
||
|
|
<a name="10"><span class="lineNum"> 10 </span> : : </a>
|
||
|
|
<a name="11"><span class="lineNum"> 11 </span> : : // This library is distributed in the hope that it will be useful,</a>
|
||
|
|
<a name="12"><span class="lineNum"> 12 </span> : : // but WITHOUT ANY WARRANTY; without even the implied warranty of</a>
|
||
|
|
<a name="13"><span class="lineNum"> 13 </span> : : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</a>
|
||
|
|
<a name="14"><span class="lineNum"> 14 </span> : : // GNU General Public License for more details.</a>
|
||
|
|
<a name="15"><span class="lineNum"> 15 </span> : : </a>
|
||
|
|
<a name="16"><span class="lineNum"> 16 </span> : : // Under Section 7 of GPL version 3, you are granted additional</a>
|
||
|
|
<a name="17"><span class="lineNum"> 17 </span> : : // permissions described in the GCC Runtime Library Exception, version</a>
|
||
|
|
<a name="18"><span class="lineNum"> 18 </span> : : // 3.1, as published by the Free Software Foundation.</a>
|
||
|
|
<a name="19"><span class="lineNum"> 19 </span> : : </a>
|
||
|
|
<a name="20"><span class="lineNum"> 20 </span> : : // You should have received a copy of the GNU General Public License and</a>
|
||
|
|
<a name="21"><span class="lineNum"> 21 </span> : : // a copy of the GCC Runtime Library Exception along with this program;</a>
|
||
|
|
<a name="22"><span class="lineNum"> 22 </span> : : // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</a>
|
||
|
|
<a name="23"><span class="lineNum"> 23 </span> : : // <http://www.gnu.org/licenses/>.</a>
|
||
|
|
<a name="24"><span class="lineNum"> 24 </span> : : </a>
|
||
|
|
<a name="25"><span class="lineNum"> 25 </span> : : /*</a>
|
||
|
|
<a name="26"><span class="lineNum"> 26 </span> : : *</a>
|
||
|
|
<a name="27"><span class="lineNum"> 27 </span> : : * Copyright (c) 1994</a>
|
||
|
|
<a name="28"><span class="lineNum"> 28 </span> : : * Hewlett-Packard Company</a>
|
||
|
|
<a name="29"><span class="lineNum"> 29 </span> : : *</a>
|
||
|
|
<a name="30"><span class="lineNum"> 30 </span> : : * Permission to use, copy, modify, distribute and sell this software</a>
|
||
|
|
<a name="31"><span class="lineNum"> 31 </span> : : * and its documentation for any purpose is hereby granted without fee,</a>
|
||
|
|
<a name="32"><span class="lineNum"> 32 </span> : : * provided that the above copyright notice appear in all copies and</a>
|
||
|
|
<a name="33"><span class="lineNum"> 33 </span> : : * that both that copyright notice and this permission notice appear</a>
|
||
|
|
<a name="34"><span class="lineNum"> 34 </span> : : * in supporting documentation. Hewlett-Packard Company makes no</a>
|
||
|
|
<a name="35"><span class="lineNum"> 35 </span> : : * representations about the suitability of this software for any</a>
|
||
|
|
<a name="36"><span class="lineNum"> 36 </span> : : * purpose. It is provided "as is" without express or implied warranty.</a>
|
||
|
|
<a name="37"><span class="lineNum"> 37 </span> : : *</a>
|
||
|
|
<a name="38"><span class="lineNum"> 38 </span> : : *</a>
|
||
|
|
<a name="39"><span class="lineNum"> 39 </span> : : * Copyright (c) 1997</a>
|
||
|
|
<a name="40"><span class="lineNum"> 40 </span> : : * Silicon Graphics Computer Systems, Inc.</a>
|
||
|
|
<a name="41"><span class="lineNum"> 41 </span> : : *</a>
|
||
|
|
<a name="42"><span class="lineNum"> 42 </span> : : * Permission to use, copy, modify, distribute and sell this software</a>
|
||
|
|
<a name="43"><span class="lineNum"> 43 </span> : : * and its documentation for any purpose is hereby granted without fee,</a>
|
||
|
|
<a name="44"><span class="lineNum"> 44 </span> : : * provided that the above copyright notice appear in all copies and</a>
|
||
|
|
<a name="45"><span class="lineNum"> 45 </span> : : * that both that copyright notice and this permission notice appear</a>
|
||
|
|
<a name="46"><span class="lineNum"> 46 </span> : : * in supporting documentation. Silicon Graphics makes no</a>
|
||
|
|
<a name="47"><span class="lineNum"> 47 </span> : : * representations about the suitability of this software for any</a>
|
||
|
|
<a name="48"><span class="lineNum"> 48 </span> : : * purpose. It is provided "as is" without express or implied warranty.</a>
|
||
|
|
<a name="49"><span class="lineNum"> 49 </span> : : */</a>
|
||
|
|
<a name="50"><span class="lineNum"> 50 </span> : : </a>
|
||
|
|
<a name="51"><span class="lineNum"> 51 </span> : : /** @file bits/deque.tcc</a>
|
||
|
|
<a name="52"><span class="lineNum"> 52 </span> : : * This is an internal header file, included by other library headers.</a>
|
||
|
|
<a name="53"><span class="lineNum"> 53 </span> : : * Do not attempt to use it directly. @headername{deque}</a>
|
||
|
|
<a name="54"><span class="lineNum"> 54 </span> : : */</a>
|
||
|
|
<a name="55"><span class="lineNum"> 55 </span> : : </a>
|
||
|
|
<a name="56"><span class="lineNum"> 56 </span> : : #ifndef _DEQUE_TCC</a>
|
||
|
|
<a name="57"><span class="lineNum"> 57 </span> : : #define _DEQUE_TCC 1</a>
|
||
|
|
<a name="58"><span class="lineNum"> 58 </span> : : </a>
|
||
|
|
<a name="59"><span class="lineNum"> 59 </span> : : namespace std _GLIBCXX_VISIBILITY(default)</a>
|
||
|
|
<a name="60"><span class="lineNum"> 60 </span> : : {</a>
|
||
|
|
<a name="61"><span class="lineNum"> 61 </span> : : _GLIBCXX_BEGIN_NAMESPACE_VERSION</a>
|
||
|
|
<a name="62"><span class="lineNum"> 62 </span> : : _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</a>
|
||
|
|
<a name="63"><span class="lineNum"> 63 </span> : : </a>
|
||
|
|
<a name="64"><span class="lineNum"> 64 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="65"><span class="lineNum"> 65 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="66"><span class="lineNum"> 66 </span> : : void</a>
|
||
|
|
<a name="67"><span class="lineNum"> 67 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="68"><span class="lineNum"> 68 </span> : : _M_default_initialize()</a>
|
||
|
|
<a name="69"><span class="lineNum"> 69 </span> : : {</a>
|
||
|
|
<a name="70"><span class="lineNum"> 70 </span> : : _Map_pointer __cur;</a>
|
||
|
|
<a name="71"><span class="lineNum"> 71 </span> : : __try</a>
|
||
|
|
<a name="72"><span class="lineNum"> 72 </span> : : {</a>
|
||
|
|
<a name="73"><span class="lineNum"> 73 </span> : : for (__cur = this->_M_impl._M_start._M_node;</a>
|
||
|
|
<a name="74"><span class="lineNum"> 74 </span> : : __cur < this->_M_impl._M_finish._M_node;</a>
|
||
|
|
<a name="75"><span class="lineNum"> 75 </span> : : ++__cur)</a>
|
||
|
|
<a name="76"><span class="lineNum"> 76 </span> : : std::__uninitialized_default_a(*__cur, *__cur + _S_buffer_size(),</a>
|
||
|
|
<a name="77"><span class="lineNum"> 77 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="78"><span class="lineNum"> 78 </span> : : std::__uninitialized_default_a(this->_M_impl._M_finish._M_first,</a>
|
||
|
|
<a name="79"><span class="lineNum"> 79 </span> : : this->_M_impl._M_finish._M_cur,</a>
|
||
|
|
<a name="80"><span class="lineNum"> 80 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="81"><span class="lineNum"> 81 </span> : : }</a>
|
||
|
|
<a name="82"><span class="lineNum"> 82 </span> : : __catch(...)</a>
|
||
|
|
<a name="83"><span class="lineNum"> 83 </span> : : {</a>
|
||
|
|
<a name="84"><span class="lineNum"> 84 </span> : : std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur),</a>
|
||
|
|
<a name="85"><span class="lineNum"> 85 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="86"><span class="lineNum"> 86 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="87"><span class="lineNum"> 87 </span> : : }</a>
|
||
|
|
<a name="88"><span class="lineNum"> 88 </span> : : }</a>
|
||
|
|
<a name="89"><span class="lineNum"> 89 </span> : : #endif</a>
|
||
|
|
<a name="90"><span class="lineNum"> 90 </span> : : </a>
|
||
|
|
<a name="91"><span class="lineNum"> 91 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="92"><span class="lineNum"> 92 </span> : : deque<_Tp, _Alloc>&</a>
|
||
|
|
<a name="93"><span class="lineNum"> 93 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="94"><span class="lineNum"> 94 </span> : : operator=(const deque& __x)</a>
|
||
|
|
<a name="95"><span class="lineNum"> 95 </span> : : {</a>
|
||
|
|
<a name="96"><span class="lineNum"> 96 </span> : : if (&__x != this)</a>
|
||
|
|
<a name="97"><span class="lineNum"> 97 </span> : : {</a>
|
||
|
|
<a name="98"><span class="lineNum"> 98 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="99"><span class="lineNum"> 99 </span> : : if (_Alloc_traits::_S_propagate_on_copy_assign())</a>
|
||
|
|
<a name="100"><span class="lineNum"> 100 </span> : : {</a>
|
||
|
|
<a name="101"><span class="lineNum"> 101 </span> : : if (!_Alloc_traits::_S_always_equal()</a>
|
||
|
|
<a name="102"><span class="lineNum"> 102 </span> : : && _M_get_Tp_allocator() != __x._M_get_Tp_allocator())</a>
|
||
|
|
<a name="103"><span class="lineNum"> 103 </span> : : {</a>
|
||
|
|
<a name="104"><span class="lineNum"> 104 </span> : : // Replacement allocator cannot free existing storage,</a>
|
||
|
|
<a name="105"><span class="lineNum"> 105 </span> : : // so deallocate everything and take copy of __x's data.</a>
|
||
|
|
<a name="106"><span class="lineNum"> 106 </span> : : _M_replace_map(__x, __x.get_allocator());</a>
|
||
|
|
<a name="107"><span class="lineNum"> 107 </span> : : std::__alloc_on_copy(_M_get_Tp_allocator(),</a>
|
||
|
|
<a name="108"><span class="lineNum"> 108 </span> : : __x._M_get_Tp_allocator());</a>
|
||
|
|
<a name="109"><span class="lineNum"> 109 </span> : : return *this;</a>
|
||
|
|
<a name="110"><span class="lineNum"> 110 </span> : : }</a>
|
||
|
|
<a name="111"><span class="lineNum"> 111 </span> : : std::__alloc_on_copy(_M_get_Tp_allocator(),</a>
|
||
|
|
<a name="112"><span class="lineNum"> 112 </span> : : __x._M_get_Tp_allocator());</a>
|
||
|
|
<a name="113"><span class="lineNum"> 113 </span> : : }</a>
|
||
|
|
<a name="114"><span class="lineNum"> 114 </span> : : #endif</a>
|
||
|
|
<a name="115"><span class="lineNum"> 115 </span> : : const size_type __len = size();</a>
|
||
|
|
<a name="116"><span class="lineNum"> 116 </span> : : if (__len >= __x.size())</a>
|
||
|
|
<a name="117"><span class="lineNum"> 117 </span> : : _M_erase_at_end(std::copy(__x.begin(), __x.end(),</a>
|
||
|
|
<a name="118"><span class="lineNum"> 118 </span> : : this->_M_impl._M_start));</a>
|
||
|
|
<a name="119"><span class="lineNum"> 119 </span> : : else</a>
|
||
|
|
<a name="120"><span class="lineNum"> 120 </span> : : {</a>
|
||
|
|
<a name="121"><span class="lineNum"> 121 </span> : : const_iterator __mid = __x.begin() + difference_type(__len);</a>
|
||
|
|
<a name="122"><span class="lineNum"> 122 </span> : : std::copy(__x.begin(), __mid, this->_M_impl._M_start);</a>
|
||
|
|
<a name="123"><span class="lineNum"> 123 </span> : : _M_range_insert_aux(this->_M_impl._M_finish, __mid, __x.end(),</a>
|
||
|
|
<a name="124"><span class="lineNum"> 124 </span> : : std::random_access_iterator_tag());</a>
|
||
|
|
<a name="125"><span class="lineNum"> 125 </span> : : }</a>
|
||
|
|
<a name="126"><span class="lineNum"> 126 </span> : : }</a>
|
||
|
|
<a name="127"><span class="lineNum"> 127 </span> : : return *this;</a>
|
||
|
|
<a name="128"><span class="lineNum"> 128 </span> : : }</a>
|
||
|
|
<a name="129"><span class="lineNum"> 129 </span> : : </a>
|
||
|
|
<a name="130"><span class="lineNum"> 130 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="131"><span class="lineNum"> 131 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="132"><span class="lineNum"> 132 </span> : : template<typename... _Args></a>
|
||
|
|
<a name="133"><span class="lineNum"> 133 </span> : : #if __cplusplus > 201402L</a>
|
||
|
|
<a name="134"><span class="lineNum"> 134 </span> : : typename deque<_Tp, _Alloc>::reference</a>
|
||
|
|
<a name="135"><span class="lineNum"> 135 </span> : : #else</a>
|
||
|
|
<a name="136"><span class="lineNum"> 136 </span> : : void</a>
|
||
|
|
<a name="137"><span class="lineNum"> 137 </span> : : #endif</a>
|
||
|
|
<a name="138"><span class="lineNum"> 138 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="139"><span class="lineNum"> 139 </span> : : emplace_front(_Args&&... __args)</a>
|
||
|
|
<a name="140"><span class="lineNum"> 140 </span> : : {</a>
|
||
|
|
<a name="141"><span class="lineNum"> 141 </span> : : if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first)</a>
|
||
|
|
<a name="142"><span class="lineNum"> 142 </span> : : {</a>
|
||
|
|
<a name="143"><span class="lineNum"> 143 </span> : : _Alloc_traits::construct(this->_M_impl,</a>
|
||
|
|
<a name="144"><span class="lineNum"> 144 </span> : : this->_M_impl._M_start._M_cur - 1,</a>
|
||
|
|
<a name="145"><span class="lineNum"> 145 </span> : : std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="146"><span class="lineNum"> 146 </span> : : --this->_M_impl._M_start._M_cur;</a>
|
||
|
|
<a name="147"><span class="lineNum"> 147 </span> : : }</a>
|
||
|
|
<a name="148"><span class="lineNum"> 148 </span> : : else</a>
|
||
|
|
<a name="149"><span class="lineNum"> 149 </span> : : _M_push_front_aux(std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="150"><span class="lineNum"> 150 </span> : : #if __cplusplus > 201402L</a>
|
||
|
|
<a name="151"><span class="lineNum"> 151 </span> : : return front();</a>
|
||
|
|
<a name="152"><span class="lineNum"> 152 </span> : : #endif</a>
|
||
|
|
<a name="153"><span class="lineNum"> 153 </span> : : }</a>
|
||
|
|
<a name="154"><span class="lineNum"> 154 </span> : : </a>
|
||
|
|
<a name="155"><span class="lineNum"> 155 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="156"><span class="lineNum"> 156 </span> : : template<typename... _Args></a>
|
||
|
|
<a name="157"><span class="lineNum"> 157 </span> : : #if __cplusplus > 201402L</a>
|
||
|
|
<a name="158"><span class="lineNum"> 158 </span> : : typename deque<_Tp, _Alloc>::reference</a>
|
||
|
|
<a name="159"><span class="lineNum"> 159 </span> : : #else</a>
|
||
|
|
<a name="160"><span class="lineNum"> 160 </span> : : void</a>
|
||
|
|
<a name="161"><span class="lineNum"> 161 </span> : : #endif</a>
|
||
|
|
<a name="162"><span class="lineNum"> 162 </span> :<span class="lineCov"> 3 : deque<_Tp, _Alloc>::</span></a>
|
||
|
|
<a name="163"><span class="lineNum"> 163 </span> : : emplace_back(_Args&&... __args)</a>
|
||
|
|
<a name="164"><span class="lineNum"> 164 </span> : : {</a>
|
||
|
|
<a name="165"><span class="lineNum"> 165 </span> :<span class="lineCov"> 3 : if (this->_M_impl._M_finish._M_cur</span></a>
|
||
|
|
<a name="166"><span class="lineNum"> 166 </span> [<span class="branchCov" title="Branch 0 was taken 3 times"> + </span><span class="branchNoCov" title="Branch 1 was not taken"> - </span>]:<span class="lineCov"> 3 : != this->_M_impl._M_finish._M_last - 1)</span></a>
|
||
|
|
<a name="167"><span class="lineNum"> 167 </span> : : {</a>
|
||
|
|
<a name="168"><span class="lineNum"> 168 </span> :<span class="lineCov"> 3 : _Alloc_traits::construct(this->_M_impl,</span></a>
|
||
|
|
<a name="169"><span class="lineNum"> 169 </span> : : this->_M_impl._M_finish._M_cur,</a>
|
||
|
|
<a name="170"><span class="lineNum"> 170 </span> : : std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="171"><span class="lineNum"> 171 </span> :<span class="lineCov"> 3 : ++this->_M_impl._M_finish._M_cur;</span></a>
|
||
|
|
<a name="172"><span class="lineNum"> 172 </span> : : }</a>
|
||
|
|
<a name="173"><span class="lineNum"> 173 </span> : : else</a>
|
||
|
|
<a name="174"><span class="lineNum"> 174 </span> :<span class="lineNoCov"> 0 : _M_push_back_aux(std::forward<_Args>(__args)...);</span></a>
|
||
|
|
<a name="175"><span class="lineNum"> 175 </span> : : #if __cplusplus > 201402L</a>
|
||
|
|
<a name="176"><span class="lineNum"> 176 </span> : : return back();</a>
|
||
|
|
<a name="177"><span class="lineNum"> 177 </span> : : #endif</a>
|
||
|
|
<a name="178"><span class="lineNum"> 178 </span> :<span class="lineCov"> 3 : }</span></a>
|
||
|
|
<a name="179"><span class="lineNum"> 179 </span> : : #endif</a>
|
||
|
|
<a name="180"><span class="lineNum"> 180 </span> : : </a>
|
||
|
|
<a name="181"><span class="lineNum"> 181 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="182"><span class="lineNum"> 182 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="183"><span class="lineNum"> 183 </span> : : template<typename... _Args></a>
|
||
|
|
<a name="184"><span class="lineNum"> 184 </span> : : typename deque<_Tp, _Alloc>::iterator</a>
|
||
|
|
<a name="185"><span class="lineNum"> 185 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="186"><span class="lineNum"> 186 </span> : : emplace(const_iterator __position, _Args&&... __args)</a>
|
||
|
|
<a name="187"><span class="lineNum"> 187 </span> : : {</a>
|
||
|
|
<a name="188"><span class="lineNum"> 188 </span> : : if (__position._M_cur == this->_M_impl._M_start._M_cur)</a>
|
||
|
|
<a name="189"><span class="lineNum"> 189 </span> : : {</a>
|
||
|
|
<a name="190"><span class="lineNum"> 190 </span> : : emplace_front(std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="191"><span class="lineNum"> 191 </span> : : return this->_M_impl._M_start;</a>
|
||
|
|
<a name="192"><span class="lineNum"> 192 </span> : : }</a>
|
||
|
|
<a name="193"><span class="lineNum"> 193 </span> : : else if (__position._M_cur == this->_M_impl._M_finish._M_cur)</a>
|
||
|
|
<a name="194"><span class="lineNum"> 194 </span> : : {</a>
|
||
|
|
<a name="195"><span class="lineNum"> 195 </span> : : emplace_back(std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="196"><span class="lineNum"> 196 </span> : : iterator __tmp = this->_M_impl._M_finish;</a>
|
||
|
|
<a name="197"><span class="lineNum"> 197 </span> : : --__tmp;</a>
|
||
|
|
<a name="198"><span class="lineNum"> 198 </span> : : return __tmp;</a>
|
||
|
|
<a name="199"><span class="lineNum"> 199 </span> : : }</a>
|
||
|
|
<a name="200"><span class="lineNum"> 200 </span> : : else</a>
|
||
|
|
<a name="201"><span class="lineNum"> 201 </span> : : return _M_insert_aux(__position._M_const_cast(),</a>
|
||
|
|
<a name="202"><span class="lineNum"> 202 </span> : : std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="203"><span class="lineNum"> 203 </span> : : }</a>
|
||
|
|
<a name="204"><span class="lineNum"> 204 </span> : : #endif</a>
|
||
|
|
<a name="205"><span class="lineNum"> 205 </span> : : </a>
|
||
|
|
<a name="206"><span class="lineNum"> 206 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="207"><span class="lineNum"> 207 </span> : : typename deque<_Tp, _Alloc>::iterator</a>
|
||
|
|
<a name="208"><span class="lineNum"> 208 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="209"><span class="lineNum"> 209 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="210"><span class="lineNum"> 210 </span> : : insert(const_iterator __position, const value_type& __x)</a>
|
||
|
|
<a name="211"><span class="lineNum"> 211 </span> : : #else</a>
|
||
|
|
<a name="212"><span class="lineNum"> 212 </span> : : insert(iterator __position, const value_type& __x)</a>
|
||
|
|
<a name="213"><span class="lineNum"> 213 </span> : : #endif</a>
|
||
|
|
<a name="214"><span class="lineNum"> 214 </span> : : {</a>
|
||
|
|
<a name="215"><span class="lineNum"> 215 </span> : : if (__position._M_cur == this->_M_impl._M_start._M_cur)</a>
|
||
|
|
<a name="216"><span class="lineNum"> 216 </span> : : {</a>
|
||
|
|
<a name="217"><span class="lineNum"> 217 </span> : : push_front(__x);</a>
|
||
|
|
<a name="218"><span class="lineNum"> 218 </span> : : return this->_M_impl._M_start;</a>
|
||
|
|
<a name="219"><span class="lineNum"> 219 </span> : : }</a>
|
||
|
|
<a name="220"><span class="lineNum"> 220 </span> : : else if (__position._M_cur == this->_M_impl._M_finish._M_cur)</a>
|
||
|
|
<a name="221"><span class="lineNum"> 221 </span> : : {</a>
|
||
|
|
<a name="222"><span class="lineNum"> 222 </span> : : push_back(__x);</a>
|
||
|
|
<a name="223"><span class="lineNum"> 223 </span> : : iterator __tmp = this->_M_impl._M_finish;</a>
|
||
|
|
<a name="224"><span class="lineNum"> 224 </span> : : --__tmp;</a>
|
||
|
|
<a name="225"><span class="lineNum"> 225 </span> : : return __tmp;</a>
|
||
|
|
<a name="226"><span class="lineNum"> 226 </span> : : }</a>
|
||
|
|
<a name="227"><span class="lineNum"> 227 </span> : : else</a>
|
||
|
|
<a name="228"><span class="lineNum"> 228 </span> : : return _M_insert_aux(__position._M_const_cast(), __x);</a>
|
||
|
|
<a name="229"><span class="lineNum"> 229 </span> : : }</a>
|
||
|
|
<a name="230"><span class="lineNum"> 230 </span> : : </a>
|
||
|
|
<a name="231"><span class="lineNum"> 231 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="232"><span class="lineNum"> 232 </span> : : typename deque<_Tp, _Alloc>::iterator</a>
|
||
|
|
<a name="233"><span class="lineNum"> 233 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="234"><span class="lineNum"> 234 </span> : : _M_erase(iterator __position)</a>
|
||
|
|
<a name="235"><span class="lineNum"> 235 </span> : : {</a>
|
||
|
|
<a name="236"><span class="lineNum"> 236 </span> : : iterator __next = __position;</a>
|
||
|
|
<a name="237"><span class="lineNum"> 237 </span> : : ++__next;</a>
|
||
|
|
<a name="238"><span class="lineNum"> 238 </span> : : const difference_type __index = __position - begin();</a>
|
||
|
|
<a name="239"><span class="lineNum"> 239 </span> : : if (static_cast<size_type>(__index) < (size() >> 1))</a>
|
||
|
|
<a name="240"><span class="lineNum"> 240 </span> : : {</a>
|
||
|
|
<a name="241"><span class="lineNum"> 241 </span> : : if (__position != begin())</a>
|
||
|
|
<a name="242"><span class="lineNum"> 242 </span> : : _GLIBCXX_MOVE_BACKWARD3(begin(), __position, __next);</a>
|
||
|
|
<a name="243"><span class="lineNum"> 243 </span> : : pop_front();</a>
|
||
|
|
<a name="244"><span class="lineNum"> 244 </span> : : }</a>
|
||
|
|
<a name="245"><span class="lineNum"> 245 </span> : : else</a>
|
||
|
|
<a name="246"><span class="lineNum"> 246 </span> : : {</a>
|
||
|
|
<a name="247"><span class="lineNum"> 247 </span> : : if (__next != end())</a>
|
||
|
|
<a name="248"><span class="lineNum"> 248 </span> : : _GLIBCXX_MOVE3(__next, end(), __position);</a>
|
||
|
|
<a name="249"><span class="lineNum"> 249 </span> : : pop_back();</a>
|
||
|
|
<a name="250"><span class="lineNum"> 250 </span> : : }</a>
|
||
|
|
<a name="251"><span class="lineNum"> 251 </span> : : return begin() + __index;</a>
|
||
|
|
<a name="252"><span class="lineNum"> 252 </span> : : }</a>
|
||
|
|
<a name="253"><span class="lineNum"> 253 </span> : : </a>
|
||
|
|
<a name="254"><span class="lineNum"> 254 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="255"><span class="lineNum"> 255 </span> : : typename deque<_Tp, _Alloc>::iterator</a>
|
||
|
|
<a name="256"><span class="lineNum"> 256 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="257"><span class="lineNum"> 257 </span> : : _M_erase(iterator __first, iterator __last)</a>
|
||
|
|
<a name="258"><span class="lineNum"> 258 </span> : : {</a>
|
||
|
|
<a name="259"><span class="lineNum"> 259 </span> : : if (__first == __last)</a>
|
||
|
|
<a name="260"><span class="lineNum"> 260 </span> : : return __first;</a>
|
||
|
|
<a name="261"><span class="lineNum"> 261 </span> : : else if (__first == begin() && __last == end())</a>
|
||
|
|
<a name="262"><span class="lineNum"> 262 </span> : : {</a>
|
||
|
|
<a name="263"><span class="lineNum"> 263 </span> : : clear();</a>
|
||
|
|
<a name="264"><span class="lineNum"> 264 </span> : : return end();</a>
|
||
|
|
<a name="265"><span class="lineNum"> 265 </span> : : }</a>
|
||
|
|
<a name="266"><span class="lineNum"> 266 </span> : : else</a>
|
||
|
|
<a name="267"><span class="lineNum"> 267 </span> : : {</a>
|
||
|
|
<a name="268"><span class="lineNum"> 268 </span> : : const difference_type __n = __last - __first;</a>
|
||
|
|
<a name="269"><span class="lineNum"> 269 </span> : : const difference_type __elems_before = __first - begin();</a>
|
||
|
|
<a name="270"><span class="lineNum"> 270 </span> : : if (static_cast<size_type>(__elems_before) <= (size() - __n) / 2)</a>
|
||
|
|
<a name="271"><span class="lineNum"> 271 </span> : : {</a>
|
||
|
|
<a name="272"><span class="lineNum"> 272 </span> : : if (__first != begin())</a>
|
||
|
|
<a name="273"><span class="lineNum"> 273 </span> : : _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);</a>
|
||
|
|
<a name="274"><span class="lineNum"> 274 </span> : : _M_erase_at_begin(begin() + __n);</a>
|
||
|
|
<a name="275"><span class="lineNum"> 275 </span> : : }</a>
|
||
|
|
<a name="276"><span class="lineNum"> 276 </span> : : else</a>
|
||
|
|
<a name="277"><span class="lineNum"> 277 </span> : : {</a>
|
||
|
|
<a name="278"><span class="lineNum"> 278 </span> : : if (__last != end())</a>
|
||
|
|
<a name="279"><span class="lineNum"> 279 </span> : : _GLIBCXX_MOVE3(__last, end(), __first);</a>
|
||
|
|
<a name="280"><span class="lineNum"> 280 </span> : : _M_erase_at_end(end() - __n);</a>
|
||
|
|
<a name="281"><span class="lineNum"> 281 </span> : : }</a>
|
||
|
|
<a name="282"><span class="lineNum"> 282 </span> : : return begin() + __elems_before;</a>
|
||
|
|
<a name="283"><span class="lineNum"> 283 </span> : : }</a>
|
||
|
|
<a name="284"><span class="lineNum"> 284 </span> : : }</a>
|
||
|
|
<a name="285"><span class="lineNum"> 285 </span> : : </a>
|
||
|
|
<a name="286"><span class="lineNum"> 286 </span> : : template <typename _Tp, class _Alloc></a>
|
||
|
|
<a name="287"><span class="lineNum"> 287 </span> : : template <typename _InputIterator></a>
|
||
|
|
<a name="288"><span class="lineNum"> 288 </span> : : void</a>
|
||
|
|
<a name="289"><span class="lineNum"> 289 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="290"><span class="lineNum"> 290 </span> : : _M_assign_aux(_InputIterator __first, _InputIterator __last,</a>
|
||
|
|
<a name="291"><span class="lineNum"> 291 </span> : : std::input_iterator_tag)</a>
|
||
|
|
<a name="292"><span class="lineNum"> 292 </span> : : {</a>
|
||
|
|
<a name="293"><span class="lineNum"> 293 </span> : : iterator __cur = begin();</a>
|
||
|
|
<a name="294"><span class="lineNum"> 294 </span> : : for (; __first != __last && __cur != end(); ++__cur, (void)++__first)</a>
|
||
|
|
<a name="295"><span class="lineNum"> 295 </span> : : *__cur = *__first;</a>
|
||
|
|
<a name="296"><span class="lineNum"> 296 </span> : : if (__first == __last)</a>
|
||
|
|
<a name="297"><span class="lineNum"> 297 </span> : : _M_erase_at_end(__cur);</a>
|
||
|
|
<a name="298"><span class="lineNum"> 298 </span> : : else</a>
|
||
|
|
<a name="299"><span class="lineNum"> 299 </span> : : _M_range_insert_aux(end(), __first, __last,</a>
|
||
|
|
<a name="300"><span class="lineNum"> 300 </span> : : std::__iterator_category(__first));</a>
|
||
|
|
<a name="301"><span class="lineNum"> 301 </span> : : }</a>
|
||
|
|
<a name="302"><span class="lineNum"> 302 </span> : : </a>
|
||
|
|
<a name="303"><span class="lineNum"> 303 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="304"><span class="lineNum"> 304 </span> : : void</a>
|
||
|
|
<a name="305"><span class="lineNum"> 305 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="306"><span class="lineNum"> 306 </span> : : _M_fill_insert(iterator __pos, size_type __n, const value_type& __x)</a>
|
||
|
|
<a name="307"><span class="lineNum"> 307 </span> : : {</a>
|
||
|
|
<a name="308"><span class="lineNum"> 308 </span> : : if (__pos._M_cur == this->_M_impl._M_start._M_cur)</a>
|
||
|
|
<a name="309"><span class="lineNum"> 309 </span> : : {</a>
|
||
|
|
<a name="310"><span class="lineNum"> 310 </span> : : iterator __new_start = _M_reserve_elements_at_front(__n);</a>
|
||
|
|
<a name="311"><span class="lineNum"> 311 </span> : : __try</a>
|
||
|
|
<a name="312"><span class="lineNum"> 312 </span> : : {</a>
|
||
|
|
<a name="313"><span class="lineNum"> 313 </span> : : std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start,</a>
|
||
|
|
<a name="314"><span class="lineNum"> 314 </span> : : __x, _M_get_Tp_allocator());</a>
|
||
|
|
<a name="315"><span class="lineNum"> 315 </span> : : this->_M_impl._M_start = __new_start;</a>
|
||
|
|
<a name="316"><span class="lineNum"> 316 </span> : : }</a>
|
||
|
|
<a name="317"><span class="lineNum"> 317 </span> : : __catch(...)</a>
|
||
|
|
<a name="318"><span class="lineNum"> 318 </span> : : {</a>
|
||
|
|
<a name="319"><span class="lineNum"> 319 </span> : : _M_destroy_nodes(__new_start._M_node,</a>
|
||
|
|
<a name="320"><span class="lineNum"> 320 </span> : : this->_M_impl._M_start._M_node);</a>
|
||
|
|
<a name="321"><span class="lineNum"> 321 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="322"><span class="lineNum"> 322 </span> : : }</a>
|
||
|
|
<a name="323"><span class="lineNum"> 323 </span> : : }</a>
|
||
|
|
<a name="324"><span class="lineNum"> 324 </span> : : else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)</a>
|
||
|
|
<a name="325"><span class="lineNum"> 325 </span> : : {</a>
|
||
|
|
<a name="326"><span class="lineNum"> 326 </span> : : iterator __new_finish = _M_reserve_elements_at_back(__n);</a>
|
||
|
|
<a name="327"><span class="lineNum"> 327 </span> : : __try</a>
|
||
|
|
<a name="328"><span class="lineNum"> 328 </span> : : {</a>
|
||
|
|
<a name="329"><span class="lineNum"> 329 </span> : : std::__uninitialized_fill_a(this->_M_impl._M_finish,</a>
|
||
|
|
<a name="330"><span class="lineNum"> 330 </span> : : __new_finish, __x,</a>
|
||
|
|
<a name="331"><span class="lineNum"> 331 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="332"><span class="lineNum"> 332 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="333"><span class="lineNum"> 333 </span> : : }</a>
|
||
|
|
<a name="334"><span class="lineNum"> 334 </span> : : __catch(...)</a>
|
||
|
|
<a name="335"><span class="lineNum"> 335 </span> : : {</a>
|
||
|
|
<a name="336"><span class="lineNum"> 336 </span> : : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</a>
|
||
|
|
<a name="337"><span class="lineNum"> 337 </span> : : __new_finish._M_node + 1);</a>
|
||
|
|
<a name="338"><span class="lineNum"> 338 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="339"><span class="lineNum"> 339 </span> : : }</a>
|
||
|
|
<a name="340"><span class="lineNum"> 340 </span> : : }</a>
|
||
|
|
<a name="341"><span class="lineNum"> 341 </span> : : else</a>
|
||
|
|
<a name="342"><span class="lineNum"> 342 </span> : : _M_insert_aux(__pos, __n, __x);</a>
|
||
|
|
<a name="343"><span class="lineNum"> 343 </span> : : }</a>
|
||
|
|
<a name="344"><span class="lineNum"> 344 </span> : : </a>
|
||
|
|
<a name="345"><span class="lineNum"> 345 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="346"><span class="lineNum"> 346 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="347"><span class="lineNum"> 347 </span> : : void</a>
|
||
|
|
<a name="348"><span class="lineNum"> 348 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="349"><span class="lineNum"> 349 </span> : : _M_default_append(size_type __n)</a>
|
||
|
|
<a name="350"><span class="lineNum"> 350 </span> : : {</a>
|
||
|
|
<a name="351"><span class="lineNum"> 351 </span> : : if (__n)</a>
|
||
|
|
<a name="352"><span class="lineNum"> 352 </span> : : {</a>
|
||
|
|
<a name="353"><span class="lineNum"> 353 </span> : : iterator __new_finish = _M_reserve_elements_at_back(__n);</a>
|
||
|
|
<a name="354"><span class="lineNum"> 354 </span> : : __try</a>
|
||
|
|
<a name="355"><span class="lineNum"> 355 </span> : : {</a>
|
||
|
|
<a name="356"><span class="lineNum"> 356 </span> : : std::__uninitialized_default_a(this->_M_impl._M_finish,</a>
|
||
|
|
<a name="357"><span class="lineNum"> 357 </span> : : __new_finish,</a>
|
||
|
|
<a name="358"><span class="lineNum"> 358 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="359"><span class="lineNum"> 359 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="360"><span class="lineNum"> 360 </span> : : }</a>
|
||
|
|
<a name="361"><span class="lineNum"> 361 </span> : : __catch(...)</a>
|
||
|
|
<a name="362"><span class="lineNum"> 362 </span> : : {</a>
|
||
|
|
<a name="363"><span class="lineNum"> 363 </span> : : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</a>
|
||
|
|
<a name="364"><span class="lineNum"> 364 </span> : : __new_finish._M_node + 1);</a>
|
||
|
|
<a name="365"><span class="lineNum"> 365 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="366"><span class="lineNum"> 366 </span> : : }</a>
|
||
|
|
<a name="367"><span class="lineNum"> 367 </span> : : }</a>
|
||
|
|
<a name="368"><span class="lineNum"> 368 </span> : : }</a>
|
||
|
|
<a name="369"><span class="lineNum"> 369 </span> : : </a>
|
||
|
|
<a name="370"><span class="lineNum"> 370 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="371"><span class="lineNum"> 371 </span> : : bool</a>
|
||
|
|
<a name="372"><span class="lineNum"> 372 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="373"><span class="lineNum"> 373 </span> : : _M_shrink_to_fit()</a>
|
||
|
|
<a name="374"><span class="lineNum"> 374 </span> : : {</a>
|
||
|
|
<a name="375"><span class="lineNum"> 375 </span> : : const difference_type __front_capacity</a>
|
||
|
|
<a name="376"><span class="lineNum"> 376 </span> : : = (this->_M_impl._M_start._M_cur - this->_M_impl._M_start._M_first);</a>
|
||
|
|
<a name="377"><span class="lineNum"> 377 </span> : : if (__front_capacity == 0)</a>
|
||
|
|
<a name="378"><span class="lineNum"> 378 </span> : : return false;</a>
|
||
|
|
<a name="379"><span class="lineNum"> 379 </span> : : </a>
|
||
|
|
<a name="380"><span class="lineNum"> 380 </span> : : const difference_type __back_capacity</a>
|
||
|
|
<a name="381"><span class="lineNum"> 381 </span> : : = (this->_M_impl._M_finish._M_last - this->_M_impl._M_finish._M_cur);</a>
|
||
|
|
<a name="382"><span class="lineNum"> 382 </span> : : if (__front_capacity + __back_capacity < _S_buffer_size())</a>
|
||
|
|
<a name="383"><span class="lineNum"> 383 </span> : : return false;</a>
|
||
|
|
<a name="384"><span class="lineNum"> 384 </span> : : </a>
|
||
|
|
<a name="385"><span class="lineNum"> 385 </span> : : return std::__shrink_to_fit_aux<deque>::_S_do_it(*this);</a>
|
||
|
|
<a name="386"><span class="lineNum"> 386 </span> : : }</a>
|
||
|
|
<a name="387"><span class="lineNum"> 387 </span> : : #endif</a>
|
||
|
|
<a name="388"><span class="lineNum"> 388 </span> : : </a>
|
||
|
|
<a name="389"><span class="lineNum"> 389 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="390"><span class="lineNum"> 390 </span> : : void</a>
|
||
|
|
<a name="391"><span class="lineNum"> 391 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="392"><span class="lineNum"> 392 </span> : : _M_fill_initialize(const value_type& __value)</a>
|
||
|
|
<a name="393"><span class="lineNum"> 393 </span> : : {</a>
|
||
|
|
<a name="394"><span class="lineNum"> 394 </span> : : _Map_pointer __cur;</a>
|
||
|
|
<a name="395"><span class="lineNum"> 395 </span> : : __try</a>
|
||
|
|
<a name="396"><span class="lineNum"> 396 </span> : : {</a>
|
||
|
|
<a name="397"><span class="lineNum"> 397 </span> : : for (__cur = this->_M_impl._M_start._M_node;</a>
|
||
|
|
<a name="398"><span class="lineNum"> 398 </span> : : __cur < this->_M_impl._M_finish._M_node;</a>
|
||
|
|
<a name="399"><span class="lineNum"> 399 </span> : : ++__cur)</a>
|
||
|
|
<a name="400"><span class="lineNum"> 400 </span> : : std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(),</a>
|
||
|
|
<a name="401"><span class="lineNum"> 401 </span> : : __value, _M_get_Tp_allocator());</a>
|
||
|
|
<a name="402"><span class="lineNum"> 402 </span> : : std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first,</a>
|
||
|
|
<a name="403"><span class="lineNum"> 403 </span> : : this->_M_impl._M_finish._M_cur,</a>
|
||
|
|
<a name="404"><span class="lineNum"> 404 </span> : : __value, _M_get_Tp_allocator());</a>
|
||
|
|
<a name="405"><span class="lineNum"> 405 </span> : : }</a>
|
||
|
|
<a name="406"><span class="lineNum"> 406 </span> : : __catch(...)</a>
|
||
|
|
<a name="407"><span class="lineNum"> 407 </span> : : {</a>
|
||
|
|
<a name="408"><span class="lineNum"> 408 </span> : : std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur),</a>
|
||
|
|
<a name="409"><span class="lineNum"> 409 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="410"><span class="lineNum"> 410 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="411"><span class="lineNum"> 411 </span> : : }</a>
|
||
|
|
<a name="412"><span class="lineNum"> 412 </span> : : }</a>
|
||
|
|
<a name="413"><span class="lineNum"> 413 </span> : : </a>
|
||
|
|
<a name="414"><span class="lineNum"> 414 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="415"><span class="lineNum"> 415 </span> : : template <typename _InputIterator></a>
|
||
|
|
<a name="416"><span class="lineNum"> 416 </span> : : void</a>
|
||
|
|
<a name="417"><span class="lineNum"> 417 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="418"><span class="lineNum"> 418 </span> : : _M_range_initialize(_InputIterator __first, _InputIterator __last,</a>
|
||
|
|
<a name="419"><span class="lineNum"> 419 </span> : : std::input_iterator_tag)</a>
|
||
|
|
<a name="420"><span class="lineNum"> 420 </span> : : {</a>
|
||
|
|
<a name="421"><span class="lineNum"> 421 </span> : : this->_M_initialize_map(0);</a>
|
||
|
|
<a name="422"><span class="lineNum"> 422 </span> : : __try</a>
|
||
|
|
<a name="423"><span class="lineNum"> 423 </span> : : {</a>
|
||
|
|
<a name="424"><span class="lineNum"> 424 </span> : : for (; __first != __last; ++__first)</a>
|
||
|
|
<a name="425"><span class="lineNum"> 425 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="426"><span class="lineNum"> 426 </span> : : emplace_back(*__first);</a>
|
||
|
|
<a name="427"><span class="lineNum"> 427 </span> : : #else</a>
|
||
|
|
<a name="428"><span class="lineNum"> 428 </span> : : push_back(*__first);</a>
|
||
|
|
<a name="429"><span class="lineNum"> 429 </span> : : #endif</a>
|
||
|
|
<a name="430"><span class="lineNum"> 430 </span> : : }</a>
|
||
|
|
<a name="431"><span class="lineNum"> 431 </span> : : __catch(...)</a>
|
||
|
|
<a name="432"><span class="lineNum"> 432 </span> : : {</a>
|
||
|
|
<a name="433"><span class="lineNum"> 433 </span> : : clear();</a>
|
||
|
|
<a name="434"><span class="lineNum"> 434 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="435"><span class="lineNum"> 435 </span> : : }</a>
|
||
|
|
<a name="436"><span class="lineNum"> 436 </span> : : }</a>
|
||
|
|
<a name="437"><span class="lineNum"> 437 </span> : : </a>
|
||
|
|
<a name="438"><span class="lineNum"> 438 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="439"><span class="lineNum"> 439 </span> : : template <typename _ForwardIterator></a>
|
||
|
|
<a name="440"><span class="lineNum"> 440 </span> : : void</a>
|
||
|
|
<a name="441"><span class="lineNum"> 441 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="442"><span class="lineNum"> 442 </span> : : _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,</a>
|
||
|
|
<a name="443"><span class="lineNum"> 443 </span> : : std::forward_iterator_tag)</a>
|
||
|
|
<a name="444"><span class="lineNum"> 444 </span> : : {</a>
|
||
|
|
<a name="445"><span class="lineNum"> 445 </span> : : const size_type __n = std::distance(__first, __last);</a>
|
||
|
|
<a name="446"><span class="lineNum"> 446 </span> : : this->_M_initialize_map(_S_check_init_len(__n, _M_get_Tp_allocator()));</a>
|
||
|
|
<a name="447"><span class="lineNum"> 447 </span> : : </a>
|
||
|
|
<a name="448"><span class="lineNum"> 448 </span> : : _Map_pointer __cur_node;</a>
|
||
|
|
<a name="449"><span class="lineNum"> 449 </span> : : __try</a>
|
||
|
|
<a name="450"><span class="lineNum"> 450 </span> : : {</a>
|
||
|
|
<a name="451"><span class="lineNum"> 451 </span> : : for (__cur_node = this->_M_impl._M_start._M_node;</a>
|
||
|
|
<a name="452"><span class="lineNum"> 452 </span> : : __cur_node < this->_M_impl._M_finish._M_node;</a>
|
||
|
|
<a name="453"><span class="lineNum"> 453 </span> : : ++__cur_node)</a>
|
||
|
|
<a name="454"><span class="lineNum"> 454 </span> : : {</a>
|
||
|
|
<a name="455"><span class="lineNum"> 455 </span> : : _ForwardIterator __mid = __first;</a>
|
||
|
|
<a name="456"><span class="lineNum"> 456 </span> : : std::advance(__mid, _S_buffer_size());</a>
|
||
|
|
<a name="457"><span class="lineNum"> 457 </span> : : std::__uninitialized_copy_a(__first, __mid, *__cur_node,</a>
|
||
|
|
<a name="458"><span class="lineNum"> 458 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="459"><span class="lineNum"> 459 </span> : : __first = __mid;</a>
|
||
|
|
<a name="460"><span class="lineNum"> 460 </span> : : }</a>
|
||
|
|
<a name="461"><span class="lineNum"> 461 </span> : : std::__uninitialized_copy_a(__first, __last,</a>
|
||
|
|
<a name="462"><span class="lineNum"> 462 </span> : : this->_M_impl._M_finish._M_first,</a>
|
||
|
|
<a name="463"><span class="lineNum"> 463 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="464"><span class="lineNum"> 464 </span> : : }</a>
|
||
|
|
<a name="465"><span class="lineNum"> 465 </span> : : __catch(...)</a>
|
||
|
|
<a name="466"><span class="lineNum"> 466 </span> : : {</a>
|
||
|
|
<a name="467"><span class="lineNum"> 467 </span> : : std::_Destroy(this->_M_impl._M_start,</a>
|
||
|
|
<a name="468"><span class="lineNum"> 468 </span> : : iterator(*__cur_node, __cur_node),</a>
|
||
|
|
<a name="469"><span class="lineNum"> 469 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="470"><span class="lineNum"> 470 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="471"><span class="lineNum"> 471 </span> : : }</a>
|
||
|
|
<a name="472"><span class="lineNum"> 472 </span> : : }</a>
|
||
|
|
<a name="473"><span class="lineNum"> 473 </span> : : </a>
|
||
|
|
<a name="474"><span class="lineNum"> 474 </span> : : // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1.</a>
|
||
|
|
<a name="475"><span class="lineNum"> 475 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="476"><span class="lineNum"> 476 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="477"><span class="lineNum"> 477 </span> : : template<typename... _Args></a>
|
||
|
|
<a name="478"><span class="lineNum"> 478 </span> : : void</a>
|
||
|
|
<a name="479"><span class="lineNum"> 479 </span> :<span class="lineNoCov"> 0 : deque<_Tp, _Alloc>::</span></a>
|
||
|
|
<a name="480"><span class="lineNum"> 480 </span> : : _M_push_back_aux(_Args&&... __args)</a>
|
||
|
|
<a name="481"><span class="lineNum"> 481 </span> : : #else</a>
|
||
|
|
<a name="482"><span class="lineNum"> 482 </span> : : void</a>
|
||
|
|
<a name="483"><span class="lineNum"> 483 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="484"><span class="lineNum"> 484 </span> : : _M_push_back_aux(const value_type& __t)</a>
|
||
|
|
<a name="485"><span class="lineNum"> 485 </span> : : #endif</a>
|
||
|
|
<a name="486"><span class="lineNum"> 486 </span> : : {</a>
|
||
|
|
<a name="487"><span class="lineNum"> 487 </span> [<span class="branchNoExec" title="Branch 0 was not executed"> # </span><span class="branchNoExec" title="Branch 1 was not executed"> # </span>]:<span class="lineNoCov"> 0 : if (size() == max_size())</span></a>
|
||
|
|
<a name="488"><span class="lineNum"> 488 </span> :<span class="lineNoCov"> 0 : __throw_length_error(</span></a>
|
||
|
|
<a name="489"><span class="lineNum"> 489 </span> : : __N("cannot create std::deque larger than max_size()"));</a>
|
||
|
|
<a name="490"><span class="lineNum"> 490 </span> : : </a>
|
||
|
|
<a name="491"><span class="lineNum"> 491 </span> :<span class="lineNoCov"> 0 : _M_reserve_map_at_back();</span></a>
|
||
|
|
<a name="492"><span class="lineNum"> 492 </span> :<span class="lineNoCov"> 0 : *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node();</span></a>
|
||
|
|
<a name="493"><span class="lineNum"> 493 </span> : : __try</a>
|
||
|
|
<a name="494"><span class="lineNum"> 494 </span> : : {</a>
|
||
|
|
<a name="495"><span class="lineNum"> 495 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="496"><span class="lineNum"> 496 </span> :<span class="lineNoCov"> 0 : _Alloc_traits::construct(this->_M_impl,</span></a>
|
||
|
|
<a name="497"><span class="lineNum"> 497 </span> : : this->_M_impl._M_finish._M_cur,</a>
|
||
|
|
<a name="498"><span class="lineNum"> 498 </span> : : std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="499"><span class="lineNum"> 499 </span> : : #else</a>
|
||
|
|
<a name="500"><span class="lineNum"> 500 </span> : : this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t);</a>
|
||
|
|
<a name="501"><span class="lineNum"> 501 </span> : : #endif</a>
|
||
|
|
<a name="502"><span class="lineNum"> 502 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node</span></a>
|
||
|
|
<a name="503"><span class="lineNum"> 503 </span> : : + 1);</a>
|
||
|
|
<a name="504"><span class="lineNum"> 504 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first;</span></a>
|
||
|
|
<a name="505"><span class="lineNum"> 505 </span> : : }</a>
|
||
|
|
<a name="506"><span class="lineNum"> 506 </span> : : __catch(...)</a>
|
||
|
|
<a name="507"><span class="lineNum"> 507 </span> : : {</a>
|
||
|
|
<a name="508"><span class="lineNum"> 508 </span> : : _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1));</a>
|
||
|
|
<a name="509"><span class="lineNum"> 509 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="510"><span class="lineNum"> 510 </span> : : }</a>
|
||
|
|
<a name="511"><span class="lineNum"> 511 </span> :<span class="lineNoCov"> 0 : }</span></a>
|
||
|
|
<a name="512"><span class="lineNum"> 512 </span> : : </a>
|
||
|
|
<a name="513"><span class="lineNum"> 513 </span> : : // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first.</a>
|
||
|
|
<a name="514"><span class="lineNum"> 514 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="515"><span class="lineNum"> 515 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="516"><span class="lineNum"> 516 </span> : : template<typename... _Args></a>
|
||
|
|
<a name="517"><span class="lineNum"> 517 </span> : : void</a>
|
||
|
|
<a name="518"><span class="lineNum"> 518 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="519"><span class="lineNum"> 519 </span> : : _M_push_front_aux(_Args&&... __args)</a>
|
||
|
|
<a name="520"><span class="lineNum"> 520 </span> : : #else</a>
|
||
|
|
<a name="521"><span class="lineNum"> 521 </span> : : void</a>
|
||
|
|
<a name="522"><span class="lineNum"> 522 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="523"><span class="lineNum"> 523 </span> : : _M_push_front_aux(const value_type& __t)</a>
|
||
|
|
<a name="524"><span class="lineNum"> 524 </span> : : #endif</a>
|
||
|
|
<a name="525"><span class="lineNum"> 525 </span> : : {</a>
|
||
|
|
<a name="526"><span class="lineNum"> 526 </span> : : if (size() == max_size())</a>
|
||
|
|
<a name="527"><span class="lineNum"> 527 </span> : : __throw_length_error(</a>
|
||
|
|
<a name="528"><span class="lineNum"> 528 </span> : : __N("cannot create std::deque larger than max_size()"));</a>
|
||
|
|
<a name="529"><span class="lineNum"> 529 </span> : : </a>
|
||
|
|
<a name="530"><span class="lineNum"> 530 </span> : : _M_reserve_map_at_front();</a>
|
||
|
|
<a name="531"><span class="lineNum"> 531 </span> : : *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node();</a>
|
||
|
|
<a name="532"><span class="lineNum"> 532 </span> : : __try</a>
|
||
|
|
<a name="533"><span class="lineNum"> 533 </span> : : {</a>
|
||
|
|
<a name="534"><span class="lineNum"> 534 </span> : : this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node</a>
|
||
|
|
<a name="535"><span class="lineNum"> 535 </span> : : - 1);</a>
|
||
|
|
<a name="536"><span class="lineNum"> 536 </span> : : this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1;</a>
|
||
|
|
<a name="537"><span class="lineNum"> 537 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="538"><span class="lineNum"> 538 </span> : : _Alloc_traits::construct(this->_M_impl,</a>
|
||
|
|
<a name="539"><span class="lineNum"> 539 </span> : : this->_M_impl._M_start._M_cur,</a>
|
||
|
|
<a name="540"><span class="lineNum"> 540 </span> : : std::forward<_Args>(__args)...);</a>
|
||
|
|
<a name="541"><span class="lineNum"> 541 </span> : : #else</a>
|
||
|
|
<a name="542"><span class="lineNum"> 542 </span> : : this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t);</a>
|
||
|
|
<a name="543"><span class="lineNum"> 543 </span> : : #endif</a>
|
||
|
|
<a name="544"><span class="lineNum"> 544 </span> : : }</a>
|
||
|
|
<a name="545"><span class="lineNum"> 545 </span> : : __catch(...)</a>
|
||
|
|
<a name="546"><span class="lineNum"> 546 </span> : : {</a>
|
||
|
|
<a name="547"><span class="lineNum"> 547 </span> : : ++this->_M_impl._M_start;</a>
|
||
|
|
<a name="548"><span class="lineNum"> 548 </span> : : _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1));</a>
|
||
|
|
<a name="549"><span class="lineNum"> 549 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="550"><span class="lineNum"> 550 </span> : : }</a>
|
||
|
|
<a name="551"><span class="lineNum"> 551 </span> : : }</a>
|
||
|
|
<a name="552"><span class="lineNum"> 552 </span> : : </a>
|
||
|
|
<a name="553"><span class="lineNum"> 553 </span> : : // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_first.</a>
|
||
|
|
<a name="554"><span class="lineNum"> 554 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="555"><span class="lineNum"> 555 </span> :<span class="lineNoCov"> 0 : void deque<_Tp, _Alloc>::</span></a>
|
||
|
|
<a name="556"><span class="lineNum"> 556 </span> : : _M_pop_back_aux()</a>
|
||
|
|
<a name="557"><span class="lineNum"> 557 </span> : : {</a>
|
||
|
|
<a name="558"><span class="lineNum"> 558 </span> :<span class="lineNoCov"> 0 : _M_deallocate_node(this->_M_impl._M_finish._M_first);</span></a>
|
||
|
|
<a name="559"><span class="lineNum"> 559 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1);</span></a>
|
||
|
|
<a name="560"><span class="lineNum"> 560 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1;</span></a>
|
||
|
|
<a name="561"><span class="lineNum"> 561 </span> :<span class="lineNoCov"> 0 : _Alloc_traits::destroy(_M_get_Tp_allocator(),</span></a>
|
||
|
|
<a name="562"><span class="lineNum"> 562 </span> : : this->_M_impl._M_finish._M_cur);</a>
|
||
|
|
<a name="563"><span class="lineNum"> 563 </span> :<span class="lineNoCov"> 0 : }</span></a>
|
||
|
|
<a name="564"><span class="lineNum"> 564 </span> : : </a>
|
||
|
|
<a name="565"><span class="lineNum"> 565 </span> : : // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_last - 1.</a>
|
||
|
|
<a name="566"><span class="lineNum"> 566 </span> : : // Note that if the deque has at least one element (a precondition for this</a>
|
||
|
|
<a name="567"><span class="lineNum"> 567 </span> : : // member function), and if</a>
|
||
|
|
<a name="568"><span class="lineNum"> 568 </span> : : // _M_impl._M_start._M_cur == _M_impl._M_start._M_last,</a>
|
||
|
|
<a name="569"><span class="lineNum"> 569 </span> : : // then the deque must have at least two nodes.</a>
|
||
|
|
<a name="570"><span class="lineNum"> 570 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="571"><span class="lineNum"> 571 </span> : : void deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="572"><span class="lineNum"> 572 </span> : : _M_pop_front_aux()</a>
|
||
|
|
<a name="573"><span class="lineNum"> 573 </span> : : {</a>
|
||
|
|
<a name="574"><span class="lineNum"> 574 </span> : : _Alloc_traits::destroy(_M_get_Tp_allocator(),</a>
|
||
|
|
<a name="575"><span class="lineNum"> 575 </span> : : this->_M_impl._M_start._M_cur);</a>
|
||
|
|
<a name="576"><span class="lineNum"> 576 </span> : : _M_deallocate_node(this->_M_impl._M_start._M_first);</a>
|
||
|
|
<a name="577"><span class="lineNum"> 577 </span> : : this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1);</a>
|
||
|
|
<a name="578"><span class="lineNum"> 578 </span> : : this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first;</a>
|
||
|
|
<a name="579"><span class="lineNum"> 579 </span> : : }</a>
|
||
|
|
<a name="580"><span class="lineNum"> 580 </span> : : </a>
|
||
|
|
<a name="581"><span class="lineNum"> 581 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="582"><span class="lineNum"> 582 </span> : : template <typename _InputIterator></a>
|
||
|
|
<a name="583"><span class="lineNum"> 583 </span> : : void</a>
|
||
|
|
<a name="584"><span class="lineNum"> 584 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="585"><span class="lineNum"> 585 </span> : : _M_range_insert_aux(iterator __pos,</a>
|
||
|
|
<a name="586"><span class="lineNum"> 586 </span> : : _InputIterator __first, _InputIterator __last,</a>
|
||
|
|
<a name="587"><span class="lineNum"> 587 </span> : : std::input_iterator_tag)</a>
|
||
|
|
<a name="588"><span class="lineNum"> 588 </span> : : { std::copy(__first, __last, std::inserter(*this, __pos)); }</a>
|
||
|
|
<a name="589"><span class="lineNum"> 589 </span> : : </a>
|
||
|
|
<a name="590"><span class="lineNum"> 590 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="591"><span class="lineNum"> 591 </span> : : template <typename _ForwardIterator></a>
|
||
|
|
<a name="592"><span class="lineNum"> 592 </span> : : void</a>
|
||
|
|
<a name="593"><span class="lineNum"> 593 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="594"><span class="lineNum"> 594 </span> : : _M_range_insert_aux(iterator __pos,</a>
|
||
|
|
<a name="595"><span class="lineNum"> 595 </span> : : _ForwardIterator __first, _ForwardIterator __last,</a>
|
||
|
|
<a name="596"><span class="lineNum"> 596 </span> : : std::forward_iterator_tag)</a>
|
||
|
|
<a name="597"><span class="lineNum"> 597 </span> : : {</a>
|
||
|
|
<a name="598"><span class="lineNum"> 598 </span> : : const size_type __n = std::distance(__first, __last);</a>
|
||
|
|
<a name="599"><span class="lineNum"> 599 </span> : : if (__pos._M_cur == this->_M_impl._M_start._M_cur)</a>
|
||
|
|
<a name="600"><span class="lineNum"> 600 </span> : : {</a>
|
||
|
|
<a name="601"><span class="lineNum"> 601 </span> : : iterator __new_start = _M_reserve_elements_at_front(__n);</a>
|
||
|
|
<a name="602"><span class="lineNum"> 602 </span> : : __try</a>
|
||
|
|
<a name="603"><span class="lineNum"> 603 </span> : : {</a>
|
||
|
|
<a name="604"><span class="lineNum"> 604 </span> : : std::__uninitialized_copy_a(__first, __last, __new_start,</a>
|
||
|
|
<a name="605"><span class="lineNum"> 605 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="606"><span class="lineNum"> 606 </span> : : this->_M_impl._M_start = __new_start;</a>
|
||
|
|
<a name="607"><span class="lineNum"> 607 </span> : : }</a>
|
||
|
|
<a name="608"><span class="lineNum"> 608 </span> : : __catch(...)</a>
|
||
|
|
<a name="609"><span class="lineNum"> 609 </span> : : {</a>
|
||
|
|
<a name="610"><span class="lineNum"> 610 </span> : : _M_destroy_nodes(__new_start._M_node,</a>
|
||
|
|
<a name="611"><span class="lineNum"> 611 </span> : : this->_M_impl._M_start._M_node);</a>
|
||
|
|
<a name="612"><span class="lineNum"> 612 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="613"><span class="lineNum"> 613 </span> : : }</a>
|
||
|
|
<a name="614"><span class="lineNum"> 614 </span> : : }</a>
|
||
|
|
<a name="615"><span class="lineNum"> 615 </span> : : else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)</a>
|
||
|
|
<a name="616"><span class="lineNum"> 616 </span> : : {</a>
|
||
|
|
<a name="617"><span class="lineNum"> 617 </span> : : iterator __new_finish = _M_reserve_elements_at_back(__n);</a>
|
||
|
|
<a name="618"><span class="lineNum"> 618 </span> : : __try</a>
|
||
|
|
<a name="619"><span class="lineNum"> 619 </span> : : {</a>
|
||
|
|
<a name="620"><span class="lineNum"> 620 </span> : : std::__uninitialized_copy_a(__first, __last,</a>
|
||
|
|
<a name="621"><span class="lineNum"> 621 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="622"><span class="lineNum"> 622 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="623"><span class="lineNum"> 623 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="624"><span class="lineNum"> 624 </span> : : }</a>
|
||
|
|
<a name="625"><span class="lineNum"> 625 </span> : : __catch(...)</a>
|
||
|
|
<a name="626"><span class="lineNum"> 626 </span> : : {</a>
|
||
|
|
<a name="627"><span class="lineNum"> 627 </span> : : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</a>
|
||
|
|
<a name="628"><span class="lineNum"> 628 </span> : : __new_finish._M_node + 1);</a>
|
||
|
|
<a name="629"><span class="lineNum"> 629 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="630"><span class="lineNum"> 630 </span> : : }</a>
|
||
|
|
<a name="631"><span class="lineNum"> 631 </span> : : }</a>
|
||
|
|
<a name="632"><span class="lineNum"> 632 </span> : : else</a>
|
||
|
|
<a name="633"><span class="lineNum"> 633 </span> : : _M_insert_aux(__pos, __first, __last, __n);</a>
|
||
|
|
<a name="634"><span class="lineNum"> 634 </span> : : }</a>
|
||
|
|
<a name="635"><span class="lineNum"> 635 </span> : : </a>
|
||
|
|
<a name="636"><span class="lineNum"> 636 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="637"><span class="lineNum"> 637 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="638"><span class="lineNum"> 638 </span> : : template<typename... _Args></a>
|
||
|
|
<a name="639"><span class="lineNum"> 639 </span> : : typename deque<_Tp, _Alloc>::iterator</a>
|
||
|
|
<a name="640"><span class="lineNum"> 640 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="641"><span class="lineNum"> 641 </span> : : _M_insert_aux(iterator __pos, _Args&&... __args)</a>
|
||
|
|
<a name="642"><span class="lineNum"> 642 </span> : : {</a>
|
||
|
|
<a name="643"><span class="lineNum"> 643 </span> : : value_type __x_copy(std::forward<_Args>(__args)...); // XXX copy</a>
|
||
|
|
<a name="644"><span class="lineNum"> 644 </span> : : #else</a>
|
||
|
|
<a name="645"><span class="lineNum"> 645 </span> : : typename deque<_Tp, _Alloc>::iterator</a>
|
||
|
|
<a name="646"><span class="lineNum"> 646 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="647"><span class="lineNum"> 647 </span> : : _M_insert_aux(iterator __pos, const value_type& __x)</a>
|
||
|
|
<a name="648"><span class="lineNum"> 648 </span> : : {</a>
|
||
|
|
<a name="649"><span class="lineNum"> 649 </span> : : value_type __x_copy = __x; // XXX copy</a>
|
||
|
|
<a name="650"><span class="lineNum"> 650 </span> : : #endif</a>
|
||
|
|
<a name="651"><span class="lineNum"> 651 </span> : : difference_type __index = __pos - this->_M_impl._M_start;</a>
|
||
|
|
<a name="652"><span class="lineNum"> 652 </span> : : if (static_cast<size_type>(__index) < size() / 2)</a>
|
||
|
|
<a name="653"><span class="lineNum"> 653 </span> : : {</a>
|
||
|
|
<a name="654"><span class="lineNum"> 654 </span> : : push_front(_GLIBCXX_MOVE(front()));</a>
|
||
|
|
<a name="655"><span class="lineNum"> 655 </span> : : iterator __front1 = this->_M_impl._M_start;</a>
|
||
|
|
<a name="656"><span class="lineNum"> 656 </span> : : ++__front1;</a>
|
||
|
|
<a name="657"><span class="lineNum"> 657 </span> : : iterator __front2 = __front1;</a>
|
||
|
|
<a name="658"><span class="lineNum"> 658 </span> : : ++__front2;</a>
|
||
|
|
<a name="659"><span class="lineNum"> 659 </span> : : __pos = this->_M_impl._M_start + __index;</a>
|
||
|
|
<a name="660"><span class="lineNum"> 660 </span> : : iterator __pos1 = __pos;</a>
|
||
|
|
<a name="661"><span class="lineNum"> 661 </span> : : ++__pos1;</a>
|
||
|
|
<a name="662"><span class="lineNum"> 662 </span> : : _GLIBCXX_MOVE3(__front2, __pos1, __front1);</a>
|
||
|
|
<a name="663"><span class="lineNum"> 663 </span> : : }</a>
|
||
|
|
<a name="664"><span class="lineNum"> 664 </span> : : else</a>
|
||
|
|
<a name="665"><span class="lineNum"> 665 </span> : : {</a>
|
||
|
|
<a name="666"><span class="lineNum"> 666 </span> : : push_back(_GLIBCXX_MOVE(back()));</a>
|
||
|
|
<a name="667"><span class="lineNum"> 667 </span> : : iterator __back1 = this->_M_impl._M_finish;</a>
|
||
|
|
<a name="668"><span class="lineNum"> 668 </span> : : --__back1;</a>
|
||
|
|
<a name="669"><span class="lineNum"> 669 </span> : : iterator __back2 = __back1;</a>
|
||
|
|
<a name="670"><span class="lineNum"> 670 </span> : : --__back2;</a>
|
||
|
|
<a name="671"><span class="lineNum"> 671 </span> : : __pos = this->_M_impl._M_start + __index;</a>
|
||
|
|
<a name="672"><span class="lineNum"> 672 </span> : : _GLIBCXX_MOVE_BACKWARD3(__pos, __back2, __back1);</a>
|
||
|
|
<a name="673"><span class="lineNum"> 673 </span> : : }</a>
|
||
|
|
<a name="674"><span class="lineNum"> 674 </span> : : *__pos = _GLIBCXX_MOVE(__x_copy);</a>
|
||
|
|
<a name="675"><span class="lineNum"> 675 </span> : : return __pos;</a>
|
||
|
|
<a name="676"><span class="lineNum"> 676 </span> : : }</a>
|
||
|
|
<a name="677"><span class="lineNum"> 677 </span> : : </a>
|
||
|
|
<a name="678"><span class="lineNum"> 678 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="679"><span class="lineNum"> 679 </span> : : void</a>
|
||
|
|
<a name="680"><span class="lineNum"> 680 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="681"><span class="lineNum"> 681 </span> : : _M_insert_aux(iterator __pos, size_type __n, const value_type& __x)</a>
|
||
|
|
<a name="682"><span class="lineNum"> 682 </span> : : {</a>
|
||
|
|
<a name="683"><span class="lineNum"> 683 </span> : : const difference_type __elems_before = __pos - this->_M_impl._M_start;</a>
|
||
|
|
<a name="684"><span class="lineNum"> 684 </span> : : const size_type __length = this->size();</a>
|
||
|
|
<a name="685"><span class="lineNum"> 685 </span> : : value_type __x_copy = __x;</a>
|
||
|
|
<a name="686"><span class="lineNum"> 686 </span> : : if (__elems_before < difference_type(__length / 2))</a>
|
||
|
|
<a name="687"><span class="lineNum"> 687 </span> : : {</a>
|
||
|
|
<a name="688"><span class="lineNum"> 688 </span> : : iterator __new_start = _M_reserve_elements_at_front(__n);</a>
|
||
|
|
<a name="689"><span class="lineNum"> 689 </span> : : iterator __old_start = this->_M_impl._M_start;</a>
|
||
|
|
<a name="690"><span class="lineNum"> 690 </span> : : __pos = this->_M_impl._M_start + __elems_before;</a>
|
||
|
|
<a name="691"><span class="lineNum"> 691 </span> : : __try</a>
|
||
|
|
<a name="692"><span class="lineNum"> 692 </span> : : {</a>
|
||
|
|
<a name="693"><span class="lineNum"> 693 </span> : : if (__elems_before >= difference_type(__n))</a>
|
||
|
|
<a name="694"><span class="lineNum"> 694 </span> : : {</a>
|
||
|
|
<a name="695"><span class="lineNum"> 695 </span> : : iterator __start_n = (this->_M_impl._M_start</a>
|
||
|
|
<a name="696"><span class="lineNum"> 696 </span> : : + difference_type(__n));</a>
|
||
|
|
<a name="697"><span class="lineNum"> 697 </span> : : std::__uninitialized_move_a(this->_M_impl._M_start,</a>
|
||
|
|
<a name="698"><span class="lineNum"> 698 </span> : : __start_n, __new_start,</a>
|
||
|
|
<a name="699"><span class="lineNum"> 699 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="700"><span class="lineNum"> 700 </span> : : this->_M_impl._M_start = __new_start;</a>
|
||
|
|
<a name="701"><span class="lineNum"> 701 </span> : : _GLIBCXX_MOVE3(__start_n, __pos, __old_start);</a>
|
||
|
|
<a name="702"><span class="lineNum"> 702 </span> : : std::fill(__pos - difference_type(__n), __pos, __x_copy);</a>
|
||
|
|
<a name="703"><span class="lineNum"> 703 </span> : : }</a>
|
||
|
|
<a name="704"><span class="lineNum"> 704 </span> : : else</a>
|
||
|
|
<a name="705"><span class="lineNum"> 705 </span> : : {</a>
|
||
|
|
<a name="706"><span class="lineNum"> 706 </span> : : std::__uninitialized_move_fill(this->_M_impl._M_start,</a>
|
||
|
|
<a name="707"><span class="lineNum"> 707 </span> : : __pos, __new_start,</a>
|
||
|
|
<a name="708"><span class="lineNum"> 708 </span> : : this->_M_impl._M_start,</a>
|
||
|
|
<a name="709"><span class="lineNum"> 709 </span> : : __x_copy,</a>
|
||
|
|
<a name="710"><span class="lineNum"> 710 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="711"><span class="lineNum"> 711 </span> : : this->_M_impl._M_start = __new_start;</a>
|
||
|
|
<a name="712"><span class="lineNum"> 712 </span> : : std::fill(__old_start, __pos, __x_copy);</a>
|
||
|
|
<a name="713"><span class="lineNum"> 713 </span> : : }</a>
|
||
|
|
<a name="714"><span class="lineNum"> 714 </span> : : }</a>
|
||
|
|
<a name="715"><span class="lineNum"> 715 </span> : : __catch(...)</a>
|
||
|
|
<a name="716"><span class="lineNum"> 716 </span> : : {</a>
|
||
|
|
<a name="717"><span class="lineNum"> 717 </span> : : _M_destroy_nodes(__new_start._M_node,</a>
|
||
|
|
<a name="718"><span class="lineNum"> 718 </span> : : this->_M_impl._M_start._M_node);</a>
|
||
|
|
<a name="719"><span class="lineNum"> 719 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="720"><span class="lineNum"> 720 </span> : : }</a>
|
||
|
|
<a name="721"><span class="lineNum"> 721 </span> : : }</a>
|
||
|
|
<a name="722"><span class="lineNum"> 722 </span> : : else</a>
|
||
|
|
<a name="723"><span class="lineNum"> 723 </span> : : {</a>
|
||
|
|
<a name="724"><span class="lineNum"> 724 </span> : : iterator __new_finish = _M_reserve_elements_at_back(__n);</a>
|
||
|
|
<a name="725"><span class="lineNum"> 725 </span> : : iterator __old_finish = this->_M_impl._M_finish;</a>
|
||
|
|
<a name="726"><span class="lineNum"> 726 </span> : : const difference_type __elems_after =</a>
|
||
|
|
<a name="727"><span class="lineNum"> 727 </span> : : difference_type(__length) - __elems_before;</a>
|
||
|
|
<a name="728"><span class="lineNum"> 728 </span> : : __pos = this->_M_impl._M_finish - __elems_after;</a>
|
||
|
|
<a name="729"><span class="lineNum"> 729 </span> : : __try</a>
|
||
|
|
<a name="730"><span class="lineNum"> 730 </span> : : {</a>
|
||
|
|
<a name="731"><span class="lineNum"> 731 </span> : : if (__elems_after > difference_type(__n))</a>
|
||
|
|
<a name="732"><span class="lineNum"> 732 </span> : : {</a>
|
||
|
|
<a name="733"><span class="lineNum"> 733 </span> : : iterator __finish_n = (this->_M_impl._M_finish</a>
|
||
|
|
<a name="734"><span class="lineNum"> 734 </span> : : - difference_type(__n));</a>
|
||
|
|
<a name="735"><span class="lineNum"> 735 </span> : : std::__uninitialized_move_a(__finish_n,</a>
|
||
|
|
<a name="736"><span class="lineNum"> 736 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="737"><span class="lineNum"> 737 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="738"><span class="lineNum"> 738 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="739"><span class="lineNum"> 739 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="740"><span class="lineNum"> 740 </span> : : _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);</a>
|
||
|
|
<a name="741"><span class="lineNum"> 741 </span> : : std::fill(__pos, __pos + difference_type(__n), __x_copy);</a>
|
||
|
|
<a name="742"><span class="lineNum"> 742 </span> : : }</a>
|
||
|
|
<a name="743"><span class="lineNum"> 743 </span> : : else</a>
|
||
|
|
<a name="744"><span class="lineNum"> 744 </span> : : {</a>
|
||
|
|
<a name="745"><span class="lineNum"> 745 </span> : : std::__uninitialized_fill_move(this->_M_impl._M_finish,</a>
|
||
|
|
<a name="746"><span class="lineNum"> 746 </span> : : __pos + difference_type(__n),</a>
|
||
|
|
<a name="747"><span class="lineNum"> 747 </span> : : __x_copy, __pos,</a>
|
||
|
|
<a name="748"><span class="lineNum"> 748 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="749"><span class="lineNum"> 749 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="750"><span class="lineNum"> 750 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="751"><span class="lineNum"> 751 </span> : : std::fill(__pos, __old_finish, __x_copy);</a>
|
||
|
|
<a name="752"><span class="lineNum"> 752 </span> : : }</a>
|
||
|
|
<a name="753"><span class="lineNum"> 753 </span> : : }</a>
|
||
|
|
<a name="754"><span class="lineNum"> 754 </span> : : __catch(...)</a>
|
||
|
|
<a name="755"><span class="lineNum"> 755 </span> : : {</a>
|
||
|
|
<a name="756"><span class="lineNum"> 756 </span> : : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</a>
|
||
|
|
<a name="757"><span class="lineNum"> 757 </span> : : __new_finish._M_node + 1);</a>
|
||
|
|
<a name="758"><span class="lineNum"> 758 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="759"><span class="lineNum"> 759 </span> : : }</a>
|
||
|
|
<a name="760"><span class="lineNum"> 760 </span> : : }</a>
|
||
|
|
<a name="761"><span class="lineNum"> 761 </span> : : }</a>
|
||
|
|
<a name="762"><span class="lineNum"> 762 </span> : : </a>
|
||
|
|
<a name="763"><span class="lineNum"> 763 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="764"><span class="lineNum"> 764 </span> : : template <typename _ForwardIterator></a>
|
||
|
|
<a name="765"><span class="lineNum"> 765 </span> : : void</a>
|
||
|
|
<a name="766"><span class="lineNum"> 766 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="767"><span class="lineNum"> 767 </span> : : _M_insert_aux(iterator __pos,</a>
|
||
|
|
<a name="768"><span class="lineNum"> 768 </span> : : _ForwardIterator __first, _ForwardIterator __last,</a>
|
||
|
|
<a name="769"><span class="lineNum"> 769 </span> : : size_type __n)</a>
|
||
|
|
<a name="770"><span class="lineNum"> 770 </span> : : {</a>
|
||
|
|
<a name="771"><span class="lineNum"> 771 </span> : : const difference_type __elemsbefore = __pos - this->_M_impl._M_start;</a>
|
||
|
|
<a name="772"><span class="lineNum"> 772 </span> : : const size_type __length = size();</a>
|
||
|
|
<a name="773"><span class="lineNum"> 773 </span> : : if (static_cast<size_type>(__elemsbefore) < __length / 2)</a>
|
||
|
|
<a name="774"><span class="lineNum"> 774 </span> : : {</a>
|
||
|
|
<a name="775"><span class="lineNum"> 775 </span> : : iterator __new_start = _M_reserve_elements_at_front(__n);</a>
|
||
|
|
<a name="776"><span class="lineNum"> 776 </span> : : iterator __old_start = this->_M_impl._M_start;</a>
|
||
|
|
<a name="777"><span class="lineNum"> 777 </span> : : __pos = this->_M_impl._M_start + __elemsbefore;</a>
|
||
|
|
<a name="778"><span class="lineNum"> 778 </span> : : __try</a>
|
||
|
|
<a name="779"><span class="lineNum"> 779 </span> : : {</a>
|
||
|
|
<a name="780"><span class="lineNum"> 780 </span> : : if (__elemsbefore >= difference_type(__n))</a>
|
||
|
|
<a name="781"><span class="lineNum"> 781 </span> : : {</a>
|
||
|
|
<a name="782"><span class="lineNum"> 782 </span> : : iterator __start_n = (this->_M_impl._M_start</a>
|
||
|
|
<a name="783"><span class="lineNum"> 783 </span> : : + difference_type(__n));</a>
|
||
|
|
<a name="784"><span class="lineNum"> 784 </span> : : std::__uninitialized_move_a(this->_M_impl._M_start,</a>
|
||
|
|
<a name="785"><span class="lineNum"> 785 </span> : : __start_n, __new_start,</a>
|
||
|
|
<a name="786"><span class="lineNum"> 786 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="787"><span class="lineNum"> 787 </span> : : this->_M_impl._M_start = __new_start;</a>
|
||
|
|
<a name="788"><span class="lineNum"> 788 </span> : : _GLIBCXX_MOVE3(__start_n, __pos, __old_start);</a>
|
||
|
|
<a name="789"><span class="lineNum"> 789 </span> : : std::copy(__first, __last, __pos - difference_type(__n));</a>
|
||
|
|
<a name="790"><span class="lineNum"> 790 </span> : : }</a>
|
||
|
|
<a name="791"><span class="lineNum"> 791 </span> : : else</a>
|
||
|
|
<a name="792"><span class="lineNum"> 792 </span> : : {</a>
|
||
|
|
<a name="793"><span class="lineNum"> 793 </span> : : _ForwardIterator __mid = __first;</a>
|
||
|
|
<a name="794"><span class="lineNum"> 794 </span> : : std::advance(__mid, difference_type(__n) - __elemsbefore);</a>
|
||
|
|
<a name="795"><span class="lineNum"> 795 </span> : : std::__uninitialized_move_copy(this->_M_impl._M_start,</a>
|
||
|
|
<a name="796"><span class="lineNum"> 796 </span> : : __pos, __first, __mid,</a>
|
||
|
|
<a name="797"><span class="lineNum"> 797 </span> : : __new_start,</a>
|
||
|
|
<a name="798"><span class="lineNum"> 798 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="799"><span class="lineNum"> 799 </span> : : this->_M_impl._M_start = __new_start;</a>
|
||
|
|
<a name="800"><span class="lineNum"> 800 </span> : : std::copy(__mid, __last, __old_start);</a>
|
||
|
|
<a name="801"><span class="lineNum"> 801 </span> : : }</a>
|
||
|
|
<a name="802"><span class="lineNum"> 802 </span> : : }</a>
|
||
|
|
<a name="803"><span class="lineNum"> 803 </span> : : __catch(...)</a>
|
||
|
|
<a name="804"><span class="lineNum"> 804 </span> : : {</a>
|
||
|
|
<a name="805"><span class="lineNum"> 805 </span> : : _M_destroy_nodes(__new_start._M_node,</a>
|
||
|
|
<a name="806"><span class="lineNum"> 806 </span> : : this->_M_impl._M_start._M_node);</a>
|
||
|
|
<a name="807"><span class="lineNum"> 807 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="808"><span class="lineNum"> 808 </span> : : }</a>
|
||
|
|
<a name="809"><span class="lineNum"> 809 </span> : : }</a>
|
||
|
|
<a name="810"><span class="lineNum"> 810 </span> : : else</a>
|
||
|
|
<a name="811"><span class="lineNum"> 811 </span> : : {</a>
|
||
|
|
<a name="812"><span class="lineNum"> 812 </span> : : iterator __new_finish = _M_reserve_elements_at_back(__n);</a>
|
||
|
|
<a name="813"><span class="lineNum"> 813 </span> : : iterator __old_finish = this->_M_impl._M_finish;</a>
|
||
|
|
<a name="814"><span class="lineNum"> 814 </span> : : const difference_type __elemsafter =</a>
|
||
|
|
<a name="815"><span class="lineNum"> 815 </span> : : difference_type(__length) - __elemsbefore;</a>
|
||
|
|
<a name="816"><span class="lineNum"> 816 </span> : : __pos = this->_M_impl._M_finish - __elemsafter;</a>
|
||
|
|
<a name="817"><span class="lineNum"> 817 </span> : : __try</a>
|
||
|
|
<a name="818"><span class="lineNum"> 818 </span> : : {</a>
|
||
|
|
<a name="819"><span class="lineNum"> 819 </span> : : if (__elemsafter > difference_type(__n))</a>
|
||
|
|
<a name="820"><span class="lineNum"> 820 </span> : : {</a>
|
||
|
|
<a name="821"><span class="lineNum"> 821 </span> : : iterator __finish_n = (this->_M_impl._M_finish</a>
|
||
|
|
<a name="822"><span class="lineNum"> 822 </span> : : - difference_type(__n));</a>
|
||
|
|
<a name="823"><span class="lineNum"> 823 </span> : : std::__uninitialized_move_a(__finish_n,</a>
|
||
|
|
<a name="824"><span class="lineNum"> 824 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="825"><span class="lineNum"> 825 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="826"><span class="lineNum"> 826 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="827"><span class="lineNum"> 827 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="828"><span class="lineNum"> 828 </span> : : _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);</a>
|
||
|
|
<a name="829"><span class="lineNum"> 829 </span> : : std::copy(__first, __last, __pos);</a>
|
||
|
|
<a name="830"><span class="lineNum"> 830 </span> : : }</a>
|
||
|
|
<a name="831"><span class="lineNum"> 831 </span> : : else</a>
|
||
|
|
<a name="832"><span class="lineNum"> 832 </span> : : {</a>
|
||
|
|
<a name="833"><span class="lineNum"> 833 </span> : : _ForwardIterator __mid = __first;</a>
|
||
|
|
<a name="834"><span class="lineNum"> 834 </span> : : std::advance(__mid, __elemsafter);</a>
|
||
|
|
<a name="835"><span class="lineNum"> 835 </span> : : std::__uninitialized_copy_move(__mid, __last, __pos,</a>
|
||
|
|
<a name="836"><span class="lineNum"> 836 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="837"><span class="lineNum"> 837 </span> : : this->_M_impl._M_finish,</a>
|
||
|
|
<a name="838"><span class="lineNum"> 838 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="839"><span class="lineNum"> 839 </span> : : this->_M_impl._M_finish = __new_finish;</a>
|
||
|
|
<a name="840"><span class="lineNum"> 840 </span> : : std::copy(__first, __mid, __pos);</a>
|
||
|
|
<a name="841"><span class="lineNum"> 841 </span> : : }</a>
|
||
|
|
<a name="842"><span class="lineNum"> 842 </span> : : }</a>
|
||
|
|
<a name="843"><span class="lineNum"> 843 </span> : : __catch(...)</a>
|
||
|
|
<a name="844"><span class="lineNum"> 844 </span> : : {</a>
|
||
|
|
<a name="845"><span class="lineNum"> 845 </span> : : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</a>
|
||
|
|
<a name="846"><span class="lineNum"> 846 </span> : : __new_finish._M_node + 1);</a>
|
||
|
|
<a name="847"><span class="lineNum"> 847 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="848"><span class="lineNum"> 848 </span> : : }</a>
|
||
|
|
<a name="849"><span class="lineNum"> 849 </span> : : }</a>
|
||
|
|
<a name="850"><span class="lineNum"> 850 </span> : : }</a>
|
||
|
|
<a name="851"><span class="lineNum"> 851 </span> : : </a>
|
||
|
|
<a name="852"><span class="lineNum"> 852 </span> : : template<typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="853"><span class="lineNum"> 853 </span> : : void</a>
|
||
|
|
<a name="854"><span class="lineNum"> 854 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="855"><span class="lineNum"> 855 </span> : : _M_destroy_data_aux(iterator __first, iterator __last)</a>
|
||
|
|
<a name="856"><span class="lineNum"> 856 </span> : : {</a>
|
||
|
|
<a name="857"><span class="lineNum"> 857 </span> : : for (_Map_pointer __node = __first._M_node + 1;</a>
|
||
|
|
<a name="858"><span class="lineNum"> 858 </span> : : __node < __last._M_node; ++__node)</a>
|
||
|
|
<a name="859"><span class="lineNum"> 859 </span> : : std::_Destroy(*__node, *__node + _S_buffer_size(),</a>
|
||
|
|
<a name="860"><span class="lineNum"> 860 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="861"><span class="lineNum"> 861 </span> : : </a>
|
||
|
|
<a name="862"><span class="lineNum"> 862 </span> : : if (__first._M_node != __last._M_node)</a>
|
||
|
|
<a name="863"><span class="lineNum"> 863 </span> : : {</a>
|
||
|
|
<a name="864"><span class="lineNum"> 864 </span> : : std::_Destroy(__first._M_cur, __first._M_last,</a>
|
||
|
|
<a name="865"><span class="lineNum"> 865 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="866"><span class="lineNum"> 866 </span> : : std::_Destroy(__last._M_first, __last._M_cur,</a>
|
||
|
|
<a name="867"><span class="lineNum"> 867 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="868"><span class="lineNum"> 868 </span> : : }</a>
|
||
|
|
<a name="869"><span class="lineNum"> 869 </span> : : else</a>
|
||
|
|
<a name="870"><span class="lineNum"> 870 </span> : : std::_Destroy(__first._M_cur, __last._M_cur,</a>
|
||
|
|
<a name="871"><span class="lineNum"> 871 </span> : : _M_get_Tp_allocator());</a>
|
||
|
|
<a name="872"><span class="lineNum"> 872 </span> : : }</a>
|
||
|
|
<a name="873"><span class="lineNum"> 873 </span> : : </a>
|
||
|
|
<a name="874"><span class="lineNum"> 874 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="875"><span class="lineNum"> 875 </span> : : void</a>
|
||
|
|
<a name="876"><span class="lineNum"> 876 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="877"><span class="lineNum"> 877 </span> : : _M_new_elements_at_front(size_type __new_elems)</a>
|
||
|
|
<a name="878"><span class="lineNum"> 878 </span> : : {</a>
|
||
|
|
<a name="879"><span class="lineNum"> 879 </span> : : if (this->max_size() - this->size() < __new_elems)</a>
|
||
|
|
<a name="880"><span class="lineNum"> 880 </span> : : __throw_length_error(__N("deque::_M_new_elements_at_front"));</a>
|
||
|
|
<a name="881"><span class="lineNum"> 881 </span> : : </a>
|
||
|
|
<a name="882"><span class="lineNum"> 882 </span> : : const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1)</a>
|
||
|
|
<a name="883"><span class="lineNum"> 883 </span> : : / _S_buffer_size());</a>
|
||
|
|
<a name="884"><span class="lineNum"> 884 </span> : : _M_reserve_map_at_front(__new_nodes);</a>
|
||
|
|
<a name="885"><span class="lineNum"> 885 </span> : : size_type __i;</a>
|
||
|
|
<a name="886"><span class="lineNum"> 886 </span> : : __try</a>
|
||
|
|
<a name="887"><span class="lineNum"> 887 </span> : : {</a>
|
||
|
|
<a name="888"><span class="lineNum"> 888 </span> : : for (__i = 1; __i <= __new_nodes; ++__i)</a>
|
||
|
|
<a name="889"><span class="lineNum"> 889 </span> : : *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node();</a>
|
||
|
|
<a name="890"><span class="lineNum"> 890 </span> : : }</a>
|
||
|
|
<a name="891"><span class="lineNum"> 891 </span> : : __catch(...)</a>
|
||
|
|
<a name="892"><span class="lineNum"> 892 </span> : : {</a>
|
||
|
|
<a name="893"><span class="lineNum"> 893 </span> : : for (size_type __j = 1; __j < __i; ++__j)</a>
|
||
|
|
<a name="894"><span class="lineNum"> 894 </span> : : _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j));</a>
|
||
|
|
<a name="895"><span class="lineNum"> 895 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="896"><span class="lineNum"> 896 </span> : : }</a>
|
||
|
|
<a name="897"><span class="lineNum"> 897 </span> : : }</a>
|
||
|
|
<a name="898"><span class="lineNum"> 898 </span> : : </a>
|
||
|
|
<a name="899"><span class="lineNum"> 899 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="900"><span class="lineNum"> 900 </span> : : void</a>
|
||
|
|
<a name="901"><span class="lineNum"> 901 </span> : : deque<_Tp, _Alloc>::</a>
|
||
|
|
<a name="902"><span class="lineNum"> 902 </span> : : _M_new_elements_at_back(size_type __new_elems)</a>
|
||
|
|
<a name="903"><span class="lineNum"> 903 </span> : : {</a>
|
||
|
|
<a name="904"><span class="lineNum"> 904 </span> : : if (this->max_size() - this->size() < __new_elems)</a>
|
||
|
|
<a name="905"><span class="lineNum"> 905 </span> : : __throw_length_error(__N("deque::_M_new_elements_at_back"));</a>
|
||
|
|
<a name="906"><span class="lineNum"> 906 </span> : : </a>
|
||
|
|
<a name="907"><span class="lineNum"> 907 </span> : : const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1)</a>
|
||
|
|
<a name="908"><span class="lineNum"> 908 </span> : : / _S_buffer_size());</a>
|
||
|
|
<a name="909"><span class="lineNum"> 909 </span> : : _M_reserve_map_at_back(__new_nodes);</a>
|
||
|
|
<a name="910"><span class="lineNum"> 910 </span> : : size_type __i;</a>
|
||
|
|
<a name="911"><span class="lineNum"> 911 </span> : : __try</a>
|
||
|
|
<a name="912"><span class="lineNum"> 912 </span> : : {</a>
|
||
|
|
<a name="913"><span class="lineNum"> 913 </span> : : for (__i = 1; __i <= __new_nodes; ++__i)</a>
|
||
|
|
<a name="914"><span class="lineNum"> 914 </span> : : *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node();</a>
|
||
|
|
<a name="915"><span class="lineNum"> 915 </span> : : }</a>
|
||
|
|
<a name="916"><span class="lineNum"> 916 </span> : : __catch(...)</a>
|
||
|
|
<a name="917"><span class="lineNum"> 917 </span> : : {</a>
|
||
|
|
<a name="918"><span class="lineNum"> 918 </span> : : for (size_type __j = 1; __j < __i; ++__j)</a>
|
||
|
|
<a name="919"><span class="lineNum"> 919 </span> : : _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j));</a>
|
||
|
|
<a name="920"><span class="lineNum"> 920 </span> : : __throw_exception_again;</a>
|
||
|
|
<a name="921"><span class="lineNum"> 921 </span> : : }</a>
|
||
|
|
<a name="922"><span class="lineNum"> 922 </span> : : }</a>
|
||
|
|
<a name="923"><span class="lineNum"> 923 </span> : : </a>
|
||
|
|
<a name="924"><span class="lineNum"> 924 </span> : : template <typename _Tp, typename _Alloc></a>
|
||
|
|
<a name="925"><span class="lineNum"> 925 </span> : : void</a>
|
||
|
|
<a name="926"><span class="lineNum"> 926 </span> :<span class="lineNoCov"> 0 : deque<_Tp, _Alloc>::</span></a>
|
||
|
|
<a name="927"><span class="lineNum"> 927 </span> : : _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)</a>
|
||
|
|
<a name="928"><span class="lineNum"> 928 </span> : : {</a>
|
||
|
|
<a name="929"><span class="lineNum"> 929 </span> :<span class="lineNoCov"> 0 : const size_type __old_num_nodes</span></a>
|
||
|
|
<a name="930"><span class="lineNum"> 930 </span> :<span class="lineNoCov"> 0 : = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1;</span></a>
|
||
|
|
<a name="931"><span class="lineNum"> 931 </span> :<span class="lineNoCov"> 0 : const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;</span></a>
|
||
|
|
<a name="932"><span class="lineNum"> 932 </span> : : </a>
|
||
|
|
<a name="933"><span class="lineNum"> 933 </span> : : _Map_pointer __new_nstart;</a>
|
||
|
|
<a name="934"><span class="lineNum"> 934 </span> [<span class="branchNoExec" title="Branch 0 was not executed"> # </span><span class="branchNoExec" title="Branch 1 was not executed"> # </span>]:<span class="lineNoCov"> 0 : if (this->_M_impl._M_map_size > 2 * __new_num_nodes)</span></a>
|
||
|
|
<a name="935"><span class="lineNum"> 935 </span> : : {</a>
|
||
|
|
<a name="936"><span class="lineNum"> 936 </span> :<span class="lineNoCov"> 0 : __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size</span></a>
|
||
|
|
<a name="937"><span class="lineNum"> 937 </span> :<span class="lineNoCov"> 0 : - __new_num_nodes) / 2</span></a>
|
||
|
|
<a name="938"><span class="lineNum"> 938 </span> [<span class="branchNoExec" title="Branch 0 was not executed"> # </span><span class="branchNoExec" title="Branch 1 was not executed"> # </span>]:<span class="lineNoCov"> 0 : + (__add_at_front ? __nodes_to_add : 0);</span></a>
|
||
|
|
<a name="939"><span class="lineNum"> 939 </span> [<span class="branchNoExec" title="Branch 0 was not executed"> # </span><span class="branchNoExec" title="Branch 1 was not executed"> # </span>]:<span class="lineNoCov"> 0 : if (__new_nstart < this->_M_impl._M_start._M_node)</span></a>
|
||
|
|
<a name="940"><span class="lineNum"> 940 </span> :<span class="lineNoCov"> 0 : std::copy(this->_M_impl._M_start._M_node,</span></a>
|
||
|
|
<a name="941"><span class="lineNum"> 941 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_node + 1,</span></a>
|
||
|
|
<a name="942"><span class="lineNum"> 942 </span> : : __new_nstart);</a>
|
||
|
|
<a name="943"><span class="lineNum"> 943 </span> : : else</a>
|
||
|
|
<a name="944"><span class="lineNum"> 944 </span> :<span class="lineNoCov"> 0 : std::copy_backward(this->_M_impl._M_start._M_node,</span></a>
|
||
|
|
<a name="945"><span class="lineNum"> 945 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_node + 1,</span></a>
|
||
|
|
<a name="946"><span class="lineNum"> 946 </span> :<span class="lineNoCov"> 0 : __new_nstart + __old_num_nodes);</span></a>
|
||
|
|
<a name="947"><span class="lineNum"> 947 </span> : : }</a>
|
||
|
|
<a name="948"><span class="lineNum"> 948 </span> : : else</a>
|
||
|
|
<a name="949"><span class="lineNum"> 949 </span> : : {</a>
|
||
|
|
<a name="950"><span class="lineNum"> 950 </span> :<span class="lineNoCov"> 0 : size_type __new_map_size = this->_M_impl._M_map_size</span></a>
|
||
|
|
<a name="951"><span class="lineNum"> 951 </span> :<span class="lineNoCov"> 0 : + std::max(this->_M_impl._M_map_size,</span></a>
|
||
|
|
<a name="952"><span class="lineNum"> 952 </span> : : __nodes_to_add) + 2;</a>
|
||
|
|
<a name="953"><span class="lineNum"> 953 </span> : : </a>
|
||
|
|
<a name="954"><span class="lineNum"> 954 </span> :<span class="lineNoCov"> 0 : _Map_pointer __new_map = this->_M_allocate_map(__new_map_size);</span></a>
|
||
|
|
<a name="955"><span class="lineNum"> 955 </span> :<span class="lineNoCov"> 0 : __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2</span></a>
|
||
|
|
<a name="956"><span class="lineNum"> 956 </span> [<span class="branchNoExec" title="Branch 0 was not executed"> # </span><span class="branchNoExec" title="Branch 1 was not executed"> # </span>]:<span class="lineNoCov"> 0 : + (__add_at_front ? __nodes_to_add : 0);</span></a>
|
||
|
|
<a name="957"><span class="lineNum"> 957 </span> :<span class="lineNoCov"> 0 : std::copy(this->_M_impl._M_start._M_node,</span></a>
|
||
|
|
<a name="958"><span class="lineNum"> 958 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_node + 1,</span></a>
|
||
|
|
<a name="959"><span class="lineNum"> 959 </span> : : __new_nstart);</a>
|
||
|
|
<a name="960"><span class="lineNum"> 960 </span> :<span class="lineNoCov"> 0 : _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</span></a>
|
||
|
|
<a name="961"><span class="lineNum"> 961 </span> : : </a>
|
||
|
|
<a name="962"><span class="lineNum"> 962 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_map = __new_map;</span></a>
|
||
|
|
<a name="963"><span class="lineNum"> 963 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_map_size = __new_map_size;</span></a>
|
||
|
|
<a name="964"><span class="lineNum"> 964 </span> : : }</a>
|
||
|
|
<a name="965"><span class="lineNum"> 965 </span> : : </a>
|
||
|
|
<a name="966"><span class="lineNum"> 966 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_start._M_set_node(__new_nstart);</span></a>
|
||
|
|
<a name="967"><span class="lineNum"> 967 </span> :<span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);</span></a>
|
||
|
|
<a name="968"><span class="lineNum"> 968 </span> :<span class="lineNoCov"> 0 : }</span></a>
|
||
|
|
<a name="969"><span class="lineNum"> 969 </span> : : </a>
|
||
|
|
<a name="970"><span class="lineNum"> 970 </span> : : // Overload for deque::iterators, exploiting the "segmented-iterator</a>
|
||
|
|
<a name="971"><span class="lineNum"> 971 </span> : : // optimization".</a>
|
||
|
|
<a name="972"><span class="lineNum"> 972 </span> : : template<typename _Tp></a>
|
||
|
|
<a name="973"><span class="lineNum"> 973 </span> : : void</a>
|
||
|
|
<a name="974"><span class="lineNum"> 974 </span> : : fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,</a>
|
||
|
|
<a name="975"><span class="lineNum"> 975 </span> : : const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value)</a>
|
||
|
|
<a name="976"><span class="lineNum"> 976 </span> : : {</a>
|
||
|
|
<a name="977"><span class="lineNum"> 977 </span> : : typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</a>
|
||
|
|
<a name="978"><span class="lineNum"> 978 </span> : : </a>
|
||
|
|
<a name="979"><span class="lineNum"> 979 </span> : : for (typename _Self::_Map_pointer __node = __first._M_node + 1;</a>
|
||
|
|
<a name="980"><span class="lineNum"> 980 </span> : : __node < __last._M_node; ++__node)</a>
|
||
|
|
<a name="981"><span class="lineNum"> 981 </span> : : std::fill(*__node, *__node + _Self::_S_buffer_size(), __value);</a>
|
||
|
|
<a name="982"><span class="lineNum"> 982 </span> : : </a>
|
||
|
|
<a name="983"><span class="lineNum"> 983 </span> : : if (__first._M_node != __last._M_node)</a>
|
||
|
|
<a name="984"><span class="lineNum"> 984 </span> : : {</a>
|
||
|
|
<a name="985"><span class="lineNum"> 985 </span> : : std::fill(__first._M_cur, __first._M_last, __value);</a>
|
||
|
|
<a name="986"><span class="lineNum"> 986 </span> : : std::fill(__last._M_first, __last._M_cur, __value);</a>
|
||
|
|
<a name="987"><span class="lineNum"> 987 </span> : : }</a>
|
||
|
|
<a name="988"><span class="lineNum"> 988 </span> : : else</a>
|
||
|
|
<a name="989"><span class="lineNum"> 989 </span> : : std::fill(__first._M_cur, __last._M_cur, __value);</a>
|
||
|
|
<a name="990"><span class="lineNum"> 990 </span> : : }</a>
|
||
|
|
<a name="991"><span class="lineNum"> 991 </span> : : </a>
|
||
|
|
<a name="992"><span class="lineNum"> 992 </span> : : template<typename _Tp></a>
|
||
|
|
<a name="993"><span class="lineNum"> 993 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*></a>
|
||
|
|
<a name="994"><span class="lineNum"> 994 </span> : : copy(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</a>
|
||
|
|
<a name="995"><span class="lineNum"> 995 </span> : : _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</a>
|
||
|
|
<a name="996"><span class="lineNum"> 996 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</a>
|
||
|
|
<a name="997"><span class="lineNum"> 997 </span> : : {</a>
|
||
|
|
<a name="998"><span class="lineNum"> 998 </span> : : typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</a>
|
||
|
|
<a name="999"><span class="lineNum"> 999 </span> : : typedef typename _Self::difference_type difference_type;</a>
|
||
|
|
<a name="1000"><span class="lineNum"> 1000 </span> : : </a>
|
||
|
|
<a name="1001"><span class="lineNum"> 1001 </span> : : difference_type __len = __last - __first;</a>
|
||
|
|
<a name="1002"><span class="lineNum"> 1002 </span> : : while (__len > 0)</a>
|
||
|
|
<a name="1003"><span class="lineNum"> 1003 </span> : : {</a>
|
||
|
|
<a name="1004"><span class="lineNum"> 1004 </span> : : const difference_type __clen</a>
|
||
|
|
<a name="1005"><span class="lineNum"> 1005 </span> : : = std::min(__len, std::min(__first._M_last - __first._M_cur,</a>
|
||
|
|
<a name="1006"><span class="lineNum"> 1006 </span> : : __result._M_last - __result._M_cur));</a>
|
||
|
|
<a name="1007"><span class="lineNum"> 1007 </span> : : std::copy(__first._M_cur, __first._M_cur + __clen, __result._M_cur);</a>
|
||
|
|
<a name="1008"><span class="lineNum"> 1008 </span> : : __first += __clen;</a>
|
||
|
|
<a name="1009"><span class="lineNum"> 1009 </span> : : __result += __clen;</a>
|
||
|
|
<a name="1010"><span class="lineNum"> 1010 </span> : : __len -= __clen;</a>
|
||
|
|
<a name="1011"><span class="lineNum"> 1011 </span> : : }</a>
|
||
|
|
<a name="1012"><span class="lineNum"> 1012 </span> : : return __result;</a>
|
||
|
|
<a name="1013"><span class="lineNum"> 1013 </span> : : }</a>
|
||
|
|
<a name="1014"><span class="lineNum"> 1014 </span> : : </a>
|
||
|
|
<a name="1015"><span class="lineNum"> 1015 </span> : : template<typename _Tp></a>
|
||
|
|
<a name="1016"><span class="lineNum"> 1016 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*></a>
|
||
|
|
<a name="1017"><span class="lineNum"> 1017 </span> : : copy_backward(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</a>
|
||
|
|
<a name="1018"><span class="lineNum"> 1018 </span> : : _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</a>
|
||
|
|
<a name="1019"><span class="lineNum"> 1019 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</a>
|
||
|
|
<a name="1020"><span class="lineNum"> 1020 </span> : : {</a>
|
||
|
|
<a name="1021"><span class="lineNum"> 1021 </span> : : typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</a>
|
||
|
|
<a name="1022"><span class="lineNum"> 1022 </span> : : typedef typename _Self::difference_type difference_type;</a>
|
||
|
|
<a name="1023"><span class="lineNum"> 1023 </span> : : </a>
|
||
|
|
<a name="1024"><span class="lineNum"> 1024 </span> : : difference_type __len = __last - __first;</a>
|
||
|
|
<a name="1025"><span class="lineNum"> 1025 </span> : : while (__len > 0)</a>
|
||
|
|
<a name="1026"><span class="lineNum"> 1026 </span> : : {</a>
|
||
|
|
<a name="1027"><span class="lineNum"> 1027 </span> : : difference_type __llen = __last._M_cur - __last._M_first;</a>
|
||
|
|
<a name="1028"><span class="lineNum"> 1028 </span> : : _Tp* __lend = __last._M_cur;</a>
|
||
|
|
<a name="1029"><span class="lineNum"> 1029 </span> : : </a>
|
||
|
|
<a name="1030"><span class="lineNum"> 1030 </span> : : difference_type __rlen = __result._M_cur - __result._M_first;</a>
|
||
|
|
<a name="1031"><span class="lineNum"> 1031 </span> : : _Tp* __rend = __result._M_cur;</a>
|
||
|
|
<a name="1032"><span class="lineNum"> 1032 </span> : : </a>
|
||
|
|
<a name="1033"><span class="lineNum"> 1033 </span> : : if (!__llen)</a>
|
||
|
|
<a name="1034"><span class="lineNum"> 1034 </span> : : {</a>
|
||
|
|
<a name="1035"><span class="lineNum"> 1035 </span> : : __llen = _Self::_S_buffer_size();</a>
|
||
|
|
<a name="1036"><span class="lineNum"> 1036 </span> : : __lend = *(__last._M_node - 1) + __llen;</a>
|
||
|
|
<a name="1037"><span class="lineNum"> 1037 </span> : : }</a>
|
||
|
|
<a name="1038"><span class="lineNum"> 1038 </span> : : if (!__rlen)</a>
|
||
|
|
<a name="1039"><span class="lineNum"> 1039 </span> : : {</a>
|
||
|
|
<a name="1040"><span class="lineNum"> 1040 </span> : : __rlen = _Self::_S_buffer_size();</a>
|
||
|
|
<a name="1041"><span class="lineNum"> 1041 </span> : : __rend = *(__result._M_node - 1) + __rlen;</a>
|
||
|
|
<a name="1042"><span class="lineNum"> 1042 </span> : : }</a>
|
||
|
|
<a name="1043"><span class="lineNum"> 1043 </span> : : </a>
|
||
|
|
<a name="1044"><span class="lineNum"> 1044 </span> : : const difference_type __clen = std::min(__len,</a>
|
||
|
|
<a name="1045"><span class="lineNum"> 1045 </span> : : std::min(__llen, __rlen));</a>
|
||
|
|
<a name="1046"><span class="lineNum"> 1046 </span> : : std::copy_backward(__lend - __clen, __lend, __rend);</a>
|
||
|
|
<a name="1047"><span class="lineNum"> 1047 </span> : : __last -= __clen;</a>
|
||
|
|
<a name="1048"><span class="lineNum"> 1048 </span> : : __result -= __clen;</a>
|
||
|
|
<a name="1049"><span class="lineNum"> 1049 </span> : : __len -= __clen;</a>
|
||
|
|
<a name="1050"><span class="lineNum"> 1050 </span> : : }</a>
|
||
|
|
<a name="1051"><span class="lineNum"> 1051 </span> : : return __result;</a>
|
||
|
|
<a name="1052"><span class="lineNum"> 1052 </span> : : }</a>
|
||
|
|
<a name="1053"><span class="lineNum"> 1053 </span> : : </a>
|
||
|
|
<a name="1054"><span class="lineNum"> 1054 </span> : : #if __cplusplus >= 201103L</a>
|
||
|
|
<a name="1055"><span class="lineNum"> 1055 </span> : : template<typename _Tp></a>
|
||
|
|
<a name="1056"><span class="lineNum"> 1056 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*></a>
|
||
|
|
<a name="1057"><span class="lineNum"> 1057 </span> : : move(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</a>
|
||
|
|
<a name="1058"><span class="lineNum"> 1058 </span> : : _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</a>
|
||
|
|
<a name="1059"><span class="lineNum"> 1059 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</a>
|
||
|
|
<a name="1060"><span class="lineNum"> 1060 </span> : : {</a>
|
||
|
|
<a name="1061"><span class="lineNum"> 1061 </span> : : typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</a>
|
||
|
|
<a name="1062"><span class="lineNum"> 1062 </span> : : typedef typename _Self::difference_type difference_type;</a>
|
||
|
|
<a name="1063"><span class="lineNum"> 1063 </span> : : </a>
|
||
|
|
<a name="1064"><span class="lineNum"> 1064 </span> : : difference_type __len = __last - __first;</a>
|
||
|
|
<a name="1065"><span class="lineNum"> 1065 </span> : : while (__len > 0)</a>
|
||
|
|
<a name="1066"><span class="lineNum"> 1066 </span> : : {</a>
|
||
|
|
<a name="1067"><span class="lineNum"> 1067 </span> : : const difference_type __clen</a>
|
||
|
|
<a name="1068"><span class="lineNum"> 1068 </span> : : = std::min(__len, std::min(__first._M_last - __first._M_cur,</a>
|
||
|
|
<a name="1069"><span class="lineNum"> 1069 </span> : : __result._M_last - __result._M_cur));</a>
|
||
|
|
<a name="1070"><span class="lineNum"> 1070 </span> : : std::move(__first._M_cur, __first._M_cur + __clen, __result._M_cur);</a>
|
||
|
|
<a name="1071"><span class="lineNum"> 1071 </span> : : __first += __clen;</a>
|
||
|
|
<a name="1072"><span class="lineNum"> 1072 </span> : : __result += __clen;</a>
|
||
|
|
<a name="1073"><span class="lineNum"> 1073 </span> : : __len -= __clen;</a>
|
||
|
|
<a name="1074"><span class="lineNum"> 1074 </span> : : }</a>
|
||
|
|
<a name="1075"><span class="lineNum"> 1075 </span> : : return __result;</a>
|
||
|
|
<a name="1076"><span class="lineNum"> 1076 </span> : : }</a>
|
||
|
|
<a name="1077"><span class="lineNum"> 1077 </span> : : </a>
|
||
|
|
<a name="1078"><span class="lineNum"> 1078 </span> : : template<typename _Tp></a>
|
||
|
|
<a name="1079"><span class="lineNum"> 1079 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*></a>
|
||
|
|
<a name="1080"><span class="lineNum"> 1080 </span> : : move_backward(_Deque_iterator<_Tp, const _Tp&, const _Tp*> __first,</a>
|
||
|
|
<a name="1081"><span class="lineNum"> 1081 </span> : : _Deque_iterator<_Tp, const _Tp&, const _Tp*> __last,</a>
|
||
|
|
<a name="1082"><span class="lineNum"> 1082 </span> : : _Deque_iterator<_Tp, _Tp&, _Tp*> __result)</a>
|
||
|
|
<a name="1083"><span class="lineNum"> 1083 </span> : : {</a>
|
||
|
|
<a name="1084"><span class="lineNum"> 1084 </span> : : typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self;</a>
|
||
|
|
<a name="1085"><span class="lineNum"> 1085 </span> : : typedef typename _Self::difference_type difference_type;</a>
|
||
|
|
<a name="1086"><span class="lineNum"> 1086 </span> : : </a>
|
||
|
|
<a name="1087"><span class="lineNum"> 1087 </span> : : difference_type __len = __last - __first;</a>
|
||
|
|
<a name="1088"><span class="lineNum"> 1088 </span> : : while (__len > 0)</a>
|
||
|
|
<a name="1089"><span class="lineNum"> 1089 </span> : : {</a>
|
||
|
|
<a name="1090"><span class="lineNum"> 1090 </span> : : difference_type __llen = __last._M_cur - __last._M_first;</a>
|
||
|
|
<a name="1091"><span class="lineNum"> 1091 </span> : : _Tp* __lend = __last._M_cur;</a>
|
||
|
|
<a name="1092"><span class="lineNum"> 1092 </span> : : </a>
|
||
|
|
<a name="1093"><span class="lineNum"> 1093 </span> : : difference_type __rlen = __result._M_cur - __result._M_first;</a>
|
||
|
|
<a name="1094"><span class="lineNum"> 1094 </span> : : _Tp* __rend = __result._M_cur;</a>
|
||
|
|
<a name="1095"><span class="lineNum"> 1095 </span> : : </a>
|
||
|
|
<a name="1096"><span class="lineNum"> 1096 </span> : : if (!__llen)</a>
|
||
|
|
<a name="1097"><span class="lineNum"> 1097 </span> : : {</a>
|
||
|
|
<a name="1098"><span class="lineNum"> 1098 </span> : : __llen = _Self::_S_buffer_size();</a>
|
||
|
|
<a name="1099"><span class="lineNum"> 1099 </span> : : __lend = *(__last._M_node - 1) + __llen;</a>
|
||
|
|
<a name="1100"><span class="lineNum"> 1100 </span> : : }</a>
|
||
|
|
<a name="1101"><span class="lineNum"> 1101 </span> : : if (!__rlen)</a>
|
||
|
|
<a name="1102"><span class="lineNum"> 1102 </span> : : {</a>
|
||
|
|
<a name="1103"><span class="lineNum"> 1103 </span> : : __rlen = _Self::_S_buffer_size();</a>
|
||
|
|
<a name="1104"><span class="lineNum"> 1104 </span> : : __rend = *(__result._M_node - 1) + __rlen;</a>
|
||
|
|
<a name="1105"><span class="lineNum"> 1105 </span> : : }</a>
|
||
|
|
<a name="1106"><span class="lineNum"> 1106 </span> : : </a>
|
||
|
|
<a name="1107"><span class="lineNum"> 1107 </span> : : const difference_type __clen = std::min(__len,</a>
|
||
|
|
<a name="1108"><span class="lineNum"> 1108 </span> : : std::min(__llen, __rlen));</a>
|
||
|
|
<a name="1109"><span class="lineNum"> 1109 </span> : : std::move_backward(__lend - __clen, __lend, __rend);</a>
|
||
|
|
<a name="1110"><span class="lineNum"> 1110 </span> : : __last -= __clen;</a>
|
||
|
|
<a name="1111"><span class="lineNum"> 1111 </span> : : __result -= __clen;</a>
|
||
|
|
<a name="1112"><span class="lineNum"> 1112 </span> : : __len -= __clen;</a>
|
||
|
|
<a name="1113"><span class="lineNum"> 1113 </span> : : }</a>
|
||
|
|
<a name="1114"><span class="lineNum"> 1114 </span> : : return __result;</a>
|
||
|
|
<a name="1115"><span class="lineNum"> 1115 </span> : : }</a>
|
||
|
|
<a name="1116"><span class="lineNum"> 1116 </span> : : #endif</a>
|
||
|
|
<a name="1117"><span class="lineNum"> 1117 </span> : : </a>
|
||
|
|
<a name="1118"><span class="lineNum"> 1118 </span> : : _GLIBCXX_END_NAMESPACE_CONTAINER</a>
|
||
|
|
<a name="1119"><span class="lineNum"> 1119 </span> : : _GLIBCXX_END_NAMESPACE_VERSION</a>
|
||
|
|
<a name="1120"><span class="lineNum"> 1120 </span> : : } // namespace std</a>
|
||
|
|
<a name="1121"><span class="lineNum"> 1121 </span> : : </a>
|
||
|
|
<a name="1122"><span class="lineNum"> 1122 </span> : : #endif</a>
|
||
|
|
</pre>
|
||
|
|
</td>
|
||
|
|
</tr>
|
||
|
|
</table>
|
||
|
|
<br>
|
||
|
|
|
||
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
||
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
||
|
|
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.14</a></td></tr>
|
||
|
|
</table>
|
||
|
|
<br>
|
||
|
|
|
||
|
|
</body>
|
||
|
|
</html>
|