<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: std::deque< _Tp, _Alloc > Class Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a07304.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> |
<a href="#pub-methods">Public Member Functions</a> |
<a href="#pro-types">Protected Types</a> |
<a href="#pro-methods">Protected Member Functions</a> |
<a href="#pro-static-methods">Static Protected Member Functions</a> |
<a href="#pro-attribs">Protected Attributes</a> |
<a href="a07301.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">std::deque< _Tp, _Alloc > Class Template Reference<div class="ingroups"><a class="el" href="a01460.html">Containers</a> » <a class="el" href="a01461.html">Sequences</a></div></div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Inheritance diagram for std::deque< _Tp, _Alloc >:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="a07303.svg" width="171" height="123"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:afe3fbd0baf6c30dd3fa06c3a0152aee6"><td class="memItemLeft" align="right" valign="top"><a id="afe3fbd0baf6c30dd3fa06c3a0152aee6"></a>
typedef _Alloc </td><td class="memItemRight" valign="bottom"><b>allocator_type</b></td></tr>
<tr class="separator:afe3fbd0baf6c30dd3fa06c3a0152aee6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8e32f71311ef10141cabaab48ac8e414"><td class="memItemLeft" align="right" valign="top"><a id="a8e32f71311ef10141cabaab48ac8e414"></a>
typedef <a class="el" href="a07292.html">_Base::const_iterator</a> </td><td class="memItemRight" valign="bottom"><b>const_iterator</b></td></tr>
<tr class="separator:a8e32f71311ef10141cabaab48ac8e414"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7f5bb1b7f8f305ef36f9d962f0061d95"><td class="memItemLeft" align="right" valign="top"><a id="a7f5bb1b7f8f305ef36f9d962f0061d95"></a>
typedef _Alloc_traits::const_pointer </td><td class="memItemRight" valign="bottom"><b>const_pointer</b></td></tr>
<tr class="separator:a7f5bb1b7f8f305ef36f9d962f0061d95"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af2e393735a0f7a53cf3da55bac4715f7"><td class="memItemLeft" align="right" valign="top"><a id="af2e393735a0f7a53cf3da55bac4715f7"></a>
typedef _Alloc_traits::const_reference </td><td class="memItemRight" valign="bottom"><b>const_reference</b></td></tr>
<tr class="separator:af2e393735a0f7a53cf3da55bac4715f7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2c71b231205293b158661ef681a3b3db"><td class="memItemLeft" align="right" valign="top"><a id="a2c71b231205293b158661ef681a3b3db"></a>
typedef <a class="el" href="a07612.html">std::reverse_iterator</a>< <a class="el" href="a07292.html">const_iterator</a> > </td><td class="memItemRight" valign="bottom"><b>const_reverse_iterator</b></td></tr>
<tr class="separator:a2c71b231205293b158661ef681a3b3db"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3317c1bdbb65b3992394420ef5f98a9e"><td class="memItemLeft" align="right" valign="top"><a id="a3317c1bdbb65b3992394420ef5f98a9e"></a>
typedef ptrdiff_t </td><td class="memItemRight" valign="bottom"><b>difference_type</b></td></tr>
<tr class="separator:a3317c1bdbb65b3992394420ef5f98a9e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af1c936a6b01752957a341b82171006ae"><td class="memItemLeft" align="right" valign="top"><a id="af1c936a6b01752957a341b82171006ae"></a>
typedef <a class="el" href="a07292.html">_Base::iterator</a> </td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr>
<tr class="separator:af1c936a6b01752957a341b82171006ae"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ade0d108522fbeacba85c047645a91062"><td class="memItemLeft" align="right" valign="top"><a id="ade0d108522fbeacba85c047645a91062"></a>
typedef _Alloc_traits::pointer </td><td class="memItemRight" valign="bottom"><b>pointer</b></td></tr>
<tr class="separator:ade0d108522fbeacba85c047645a91062"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad6e682c4edd476461ddc1674192baf7c"><td class="memItemLeft" align="right" valign="top"><a id="ad6e682c4edd476461ddc1674192baf7c"></a>
typedef _Alloc_traits::reference </td><td class="memItemRight" valign="bottom"><b>reference</b></td></tr>
<tr class="separator:ad6e682c4edd476461ddc1674192baf7c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7911e50991f4eb2c880b65bede5ee92d"><td class="memItemLeft" align="right" valign="top"><a id="a7911e50991f4eb2c880b65bede5ee92d"></a>
typedef <a class="el" href="a07612.html">std::reverse_iterator</a>< <a class="el" href="a07292.html">iterator</a> > </td><td class="memItemRight" valign="bottom"><b>reverse_iterator</b></td></tr>
<tr class="separator:a7911e50991f4eb2c880b65bede5ee92d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7d7e27dbeb5afbf8391622192dc49865"><td class="memItemLeft" align="right" valign="top"><a id="a7d7e27dbeb5afbf8391622192dc49865"></a>
typedef size_t </td><td class="memItemRight" valign="bottom"><b>size_type</b></td></tr>
<tr class="separator:a7d7e27dbeb5afbf8391622192dc49865"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a37bda40dc9295629fbf1dbcf417afea4"><td class="memItemLeft" align="right" valign="top"><a id="a37bda40dc9295629fbf1dbcf417afea4"></a>
typedef _Tp </td><td class="memItemRight" valign="bottom"><b>value_type</b></td></tr>
<tr class="separator:a37bda40dc9295629fbf1dbcf417afea4"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ae68c6ac05cd6e788a90c9b8a47c56756"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a> ()</td></tr>
<tr class="separator:ae68c6ac05cd6e788a90c9b8a47c56756"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa8cf87c79a7c6bdf2cf07749fb1e2ff5"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#aa8cf87c79a7c6bdf2cf07749fb1e2ff5">deque</a> (const allocator_type &__a)</td></tr>
<tr class="separator:aa8cf87c79a7c6bdf2cf07749fb1e2ff5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a511a8f76d058f6bd0e2236abf8df23bc"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a511a8f76d058f6bd0e2236abf8df23bc">deque</a> (size_type __n, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a511a8f76d058f6bd0e2236abf8df23bc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a858d7660a45a911f8ae7858246ea2f6d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a858d7660a45a911f8ae7858246ea2f6d">deque</a> (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a858d7660a45a911f8ae7858246ea2f6d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a03515a6af7f959e28cec591ac5f0f8b2"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a03515a6af7f959e28cec591ac5f0f8b2">deque</a> (const <a class="el" href="a07304.html">deque</a> &__x)</td></tr>
<tr class="separator:a03515a6af7f959e28cec591ac5f0f8b2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7d533f573a77a0f9bf33fa40dde1c9cd"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a7d533f573a77a0f9bf33fa40dde1c9cd">deque</a> (<a class="el" href="a07304.html">deque</a> &&__x)</td></tr>
<tr class="separator:a7d533f573a77a0f9bf33fa40dde1c9cd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0948ee096c5387c1deb1e5885d06c112"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a0948ee096c5387c1deb1e5885d06c112">deque</a> (const <a class="el" href="a07304.html">deque</a> &__x, const allocator_type &__a)</td></tr>
<tr class="separator:a0948ee096c5387c1deb1e5885d06c112"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0bb7da7a228f22622f2e822252813d51"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a0bb7da7a228f22622f2e822252813d51">deque</a> (<a class="el" href="a07304.html">deque</a> &&__x, const allocator_type &__a)</td></tr>
<tr class="separator:a0bb7da7a228f22622f2e822252813d51"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abdc5fd34432d73edde92643c58d7db6d"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#abdc5fd34432d73edde92643c58d7db6d">deque</a> (<a class="el" href="a01652.html">initializer_list</a>< value_type > __l, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:abdc5fd34432d73edde92643c58d7db6d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac11b72c35c99798a8aa8428206af7b74"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:ac11b72c35c99798a8aa8428206af7b74"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#ac11b72c35c99798a8aa8428206af7b74">deque</a> (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:ac11b72c35c99798a8aa8428206af7b74"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8e7b8eb846862bae0ec76623338fa2a7"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a8e7b8eb846862bae0ec76623338fa2a7">~deque</a> ()</td></tr>
<tr class="separator:a8e7b8eb846862bae0ec76623338fa2a7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a65dabc6e005b7b5a19adf55792821e76"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a65dabc6e005b7b5a19adf55792821e76">assign</a> (size_type __n, const value_type &__val)</td></tr>
<tr class="separator:a65dabc6e005b7b5a19adf55792821e76"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac0579ff04738a923ad49b8b9398af642"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:ac0579ff04738a923ad49b8b9398af642"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#ac0579ff04738a923ad49b8b9398af642">assign</a> (_InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:ac0579ff04738a923ad49b8b9398af642"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab16028e538ba034ad569b6933c152cdb"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ab16028e538ba034ad569b6933c152cdb">assign</a> (<a class="el" href="a01652.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:ab16028e538ba034ad569b6933c152cdb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4b0080ca0ed1a2222104a5fb776a454f"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a4b0080ca0ed1a2222104a5fb776a454f">at</a> (size_type __n)</td></tr>
<tr class="separator:a4b0080ca0ed1a2222104a5fb776a454f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a03a10b684468f787e852fa360440ba7b"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a03a10b684468f787e852fa360440ba7b">at</a> (size_type __n) const</td></tr>
<tr class="separator:a03a10b684468f787e852fa360440ba7b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9345d8aadac1295d32b7390ede8478f5"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a9345d8aadac1295d32b7390ede8478f5">back</a> () noexcept</td></tr>
<tr class="separator:a9345d8aadac1295d32b7390ede8478f5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0ebb54615350e129c2ce3b51368402bb"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a0ebb54615350e129c2ce3b51368402bb">back</a> () const noexcept</td></tr>
<tr class="separator:a0ebb54615350e129c2ce3b51368402bb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af71a8fc9a6dff2b04bfd8b219c40a940"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#af71a8fc9a6dff2b04bfd8b219c40a940">begin</a> () noexcept</td></tr>
<tr class="separator:af71a8fc9a6dff2b04bfd8b219c40a940"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac5c61891a706a301138fdc8dbf0d0209"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ac5c61891a706a301138fdc8dbf0d0209">begin</a> () const noexcept</td></tr>
<tr class="separator:ac5c61891a706a301138fdc8dbf0d0209"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a289af3aac006b9faa969fbdf090f8202"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a289af3aac006b9faa969fbdf090f8202">cbegin</a> () const noexcept</td></tr>
<tr class="separator:a289af3aac006b9faa969fbdf090f8202"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae56c2f3c25dc623eba9825a2e3eddd7c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ae56c2f3c25dc623eba9825a2e3eddd7c">cend</a> () const noexcept</td></tr>
<tr class="separator:ae56c2f3c25dc623eba9825a2e3eddd7c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1a753bfa9e6b675bac7ee9ec4365fbdf"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a1a753bfa9e6b675bac7ee9ec4365fbdf">clear</a> () noexcept</td></tr>
<tr class="separator:a1a753bfa9e6b675bac7ee9ec4365fbdf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a86674e16182ecb624e854ce7a653c03e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07612.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a86674e16182ecb624e854ce7a653c03e">crbegin</a> () const noexcept</td></tr>
<tr class="separator:a86674e16182ecb624e854ce7a653c03e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a17d738d29f26320ce991399537a17bce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07612.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a17d738d29f26320ce991399537a17bce">crend</a> () const noexcept</td></tr>
<tr class="separator:a17d738d29f26320ce991399537a17bce"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3ea67e3e7fc5c84e92d9868bb57ae05a"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a3ea67e3e7fc5c84e92d9868bb57ae05a"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#a3ea67e3e7fc5c84e92d9868bb57ae05a">emplace</a> (<a class="el" href="a07292.html">const_iterator</a> __position, _Args &&... __args)</td></tr>
<tr class="separator:a3ea67e3e7fc5c84e92d9868bb57ae05a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2fdf35f06a855cf4131b4ef693baa73e"><td class="memTemplParams" colspan="2"><a id="a2fdf35f06a855cf4131b4ef693baa73e"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a2fdf35f06a855cf4131b4ef693baa73e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>emplace_back</b> (_Args &&... __args)</td></tr>
<tr class="separator:a2fdf35f06a855cf4131b4ef693baa73e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a79fb349fb2921b9eb1c5a2b84df97dd5"><td class="memTemplParams" colspan="2"><a id="a79fb349fb2921b9eb1c5a2b84df97dd5"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a79fb349fb2921b9eb1c5a2b84df97dd5"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>emplace_front</b> (_Args &&... __args)</td></tr>
<tr class="separator:a79fb349fb2921b9eb1c5a2b84df97dd5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a512ed6c7e0dc244335b337da26d76f41"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a512ed6c7e0dc244335b337da26d76f41">empty</a> () const noexcept</td></tr>
<tr class="separator:a512ed6c7e0dc244335b337da26d76f41"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a78b2da6c6329349581db042e6bbe2a40"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a78b2da6c6329349581db042e6bbe2a40">end</a> () noexcept</td></tr>
<tr class="separator:a78b2da6c6329349581db042e6bbe2a40"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad1986c3313eec924e6a7531929a82b8d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">const_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ad1986c3313eec924e6a7531929a82b8d">end</a> () const noexcept</td></tr>
<tr class="separator:ad1986c3313eec924e6a7531929a82b8d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0e0812f0cacd5dfd1108455df4fda375"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a0e0812f0cacd5dfd1108455df4fda375">erase</a> (<a class="el" href="a07292.html">const_iterator</a> __position)</td></tr>
<tr class="separator:a0e0812f0cacd5dfd1108455df4fda375"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af8f15e04574604071004bcdcd3be22fc"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#af8f15e04574604071004bcdcd3be22fc">erase</a> (<a class="el" href="a07292.html">const_iterator</a> __first, <a class="el" href="a07292.html">const_iterator</a> __last)</td></tr>
<tr class="separator:af8f15e04574604071004bcdcd3be22fc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae5172d8f3ab8a44f5f68f5d6256e5c7e"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ae5172d8f3ab8a44f5f68f5d6256e5c7e">front</a> () noexcept</td></tr>
<tr class="separator:ae5172d8f3ab8a44f5f68f5d6256e5c7e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a62222a6cab13f17c0489a3d6242dd6a8"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a62222a6cab13f17c0489a3d6242dd6a8">front</a> () const noexcept</td></tr>
<tr class="separator:a62222a6cab13f17c0489a3d6242dd6a8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a40d6b0cbbd61cda2b99f5fc4a274fe02"><td class="memItemLeft" align="right" valign="top">allocator_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a40d6b0cbbd61cda2b99f5fc4a274fe02">get_allocator</a> () const noexcept</td></tr>
<tr class="separator:a40d6b0cbbd61cda2b99f5fc4a274fe02"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a69b4ca4a5aad67e979d6e6db9b31781a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a69b4ca4a5aad67e979d6e6db9b31781a">insert</a> (<a class="el" href="a07292.html">const_iterator</a> __position, const value_type &__x)</td></tr>
<tr class="separator:a69b4ca4a5aad67e979d6e6db9b31781a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adec6ee2ba1f059f0addf6b9da5b596e1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#adec6ee2ba1f059f0addf6b9da5b596e1">insert</a> (<a class="el" href="a07292.html">const_iterator</a> __position, value_type &&__x)</td></tr>
<tr class="separator:adec6ee2ba1f059f0addf6b9da5b596e1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a755a6d05ef2270de50ce270bea77250f"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a755a6d05ef2270de50ce270bea77250f">insert</a> (<a class="el" href="a07292.html">const_iterator</a> __p, <a class="el" href="a01652.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:a755a6d05ef2270de50ce270bea77250f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad645c0144212cbfee911daa80578e997"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ad645c0144212cbfee911daa80578e997">insert</a> (<a class="el" href="a07292.html">const_iterator</a> __position, size_type __n, const value_type &__x)</td></tr>
<tr class="separator:ad645c0144212cbfee911daa80578e997"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aee2b0dd83e2d5c82db3b2df6918e484a"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:aee2b0dd83e2d5c82db3b2df6918e484a"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#aee2b0dd83e2d5c82db3b2df6918e484a">insert</a> (<a class="el" href="a07292.html">const_iterator</a> __position, _InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:aee2b0dd83e2d5c82db3b2df6918e484a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5aea8252ed76805923d591f878768f67"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a5aea8252ed76805923d591f878768f67">max_size</a> () const noexcept</td></tr>
<tr class="separator:a5aea8252ed76805923d591f878768f67"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acbbd2ced11be9e416c030bf3dcaeacad"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07304.html">deque</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#acbbd2ced11be9e416c030bf3dcaeacad">operator=</a> (const <a class="el" href="a07304.html">deque</a> &__x)</td></tr>
<tr class="separator:acbbd2ced11be9e416c030bf3dcaeacad"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a77734a257fa1c71752517d0ae6ae707d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07304.html">deque</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a77734a257fa1c71752517d0ae6ae707d">operator=</a> (<a class="el" href="a07304.html">deque</a> &&__x) noexcept(_Alloc_traits::_S_always_equal())</td></tr>
<tr class="separator:a77734a257fa1c71752517d0ae6ae707d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a74898d8b495f47ced979e6ba66c4eef1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07304.html">deque</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a74898d8b495f47ced979e6ba66c4eef1">operator=</a> (<a class="el" href="a01652.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:a74898d8b495f47ced979e6ba66c4eef1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a461a433ad999e2d22e10f45addf1bb67"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a461a433ad999e2d22e10f45addf1bb67">operator[]</a> (size_type __n) noexcept</td></tr>
<tr class="separator:a461a433ad999e2d22e10f45addf1bb67"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a513a4ab26ac9df40d7ec95fc50e1218b"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a513a4ab26ac9df40d7ec95fc50e1218b">operator[]</a> (size_type __n) const noexcept</td></tr>
<tr class="separator:a513a4ab26ac9df40d7ec95fc50e1218b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2299790b7c0080b2652ba374a2ea68fc"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a2299790b7c0080b2652ba374a2ea68fc">pop_back</a> () noexcept</td></tr>
<tr class="separator:a2299790b7c0080b2652ba374a2ea68fc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3f5c33f2728f70a589e11a2e8b013e78"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a3f5c33f2728f70a589e11a2e8b013e78">pop_front</a> () noexcept</td></tr>
<tr class="separator:a3f5c33f2728f70a589e11a2e8b013e78"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa261893d7576d53592700d030dedae78"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#aa261893d7576d53592700d030dedae78">push_back</a> (const value_type &__x)</td></tr>
<tr class="separator:aa261893d7576d53592700d030dedae78"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aff298f0b627fb33ac06d262cb2008259"><td class="memItemLeft" align="right" valign="top"><a id="aff298f0b627fb33ac06d262cb2008259"></a>
void </td><td class="memItemRight" valign="bottom"><b>push_back</b> (value_type &&__x)</td></tr>
<tr class="separator:aff298f0b627fb33ac06d262cb2008259"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5e23e99b8919a725e105786dd2bf20e9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a5e23e99b8919a725e105786dd2bf20e9">push_front</a> (const value_type &__x)</td></tr>
<tr class="separator:a5e23e99b8919a725e105786dd2bf20e9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a20c4680e18e3644296ce686f6a6764c5"><td class="memItemLeft" align="right" valign="top"><a id="a20c4680e18e3644296ce686f6a6764c5"></a>
void </td><td class="memItemRight" valign="bottom"><b>push_front</b> (value_type &&__x)</td></tr>
<tr class="separator:a20c4680e18e3644296ce686f6a6764c5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a00b51e916472a01d8d68945681ab8245"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07612.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a00b51e916472a01d8d68945681ab8245">rbegin</a> () noexcept</td></tr>
<tr class="separator:a00b51e916472a01d8d68945681ab8245"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af3714db48a222a584264a3e668bd5b3c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07612.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#af3714db48a222a584264a3e668bd5b3c">rbegin</a> () const noexcept</td></tr>
<tr class="separator:af3714db48a222a584264a3e668bd5b3c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0daef1995ab8473dad46086c79ecb9f0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07612.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a0daef1995ab8473dad46086c79ecb9f0">rend</a> () noexcept</td></tr>
<tr class="separator:a0daef1995ab8473dad46086c79ecb9f0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2d4c0290323b6a5a78b2e30d2706d753"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07612.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a2d4c0290323b6a5a78b2e30d2706d753">rend</a> () const noexcept</td></tr>
<tr class="separator:a2d4c0290323b6a5a78b2e30d2706d753"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2cb09fae5538690a6175b6e738f39b59"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a2cb09fae5538690a6175b6e738f39b59">resize</a> (size_type __new_size)</td></tr>
<tr class="separator:a2cb09fae5538690a6175b6e738f39b59"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5f7f1a01f2d6a06b4c89a4c5a84a9002"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a5f7f1a01f2d6a06b4c89a4c5a84a9002">resize</a> (size_type __new_size, const value_type &__x)</td></tr>
<tr class="separator:a5f7f1a01f2d6a06b4c89a4c5a84a9002"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abe9c2e87fe6d96dbbbf7f50f750d3cf2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#abe9c2e87fe6d96dbbbf7f50f750d3cf2">shrink_to_fit</a> () noexcept</td></tr>
<tr class="separator:abe9c2e87fe6d96dbbbf7f50f750d3cf2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a24d5150e384f657ca3b317ced4dadc5d"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a24d5150e384f657ca3b317ced4dadc5d">size</a> () const noexcept</td></tr>
<tr class="separator:a24d5150e384f657ca3b317ced4dadc5d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a41f78615b6896d0b85bef3aea0e41f2f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a41f78615b6896d0b85bef3aea0e41f2f">swap</a> (<a class="el" href="a07304.html">deque</a> &__x) noexcept</td></tr>
<tr class="separator:a41f78615b6896d0b85bef3aea0e41f2f"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-types"></a>
Protected Types</h2></td></tr>
<tr class="memitem:a0fe957aad5c7ecb9f40bfeb5e75dce48"><td class="memItemLeft" align="right" valign="top"><a id="a0fe957aad5c7ecb9f40bfeb5e75dce48"></a>enum  </td><td class="memItemRight" valign="bottom">{ <b>_S_initial_map_size</b>
}</td></tr>
<tr class="separator:a0fe957aad5c7ecb9f40bfeb5e75dce48"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a687644ef654670c010b783a163709d97"><td class="memItemLeft" align="right" valign="top"><a id="a687644ef654670c010b783a163709d97"></a>
typedef <a class="el" href="a10156.html">__gnu_cxx::__alloc_traits</a>< _Map_alloc_type > </td><td class="memItemRight" valign="bottom"><b>_Map_alloc_traits</b></td></tr>
<tr class="separator:a687644ef654670c010b783a163709d97"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7babfed89ab30924cfb43ffd9306dd2c"><td class="memItemLeft" align="right" valign="top"><a id="a7babfed89ab30924cfb43ffd9306dd2c"></a>
typedef _Alloc_traits::template rebind< _Ptr >::other </td><td class="memItemRight" valign="bottom"><b>_Map_alloc_type</b></td></tr>
<tr class="separator:a7babfed89ab30924cfb43ffd9306dd2c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab9133dc0346264e1694441cbc215a6db"><td class="memItemLeft" align="right" valign="top"><a id="ab9133dc0346264e1694441cbc215a6db"></a>
typedef _Alloc_traits::pointer </td><td class="memItemRight" valign="bottom"><b>_Ptr</b></td></tr>
<tr class="separator:ab9133dc0346264e1694441cbc215a6db"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5435c02c8f84484efb996df8973dd793"><td class="memItemLeft" align="right" valign="top"><a id="a5435c02c8f84484efb996df8973dd793"></a>
typedef _Alloc_traits::const_pointer </td><td class="memItemRight" valign="bottom"><b>_Ptr_const</b></td></tr>
<tr class="separator:a5435c02c8f84484efb996df8973dd793"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a4605d776b9c6823e3133c1bf2d4c336a"><td class="memItemLeft" align="right" valign="top"><a id="a4605d776b9c6823e3133c1bf2d4c336a"></a>
_Map_pointer </td><td class="memItemRight" valign="bottom"><b>_M_allocate_map</b> (size_t __n)</td></tr>
<tr class="separator:a4605d776b9c6823e3133c1bf2d4c336a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4605d776b9c6823e3133c1bf2d4c336a"><td class="memItemLeft" align="right" valign="top"><a id="a4605d776b9c6823e3133c1bf2d4c336a"></a>
_Map_pointer </td><td class="memItemRight" valign="bottom"><b>_M_allocate_map</b> (size_t __n)</td></tr>
<tr class="separator:a4605d776b9c6823e3133c1bf2d4c336a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0565094286d3d589d69cd8526a80b207"><td class="memItemLeft" align="right" valign="top"><a id="a0565094286d3d589d69cd8526a80b207"></a>
_Ptr </td><td class="memItemRight" valign="bottom"><b>_M_allocate_node</b> ()</td></tr>
<tr class="separator:a0565094286d3d589d69cd8526a80b207"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0565094286d3d589d69cd8526a80b207"><td class="memItemLeft" align="right" valign="top"><a id="a0565094286d3d589d69cd8526a80b207"></a>
_Ptr </td><td class="memItemRight" valign="bottom"><b>_M_allocate_node</b> ()</td></tr>
<tr class="separator:a0565094286d3d589d69cd8526a80b207"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab18e5792808d351e049d5e25fb076fac"><td class="memTemplParams" colspan="2"><a id="ab18e5792808d351e049d5e25fb076fac"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:ab18e5792808d351e049d5e25fb076fac"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_assign_aux</b> (_InputIterator __first, _InputIterator __last, <a class="el" href="a07652.html">std::input_iterator_tag</a>)</td></tr>
<tr class="separator:ab18e5792808d351e049d5e25fb076fac"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4ac2272b2bdb5b0fa882d2d697382868"><td class="memTemplParams" colspan="2"><a id="a4ac2272b2bdb5b0fa882d2d697382868"></a>
template<typename _ForwardIterator > </td></tr>
<tr class="memitem:a4ac2272b2bdb5b0fa882d2d697382868"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_assign_aux</b> (_ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a07660.html">std::forward_iterator_tag</a>)</td></tr>
<tr class="separator:a4ac2272b2bdb5b0fa882d2d697382868"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2ce26fda041bf29c62785490b8ffaefa"><td class="memTemplParams" colspan="2"><a id="a2ce26fda041bf29c62785490b8ffaefa"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:a2ce26fda041bf29c62785490b8ffaefa"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_assign_dispatch</b> (_Integer __n, _Integer __val, __true_type)</td></tr>
<tr class="separator:a2ce26fda041bf29c62785490b8ffaefa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8dbd736977480a407bc02d9dc8d51333"><td class="memTemplParams" colspan="2"><a id="a8dbd736977480a407bc02d9dc8d51333"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a8dbd736977480a407bc02d9dc8d51333"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_assign_dispatch</b> (_InputIterator __first, _InputIterator __last, __false_type)</td></tr>
<tr class="separator:a8dbd736977480a407bc02d9dc8d51333"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a74fb22e4b513cb736037e8dd4a115a1d"><td class="memItemLeft" align="right" valign="top"><a id="a74fb22e4b513cb736037e8dd4a115a1d"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_create_nodes</b> (_Map_pointer __nstart, _Map_pointer __nfinish)</td></tr>
<tr class="separator:a74fb22e4b513cb736037e8dd4a115a1d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a74fb22e4b513cb736037e8dd4a115a1d"><td class="memItemLeft" align="right" valign="top"><a id="a74fb22e4b513cb736037e8dd4a115a1d"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_create_nodes</b> (_Map_pointer __nstart, _Map_pointer __nfinish)</td></tr>
<tr class="separator:a74fb22e4b513cb736037e8dd4a115a1d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7b97df23c5631c1a1d621503b4ee5afe"><td class="memItemLeft" align="right" valign="top"><a id="a7b97df23c5631c1a1d621503b4ee5afe"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_deallocate_map</b> (_Map_pointer __p, size_t __n) noexcept</td></tr>
<tr class="separator:a7b97df23c5631c1a1d621503b4ee5afe"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7b97df23c5631c1a1d621503b4ee5afe"><td class="memItemLeft" align="right" valign="top"><a id="a7b97df23c5631c1a1d621503b4ee5afe"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_deallocate_map</b> (_Map_pointer __p, size_t __n) noexcept</td></tr>
<tr class="separator:a7b97df23c5631c1a1d621503b4ee5afe"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a11e97f47e8c02f29ebaa29329649f568"><td class="memItemLeft" align="right" valign="top"><a id="a11e97f47e8c02f29ebaa29329649f568"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_deallocate_node</b> (_Ptr __p) noexcept</td></tr>
<tr class="separator:a11e97f47e8c02f29ebaa29329649f568"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a11e97f47e8c02f29ebaa29329649f568"><td class="memItemLeft" align="right" valign="top"><a id="a11e97f47e8c02f29ebaa29329649f568"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_deallocate_node</b> (_Ptr __p) noexcept</td></tr>
<tr class="separator:a11e97f47e8c02f29ebaa29329649f568"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae817d2eee0268dc22aa14befa6932fef"><td class="memItemLeft" align="right" valign="top"><a id="ae817d2eee0268dc22aa14befa6932fef"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_default_append</b> (size_type __n)</td></tr>
<tr class="separator:ae817d2eee0268dc22aa14befa6932fef"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:addbfc6cead3dd8dc7a10f56516c77605"><td class="memItemLeft" align="right" valign="top"><a id="addbfc6cead3dd8dc7a10f56516c77605"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_default_initialize</b> ()</td></tr>
<tr class="separator:addbfc6cead3dd8dc7a10f56516c77605"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0db05f994447c462bc58b4807958b123"><td class="memTemplParams" colspan="2"><a id="a0db05f994447c462bc58b4807958b123"></a>
template<typename _Alloc1 > </td></tr>
<tr class="memitem:a0db05f994447c462bc58b4807958b123"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_destroy_data</b> (<a class="el" href="a07292.html">iterator</a> __first, <a class="el" href="a07292.html">iterator</a> __last, const _Alloc1 &)</td></tr>
<tr class="separator:a0db05f994447c462bc58b4807958b123"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ada4056c0ac21a663bb141fa4558a24c3"><td class="memItemLeft" align="right" valign="top"><a id="ada4056c0ac21a663bb141fa4558a24c3"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_destroy_data</b> (<a class="el" href="a07292.html">iterator</a> __first, <a class="el" href="a07292.html">iterator</a> __last, const <a class="el" href="a04704.html">std::allocator</a>< _Tp > &)</td></tr>
<tr class="separator:ada4056c0ac21a663bb141fa4558a24c3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a33740dac3c334ef44055b58ed7629eb7"><td class="memItemLeft" align="right" valign="top"><a id="a33740dac3c334ef44055b58ed7629eb7"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_destroy_data_aux</b> (<a class="el" href="a07292.html">iterator</a> __first, <a class="el" href="a07292.html">iterator</a> __last)</td></tr>
<tr class="separator:a33740dac3c334ef44055b58ed7629eb7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae32fbc35c68d7a6a7b0fd5900e3e9610"><td class="memItemLeft" align="right" valign="top"><a id="ae32fbc35c68d7a6a7b0fd5900e3e9610"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_destroy_nodes</b> (_Map_pointer __nstart, _Map_pointer __nfinish) noexcept</td></tr>
<tr class="separator:ae32fbc35c68d7a6a7b0fd5900e3e9610"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae32fbc35c68d7a6a7b0fd5900e3e9610"><td class="memItemLeft" align="right" valign="top"><a id="ae32fbc35c68d7a6a7b0fd5900e3e9610"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_destroy_nodes</b> (_Map_pointer __nstart, _Map_pointer __nfinish) noexcept</td></tr>
<tr class="separator:ae32fbc35c68d7a6a7b0fd5900e3e9610"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a274cfb52c2aefdccfd09e6551aef965c"><td class="memItemLeft" align="right" valign="top"><a id="a274cfb52c2aefdccfd09e6551aef965c"></a>
<a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><b>_M_erase</b> (<a class="el" href="a07292.html">iterator</a> __pos)</td></tr>
<tr class="separator:a274cfb52c2aefdccfd09e6551aef965c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8ad08caa00717ca88840ed9053a5cfd4"><td class="memItemLeft" align="right" valign="top"><a id="a8ad08caa00717ca88840ed9053a5cfd4"></a>
<a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><b>_M_erase</b> (<a class="el" href="a07292.html">iterator</a> __first, <a class="el" href="a07292.html">iterator</a> __last)</td></tr>
<tr class="separator:a8ad08caa00717ca88840ed9053a5cfd4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a57d83aba6e3dffe62b1fc027b157e30a"><td class="memItemLeft" align="right" valign="top"><a id="a57d83aba6e3dffe62b1fc027b157e30a"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_erase_at_begin</b> (<a class="el" href="a07292.html">iterator</a> __pos)</td></tr>
<tr class="separator:a57d83aba6e3dffe62b1fc027b157e30a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6d4c16713c19f42dedf7e6146bafeaaa"><td class="memItemLeft" align="right" valign="top"><a id="a6d4c16713c19f42dedf7e6146bafeaaa"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_erase_at_end</b> (<a class="el" href="a07292.html">iterator</a> __pos)</td></tr>
<tr class="separator:a6d4c16713c19f42dedf7e6146bafeaaa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7a4c9266e57c4b8ce368b252db1b15dc"><td class="memItemLeft" align="right" valign="top"><a id="a7a4c9266e57c4b8ce368b252db1b15dc"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_fill_assign</b> (size_type __n, const value_type &__val)</td></tr>
<tr class="separator:a7a4c9266e57c4b8ce368b252db1b15dc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a67647a3b7f00d3ca89b27980a1f2b7ee"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a67647a3b7f00d3ca89b27980a1f2b7ee">_M_fill_initialize</a> (const value_type &__value)</td></tr>
<tr class="separator:a67647a3b7f00d3ca89b27980a1f2b7ee"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aebe0cc057092c3def2cd8a44d0aff597"><td class="memItemLeft" align="right" valign="top"><a id="aebe0cc057092c3def2cd8a44d0aff597"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_fill_insert</b> (<a class="el" href="a07292.html">iterator</a> __pos, size_type __n, const value_type &__x)</td></tr>
<tr class="separator:aebe0cc057092c3def2cd8a44d0aff597"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae34ec7649a3511dd93b8cc54d7108069"><td class="memItemLeft" align="right" valign="top"><a id="ae34ec7649a3511dd93b8cc54d7108069"></a>
_Map_alloc_type </td><td class="memItemRight" valign="bottom"><b>_M_get_map_allocator</b> () const noexcept</td></tr>
<tr class="separator:ae34ec7649a3511dd93b8cc54d7108069"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a415a2817dfd99640f105fae7e2097588"><td class="memItemLeft" align="right" valign="top"><a id="a415a2817dfd99640f105fae7e2097588"></a>
_Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () noexcept</td></tr>
<tr class="separator:a415a2817dfd99640f105fae7e2097588"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aeb3557936e6f8bfe929846072e7cd0fa"><td class="memItemLeft" align="right" valign="top"><a id="aeb3557936e6f8bfe929846072e7cd0fa"></a>
const _Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () const noexcept</td></tr>
<tr class="separator:aeb3557936e6f8bfe929846072e7cd0fa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a415a2817dfd99640f105fae7e2097588"><td class="memItemLeft" align="right" valign="top"><a id="a415a2817dfd99640f105fae7e2097588"></a>
_Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () noexcept</td></tr>
<tr class="separator:a415a2817dfd99640f105fae7e2097588"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aeb3557936e6f8bfe929846072e7cd0fa"><td class="memItemLeft" align="right" valign="top"><a id="aeb3557936e6f8bfe929846072e7cd0fa"></a>
const _Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () const noexcept</td></tr>
<tr class="separator:aeb3557936e6f8bfe929846072e7cd0fa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acedb487c969298e154c3fa4a4d4965f8"><td class="memTemplParams" colspan="2"><a id="acedb487c969298e154c3fa4a4d4965f8"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:acedb487c969298e154c3fa4a4d4965f8"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_initialize_dispatch</b> (_Integer __n, _Integer __x, __true_type)</td></tr>
<tr class="separator:acedb487c969298e154c3fa4a4d4965f8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a264d6656baebebda3938367cd5e461ca"><td class="memTemplParams" colspan="2"><a id="a264d6656baebebda3938367cd5e461ca"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a264d6656baebebda3938367cd5e461ca"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_initialize_dispatch</b> (_InputIterator __first, _InputIterator __last, __false_type)</td></tr>
<tr class="separator:a264d6656baebebda3938367cd5e461ca"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0ba38b77ebabad6056d04d9f65ffa74c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07296.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a> (size_t)</td></tr>
<tr class="separator:a0ba38b77ebabad6056d04d9f65ffa74c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0ba38b77ebabad6056d04d9f65ffa74c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a> (size_t)</td></tr>
<tr class="separator:a0ba38b77ebabad6056d04d9f65ffa74c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4818831d8c0e65600f5553bbc77dab1c"><td class="memTemplParams" colspan="2"><a id="a4818831d8c0e65600f5553bbc77dab1c"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a4818831d8c0e65600f5553bbc77dab1c"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_aux</b> (<a class="el" href="a07292.html">iterator</a> __pos, _Args &&... __args)</td></tr>
<tr class="separator:a4818831d8c0e65600f5553bbc77dab1c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a382f789cae857435a2e88f6b62c9d5d4"><td class="memItemLeft" align="right" valign="top"><a id="a382f789cae857435a2e88f6b62c9d5d4"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_insert_aux</b> (<a class="el" href="a07292.html">iterator</a> __pos, size_type __n, const value_type &__x)</td></tr>
<tr class="separator:a382f789cae857435a2e88f6b62c9d5d4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4cd9adfaccd88d4f9d2b0a7adc70a37e"><td class="memTemplParams" colspan="2"><a id="a4cd9adfaccd88d4f9d2b0a7adc70a37e"></a>
template<typename _ForwardIterator > </td></tr>
<tr class="memitem:a4cd9adfaccd88d4f9d2b0a7adc70a37e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_aux</b> (<a class="el" href="a07292.html">iterator</a> __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n)</td></tr>
<tr class="separator:a4cd9adfaccd88d4f9d2b0a7adc70a37e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a95175c53ab11dea26b321126522cef6e"><td class="memTemplParams" colspan="2"><a id="a95175c53ab11dea26b321126522cef6e"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:a95175c53ab11dea26b321126522cef6e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_dispatch</b> (<a class="el" href="a07292.html">iterator</a> __pos, _Integer __n, _Integer __x, __true_type)</td></tr>
<tr class="separator:a95175c53ab11dea26b321126522cef6e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a03bc91cdee9ee972bece50561c3d8dcc"><td class="memTemplParams" colspan="2"><a id="a03bc91cdee9ee972bece50561c3d8dcc"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a03bc91cdee9ee972bece50561c3d8dcc"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_dispatch</b> (<a class="el" href="a07292.html">iterator</a> __pos, _InputIterator __first, _InputIterator __last, __false_type)</td></tr>
<tr class="separator:a03bc91cdee9ee972bece50561c3d8dcc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a37c5b81866d150bd167ae93d24b4006f"><td class="memItemLeft" align="right" valign="top"><a id="a37c5b81866d150bd167ae93d24b4006f"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_assign1</b> (<a class="el" href="a07304.html">deque</a> &&__x, <a class="el" href="a01476.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>) noexcept</td></tr>
<tr class="separator:a37c5b81866d150bd167ae93d24b4006f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3e07f2c0eacd093651a4eac0cd24f1a7"><td class="memItemLeft" align="right" valign="top"><a id="a3e07f2c0eacd093651a4eac0cd24f1a7"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_assign1</b> (<a class="el" href="a07304.html">deque</a> &&__x, <a class="el" href="a01476.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</td></tr>
<tr class="separator:a3e07f2c0eacd093651a4eac0cd24f1a7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a087033ee97f430e6d37dce41b01b8c7d"><td class="memItemLeft" align="right" valign="top"><a id="a087033ee97f430e6d37dce41b01b8c7d"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_assign2</b> (<a class="el" href="a07304.html">deque</a> &&__x, <a class="el" href="a01476.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>)</td></tr>
<tr class="separator:a087033ee97f430e6d37dce41b01b8c7d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac603972d06c5d27a84b53822d0e1e117"><td class="memItemLeft" align="right" valign="top"><a id="ac603972d06c5d27a84b53822d0e1e117"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_move_assign2</b> (<a class="el" href="a07304.html">deque</a> &&__x, <a class="el" href="a01476.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>)</td></tr>
<tr class="separator:ac603972d06c5d27a84b53822d0e1e117"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab0b41c4f880dd45f1278ce6233a3f513"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ab0b41c4f880dd45f1278ce6233a3f513">_M_range_check</a> (size_type __n) const</td></tr>
<tr class="separator:ab0b41c4f880dd45f1278ce6233a3f513"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3b9fe5dd74c0f1a63c0f2c2855d83668"><td class="memTemplParams" colspan="2"><a id="a3b9fe5dd74c0f1a63c0f2c2855d83668"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:a3b9fe5dd74c0f1a63c0f2c2855d83668"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_range_insert_aux</b> (<a class="el" href="a07292.html">iterator</a> __pos, _InputIterator __first, _InputIterator __last, <a class="el" href="a07652.html">std::input_iterator_tag</a>)</td></tr>
<tr class="separator:a3b9fe5dd74c0f1a63c0f2c2855d83668"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a05ab55afa4dd933f00e6e2fc38134417"><td class="memTemplParams" colspan="2"><a id="a05ab55afa4dd933f00e6e2fc38134417"></a>
template<typename _ForwardIterator > </td></tr>
<tr class="memitem:a05ab55afa4dd933f00e6e2fc38134417"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_range_insert_aux</b> (<a class="el" href="a07292.html">iterator</a> __pos, _ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a07660.html">std::forward_iterator_tag</a>)</td></tr>
<tr class="separator:a05ab55afa4dd933f00e6e2fc38134417"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa989a10254126fc8cfff7ef55566da8a"><td class="memTemplParams" colspan="2"><a id="aa989a10254126fc8cfff7ef55566da8a"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:aa989a10254126fc8cfff7ef55566da8a"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_replace_map</b> (_Args &&... __args)</td></tr>
<tr class="separator:aa989a10254126fc8cfff7ef55566da8a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a83b1ea2b3931b139901d5c2ed5b3a9c6"><td class="memItemLeft" align="right" valign="top"><a id="a83b1ea2b3931b139901d5c2ed5b3a9c6"></a>
bool </td><td class="memItemRight" valign="bottom"><b>_M_shrink_to_fit</b> ()</td></tr>
<tr class="separator:a83b1ea2b3931b139901d5c2ed5b3a9c6"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:ae2b6ab89b51f74b7de15e6494fc03caa"><td class="memTemplParams" colspan="2">template<typename _InputIterator > </td></tr>
<tr class="memitem:ae2b6ab89b51f74b7de15e6494fc03caa"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#ae2b6ab89b51f74b7de15e6494fc03caa">_M_range_initialize</a> (_InputIterator __first, _InputIterator __last, <a class="el" href="a07652.html">std::input_iterator_tag</a>)</td></tr>
<tr class="separator:ae2b6ab89b51f74b7de15e6494fc03caa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa453821f9b3b8666764d4e6bbd5d091c"><td class="memTemplParams" colspan="2">template<typename _ForwardIterator > </td></tr>
<tr class="memitem:aa453821f9b3b8666764d4e6bbd5d091c"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#aa453821f9b3b8666764d4e6bbd5d091c">_M_range_initialize</a> (_ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a07660.html">std::forward_iterator_tag</a>)</td></tr>
<tr class="separator:aa453821f9b3b8666764d4e6bbd5d091c"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a9cacda81743ab1d5447c31ecc1a988d2"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:a9cacda81743ab1d5447c31ecc1a988d2"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#a9cacda81743ab1d5447c31ecc1a988d2">_M_push_back_aux</a> (_Args &&... __args)</td></tr>
<tr class="separator:a9cacda81743ab1d5447c31ecc1a988d2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aaf55754b5eef8f7f949e56a7ccf80068"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:aaf55754b5eef8f7f949e56a7ccf80068"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07304.html#aaf55754b5eef8f7f949e56a7ccf80068">_M_push_front_aux</a> (_Args &&... __args)</td></tr>
<tr class="separator:aaf55754b5eef8f7f949e56a7ccf80068"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae125f10bcc0c0b97d7a4f5c582ebe9b7"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7">_M_pop_back_aux</a> ()</td></tr>
<tr class="separator:ae125f10bcc0c0b97d7a4f5c582ebe9b7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a21cfe1ac5af07d0cfa9dee315faec368"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a21cfe1ac5af07d0cfa9dee315faec368">_M_pop_front_aux</a> ()</td></tr>
<tr class="separator:a21cfe1ac5af07d0cfa9dee315faec368"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a2f8d8d37581896d79e8759a827bab9e0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a2f8d8d37581896d79e8759a827bab9e0">_M_reserve_elements_at_front</a> (size_type __n)</td></tr>
<tr class="separator:a2f8d8d37581896d79e8759a827bab9e0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae525555e5d42a93d328bdd620705ce94"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07292.html">iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#ae525555e5d42a93d328bdd620705ce94">_M_reserve_elements_at_back</a> (size_type __n)</td></tr>
<tr class="separator:ae525555e5d42a93d328bdd620705ce94"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9397000b47d5f39fff457ac11a728c50"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a9397000b47d5f39fff457ac11a728c50">_M_new_elements_at_front</a> (size_type __new_elements)</td></tr>
<tr class="separator:a9397000b47d5f39fff457ac11a728c50"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a71853b49ee48f7f429287d1a78964911"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a71853b49ee48f7f429287d1a78964911">_M_new_elements_at_back</a> (size_type __new_elements)</td></tr>
<tr class="separator:a71853b49ee48f7f429287d1a78964911"><td class="memSeparator" colspan="2"> </td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a8ebf868f4aae064167a0a05292b19093"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a8ebf868f4aae064167a0a05292b19093">_M_reserve_map_at_back</a> (size_type __nodes_to_add=1)</td></tr>
<tr class="separator:a8ebf868f4aae064167a0a05292b19093"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa8eb5a8eedeacb9a0de37a42dfc5abc9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#aa8eb5a8eedeacb9a0de37a42dfc5abc9">_M_reserve_map_at_front</a> (size_type __nodes_to_add=1)</td></tr>
<tr class="separator:aa8eb5a8eedeacb9a0de37a42dfc5abc9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a27ce26ccde84a7aacb2326cb7969149e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a27ce26ccde84a7aacb2326cb7969149e">_M_reallocate_map</a> (size_type __nodes_to_add, bool __add_at_front)</td></tr>
<tr class="separator:a27ce26ccde84a7aacb2326cb7969149e"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-static-methods"></a>
Static Protected Member Functions</h2></td></tr>
<tr class="memitem:ad606e654ee0bcec85c1dadf76602fb1a"><td class="memItemLeft" align="right" valign="top"><a id="ad606e654ee0bcec85c1dadf76602fb1a"></a>
static size_t </td><td class="memItemRight" valign="bottom"><b>_S_buffer_size</b> () noexcept</td></tr>
<tr class="separator:ad606e654ee0bcec85c1dadf76602fb1a"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:a5e3339e8baafd02e6d232c5b25d42d63"><td class="memItemLeft" align="right" valign="top">_Deque_impl </td><td class="memItemRight" valign="bottom"><a class="el" href="a07304.html#a5e3339e8baafd02e6d232c5b25d42d63">_M_impl</a></td></tr>
<tr class="separator:a5e3339e8baafd02e6d232c5b25d42d63"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template<typename _Tp, typename _Alloc = std::allocator<_Tp>><br />
class std::deque< _Tp, _Alloc ></h3>
<p>A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">_Tp</td><td>Type of element. </td></tr>
<tr><td class="paramname">_Alloc</td><td>Allocator type, defaults to allocator<_Tp>.</td></tr>
</table>
</dd>
</dl>
<p>Meets the requirements of a <a href="tables.html#65">container</a>, a <a href="tables.html#66">reversible container</a>, and a <a href="tables.html#67">sequence</a>, including the <a href="tables.html#68">optional sequence requirements</a>.</p>
<p>In previous HP/SGI versions of deque, there was an extra template parameter so users could control the node size. This extension turned out to violate the C++ standard (it can be detected using template template parameters), and it was removed.</p>
<p>Here's how a deque<Tp> manages memory. Each deque has 4 members:</p>
<ul>
<li>Tp** _M_map</li>
<li>size_t _M_map_size</li>
<li>iterator _M_start, _M_finish</li>
</ul>
<p>map_size is at least 8. map is an array of map_size pointers-to-<em>nodes</em>. (The name map has nothing to do with the std::map class, and <b>nodes</b> should not be confused with std::list's usage of <em>node</em>.)</p>
<p>A <em>node</em> has no specific type name as such, but it is referred to as <em>node</em> in this file. It is a simple array-of-Tp. If Tp is very large, there will be one Tp element per node (i.e., an <em>array</em> of one). For non-huge Tp's, node size is inversely related to Tp size: the larger the Tp, the fewer Tp's will fit in a node. The goal here is to keep the total size of a node relatively small and constant over different Tp's, to improve allocator efficiency.</p>
<p>Not every pointer in the map array will point to a node. If the initial number of elements in the deque is small, the /middle/ map pointers will be valid, and the ones at the edges will be unused. This same situation will arise as the map grows: available map pointers, if any, will be on the ends. As new nodes are created, only a subset of the map's pointers need to be copied <em>outward</em>.</p>
<p>Class invariants:</p><ul>
<li>For any nonsingular iterator i:<ul>
<li>i.node points to a member of the map array. (Yes, you read that correctly: i.node does not actually point to a node.) The member of the map array is what actually points to the node.</li>
<li>i.first == *(i.node) (This points to the node (first Tp element).)</li>
<li>i.last == i.first + node_size</li>
<li>i.cur is a pointer in the range [i.first, i.last). NOTE: the implication of this is that i.cur is always a dereferenceable pointer, even if i is a past-the-end iterator.</li>
</ul>
</li>
<li>Start and Finish are always nonsingular iterators. NOTE: this means that an empty deque must have one node, a deque with <N elements (where N is the node buffer size) must have one node, a deque with N through (2N-1) elements must have two nodes, etc.</li>
<li>For every node other than start.node and finish.node, every element in the node is an initialized object. If start.node == finish.node, then [start.cur, finish.cur) are initialized objects, and the elements outside that range are uninitialized storage. Otherwise, [start.cur, start.last) and [finish.first, finish.cur) are initialized objects, and [start.first, start.cur) and [finish.cur, finish.last) are uninitialized storage.</li>
<li>[map, map + map_size) is a valid, non-empty range.</li>
<li>[start.node, finish.node] is a valid range contained within [map, map + map_size).</li>
<li><p class="startli">A pointer in the range [map, map + map_size) points to an allocated node if and only if the pointer is in the range [start.node, finish.node].</p>
<p class="startli">Here's the magic: nothing in deque is <b>aware</b> of the discontiguous storage!</p>
<p class="startli">The memory setup and layout occurs in the parent, _Base, and the iterator class is entirely responsible for <em>leaping</em> from one node to the next. All the implementation routines for deque itself work only through the start and finish iterators. This keeps the routines simple and sane, and we can use other standard algorithms as well. </p>
</li>
</ul>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00832">832</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="ae68c6ac05cd6e788a90c9b8a47c56756"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae68c6ac05cd6e788a90c9b8a47c56756">◆ </a></span>deque() <span class="overload">[1/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a deque with no elements. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00898">898</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="aa8cf87c79a7c6bdf2cf07749fb1e2ff5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8cf87c79a7c6bdf2cf07749fb1e2ff5">◆ </a></span>deque() <span class="overload">[2/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a deque with no elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__a</td><td>An allocator object. </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00905">905</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a511a8f76d058f6bd0e2236abf8df23bc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a511a8f76d058f6bd0e2236abf8df23bc">◆ </a></span>deque() <span class="overload">[3/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a deque with default constructed elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The number of elements to initially create. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator.</td></tr>
</table>
</dd>
</dl>
<p>This constructor fills the deque with <em>n</em> default constructed elements. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00918">918</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a858d7660a45a911f8ae7858246ea2f6d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a858d7660a45a911f8ae7858246ea2f6d">◆ </a></span>deque() <span class="overload">[4/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__value</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a deque with copies of an exemplar element. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The number of elements to initially create. </td></tr>
<tr><td class="paramname">__value</td><td>An element to copy. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator.</td></tr>
</table>
</dd>
</dl>
<p>This constructor fills the deque with <em>__n</em> copies of <em>__value</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00930">930</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a03515a6af7f959e28cec591ac5f0f8b2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a03515a6af7f959e28cec591ac5f0f8b2">◆ </a></span>deque() <span class="overload">[5/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Deque copy constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A deque of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The newly-created deque uses a copy of the allocator object used by <em>__x</em> (unless the allocator traits dictate a different object). </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00957">957</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a7d533f573a77a0f9bf33fa40dde1c9cd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7d533f573a77a0f9bf33fa40dde1c9cd">◆ </a></span>deque() <span class="overload">[6/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Deque move constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A deque of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The newly-created deque contains the exact contents of <em>__x</em>. The contents of <em>__x</em> are a valid, but unspecified deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00972">972</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a0948ee096c5387c1deb1e5885d06c112"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0948ee096c5387c1deb1e5885d06c112">◆ </a></span>deque() <span class="overload">[7/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Copy constructor with alternative allocator. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00976">976</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a0bb7da7a228f22622f2e822252813d51"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0bb7da7a228f22622f2e822252813d51">◆ </a></span>deque() <span class="overload">[8/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Move constructor with alternative allocator. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00983">983</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="abdc5fd34432d73edde92643c58d7db6d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abdc5fd34432d73edde92643c58d7db6d">◆ </a></span>deque() <span class="overload">[9/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01652.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Builds a deque from an initializer list. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create a deque consisting of copies of the elements in the initializer_list <em>__l</em>.</p>
<p>This will call the element type's copy constructor N times (where N is __l.size()) and do no memory reallocation. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01006">1006</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="ac11b72c35c99798a8aa8428206af7b74"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac11b72c35c99798a8aa8428206af7b74">◆ </a></span>deque() <span class="overload">[10/10]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em> = <code>allocator_type()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Builds a deque from a range. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__a</td><td>An allocator object.</td></tr>
</table>
</dd>
</dl>
<p>Create a deque consisting of copies of the elements from [__first, __last).</p>
<p>If the iterators are forward, bidirectional, or random-access, then this will call the elements' copy constructor N times (where N is distance(__first,__last)) and do no memory reallocation. But if only input iterators are used, then this will do at most 2N calls to the copy constructor, and logN memory reallocations. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01033">1033</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a8e7b8eb846862bae0ec76623338fa2a7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8e7b8eb846862bae0ec76623338fa2a7">◆ </a></span>~deque()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::~<a class="el" href="a07304.html">deque</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01054">1054</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a67647a3b7f00d3ca89b27980a1f2b7ee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a67647a3b7f00d3ca89b27980a1f2b7ee">◆ </a></span>_M_fill_initialize()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_fill_initialize </td>
<td>(</td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__value</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Fills the deque with copies of value. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__value</td><td>Initial value. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Nothing. </dd></dl>
<dl class="section pre"><dt>Precondition</dt><dd>_M_start and _M_finish have already been initialized, but none of the deque's elements have yet been constructed.</dd></dl>
<p>This function is called only when the user provides an explicit size (with or without an explicit exemplar value). </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00392">392</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l00930">std::deque< _StateSeqT >::deque()</a>.</p>
</div>
</div>
<a id="a0ba38b77ebabad6056d04d9f65ffa74c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ba38b77ebabad6056d04d9f65ffa74c">◆ </a></span>_M_initialize_map() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07296.html">std::_Deque_base</a>< _Tp, _Alloc >::_M_initialize_map </td>
<td>(</td>
<td class="paramtype">size_t </td>
<td class="paramname"><em>__num_elements</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span><span class="mlabel">inherited</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Layout storage. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__num_elements</td><td>The count of T's for which to allocate space at first. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Nothing.</dd></dl>
<p>The initial underlying memory layout is a bit complicated... </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00683">683</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a0ba38b77ebabad6056d04d9f65ffa74c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ba38b77ebabad6056d04d9f65ffa74c">◆ </a></span>_M_initialize_map() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07296.html">std::_Deque_base</a>< _Tp, _Alloc >::_M_initialize_map</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Layout storage. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__num_elements</td><td>The count of T's for which to allocate space at first. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Nothing.</dd></dl>
<p>The initial underlying memory layout is a bit complicated... </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00683">683</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a71853b49ee48f7f429287d1a78964911"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a71853b49ee48f7f429287d1a78964911">◆ </a></span>_M_new_elements_at_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_new_elements_at_back </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__new_elements</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the previous internal insert functions. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00894">894</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l02133">std::deque< _StateSeqT >::_M_reserve_elements_at_back()</a>.</p>
</div>
</div>
<a id="a9397000b47d5f39fff457ac11a728c50"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9397000b47d5f39fff457ac11a728c50">◆ </a></span>_M_new_elements_at_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_new_elements_at_front </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__new_elements</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the previous internal insert functions. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00869">869</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l02123">std::deque< _StateSeqT >::_M_reserve_elements_at_front()</a>.</p>
</div>
</div>
<a id="ae125f10bcc0c0b97d7a4f5c582ebe9b7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae125f10bcc0c0b97d7a4f5c582ebe9b7">◆ </a></span>_M_pop_back_aux()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_pop_back_aux </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Helper functions for push_* and pop_*. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00548">548</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
</div>
</div>
<a id="a21cfe1ac5af07d0cfa9dee315faec368"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a21cfe1ac5af07d0cfa9dee315faec368">◆ </a></span>_M_pop_front_aux()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_pop_front_aux </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Helper functions for push_* and pop_*. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00564">564</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
</div>
</div>
<a id="a9cacda81743ab1d5447c31ecc1a988d2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9cacda81743ab1d5447c31ecc1a988d2">◆ </a></span>_M_push_back_aux()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_push_back_aux </td>
<td>(</td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Helper functions for push_* and pop_*. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00480">480</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01552">std::deque< _StateSeqT >::push_back()</a>.</p>
</div>
</div>
<a id="aaf55754b5eef8f7f949e56a7ccf80068"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aaf55754b5eef8f7f949e56a7ccf80068">◆ </a></span>_M_push_front_aux()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_push_front_aux </td>
<td>(</td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Helper functions for push_* and pop_*. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00515">515</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01515">std::deque< _StateSeqT >::push_front()</a>.</p>
</div>
</div>
<a id="ab0b41c4f880dd45f1278ce6233a3f513"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab0b41c4f880dd45f1278ce6233a3f513">◆ </a></span>_M_range_check()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::_M_range_check </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Safety check used only from at(). </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01410">1410</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01432">std::deque< _StateSeqT >::at()</a>.</p>
</div>
</div>
<a id="ae2b6ab89b51f74b7de15e6494fc03caa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae2b6ab89b51f74b7de15e6494fc03caa">◆ </a></span>_M_range_initialize() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_range_initialize </td>
<td>(</td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07652.html">std::input_iterator_tag</a> </td>
<td class="paramname"> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Fills the deque with whatever is in [first,last). </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Nothing.</dd></dl>
<p>If the iterators are actually forward iterators (or better), then the memory layout can be done all at once. Else we move forward using push_back on each value from the iterator. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00418">418</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01006">std::deque< _StateSeqT >::deque()</a>.</p>
</div>
</div>
<a id="aa453821f9b3b8666764d4e6bbd5d091c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa453821f9b3b8666764d4e6bbd5d091c">◆ </a></span>_M_range_initialize() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename _ForwardIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_range_initialize </td>
<td>(</td>
<td class="paramtype">_ForwardIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_ForwardIterator </td>
<td class="paramname"><em>__last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07660.html">std::forward_iterator_tag</a> </td>
<td class="paramname"> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Fills the deque with whatever is in [first,last). </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Nothing.</dd></dl>
<p>If the iterators are actually forward iterators (or better), then the memory layout can be done all at once. Else we move forward using push_back on each value from the iterator. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00442">442</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
</div>
</div>
<a id="a27ce26ccde84a7aacb2326cb7969149e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a27ce26ccde84a7aacb2326cb7969149e">◆ </a></span>_M_reallocate_map()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void deque::_M_reallocate_map </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__nodes_to_add</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>__add_at_front</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the major map. </p>
<p>Makes sure the _M_map has space for new nodes. Does not actually add the nodes. Can invalidate _M_map pointers. (And consequently, deque iterators.) </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00919">919</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l02159">std::deque< _StateSeqT >::_M_reserve_map_at_back()</a>, and <a class="el" href="a00539_source.html#l02167">std::deque< _StateSeqT >::_M_reserve_map_at_front()</a>.</p>
</div>
</div>
<a id="ae525555e5d42a93d328bdd620705ce94"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae525555e5d42a93d328bdd620705ce94">◆ </a></span>_M_reserve_elements_at_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::_M_reserve_elements_at_back </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the previous internal insert functions. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l02133">2133</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a2f8d8d37581896d79e8759a827bab9e0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2f8d8d37581896d79e8759a827bab9e0">◆ </a></span>_M_reserve_elements_at_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::_M_reserve_elements_at_front </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the previous internal insert functions. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l02123">2123</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a8ebf868f4aae064167a0a05292b19093"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8ebf868f4aae064167a0a05292b19093">◆ </a></span>_M_reserve_map_at_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::_M_reserve_map_at_back </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__nodes_to_add</em> = <code>1</code></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the major map. </p>
<p>Makes sure the _M_map has space for new nodes. Does not actually add the nodes. Can invalidate _M_map pointers. (And consequently, deque iterators.) </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l02159">2159</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="aa8eb5a8eedeacb9a0de37a42dfc5abc9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8eb5a8eedeacb9a0de37a42dfc5abc9">◆ </a></span>_M_reserve_map_at_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::_M_reserve_map_at_front </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__nodes_to_add</em> = <code>1</code></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory-handling helpers for the major map. </p>
<p>Makes sure the _M_map has space for new nodes. Does not actually add the nodes. Can invalidate _M_map pointers. (And consequently, deque iterators.) </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l02167">2167</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a65dabc6e005b7b5a19adf55792821e76"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a65dabc6e005b7b5a19adf55792821e76">◆ </a></span>assign() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__val</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns a given value to a deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>Number of elements to be assigned. </td></tr>
<tr><td class="paramname">__val</td><td>Value to be assigned.</td></tr>
</table>
</dd>
</dl>
<p>This function fills a deque with <em>n</em> copies of the given value. Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01117">1117</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="ac0579ff04738a923ad49b8b9398af642"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac0579ff04738a923ad49b8b9398af642">◆ </a></span>assign() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns a range to a deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator.</td></tr>
</table>
</dd>
</dl>
<p>This function fills a deque with copies of the elements in the range [__first,__last).</p>
<p>Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01136">1136</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="ab16028e538ba034ad569b6933c152cdb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab16028e538ba034ad569b6933c152cdb">◆ </a></span>assign() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01652.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns an initializer list to a deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list.</td></tr>
</table>
</dd>
</dl>
<p>This function fills a deque with copies of the elements in the initializer_list <em>__l</em>.</p>
<p>Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01161">1161</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a4b0080ca0ed1a2222104a5fb776a454f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4b0080ca0ed1a2222104a5fb776a454f">◆ </a></span>at() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::at </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Provides access to the data contained in the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The index of the element for which data should be accessed. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Read/write reference to data. </dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname">std::out_of_range</td><td>If <em>__n</em> is an invalid index.</td></tr>
</table>
</dd>
</dl>
<p>This function provides for safer data access. The parameter is first checked that it is in the range of the deque. The function throws out_of_range if the check fails. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01432">1432</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a03a10b684468f787e852fa360440ba7b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a03a10b684468f787e852fa360440ba7b">◆ </a></span>at() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::at </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Provides access to the data contained in the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The index of the element for which data should be accessed. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Read-only (constant) reference to data. </dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname">std::out_of_range</td><td>If <em>__n</em> is an invalid index.</td></tr>
</table>
</dd>
</dl>
<p>This function provides for safer data access. The parameter is first checked that it is in the range of the deque. The function throws out_of_range if the check fails. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01450">1450</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a9345d8aadac1295d32b7390ede8478f5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9345d8aadac1295d32b7390ede8478f5">◆ </a></span>back() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::back </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write reference to the data at the last element of the deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01483">1483</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a0ebb54615350e129c2ce3b51368402bb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ebb54615350e129c2ce3b51368402bb">◆ </a></span>back() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::back </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reference to the data at the last element of the deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01496">1496</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="af71a8fc9a6dff2b04bfd8b219c40a940"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af71a8fc9a6dff2b04bfd8b219c40a940">◆ </a></span>begin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write iterator that points to the first element in the deque. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01176">1176</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01850">std::deque< _StateSeqT >::clear()</a>, <a class="el" href="a00539_source.html#l00957">std::deque< _StateSeqT >::deque()</a>, <a class="el" href="a00539_source.html#l01688">std::deque< _StateSeqT >::insert()</a>, <a class="el" href="a00539_source.html#l02295">std::operator<()</a>, <a class="el" href="a00320_source.html#l00094">std::deque< _StateSeqT >::operator=()</a>, <a class="el" href="a00539_source.html#l02277">std::operator==()</a>, and <a class="el" href="a00539_source.html#l01054">std::deque< _StateSeqT >::~deque()</a>.</p>
</div>
</div>
<a id="ac5c61891a706a301138fdc8dbf0d0209"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac5c61891a706a301138fdc8dbf0d0209">◆ </a></span>begin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">const_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points to the first element in the deque. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01184">1184</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a289af3aac006b9faa969fbdf090f8202"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a289af3aac006b9faa969fbdf090f8202">◆ </a></span>cbegin()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">const_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::cbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points to the first element in the deque. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01247">1247</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01688">std::deque< _StateSeqT >::insert()</a>.</p>
</div>
</div>
<a id="ae56c2f3c25dc623eba9825a2e3eddd7c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae56c2f3c25dc623eba9825a2e3eddd7c">◆ </a></span>cend()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">const_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::cend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points one past the last element in the deque. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01256">1256</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a1a753bfa9e6b675bac7ee9ec4365fbdf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1a753bfa9e6b675bac7ee9ec4365fbdf">◆ </a></span>clear()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::clear </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01850">1850</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a86674e16182ecb624e854ce7a653c03e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a86674e16182ecb624e854ce7a653c03e">◆ </a></span>crbegin()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07612.html">const_reverse_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::crbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01265">1265</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a17d738d29f26320ce991399537a17bce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a17d738d29f26320ce991399537a17bce">◆ </a></span>crend()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07612.html">const_reverse_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::crend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01274">1274</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a3ea67e3e7fc5c84e92d9868bb57ae05a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3ea67e3e7fc5c84e92d9868bb57ae05a">◆ </a></span>emplace()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc >::<a class="el" href="a07292.html">iterator</a> deque::emplace </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_Args &&... </td>
<td class="paramname"><em>__args</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts an object in deque before specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the deque. </td></tr>
<tr><td class="paramname">__args</td><td>Arguments. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert an object of type T constructed with T(std::forward<Args>(args)...) before the specified location. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00186">186</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01675">std::deque< _StateSeqT >::insert()</a>.</p>
</div>
</div>
<a id="a512ed6c7e0dc244335b337da26d76f41"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a512ed6c7e0dc244335b337da26d76f41">◆ </a></span>empty()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::empty </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns true if the deque is empty. (Thus begin() would equal end().) </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01367">1367</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a78b2da6c6329349581db042e6bbe2a40"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a78b2da6c6329349581db042e6bbe2a40">◆ </a></span>end() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::end </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write iterator that points one past the last element in the deque. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01193">1193</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l00957">std::deque< _StateSeqT >::deque()</a>, <a class="el" href="a00539_source.html#l02295">std::operator<()</a>, <a class="el" href="a00320_source.html#l00094">std::deque< _StateSeqT >::operator=()</a>, <a class="el" href="a00539_source.html#l02277">std::operator==()</a>, and <a class="el" href="a00539_source.html#l01054">std::deque< _StateSeqT >::~deque()</a>.</p>
</div>
</div>
<a id="ad1986c3313eec924e6a7531929a82b8d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad1986c3313eec924e6a7531929a82b8d">◆ </a></span>end() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">const_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::end </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) iterator that points one past the last element in the deque. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01202">1202</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a0e0812f0cacd5dfd1108455df4fda375"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0e0812f0cacd5dfd1108455df4fda375">◆ </a></span>erase() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove element at given position. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>Iterator pointing to element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the next element (or end()).</dd></dl>
<p>This function will erase the element at the given position and thus shorten the deque by one.</p>
<p>The user is cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01790">1790</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="af8f15e04574604071004bcdcd3be22fc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af8f15e04574604071004bcdcd3be22fc">◆ </a></span>erase() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Remove a range of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__first</td><td>Iterator pointing to the first element to be erased. </td></tr>
<tr><td class="paramname">__last</td><td>Iterator pointing to one past the last element to be erased. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator pointing to the element pointed to by <em>last</em> prior to erasing (or end()).</dd></dl>
<p>This function will erase the elements in the range [__first,__last) and shorten the deque accordingly.</p>
<p>The user is cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01814">1814</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="ae5172d8f3ab8a44f5f68f5d6256e5c7e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae5172d8f3ab8a44f5f68f5d6256e5c7e">◆ </a></span>front() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write reference to the data at the first element of the deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01461">1461</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a62222a6cab13f17c0489a3d6242dd6a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a62222a6cab13f17c0489a3d6242dd6a8">◆ </a></span>front() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reference to the data at the first element of the deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01472">1472</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a40d6b0cbbd61cda2b99f5fc4a274fe02"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a40d6b0cbbd61cda2b99f5fc4a274fe02">◆ </a></span>get_allocator()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">allocator_type <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::get_allocator </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Get a copy of the memory allocation object. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01167">1167</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00320_source.html#l00094">std::deque< _StateSeqT >::operator=()</a>.</p>
</div>
</div>
<a id="a69b4ca4a5aad67e979d6e6db9b31781a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a69b4ca4a5aad67e979d6e6db9b31781a">◆ </a></span>insert() <span class="overload">[1/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc >::<a class="el" href="a07292.html">iterator</a> deque::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts given value into deque before specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the deque. </td></tr>
<tr><td class="paramname">__x</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert a copy of the given value before the specified location. </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00210">210</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
</div>
</div>
<a id="adec6ee2ba1f059f0addf6b9da5b596e1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adec6ee2ba1f059f0addf6b9da5b596e1">◆ </a></span>insert() <span class="overload">[2/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">value_type && </td>
<td class="paramname"><em>__x</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts given rvalue into deque before specified iterator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the deque. </td></tr>
<tr><td class="paramname">__x</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert a copy of the given rvalue before the specified location. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01675">1675</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a755a6d05ef2270de50ce270bea77250f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a755a6d05ef2270de50ce270bea77250f">◆ </a></span>insert() <span class="overload">[3/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__p</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01652.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts an initializer list into the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__p</td><td>An iterator into the deque. </td></tr>
<tr><td class="paramname">__l</td><td>An initializer_list.</td></tr>
</table>
</dd>
</dl>
<p>This function will insert copies of the data in the initializer_list <em>__l</em> into the deque before the location specified by <em>__p</em>. This is known as <em>list insert</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01688">1688</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="ad645c0144212cbfee911daa80578e997"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad645c0144212cbfee911daa80578e997">◆ </a></span>insert() <span class="overload">[4/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts a number of copies of given data into the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the deque. </td></tr>
<tr><td class="paramname">__n</td><td>Number of elements to be inserted. </td></tr>
<tr><td class="paramname">__x</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert a specified number of copies of the given data before the location specified by <em>__position</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01709">1709</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="aee2b0dd83e2d5c82db3b2df6918e484a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aee2b0dd83e2d5c82db3b2df6918e484a">◆ </a></span>insert() <span class="overload">[5/5]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07292.html">iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07292.html">const_iterator</a> </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">_InputIterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts a range into the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the deque. </td></tr>
<tr><td class="paramname">__first</td><td>An input iterator. </td></tr>
<tr><td class="paramname">__last</td><td>An input iterator. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>An iterator that points to the inserted data.</dd></dl>
<p>This function will insert copies of the data in the range [__first,__last) into the deque before the location specified by <em>__position</em>. This is known as <em>range insert</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01745">1745</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a5aea8252ed76805923d591f878768f67"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5aea8252ed76805923d591f878768f67">◆ </a></span>max_size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::max_size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the size() of the largest possible deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01286">1286</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="acbbd2ced11be9e416c030bf3dcaeacad"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acbbd2ced11be9e416c030bf3dcaeacad">◆ </a></span>operator=() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > & deque::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Deque assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A deque of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>All the elements of <em>x</em> are copied.</p>
<p>The newly-created deque uses a copy of the allocator object used by <em>__x</em> (unless the allocator traits dictate a different object). </p>
<p class="definition">Definition at line <a class="el" href="a00320_source.html#l00094">94</a> of file <a class="el" href="a00320_source.html">deque.tcc</a>.</p>
</div>
</div>
<a id="a77734a257fa1c71752517d0ae6ae707d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a77734a257fa1c71752517d0ae6ae707d">◆ </a></span>operator=() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">deque</a>& <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Deque move assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A deque of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The contents of <em>__x</em> are moved into this deque (without copying, if the allocators permit it). <em>__x</em> is a valid, but unspecified deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01079">1079</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a74898d8b495f47ced979e6ba66c4eef1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a74898d8b495f47ced979e6ba66c4eef1">◆ </a></span>operator=() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07304.html">deque</a>& <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01652.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Assigns an initializer list to a deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__l</td><td>An initializer_list.</td></tr>
</table>
</dd>
</dl>
<p>This function fills a deque with copies of the elements in the initializer_list <em>__l</em>.</p>
<p>Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01098">1098</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a461a433ad999e2d22e10f45addf1bb67"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a461a433ad999e2d22e10f45addf1bb67">◆ </a></span>operator[]() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::operator[] </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Subscript access to the data contained in the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The index of the element for which data should be accessed. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Read/write reference to data.</dd></dl>
<p>This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().) </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01383">1383</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a513a4ab26ac9df40d7ec95fc50e1218b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a513a4ab26ac9df40d7ec95fc50e1218b">◆ </a></span>operator[]() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::operator[] </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Subscript access to the data contained in the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>The index of the element for which data should be accessed. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Read-only (constant) reference to data.</dd></dl>
<p>This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().) </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01401">1401</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a2299790b7c0080b2652ba374a2ea68fc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2299790b7c0080b2652ba374a2ea68fc">◆ </a></span>pop_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::pop_back </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes last element. </p>
<p>This is a typical stack operation. It shrinks the deque by one.</p>
<p>Note that no data is returned, and if the last element's data is needed, it should be retrieved before pop_back() is called. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01611">1611</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a3f5c33f2728f70a589e11a2e8b013e78"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3f5c33f2728f70a589e11a2e8b013e78">◆ </a></span>pop_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::pop_front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Removes first element. </p>
<p>This is a typical stack operation. It shrinks the deque by one.</p>
<p>Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01588">1588</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="aa261893d7576d53592700d030dedae78"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa261893d7576d53592700d030dedae78">◆ </a></span>push_back()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::push_back </td>
<td>(</td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Add data to the end of the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Data to be added.</td></tr>
</table>
</dd>
</dl>
<p>This is a typical stack operation. The function creates an element at the end of the deque and assigns the given data to it. Due to the nature of a deque this operation can be done in constant time. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01552">1552</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a5e23e99b8919a725e105786dd2bf20e9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5e23e99b8919a725e105786dd2bf20e9">◆ </a></span>push_front()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::push_front </td>
<td>(</td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Add data to the front of the deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>Data to be added.</td></tr>
</table>
</dd>
</dl>
<p>This is a typical stack operation. The function creates an element at the front of the deque and assigns the given data to it. Due to the nature of a deque this operation can be done in constant time. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01515">1515</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a00b51e916472a01d8d68945681ab8245"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a00b51e916472a01d8d68945681ab8245">◆ </a></span>rbegin() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07612.html">reverse_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::rbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01211">1211</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="af3714db48a222a584264a3e668bd5b3c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af3714db48a222a584264a3e668bd5b3c">◆ </a></span>rbegin() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07612.html">const_reverse_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::rbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reverse iterator that points to the last element in the deque. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01220">1220</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a0daef1995ab8473dad46086c79ecb9f0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0daef1995ab8473dad46086c79ecb9f0">◆ </a></span>rend() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07612.html">reverse_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::rend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read/write reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01229">1229</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a2d4c0290323b6a5a78b2e30d2706d753"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2d4c0290323b6a5a78b2e30d2706d753">◆ </a></span>rend() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a07612.html">const_reverse_iterator</a> <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::rend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns a read-only (constant) reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01238">1238</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a2cb09fae5538690a6175b6e738f39b59"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2cb09fae5538690a6175b6e738f39b59">◆ </a></span>resize() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::resize </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__new_size</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Resizes the deque to the specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__new_size</td><td>Number of elements the deque should contain.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the deque to the specified number of elements. If the number is smaller than the deque's current size the deque is truncated, otherwise default constructed elements are appended. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01300">1300</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a5f7f1a01f2d6a06b4c89a4c5a84a9002"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5f7f1a01f2d6a06b4c89a4c5a84a9002">◆ </a></span>resize() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::resize </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__new_size</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const value_type & </td>
<td class="paramname"><em>__x</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Resizes the deque to the specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__new_size</td><td>Number of elements the deque should contain. </td></tr>
<tr><td class="paramname">__x</td><td>Data with which new elements should be populated.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the deque to the specified number of elements. If the number is smaller than the deque's current size the deque is truncated, otherwise the deque is extended and new elements are populated with given data. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01322">1322</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="abe9c2e87fe6d96dbbbf7f50f750d3cf2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abe9c2e87fe6d96dbbbf7f50f750d3cf2">◆ </a></span>shrink_to_fit()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::shrink_to_fit </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A non-binding request to reduce memory use. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01358">1358</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<a id="a24d5150e384f657ca3b317ced4dadc5d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a24d5150e384f657ca3b317ced4dadc5d">◆ </a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the number of elements in the deque. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01281">1281</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00539_source.html#l01410">std::deque< _StateSeqT >::_M_range_check()</a>, <a class="el" href="a00320_source.html#l00094">std::deque< _StateSeqT >::operator=()</a>, <a class="el" href="a00539_source.html#l02277">std::operator==()</a>, and <a class="el" href="a00539_source.html#l01300">std::deque< _StateSeqT >::resize()</a>.</p>
</div>
</div>
<a id="a41f78615b6896d0b85bef3aea0e41f2f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a41f78615b6896d0b85bef3aea0e41f2f">◆ </a></span>swap()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a07304.html">std::deque</a>< _Tp, _Alloc >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07304.html">deque</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Swaps data with another deque. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A deque of the same element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>This exchanges the elements between two deques in constant time. (Four pointers, so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(d1,d2) will feed to this function.</p>
<p>Whether the allocators are swapped depends on the allocator traits. </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l01832">1832</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="a5e3339e8baafd02e6d232c5b25d42d63"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5e3339e8baafd02e6d232c5b25d42d63">◆ </a></span>_M_impl</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">_Deque_impl <a class="el" href="a07296.html">std::_Deque_base</a>< _Tp, _Alloc >::_M_impl</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A total of four data members accumulated down the hierarchy. May be accessed via _M_impl.* </p>
<p class="definition">Definition at line <a class="el" href="a00539_source.html#l00634">634</a> of file <a class="el" href="a00539_source.html">stl_deque.h</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="a00539_source.html">stl_deque.h</a></li>
<li><a class="el" href="a00320_source.html">deque.tcc</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="a01538.html">std</a></li><li class="navelem"><a class="el" href="a07304.html">deque</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
3667
