<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.3"/>
<title>libstdc++: Member List</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="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</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 style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.3 -->
</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">
$(document).ready(function(){initNavTree('a00646.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">std::deque< _Tp, _Alloc > Member List</div> </div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_Deque_base</b>() (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_Deque_base</b>(size_t __num_elements) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_Deque_base</b>(const allocator_type &__a, size_t __num_elements) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_Deque_base</b>(const allocator_type &__a) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_Deque_base</b>(_Deque_base &&__x) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_allocate_map</b>(size_t __n) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_allocate_node</b>() (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_assign_aux</b>(_InputIterator __first, _InputIterator __last, std::input_iterator_tag) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_assign_aux</b>(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_assign_dispatch</b>(_Integer __n, _Integer __val, __true_type) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_assign_dispatch</b>(_InputIterator __first, _InputIterator __last, __false_type) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_create_nodes</b>(_Tp **__nstart, _Tp **__nfinish) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_deallocate_map</b>(_Tp **__p, size_t __n) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_deallocate_node</b>(_Tp *__p) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_default_append</b>(size_type __n) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_default_initialize</b>() (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_destroy_data</b>(iterator __first, iterator __last, const _Alloc1 &) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_destroy_data</b>(iterator __first, iterator __last, const std::allocator< _Tp > &) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_destroy_data_aux</b>(iterator __first, iterator __last) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_destroy_nodes</b>(_Tp **__nstart, _Tp **__nfinish) (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_erase_at_begin</b>(iterator __pos) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_erase_at_end</b>(iterator __pos) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_fill_assign</b>(size_type __n, const value_type &__val) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a67647a3b7f00d3ca89b27980a1f2b7ee">_M_fill_initialize</a>(const value_type &__value)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_fill_insert</b>(iterator __pos, size_type __n, const value_type &__x) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_get_map_allocator</b>() const _GLIBCXX_NOEXCEPT (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_get_Tp_allocator</b>() _GLIBCXX_NOEXCEPT (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_get_Tp_allocator</b>() const _GLIBCXX_NOEXCEPT (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_impl</b> (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_initialize_dispatch</b>(_Integer __n, _Integer __x, __true_type) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_initialize_dispatch</b>(_InputIterator __first, _InputIterator __last, __false_type) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00507.html#a0ba38b77ebabad6056d04d9f65ffa74c">_M_initialize_map</a>(size_t)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_insert_aux</b>(iterator __pos, _Args &&...__args) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_insert_aux</b>(iterator __pos, size_type __n, const value_type &__x) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_insert_aux</b>(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_insert_dispatch</b>(iterator __pos, _Integer __n, _Integer __x, __true_type) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_insert_dispatch</b>(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a71853b49ee48f7f429287d1a78964911">_M_new_elements_at_back</a>(size_type __new_elements)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a9397000b47d5f39fff457ac11a728c50">_M_new_elements_at_front</a>(size_type __new_elements)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ae125f10bcc0c0b97d7a4f5c582ebe9b7">_M_pop_back_aux</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a21cfe1ac5af07d0cfa9dee315faec368">_M_pop_front_aux</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a2bf22c46ebf877b0c2a29fc368aca258">_M_push_back_aux</a>(_Args &&...__args)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#aa383bfc2ce0d5acc399be869b9a3727d">_M_push_front_aux</a>(_Args &&...__args)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#aa84f5efa22db9cca063cca43f6d42622">_M_range_check</a>(size_type __n) const </td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#ae2b6ab89b51f74b7de15e6494fc03caa">_M_range_initialize</a>(_InputIterator __first, _InputIterator __last, std::input_iterator_tag)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#aa453821f9b3b8666764d4e6bbd5d091c">_M_range_initialize</a>(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_M_range_insert_aux</b>(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_range_insert_aux</b>(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a27ce26ccde84a7aacb2326cb7969149e">_M_reallocate_map</a>(size_type __nodes_to_add, bool __add_at_front)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ae525555e5d42a93d328bdd620705ce94">_M_reserve_elements_at_back</a>(size_type __n)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a2f8d8d37581896d79e8759a827bab9e0">_M_reserve_elements_at_front</a>(size_type __n)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a8ebf868f4aae064167a0a05292b19093">_M_reserve_map_at_back</a>(size_type __nodes_to_add=1)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#aa8eb5a8eedeacb9a0de37a42dfc5abc9">_M_reserve_map_at_front</a>(size_type __nodes_to_add=1)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_M_shrink_to_fit</b>() (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_Map_alloc_type</b> typedef (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_Map_pointer</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_S_buffer_size</b>() (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span><span class="mlabel">static</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>_S_initial_map_size</b> enum value (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>allocator_type</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a65dabc6e005b7b5a19adf55792821e76">assign</a>(size_type __n, const value_type &__val)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#adaa7367664744a8f4145a4dd4cfa963e">assign</a>(_InputIterator __first, _InputIterator __last)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ab16028e538ba034ad569b6933c152cdb">assign</a>(initializer_list< value_type > __l)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a4b0080ca0ed1a2222104a5fb776a454f">at</a>(size_type __n)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a4761c527999561a89672ad75eceb9b38">at</a>(size_type __n) const </td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a624bb5292748f709067271e071ca1236">back</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ac65a6356e3cecde392510a3cf24cd17c">back</a>() const </td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#abbebdff0da0cb6f6c79f9c4c074d10b5">begin</a>() _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a6442ce8c9ad6034db612c8941bf079a1">begin</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a289af3aac006b9faa969fbdf090f8202">cbegin</a>() const noexcept</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ae56c2f3c25dc623eba9825a2e3eddd7c">cend</a>() const noexcept</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#af4499b4e528f6e8628866be26aeb10b2">clear</a>() _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>const_iterator</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>const_pointer</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>const_reference</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>const_reverse_iterator</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a86674e16182ecb624e854ce7a653c03e">crbegin</a>() const noexcept</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a17d738d29f26320ce991399537a17bce">crend</a>() const noexcept</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ae68c6ac05cd6e788a90c9b8a47c56756">deque</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#aa8cf87c79a7c6bdf2cf07749fb1e2ff5">deque</a>(const allocator_type &__a)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a681f800cace85de7d9af1168cf20994f">deque</a>(size_type __n)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a858d7660a45a911f8ae7858246ea2f6d">deque</a>(size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a03515a6af7f959e28cec591ac5f0f8b2">deque</a>(const deque &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a7d533f573a77a0f9bf33fa40dde1c9cd">deque</a>(deque &&__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#abdc5fd34432d73edde92643c58d7db6d">deque</a>(initializer_list< value_type > __l, const allocator_type &__a=allocator_type())</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#aac3d958a59564f97a6bdee101fe6c18a">deque</a>(_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>difference_type</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#ad88f6eb824e4e86a850bce329d63768d">emplace</a>(iterator __position, _Args &&...__args)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>emplace_back</b>(_Args &&...__args) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>emplace_front</b>(_Args &&...__args) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a077f7f49c67227ab347772790a7d92a7">empty</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a25d3e382cc4d2a983239bc3ef5d32a91">end</a>() _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#acc4296c13b4dc8d4159b5f6b842a3959">end</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a57e10fbc0bdbaacdcc1e5cfe113bf060">erase</a>(iterator __position)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a7eb188c28afdc87e9bdcd738b968051a">erase</a>(iterator __first, iterator __last)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#ab03c33146752fcad64e5a000250c8db3">front</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a7d027ca5d9fd411dad5b099729a53e79">front</a>() const </td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#acfa2f461a3cbaa08afea8a75d6fadc62">get_allocator</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ab355a648dead703816dacc28b68b6403">insert</a>(iterator __position, const value_type &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#afec57017c59397f28b8af6ba160497c2">insert</a>(iterator __position, value_type &&__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#afeb2dfed6300f290ff7560944316bced">insert</a>(iterator __p, initializer_list< value_type > __l)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a11b5a135ab91c90d56c8fd0c17547875">insert</a>(iterator __position, size_type __n, const value_type &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ae1b4c112bc3bdf4b546215dc0c694e3b">insert</a>(iterator __position, _InputIterator __first, _InputIterator __last)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>iterator</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ae80bc01c30086f94f6929642a398c6ed">max_size</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#acbbd2ced11be9e416c030bf3dcaeacad">operator=</a>(const deque &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a5eb395db6818c138b707008ec89f8171">operator=</a>(deque &&__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a74898d8b495f47ced979e6ba66c4eef1">operator=</a>(initializer_list< value_type > __l)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#af0a6a6643a4f50bae2f82da14a9a9e72">operator[]</a>(size_type __n)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a476d2134847970d9a60661f7a4895bde">operator[]</a>(size_type __n) const </td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>pointer</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#abfc4d9ae999e99e0cfaade398e2b8fe8">pop_back</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a924b098f7a9212907e55207a4731235b">pop_front</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#aa261893d7576d53592700d030dedae78">push_back</a>(const value_type &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>push_back</b>(value_type &&__x) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a5e23e99b8919a725e105786dd2bf20e9">push_front</a>(const value_type &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>push_front</b>(value_type &&__x) (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a6c3e2726deeb0fa19cae2e98f773f810">rbegin</a>() _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a8c1caf12f8bd09292a0c8cdc6532c0b0">rbegin</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>reference</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a5b24293548bdfeaff66974ecdecdd8b9">rend</a>() _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a4dd9ea22aea87518a6c3ac6554666620">rend</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a2cb09fae5538690a6175b6e738f39b59">resize</a>(size_type __new_size)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#a5f7f1a01f2d6a06b4c89a4c5a84a9002">resize</a>(size_type __new_size, const value_type &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>reverse_iterator</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#aff5e6802f8685dfe77663183fd18ec90">shrink_to_fit</a>()</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#a9f13f78a95f798dbf6bb2685b5a4c46a">size</a>() const _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>size_type</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="a00646.html#ace889e0f0af00dccd5079c3ac89e9646">swap</a>(deque &__x)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>value_type</b> typedef (defined in <a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>~_Deque_base</b>() (defined in <a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a>)</td><td class="entry"><a class="el" href="a00507.html">std::_Deque_base< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="a00646.html#ab0f6d1bcae43b808e1627f458191337d">~deque</a>() _GLIBCXX_NOEXCEPT</td><td class="entry"><a class="el" href="a00646.html">std::deque< _Tp, _Alloc ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.3 </li>
</ul>
</div>
</body>
</html>
