<!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::vector< _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('a07923.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-methods">Protected Member Functions</a> |
<a href="#pro-attribs">Protected Attributes</a> |
<a href="a07920.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">std::vector< _Tp, _Alloc > Class Template Reference<div class="ingroups"><a class="el" href="a01463.html">Containers</a> » <a class="el" href="a01464.html">Sequences</a></div></div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Inheritance diagram for std::vector< _Tp, _Alloc >:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="a07922.svg" width="138" height="136"><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:af6e9591d666d2751689d46b67ebe1054"><td class="memItemLeft" align="right" valign="top"><a id="af6e9591d666d2751689d46b67ebe1054"></a>
typedef _Alloc </td><td class="memItemRight" valign="bottom"><b>allocator_type</b></td></tr>
<tr class="separator:af6e9591d666d2751689d46b67ebe1054"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad1e57b89b9260db15b3b3c0c63549876"><td class="memItemLeft" align="right" valign="top"><a id="ad1e57b89b9260db15b3b3c0c63549876"></a>
typedef __gnu_cxx::__normal_iterator< const_pointer, <a class="el" href="a07923.html">vector</a> > </td><td class="memItemRight" valign="bottom"><b>const_iterator</b></td></tr>
<tr class="separator:ad1e57b89b9260db15b3b3c0c63549876"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a500eb907d83d64fecd35eb684ac458d3"><td class="memItemLeft" align="right" valign="top"><a id="a500eb907d83d64fecd35eb684ac458d3"></a>
typedef _Alloc_traits::const_pointer </td><td class="memItemRight" valign="bottom"><b>const_pointer</b></td></tr>
<tr class="separator:a500eb907d83d64fecd35eb684ac458d3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aad33e7c8765b56566c9b7729b2873373"><td class="memItemLeft" align="right" valign="top"><a id="aad33e7c8765b56566c9b7729b2873373"></a>
typedef _Alloc_traits::const_reference </td><td class="memItemRight" valign="bottom"><b>const_reference</b></td></tr>
<tr class="separator:aad33e7c8765b56566c9b7729b2873373"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aead130cd36f83bf0c8ff5520c5cf9e75"><td class="memItemLeft" align="right" valign="top"><a id="aead130cd36f83bf0c8ff5520c5cf9e75"></a>
typedef <a class="el" href="a07615.html">std::reverse_iterator</a>< const_iterator > </td><td class="memItemRight" valign="bottom"><b>const_reverse_iterator</b></td></tr>
<tr class="separator:aead130cd36f83bf0c8ff5520c5cf9e75"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a416c92b8ab1a276a90da34fed46f8fea"><td class="memItemLeft" align="right" valign="top"><a id="a416c92b8ab1a276a90da34fed46f8fea"></a>
typedef ptrdiff_t </td><td class="memItemRight" valign="bottom"><b>difference_type</b></td></tr>
<tr class="separator:a416c92b8ab1a276a90da34fed46f8fea"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6115ff023e7a32c02012726db8104cbe"><td class="memItemLeft" align="right" valign="top"><a id="a6115ff023e7a32c02012726db8104cbe"></a>
typedef __gnu_cxx::__normal_iterator< pointer, <a class="el" href="a07923.html">vector</a> > </td><td class="memItemRight" valign="bottom"><b>iterator</b></td></tr>
<tr class="separator:a6115ff023e7a32c02012726db8104cbe"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac969adc9cac1f455b7449aa114ad6aa0"><td class="memItemLeft" align="right" valign="top"><a id="ac969adc9cac1f455b7449aa114ad6aa0"></a>
typedef _Base::pointer </td><td class="memItemRight" valign="bottom"><b>pointer</b></td></tr>
<tr class="separator:ac969adc9cac1f455b7449aa114ad6aa0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad08649ce757452ffcd50400c756539cb"><td class="memItemLeft" align="right" valign="top"><a id="ad08649ce757452ffcd50400c756539cb"></a>
typedef _Alloc_traits::reference </td><td class="memItemRight" valign="bottom"><b>reference</b></td></tr>
<tr class="separator:ad08649ce757452ffcd50400c756539cb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a872c5273d5967f4a3ab4e3ba7bdfd5f8"><td class="memItemLeft" align="right" valign="top"><a id="a872c5273d5967f4a3ab4e3ba7bdfd5f8"></a>
typedef <a class="el" href="a07615.html">std::reverse_iterator</a>< iterator > </td><td class="memItemRight" valign="bottom"><b>reverse_iterator</b></td></tr>
<tr class="separator:a872c5273d5967f4a3ab4e3ba7bdfd5f8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0c431c4aa8cb312a241413a5b669c853"><td class="memItemLeft" align="right" valign="top"><a id="a0c431c4aa8cb312a241413a5b669c853"></a>
typedef size_t </td><td class="memItemRight" valign="bottom"><b>size_type</b></td></tr>
<tr class="separator:a0c431c4aa8cb312a241413a5b669c853"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a44e0c2e27828d3d892b9fa50e45e1d93"><td class="memItemLeft" align="right" valign="top"><a id="a44e0c2e27828d3d892b9fa50e45e1d93"></a>
typedef _Tp </td><td class="memItemRight" valign="bottom"><b>value_type</b></td></tr>
<tr class="separator:a44e0c2e27828d3d892b9fa50e45e1d93"><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:a67a4f190d61c7b35fa951357cf96a10f"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a67a4f190d61c7b35fa951357cf96a10f">vector</a> () noexcept(<a class="el" href="a03631.html">is_nothrow_default_constructible</a>< _Alloc >::value)</td></tr>
<tr class="separator:a67a4f190d61c7b35fa951357cf96a10f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab6d52bbbf36c0b4c6a61075ae2b87654"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ab6d52bbbf36c0b4c6a61075ae2b87654">vector</a> (const allocator_type &__a) noexcept</td></tr>
<tr class="separator:ab6d52bbbf36c0b4c6a61075ae2b87654"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6b8074967f8051c5fbcbe5c7057775ec"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a6b8074967f8051c5fbcbe5c7057775ec">vector</a> (size_type __n, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a6b8074967f8051c5fbcbe5c7057775ec"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a501b56f5a3b8558587ca1be9029e1de5"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a501b56f5a3b8558587ca1be9029e1de5">vector</a> (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a501b56f5a3b8558587ca1be9029e1de5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a002b00e3596af506a260bd957bee0212"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a002b00e3596af506a260bd957bee0212">vector</a> (const <a class="el" href="a07923.html">vector</a> &__x)</td></tr>
<tr class="separator:a002b00e3596af506a260bd957bee0212"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a928812d75ac8e43de2346603cfef2d4b"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a928812d75ac8e43de2346603cfef2d4b">vector</a> (<a class="el" href="a07923.html">vector</a> &&__x) noexcept</td></tr>
<tr class="separator:a928812d75ac8e43de2346603cfef2d4b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a325e3dbc4cd5c50fbfa108ff9e1a9bb9"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a325e3dbc4cd5c50fbfa108ff9e1a9bb9">vector</a> (const <a class="el" href="a07923.html">vector</a> &__x, const allocator_type &__a)</td></tr>
<tr class="separator:a325e3dbc4cd5c50fbfa108ff9e1a9bb9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:affbc2a0599ddf5a0e87475e4e65775a0"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#affbc2a0599ddf5a0e87475e4e65775a0">vector</a> (<a class="el" href="a07923.html">vector</a> &&__rv, const allocator_type &__m) noexcept(_Alloc_traits::_S_always_equal())</td></tr>
<tr class="separator:affbc2a0599ddf5a0e87475e4e65775a0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a010e6e6c437a7eb67dae7c052790cf94"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a010e6e6c437a7eb67dae7c052790cf94">vector</a> (<a class="el" href="a01655.html">initializer_list</a>< value_type > __l, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a010e6e6c437a7eb67dae7c052790cf94"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8d611ffc7e37ca37dff8acabba2897a5"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:a8d611ffc7e37ca37dff8acabba2897a5"><td class="memTemplItemLeft" align="right" valign="top"> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07923.html#a8d611ffc7e37ca37dff8acabba2897a5">vector</a> (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())</td></tr>
<tr class="separator:a8d611ffc7e37ca37dff8acabba2897a5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a71ef09bb9b5003131ec404461fbdfa13"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a71ef09bb9b5003131ec404461fbdfa13">~vector</a> () noexcept</td></tr>
<tr class="separator:a71ef09bb9b5003131ec404461fbdfa13"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abe29f1351bed07cd9d3d0b1ec8c8230f"><td class="memTemplParams" colspan="2"><a id="abe29f1351bed07cd9d3d0b1ec8c8230f"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:abe29f1351bed07cd9d3d0b1ec8c8230f"><td class="memTemplItemLeft" align="right" valign="top">auto </td><td class="memTemplItemRight" valign="bottom"><b>_M_emplace_aux</b> (const_iterator __position, _Args &&... __args) -> iterator</td></tr>
<tr class="separator:abe29f1351bed07cd9d3d0b1ec8c8230f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a943d35baf02f390b9870351f0f78c1d7"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a943d35baf02f390b9870351f0f78c1d7">assign</a> (size_type __n, const value_type &__val)</td></tr>
<tr class="separator:a943d35baf02f390b9870351f0f78c1d7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acaab0c546279a999bcba3ed54478c83d"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:acaab0c546279a999bcba3ed54478c83d"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07923.html#acaab0c546279a999bcba3ed54478c83d">assign</a> (_InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:acaab0c546279a999bcba3ed54478c83d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acda096d477c2ef09ee0b3e7fb3ca558c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#acda096d477c2ef09ee0b3e7fb3ca558c">assign</a> (<a class="el" href="a01655.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:acda096d477c2ef09ee0b3e7fb3ca558c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a11362894b61f87331541b5268d0cb033"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a11362894b61f87331541b5268d0cb033">at</a> (size_type __n)</td></tr>
<tr class="separator:a11362894b61f87331541b5268d0cb033"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aaa0004f67abf317a8923d549a0e74987"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aaa0004f67abf317a8923d549a0e74987">at</a> (size_type __n) const</td></tr>
<tr class="separator:aaa0004f67abf317a8923d549a0e74987"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac7c4da8f17ac32164def63407dec54cb"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ac7c4da8f17ac32164def63407dec54cb">back</a> () noexcept</td></tr>
<tr class="separator:ac7c4da8f17ac32164def63407dec54cb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad185eab26722975ac46eb977c7b2627b"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ad185eab26722975ac46eb977c7b2627b">back</a> () const noexcept</td></tr>
<tr class="separator:ad185eab26722975ac46eb977c7b2627b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac219a7abc1e291dfe0a57189895d04d1"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a> () noexcept</td></tr>
<tr class="separator:ac219a7abc1e291dfe0a57189895d04d1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8ecd17bf8b6b1b1ddbdb045e0553ba75"><td class="memItemLeft" align="right" valign="top">const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a8ecd17bf8b6b1b1ddbdb045e0553ba75">begin</a> () const noexcept</td></tr>
<tr class="separator:a8ecd17bf8b6b1b1ddbdb045e0553ba75"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aeec23a5238eb60cd3bb5ec960e9b430e"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aeec23a5238eb60cd3bb5ec960e9b430e">capacity</a> () const noexcept</td></tr>
<tr class="separator:aeec23a5238eb60cd3bb5ec960e9b430e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa5ce64abecf486fbdb7914ae9734d289"><td class="memItemLeft" align="right" valign="top">const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aa5ce64abecf486fbdb7914ae9734d289">cbegin</a> () const noexcept</td></tr>
<tr class="separator:aa5ce64abecf486fbdb7914ae9734d289"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aae7e855d48dc6fc90c9f746d2098c263"><td class="memItemLeft" align="right" valign="top">const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aae7e855d48dc6fc90c9f746d2098c263">cend</a> () const noexcept</td></tr>
<tr class="separator:aae7e855d48dc6fc90c9f746d2098c263"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a57ef261b05f9ea1457d6f54494902e84"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a57ef261b05f9ea1457d6f54494902e84">clear</a> () noexcept</td></tr>
<tr class="separator:a57ef261b05f9ea1457d6f54494902e84"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a30f4698eae082ffd64ed80c8cb648360"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a30f4698eae082ffd64ed80c8cb648360">crbegin</a> () const noexcept</td></tr>
<tr class="separator:a30f4698eae082ffd64ed80c8cb648360"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a825800ea90d4e7367b5361ae53f864c7"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a825800ea90d4e7367b5361ae53f864c7">crend</a> () const noexcept</td></tr>
<tr class="separator:a825800ea90d4e7367b5361ae53f864c7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abee0514d69c004f06f06e37e33b6104b"><td class="memItemLeft" align="right" valign="top">_Tp * </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#abee0514d69c004f06f06e37e33b6104b">data</a> () noexcept</td></tr>
<tr class="separator:abee0514d69c004f06f06e37e33b6104b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5a9cde1fdf538e8e2226c8cde4a65820"><td class="memItemLeft" align="right" valign="top"><a id="a5a9cde1fdf538e8e2226c8cde4a65820"></a>
const _Tp * </td><td class="memItemRight" valign="bottom"><b>data</b> () const noexcept</td></tr>
<tr class="separator:a5a9cde1fdf538e8e2226c8cde4a65820"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab9f9ca10121c7ca0d2365a92ec7c5a85"><td class="memTemplParams" colspan="2">template<typename... _Args> </td></tr>
<tr class="memitem:ab9f9ca10121c7ca0d2365a92ec7c5a85"><td class="memTemplItemLeft" align="right" valign="top">iterator </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07923.html#ab9f9ca10121c7ca0d2365a92ec7c5a85">emplace</a> (const_iterator __position, _Args &&... __args)</td></tr>
<tr class="separator:ab9f9ca10121c7ca0d2365a92ec7c5a85"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a134123f9a58e155afcb0d96f56d122e5"><td class="memTemplParams" colspan="2"><a id="a134123f9a58e155afcb0d96f56d122e5"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a134123f9a58e155afcb0d96f56d122e5"><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:a134123f9a58e155afcb0d96f56d122e5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2c527667d502c53e377b49b8c1ce4214"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a2c527667d502c53e377b49b8c1ce4214">empty</a> () const noexcept</td></tr>
<tr class="separator:a2c527667d502c53e377b49b8c1ce4214"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae957699b810eb3313916800773e103d7"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ae957699b810eb3313916800773e103d7">end</a> () noexcept</td></tr>
<tr class="separator:ae957699b810eb3313916800773e103d7"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae3d969a640523603b2c51341c975b30c"><td class="memItemLeft" align="right" valign="top">const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ae3d969a640523603b2c51341c975b30c">end</a> () const noexcept</td></tr>
<tr class="separator:ae3d969a640523603b2c51341c975b30c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1c8b8734443a1028d00ad364190bac76"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a1c8b8734443a1028d00ad364190bac76">erase</a> (const_iterator __position)</td></tr>
<tr class="separator:a1c8b8734443a1028d00ad364190bac76"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aae89e304cceda4179427223add91eebb"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aae89e304cceda4179427223add91eebb">erase</a> (const_iterator __first, const_iterator __last)</td></tr>
<tr class="separator:aae89e304cceda4179427223add91eebb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a460e9d810eb0009f44d8584662672a6b"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a460e9d810eb0009f44d8584662672a6b">front</a> () noexcept</td></tr>
<tr class="separator:a460e9d810eb0009f44d8584662672a6b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1a3f9b081e24c3932472aff316308554"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a1a3f9b081e24c3932472aff316308554">front</a> () const noexcept</td></tr>
<tr class="separator:a1a3f9b081e24c3932472aff316308554"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4d5bf9070b5e56f9d9c12c33ef67a295"><td class="memItemLeft" align="right" valign="top">allocator_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a4d5bf9070b5e56f9d9c12c33ef67a295">get_allocator</a> () const noexcept</td></tr>
<tr class="separator:a4d5bf9070b5e56f9d9c12c33ef67a295"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ace70e223402de9cdd87a09bd4ff0e76b"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ace70e223402de9cdd87a09bd4ff0e76b">insert</a> (const_iterator __position, const value_type &__x)</td></tr>
<tr class="separator:ace70e223402de9cdd87a09bd4ff0e76b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a84793dbae69ddcd84cc26199e6a9e898"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a84793dbae69ddcd84cc26199e6a9e898">insert</a> (const_iterator __position, value_type &&__x)</td></tr>
<tr class="separator:a84793dbae69ddcd84cc26199e6a9e898"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1a1db200194fca60d689aacce652d616"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a1a1db200194fca60d689aacce652d616">insert</a> (const_iterator __position, <a class="el" href="a01655.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:a1a1db200194fca60d689aacce652d616"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4922c571c2d3e9006f68813656f36587"><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a4922c571c2d3e9006f68813656f36587">insert</a> (const_iterator __position, size_type __n, const value_type &__x)</td></tr>
<tr class="separator:a4922c571c2d3e9006f68813656f36587"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a35cc226f8730266ed04ca5dd0fd3077c"><td class="memTemplParams" colspan="2">template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> </td></tr>
<tr class="memitem:a35cc226f8730266ed04ca5dd0fd3077c"><td class="memTemplItemLeft" align="right" valign="top">iterator </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07923.html#a35cc226f8730266ed04ca5dd0fd3077c">insert</a> (const_iterator __position, _InputIterator __first, _InputIterator __last)</td></tr>
<tr class="separator:a35cc226f8730266ed04ca5dd0fd3077c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7abf19c35e087a2d4596f651e340fb89"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a7abf19c35e087a2d4596f651e340fb89">max_size</a> () const noexcept</td></tr>
<tr class="separator:a7abf19c35e087a2d4596f651e340fb89"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9c56711f1fdb6aeb4a287570da90a688"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07923.html">vector</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a9c56711f1fdb6aeb4a287570da90a688">operator=</a> (const <a class="el" href="a07923.html">vector</a> &__x)</td></tr>
<tr class="separator:a9c56711f1fdb6aeb4a287570da90a688"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3bcd2b28b84df51df419171868014a84"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07923.html">vector</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a3bcd2b28b84df51df419171868014a84">operator=</a> (<a class="el" href="a07923.html">vector</a> &&__x) noexcept(_Alloc_traits::_S_nothrow_move())</td></tr>
<tr class="separator:a3bcd2b28b84df51df419171868014a84"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5badc45ac5ba40fafcbb6ec5a0b8a745"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07923.html">vector</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a5badc45ac5ba40fafcbb6ec5a0b8a745">operator=</a> (<a class="el" href="a01655.html">initializer_list</a>< value_type > __l)</td></tr>
<tr class="separator:a5badc45ac5ba40fafcbb6ec5a0b8a745"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afdb93693c1129f8f23406e8a9f4dc27e"><td class="memItemLeft" align="right" valign="top">reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#afdb93693c1129f8f23406e8a9f4dc27e">operator[]</a> (size_type __n) noexcept</td></tr>
<tr class="separator:afdb93693c1129f8f23406e8a9f4dc27e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a75bd59d9586be7f6d3e43e1afeac3d08"><td class="memItemLeft" align="right" valign="top">const_reference </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a75bd59d9586be7f6d3e43e1afeac3d08">operator[]</a> (size_type __n) const noexcept</td></tr>
<tr class="separator:a75bd59d9586be7f6d3e43e1afeac3d08"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a99e26d28529b0d7e6dfc3aff0400e8bd"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a99e26d28529b0d7e6dfc3aff0400e8bd">pop_back</a> () noexcept</td></tr>
<tr class="separator:a99e26d28529b0d7e6dfc3aff0400e8bd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6f2144e852790296d3c62cdec92c95ce"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a6f2144e852790296d3c62cdec92c95ce">push_back</a> (const value_type &__x)</td></tr>
<tr class="separator:a6f2144e852790296d3c62cdec92c95ce"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a74b2762e80090843e3e6e6b609bf0ea0"><td class="memItemLeft" align="right" valign="top"><a id="a74b2762e80090843e3e6e6b609bf0ea0"></a>
void </td><td class="memItemRight" valign="bottom"><b>push_back</b> (value_type &&__x)</td></tr>
<tr class="separator:a74b2762e80090843e3e6e6b609bf0ea0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a20e5ca3edaf43348d346614730c8b637"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a20e5ca3edaf43348d346614730c8b637">rbegin</a> () noexcept</td></tr>
<tr class="separator:a20e5ca3edaf43348d346614730c8b637"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac1f157333783a401dd4a0c23edaddf1c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#ac1f157333783a401dd4a0c23edaddf1c">rbegin</a> () const noexcept</td></tr>
<tr class="separator:ac1f157333783a401dd4a0c23edaddf1c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a52d47db7d19a815e22d1cefdfa94d93c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a52d47db7d19a815e22d1cefdfa94d93c">rend</a> () noexcept</td></tr>
<tr class="separator:a52d47db7d19a815e22d1cefdfa94d93c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa32a4b05a4c404e012c787360d7518a8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="a07615.html">const_reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aa32a4b05a4c404e012c787360d7518a8">rend</a> () const noexcept</td></tr>
<tr class="separator:aa32a4b05a4c404e012c787360d7518a8"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8ab62036345a72d8126fa30425dfe869"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a8ab62036345a72d8126fa30425dfe869">reserve</a> (size_type __n)</td></tr>
<tr class="separator:a8ab62036345a72d8126fa30425dfe869"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1134bcc83ff6c70cf78bab3cd426feaf"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a1134bcc83ff6c70cf78bab3cd426feaf">resize</a> (size_type __new_size)</td></tr>
<tr class="separator:a1134bcc83ff6c70cf78bab3cd426feaf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a53e627a12d33d2df15d4a9c25c872785"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a53e627a12d33d2df15d4a9c25c872785">resize</a> (size_type __new_size, const value_type &__x)</td></tr>
<tr class="separator:a53e627a12d33d2df15d4a9c25c872785"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4f4dc31fc105124cd9a5e4a90ae99c44"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a4f4dc31fc105124cd9a5e4a90ae99c44">shrink_to_fit</a> ()</td></tr>
<tr class="separator:a4f4dc31fc105124cd9a5e4a90ae99c44"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aedc1ee21f6ca2b8304b4f1f430125c8d"><td class="memItemLeft" align="right" valign="top">size_type </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a> () const noexcept</td></tr>
<tr class="separator:aedc1ee21f6ca2b8304b4f1f430125c8d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a97d8ff35af22b6787d9aa7c60b2ba3ff"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a97d8ff35af22b6787d9aa7c60b2ba3ff">swap</a> (<a class="el" href="a07923.html">vector</a> &__x) noexcept</td></tr>
<tr class="separator:a97d8ff35af22b6787d9aa7c60b2ba3ff"><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:a9f6bc9734850c7a9da4a77463ae5f6ee"><td class="memItemLeft" align="right" valign="top"><a id="a9f6bc9734850c7a9da4a77463ae5f6ee"></a>
pointer </td><td class="memItemRight" valign="bottom"><b>_M_allocate</b> (size_t __n)</td></tr>
<tr class="separator:a9f6bc9734850c7a9da4a77463ae5f6ee"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9f6bc9734850c7a9da4a77463ae5f6ee"><td class="memItemLeft" align="right" valign="top"><a id="a9f6bc9734850c7a9da4a77463ae5f6ee"></a>
pointer </td><td class="memItemRight" valign="bottom"><b>_M_allocate</b> (size_t __n)</td></tr>
<tr class="separator:a9f6bc9734850c7a9da4a77463ae5f6ee"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a283e72373f613c3d74ccf35b529a8393"><td class="memTemplParams" colspan="2">template<typename _ForwardIterator > </td></tr>
<tr class="memitem:a283e72373f613c3d74ccf35b529a8393"><td class="memTemplItemLeft" align="right" valign="top">pointer </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a07923.html#a283e72373f613c3d74ccf35b529a8393">_M_allocate_and_copy</a> (size_type __n, _ForwardIterator __first, _ForwardIterator __last)</td></tr>
<tr class="separator:a283e72373f613c3d74ccf35b529a8393"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ada0071765281496697c9766699cc5eea"><td class="memTemplParams" colspan="2"><a id="ada0071765281496697c9766699cc5eea"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:ada0071765281496697c9766699cc5eea"><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="a07655.html">std::input_iterator_tag</a>)</td></tr>
<tr class="separator:ada0071765281496697c9766699cc5eea"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad8e7613ee2cbc82b5b1db540a5d0f024"><td class="memTemplParams" colspan="2"><a id="ad8e7613ee2cbc82b5b1db540a5d0f024"></a>
template<typename _ForwardIterator > </td></tr>
<tr class="memitem:ad8e7613ee2cbc82b5b1db540a5d0f024"><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="a07663.html">std::forward_iterator_tag</a>)</td></tr>
<tr class="separator:ad8e7613ee2cbc82b5b1db540a5d0f024"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1f76dd5a06e36e2f216a7a133ea0aa18"><td class="memTemplParams" colspan="2"><a id="a1f76dd5a06e36e2f216a7a133ea0aa18"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:a1f76dd5a06e36e2f216a7a133ea0aa18"><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:a1f76dd5a06e36e2f216a7a133ea0aa18"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abda33401b224f7caa5f0d4d2a756d72f"><td class="memTemplParams" colspan="2"><a id="abda33401b224f7caa5f0d4d2a756d72f"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:abda33401b224f7caa5f0d4d2a756d72f"><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:abda33401b224f7caa5f0d4d2a756d72f"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9ec1fb7096938b30190aa8aa63288de2"><td class="memItemLeft" align="right" valign="top"><a id="a9ec1fb7096938b30190aa8aa63288de2"></a>
size_type </td><td class="memItemRight" valign="bottom"><b>_M_check_len</b> (size_type __n, const char *__s) const</td></tr>
<tr class="separator:a9ec1fb7096938b30190aa8aa63288de2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af1d6b5f13ea6f29d7aa9b2471fe817a0"><td class="memItemLeft" align="right" valign="top"><a id="af1d6b5f13ea6f29d7aa9b2471fe817a0"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_deallocate</b> (pointer __p, size_t __n)</td></tr>
<tr class="separator:af1d6b5f13ea6f29d7aa9b2471fe817a0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af1d6b5f13ea6f29d7aa9b2471fe817a0"><td class="memItemLeft" align="right" valign="top"><a id="af1d6b5f13ea6f29d7aa9b2471fe817a0"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_deallocate</b> (pointer __p, size_t __n)</td></tr>
<tr class="separator:af1d6b5f13ea6f29d7aa9b2471fe817a0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5bc3c30680c623031c1b659ed1f4baa2"><td class="memItemLeft" align="right" valign="top"><a id="a5bc3c30680c623031c1b659ed1f4baa2"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_default_append</b> (size_type __n)</td></tr>
<tr class="separator:a5bc3c30680c623031c1b659ed1f4baa2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8ff15aec0260b1c1e0a067c5c1e6dd95"><td class="memItemLeft" align="right" valign="top"><a id="a8ff15aec0260b1c1e0a067c5c1e6dd95"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_default_initialize</b> (size_type __n)</td></tr>
<tr class="separator:a8ff15aec0260b1c1e0a067c5c1e6dd95"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a37c1b131cc48397ec7ce32c83be01938"><td class="memTemplParams" colspan="2"><a id="a37c1b131cc48397ec7ce32c83be01938"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:a37c1b131cc48397ec7ce32c83be01938"><td class="memTemplItemLeft" align="right" valign="top">iterator </td><td class="memTemplItemRight" valign="bottom"><b>_M_emplace_aux</b> (const_iterator __position, _Args &&... __args)</td></tr>
<tr class="separator:a37c1b131cc48397ec7ce32c83be01938"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7b0e5dee510bc34849ad045043f1e4e1"><td class="memItemLeft" align="right" valign="top"><a id="a7b0e5dee510bc34849ad045043f1e4e1"></a>
iterator </td><td class="memItemRight" valign="bottom"><b>_M_emplace_aux</b> (const_iterator __position, value_type &&__v)</td></tr>
<tr class="separator:a7b0e5dee510bc34849ad045043f1e4e1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9cbfd7bdf97cd8f71047b24205df2ef2"><td class="memItemLeft" align="right" valign="top"><a id="a9cbfd7bdf97cd8f71047b24205df2ef2"></a>
iterator </td><td class="memItemRight" valign="bottom"><b>_M_erase</b> (iterator __position)</td></tr>
<tr class="separator:a9cbfd7bdf97cd8f71047b24205df2ef2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a53e36f37b4b5c1deeec9726d49c37cec"><td class="memItemLeft" align="right" valign="top"><a id="a53e36f37b4b5c1deeec9726d49c37cec"></a>
iterator </td><td class="memItemRight" valign="bottom"><b>_M_erase</b> (iterator __first, iterator __last)</td></tr>
<tr class="separator:a53e36f37b4b5c1deeec9726d49c37cec"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6c8a1322de9aecb9beb9292d71ab5074"><td class="memItemLeft" align="right" valign="top"><a id="a6c8a1322de9aecb9beb9292d71ab5074"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_erase_at_end</b> (pointer __pos) noexcept</td></tr>
<tr class="separator:a6c8a1322de9aecb9beb9292d71ab5074"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0db26d051403045a28d5287abc00540d"><td class="memItemLeft" align="right" valign="top"><a id="a0db26d051403045a28d5287abc00540d"></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:a0db26d051403045a28d5287abc00540d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2df134aac8d559b54496f00b63294a39"><td class="memItemLeft" align="right" valign="top"><a id="a2df134aac8d559b54496f00b63294a39"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_fill_initialize</b> (size_type __n, const value_type &__value)</td></tr>
<tr class="separator:a2df134aac8d559b54496f00b63294a39"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a097dcde87121f08e6da0f0b0a931e837"><td class="memItemLeft" align="right" valign="top"><a id="a097dcde87121f08e6da0f0b0a931e837"></a>
void </td><td class="memItemRight" valign="bottom"><b>_M_fill_insert</b> (iterator __pos, size_type __n, const value_type &__x)</td></tr>
<tr class="separator:a097dcde87121f08e6da0f0b0a931e837"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac9a03b39ad86589d5c175eb2a286b468"><td class="memItemLeft" align="right" valign="top"><a id="ac9a03b39ad86589d5c175eb2a286b468"></a>
_Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () noexcept</td></tr>
<tr class="separator:ac9a03b39ad86589d5c175eb2a286b468"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac64b6ea1dacba000a66e7dc95e9b53ca"><td class="memItemLeft" align="right" valign="top"><a id="ac64b6ea1dacba000a66e7dc95e9b53ca"></a>
const _Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () const noexcept</td></tr>
<tr class="separator:ac64b6ea1dacba000a66e7dc95e9b53ca"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac64b6ea1dacba000a66e7dc95e9b53ca"><td class="memItemLeft" align="right" valign="top"><a id="ac64b6ea1dacba000a66e7dc95e9b53ca"></a>
const _Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () const noexcept</td></tr>
<tr class="separator:ac64b6ea1dacba000a66e7dc95e9b53ca"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac9a03b39ad86589d5c175eb2a286b468"><td class="memItemLeft" align="right" valign="top"><a id="ac9a03b39ad86589d5c175eb2a286b468"></a>
_Tp_alloc_type & </td><td class="memItemRight" valign="bottom"><b>_M_get_Tp_allocator</b> () noexcept</td></tr>
<tr class="separator:ac9a03b39ad86589d5c175eb2a286b468"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a892be386777f2c66b685e536bc139f6e"><td class="memTemplParams" colspan="2"><a id="a892be386777f2c66b685e536bc139f6e"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:a892be386777f2c66b685e536bc139f6e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_initialize_dispatch</b> (_Integer __n, _Integer __value, __true_type)</td></tr>
<tr class="separator:a892be386777f2c66b685e536bc139f6e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afee22cb59f8dd85b8342368eff2ae113"><td class="memTemplParams" colspan="2"><a id="afee22cb59f8dd85b8342368eff2ae113"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:afee22cb59f8dd85b8342368eff2ae113"><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:afee22cb59f8dd85b8342368eff2ae113"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad1374cd2ca76db4198b34c2cdcd10130"><td class="memTemplParams" colspan="2"><a id="ad1374cd2ca76db4198b34c2cdcd10130"></a>
template<typename _Arg > </td></tr>
<tr class="memitem:ad1374cd2ca76db4198b34c2cdcd10130"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_aux</b> (iterator __position, _Arg &&__arg)</td></tr>
<tr class="separator:ad1374cd2ca76db4198b34c2cdcd10130"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a11d3c98b4227dd3d0579f5d98a72d0cf"><td class="memTemplParams" colspan="2"><a id="a11d3c98b4227dd3d0579f5d98a72d0cf"></a>
template<typename _Integer > </td></tr>
<tr class="memitem:a11d3c98b4227dd3d0579f5d98a72d0cf"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_dispatch</b> (iterator __pos, _Integer __n, _Integer __val, __true_type)</td></tr>
<tr class="separator:a11d3c98b4227dd3d0579f5d98a72d0cf"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa4e0b223f26f7ac019b735df1a08a33a"><td class="memTemplParams" colspan="2"><a id="aa4e0b223f26f7ac019b735df1a08a33a"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:aa4e0b223f26f7ac019b735df1a08a33a"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_insert_dispatch</b> (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)</td></tr>
<tr class="separator:aa4e0b223f26f7ac019b735df1a08a33a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa9f19f523a868f955e7be530280a066d"><td class="memItemLeft" align="right" valign="top"><a id="aa9f19f523a868f955e7be530280a066d"></a>
iterator </td><td class="memItemRight" valign="bottom"><b>_M_insert_rval</b> (const_iterator __position, value_type &&__v)</td></tr>
<tr class="separator:aa9f19f523a868f955e7be530280a066d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a84c7c47a337f0e2dfbdad2c5719c13f5"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a07923.html#a84c7c47a337f0e2dfbdad2c5719c13f5">_M_range_check</a> (size_type __n) const</td></tr>
<tr class="separator:a84c7c47a337f0e2dfbdad2c5719c13f5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae67a6c9530407a7681e45bb94f4db433"><td class="memTemplParams" colspan="2"><a id="ae67a6c9530407a7681e45bb94f4db433"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:ae67a6c9530407a7681e45bb94f4db433"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_range_initialize</b> (_InputIterator __first, _InputIterator __last, <a class="el" href="a07655.html">std::input_iterator_tag</a>)</td></tr>
<tr class="separator:ae67a6c9530407a7681e45bb94f4db433"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0875f47a5459a0480e797410729e0007"><td class="memTemplParams" colspan="2"><a id="a0875f47a5459a0480e797410729e0007"></a>
template<typename _ForwardIterator > </td></tr>
<tr class="memitem:a0875f47a5459a0480e797410729e0007"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_range_initialize</b> (_ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a07663.html">std::forward_iterator_tag</a>)</td></tr>
<tr class="separator:a0875f47a5459a0480e797410729e0007"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad62b9823e6a1e9b4a80a24233fbf572b"><td class="memTemplParams" colspan="2"><a id="ad62b9823e6a1e9b4a80a24233fbf572b"></a>
template<typename _InputIterator > </td></tr>
<tr class="memitem:ad62b9823e6a1e9b4a80a24233fbf572b"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_range_insert</b> (iterator __pos, _InputIterator __first, _InputIterator __last, <a class="el" href="a07655.html">std::input_iterator_tag</a>)</td></tr>
<tr class="separator:ad62b9823e6a1e9b4a80a24233fbf572b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9b67053ec5c722de5faf14c9942dfa66"><td class="memTemplParams" colspan="2"><a id="a9b67053ec5c722de5faf14c9942dfa66"></a>
template<typename _ForwardIterator > </td></tr>
<tr class="memitem:a9b67053ec5c722de5faf14c9942dfa66"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_range_insert</b> (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a07663.html">std::forward_iterator_tag</a>)</td></tr>
<tr class="separator:a9b67053ec5c722de5faf14c9942dfa66"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac7f9b75bd8615d5251bdfd02bba0ace4"><td class="memTemplParams" colspan="2"><a id="ac7f9b75bd8615d5251bdfd02bba0ace4"></a>
template<typename... _Args> </td></tr>
<tr class="memitem:ac7f9b75bd8615d5251bdfd02bba0ace4"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>_M_realloc_insert</b> (iterator __position, _Args &&... __args)</td></tr>
<tr class="separator:ac7f9b75bd8615d5251bdfd02bba0ace4"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7c1b8a009e5866fd4bf57c18f89c7ca5"><td class="memItemLeft" align="right" valign="top"><a id="a7c1b8a009e5866fd4bf57c18f89c7ca5"></a>
bool </td><td class="memItemRight" valign="bottom"><b>_M_shrink_to_fit</b> ()</td></tr>
<tr class="separator:a7c1b8a009e5866fd4bf57c18f89c7ca5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4d5bf9070b5e56f9d9c12c33ef67a295"><td class="memItemLeft" align="right" valign="top"><a id="a4d5bf9070b5e56f9d9c12c33ef67a295"></a>
allocator_type </td><td class="memItemRight" valign="bottom"><b>get_allocator</b> () const noexcept</td></tr>
<tr class="separator:a4d5bf9070b5e56f9d9c12c33ef67a295"><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:a1f01a554f9c151b5b56ab81b8da228bd"><td class="memItemLeft" align="right" valign="top"><a id="a1f01a554f9c151b5b56ab81b8da228bd"></a>
_Vector_impl </td><td class="memItemRight" valign="bottom"><b>_M_impl</b></td></tr>
<tr class="separator:a1f01a554f9c151b5b56ab81b8da228bd"><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::vector< _Tp, _Alloc ></h3>
<p>A standard container which offers fixed time access to individual elements in any order. </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> with the exception of <code>push_front</code> and <code>pop_front</code>.</p>
<p>In some terminology a vector can be described as a dynamic C-style array, it offers fast and efficient access to individual elements in any order and saves the user from worrying about memory and size allocation. Subscripting ( <code></code>[] ) access is also provided as with C-style arrays. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00339">339</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="a67a4f190d61c7b35fa951357cf96a10f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a67a4f190d61c7b35fa951357cf96a10f">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a vector with no elements. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00391">391</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="ab6d52bbbf36c0b4c6a61075ae2b87654"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab6d52bbbf36c0b4c6a61075ae2b87654">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</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 class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Creates a vector 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="a00599_source.html#l00402">402</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a6b8074967f8051c5fbcbe5c7057775ec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6b8074967f8051c5fbcbe5c7057775ec">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</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 vector 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 vector with <em>__n</em> default constructed elements. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00415">415</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a501b56f5a3b8558587ca1be9029e1de5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a501b56f5a3b8558587ca1be9029e1de5">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</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 vector 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 vector with <em>__n</em> copies of <em>__value</em>. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00427">427</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a002b00e3596af506a260bd957bee0212"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a002b00e3596af506a260bd957bee0212">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07923.html">vector</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>Vector copy constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A vector of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>All the elements of <em>__x</em> are copied, but any unused capacity in <em>__x</em> will not be copied (i.e. capacity() == size() in the new vector).</p>
<p>The newly-created vector 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="a00599_source.html#l00458">458</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a928812d75ac8e43de2346603cfef2d4b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a928812d75ac8e43de2346603cfef2d4b">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07923.html">vector</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>Vector move constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A vector of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The newly-created vector contains the exact contents of <em>__x</em>. The contents of <em>__x</em> are a valid, but unspecified vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00476">476</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a325e3dbc4cd5c50fbfa108ff9e1a9bb9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a325e3dbc4cd5c50fbfa108ff9e1a9bb9">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07923.html">vector</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="a00599_source.html#l00480">480</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="affbc2a0599ddf5a0e87475e4e65775a0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#affbc2a0599ddf5a0e87475e4e65775a0">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07923.html">vector</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__rv</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__m</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 class="mlabel">noexcept</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="a00599_source.html#l00490">490</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a010e6e6c437a7eb67dae7c052790cf94"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a010e6e6c437a7eb67dae7c052790cf94">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.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 vector 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.</td></tr>
</table>
</dd>
</dl>
<p>Create a vector 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 <em>__l.size()</em>) and do no memory reallocation. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00515">515</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a8d611ffc7e37ca37dff8acabba2897a5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8d611ffc7e37ca37dff8acabba2897a5">◆ </a></span>vector() <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="a07923.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a07923.html">vector</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 vector 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.</td></tr>
</table>
</dd>
</dl>
<p>Create a vector 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="a00599_source.html#l00543">543</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a71ef09bb9b5003131ec404461fbdfa13"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a71ef09bb9b5003131ec404461fbdfa13">◆ </a></span>~vector()</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="a07923.html">std::vector</a>< _Tp, _Alloc >::~<a class="el" href="a07923.html">vector</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 class="mlabel">noexcept</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="a00599_source.html#l00565">565</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a283e72373f613c3d74ccf35b529a8393"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a283e72373f613c3d74ccf35b529a8393">◆ </a></span>_M_allocate_and_copy()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _ForwardIterator > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">pointer <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::_M_allocate_and_copy </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">_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></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">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Memory expansion handler. Uses the member allocation function to obtain <em>n</em> bytes of memory, and then copies [first,last) into it. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01395">1395</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a84c7c47a337f0e2dfbdad2c5719c13f5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a84c7c47a337f0e2dfbdad2c5719c13f5">◆ </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="a07923.html">std::vector</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="a00599_source.html#l00957">957</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00599_source.html#l00979">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::at()</a>.</p>
</div>
</div>
<a id="a943d35baf02f390b9870351f0f78c1d7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a943d35baf02f390b9870351f0f78c1d7">◆ </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="a07923.html">std::vector</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 vector. </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 vector with <em>__n</em> copies of the given value. Note that the assignment completely changes the vector and that the resulting vector's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00636">636</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="acaab0c546279a999bcba3ed54478c83d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acaab0c546279a999bcba3ed54478c83d">◆ </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="a07923.html">std::vector</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 vector. </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 vector with copies of the elements in the range [__first,__last).</p>
<p>Note that the assignment completely changes the vector and that the resulting vector's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00655">655</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="acda096d477c2ef09ee0b3e7fb3ca558c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acda096d477c2ef09ee0b3e7fb3ca558c">◆ </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="a07923.html">std::vector</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.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 vector. </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 vector with copies of the elements in the initializer list <em>__l</em>.</p>
<p>Note that the assignment completely changes the vector and that the resulting vector's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00681">681</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a11362894b61f87331541b5268d0cb033"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a11362894b61f87331541b5268d0cb033">◆ </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="a07923.html">std::vector</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 vector. </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 vector. The function throws out_of_range if the check fails. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00979">979</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="aaa0004f67abf317a8923d549a0e74987"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aaa0004f67abf317a8923d549a0e74987">◆ </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="a07923.html">std::vector</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 vector. </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 vector. The function throws out_of_range if the check fails. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00997">997</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="ac7c4da8f17ac32164def63407dec54cb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac7c4da8f17ac32164def63407dec54cb">◆ </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="a07923.html">std::vector</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 vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01030">1030</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00452_source.html#l05567">std::piecewise_constant_distribution< _RealType >::max()</a>, and <a class="el" href="a00452_source.html#l05841">std::piecewise_linear_distribution< _RealType >::max()</a>.</p>
</div>
</div>
<a id="ad185eab26722975ac46eb977c7b2627b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad185eab26722975ac46eb977c7b2627b">◆ </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="a07923.html">std::vector</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 vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01041">1041</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="ac219a7abc1e291dfe0a57189895d04d1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac219a7abc1e291dfe0a57189895d04d1">◆ </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">iterator <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00698">698</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00599_source.html#l00798">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crend()</a>, <a class="el" href="a00599_source.html#l00894">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty()</a>, <a class="el" href="a00599_source.html#l01317">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::erase()</a>, <a class="el" href="a00599_source.html#l01197">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert()</a>, <a class="el" href="a00599_source.html#l01770">std::operator<()</a>, <a class="el" href="a00599_source.html#l01753">std::operator==()</a>, <a class="el" href="a00599_source.html#l00752">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rend()</a>, and <a class="el" href="a00599_source.html#l00458">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector()</a>.</p>
</div>
</div>
<a id="a8ecd17bf8b6b1b1ddbdb045e0553ba75"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8ecd17bf8b6b1b1ddbdb045e0553ba75">◆ </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">const_iterator <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00707">707</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="aeec23a5238eb60cd3bb5ec960e9b430e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeec23a5238eb60cd3bb5ec960e9b430e">◆ </a></span>capacity()</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="a07923.html">std::vector</a>< _Tp, _Alloc >::capacity </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 total number of elements that the vector can hold before needing to allocate more memory. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00885">885</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="aa5ce64abecf486fbdb7914ae9734d289"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa5ce64abecf486fbdb7914ae9734d289">◆ </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">const_iterator <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00771">771</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00599_source.html#l01317">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::erase()</a>, and <a class="el" href="a00599_source.html#l01197">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert()</a>.</p>
</div>
</div>
<a id="aae7e855d48dc6fc90c9f746d2098c263"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aae7e855d48dc6fc90c9f746d2098c263">◆ </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">const_iterator <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00780">780</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a57ef261b05f9ea1457d6f54494902e84"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a57ef261b05f9ea1457d6f54494902e84">◆ </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="a07923.html">std::vector</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="a00599_source.html#l01385">1385</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a30f4698eae082ffd64ed80c8cb648360"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a30f4698eae082ffd64ed80c8cb648360">◆ </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="a07615.html">const_reverse_iterator</a> <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00789">789</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a825800ea90d4e7367b5361ae53f864c7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a825800ea90d4e7367b5361ae53f864c7">◆ </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="a07615.html">const_reverse_iterator</a> <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00798">798</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="abee0514d69c004f06f06e37e33b6104b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abee0514d69c004f06f06e37e33b6104b">◆ </a></span>data()</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">_Tp* <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::data </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 pointer such that [data(), data() + size()) is a valid range. For a non-empty vector, data() == &front(). </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01055">1055</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00464_source.html#l00248">std::regex_traits< _CharType >::transform_primary()</a>.</p>
</div>
</div>
<a id="ab9f9ca10121c7ca0d2365a92ec7c5a85"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab9f9ca10121c7ca0d2365a92ec7c5a85">◆ </a></span>emplace()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::emplace </td>
<td>(</td>
<td class="paramtype">const_iterator </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>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts an object in vector 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 vector. </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. Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01135">1135</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a2c527667d502c53e377b49b8c1ce4214"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2c527667d502c53e377b49b8c1ce4214">◆ </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="a07923.html">std::vector</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 vector is empty. (Thus begin() would equal end().) </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00894">894</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00452_source.html#l05532">std::piecewise_constant_distribution< _RealType >::densities()</a>, <a class="el" href="a00452_source.html#l05806">std::piecewise_linear_distribution< _RealType >::densities()</a>, <a class="el" href="a00452_source.html#l05516">std::piecewise_constant_distribution< _RealType >::intervals()</a>, <a class="el" href="a00452_source.html#l05789">std::piecewise_linear_distribution< _RealType >::intervals()</a>, <a class="el" href="a00452_source.html#l05296">std::discrete_distribution< _IntType >::max()</a>, <a class="el" href="a00452_source.html#l05567">std::piecewise_constant_distribution< _RealType >::max()</a>, <a class="el" href="a00452_source.html#l05841">std::piecewise_linear_distribution< _RealType >::max()</a>, <a class="el" href="a00452_source.html#l05557">std::piecewise_constant_distribution< _RealType >::min()</a>, <a class="el" href="a00452_source.html#l05831">std::piecewise_linear_distribution< _RealType >::min()</a>, and <a class="el" href="a00452_source.html#l05264">std::discrete_distribution< _IntType >::probabilities()</a>.</p>
</div>
</div>
<a id="ae957699b810eb3313916800773e103d7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae957699b810eb3313916800773e103d7">◆ </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">iterator <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00716">716</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00599_source.html#l00789">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crbegin()</a>, <a class="el" href="a00599_source.html#l00894">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty()</a>, <a class="el" href="a00599_source.html#l01770">std::operator<()</a>, <a class="el" href="a00599_source.html#l01753">std::operator==()</a>, <a class="el" href="a00599_source.html#l00734">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rbegin()</a>, <a class="el" href="a00599_source.html#l00844">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()</a>, and <a class="el" href="a00599_source.html#l00458">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector()</a>.</p>
</div>
</div>
<a id="ae3d969a640523603b2c51341c975b30c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae3d969a640523603b2c51341c975b30c">◆ </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">const_iterator <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in ordinary element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00725">725</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a1c8b8734443a1028d00ad364190bac76"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1c8b8734443a1028d00ad364190bac76">◆ </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">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype">const_iterator </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 vector by one.</p>
<p>Note This operation could be expensive and if it is frequently used the user should consider using std::list. The user is also 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="a00599_source.html#l01317">1317</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="aae89e304cceda4179427223add91eebb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aae89e304cceda4179427223add91eebb">◆ </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">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::erase </td>
<td>(</td>
<td class="paramtype">const_iterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const_iterator </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 vector accordingly.</p>
<p>Note This operation could be expensive and if it is frequently used the user should consider using std::list. The user is also 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="a00599_source.html#l01344">1344</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a460e9d810eb0009f44d8584662672a6b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a460e9d810eb0009f44d8584662672a6b">◆ </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="a07923.html">std::vector</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 vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01008">1008</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00452_source.html#l05557">std::piecewise_constant_distribution< _RealType >::min()</a>, and <a class="el" href="a00452_source.html#l05831">std::piecewise_linear_distribution< _RealType >::min()</a>.</p>
</div>
</div>
<a id="a1a3f9b081e24c3932472aff316308554"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1a3f9b081e24c3932472aff316308554">◆ </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="a07923.html">std::vector</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 vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01019">1019</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a4d5bf9070b5e56f9d9c12c33ef67a295"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4d5bf9070b5e56f9d9c12c33ef67a295">◆ </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="a07915.html">std::_Vector_base</a>< _Tp, _Alloc >::get_allocator</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="a00599_source.html#l00245">245</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="ace70e223402de9cdd87a09bd4ff0e76b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ace70e223402de9cdd87a09bd4ff0e76b">◆ </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="a07923.html">vector</a>< _Tp, _Alloc >::iterator vector::insert </td>
<td>(</td>
<td class="paramtype">const_iterator </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 vector 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 vector. </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. Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list. </p>
<p class="definition">Definition at line <a class="el" href="a00644_source.html#l00120">120</a> of file <a class="el" href="a00644_source.html">vector.tcc</a>.</p>
</div>
</div>
<a id="a84793dbae69ddcd84cc26199e6a9e898"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a84793dbae69ddcd84cc26199e6a9e898">◆ </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">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">const_iterator </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 vector 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 vector. </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. Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01180">1180</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a1a1db200194fca60d689aacce652d616"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1a1db200194fca60d689aacce652d616">◆ </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">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">const_iterator </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01655.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 vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>An iterator into the vector. </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 vector before the location specified by <em>position</em>.</p>
<p>Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01197">1197</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a4922c571c2d3e9006f68813656f36587"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4922c571c2d3e9006f68813656f36587">◆ </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">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">const_iterator </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 vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the vector. </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>Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01222">1222</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a35cc226f8730266ed04ca5dd0fd3077c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a35cc226f8730266ed04ca5dd0fd3077c">◆ </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">iterator <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">const_iterator </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 vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__position</td><td>A const_iterator into the vector. </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 vector before the location specified by <em>pos</em>.</p>
<p>Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01266">1266</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a7abf19c35e087a2d4596f651e340fb89"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7abf19c35e087a2d4596f651e340fb89">◆ </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="a07923.html">std::vector</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 vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00810">810</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a9c56711f1fdb6aeb4a287570da90a688"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9c56711f1fdb6aeb4a287570da90a688">◆ </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="a07923.html">vector</a>< _Tp, _Alloc > & vector::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a07923.html">vector</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Vector assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A vector of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>All the elements of <em>__x</em> are copied, but any unused capacity in <em>__x</em> will not be copied.</p>
<p>Whether the allocator is copied depends on the allocator traits. </p>
<p class="definition">Definition at line <a class="el" href="a00644_source.html#l00187">187</a> of file <a class="el" href="a00644_source.html">vector.tcc</a>.</p>
</div>
</div>
<a id="a3bcd2b28b84df51df419171868014a84"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3bcd2b28b84df51df419171868014a84">◆ </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="a07923.html">vector</a>& <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07923.html">vector</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>Vector move assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A vector of identical element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>The contents of <em>__x</em> are moved into this vector (without copying, if the allocators permit it). Afterwards <em>__x</em> is a valid, but unspecified vector.</p>
<p>Whether the allocator is moved depends on the allocator traits. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00596">596</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a5badc45ac5ba40fafcbb6ec5a0b8a745"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5badc45ac5ba40fafcbb6ec5a0b8a745">◆ </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="a07923.html">vector</a>& <a class="el" href="a07923.html">std::vector</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01655.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>Vector list assignment operator. </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 vector with copies of the elements in the initializer list <em>__l</em>.</p>
<p>Note that the assignment completely changes the vector and that the resulting vector's size is the same as the number of elements assigned. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00617">617</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="afdb93693c1129f8f23406e8a9f4dc27e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afdb93693c1129f8f23406e8a9f4dc27e">◆ </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="a07923.html">std::vector</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 vector. </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="a00599_source.html#l00930">930</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a75bd59d9586be7f6d3e43e1afeac3d08"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a75bd59d9586be7f6d3e43e1afeac3d08">◆ </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="a07923.html">std::vector</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 vector. </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="a00599_source.html#l00948">948</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a99e26d28529b0d7e6dfc3aff0400e8bd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a99e26d28529b0d7e6dfc3aff0400e8bd">◆ </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="a07923.html">std::vector</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 vector 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="a00599_source.html#l01112">1112</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a6f2144e852790296d3c62cdec92c95ce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6f2144e852790296d3c62cdec92c95ce">◆ </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="a07923.html">std::vector</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 vector. </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 vector and assigns the given data to it. Due to the nature of a vector this operation can be done in constant time if the vector has preallocated space available. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l01074">1074</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a20e5ca3edaf43348d346614730c8b637"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a20e5ca3edaf43348d346614730c8b637">◆ </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="a07615.html">reverse_iterator</a> <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00734">734</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="ac1f157333783a401dd4a0c23edaddf1c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac1f157333783a401dd4a0c23edaddf1c">◆ </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="a07615.html">const_reverse_iterator</a> <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00743">743</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a52d47db7d19a815e22d1cefdfa94d93c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a52d47db7d19a815e22d1cefdfa94d93c">◆ </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="a07615.html">reverse_iterator</a> <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00752">752</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="aa32a4b05a4c404e012c787360d7518a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa32a4b05a4c404e012c787360d7518a8">◆ </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="a07615.html">const_reverse_iterator</a> <a class="el" href="a07923.html">std::vector</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 vector. Iteration is done in reverse element order. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00761">761</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a8ab62036345a72d8126fa30425dfe869"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8ab62036345a72d8126fa30425dfe869">◆ </a></span>reserve()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<table class="memname">
<tr>
<td class="memname">void vector::reserve </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Attempt to preallocate enough memory for specified number of elements. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__n</td><td>Number of elements required. </td></tr>
</table>
</dd>
</dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname">std::length_error</td><td>If <em>n</em> exceeds <code>max_size()</code>.</td></tr>
</table>
</dd>
</dl>
<p>This function attempts to reserve enough memory for the vector to hold the specified number of elements. If the number requested is more than max_size(), length_error is thrown.</p>
<p>The advantage of this function is that if optimal code is a necessity and the user can determine the number of elements that will be required, the user can reserve the memory in advance, and thus prevent a possible reallocation of memory and copying of vector data. </p>
<p class="definition">Definition at line <a class="el" href="a00644_source.html#l00067">67</a> of file <a class="el" href="a00644_source.html">vector.tcc</a>.</p>
</div>
</div>
<a id="a1134bcc83ff6c70cf78bab3cd426feaf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1134bcc83ff6c70cf78bab3cd426feaf">◆ </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="a07923.html">std::vector</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 vector 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 vector should contain.</td></tr>
</table>
</dd>
</dl>
<p>This function will resize the vector to the specified number of elements. If the number is smaller than the vector's current size the vector is truncated, otherwise default constructed elements are appended. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00824">824</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00905_source.html#l00050">__gnu_parallel::__shrink_and_double()</a>.</p>
</div>
</div>
<a id="a53e627a12d33d2df15d4a9c25c872785"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a53e627a12d33d2df15d4a9c25c872785">◆ </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="a07923.html">std::vector</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 vector 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 vector 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 vector to the specified number of elements. If the number is smaller than the vector's current size the vector is truncated, otherwise the vector is extended and new elements are populated with given data. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00844">844</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="a4f4dc31fc105124cd9a5e4a90ae99c44"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4f4dc31fc105124cd9a5e4a90ae99c44">◆ </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="a07923.html">std::vector</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> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A non-binding request to reduce capacity() to size(). </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00876">876</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a id="aedc1ee21f6ca2b8304b4f1f430125c8d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aedc1ee21f6ca2b8304b4f1f430125c8d">◆ </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="a07923.html">std::vector</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 vector. </p>
<p class="definition">Definition at line <a class="el" href="a00599_source.html#l00805">805</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
<p class="reference">Referenced by <a class="el" href="a00905_source.html#l00070">__gnu_parallel::__shrink()</a>, <a class="el" href="a00905_source.html#l00050">__gnu_parallel::__shrink_and_double()</a>, <a class="el" href="a00599_source.html#l00957">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::_M_range_check()</a>, <a class="el" href="a00905_source.html#l00101">__gnu_parallel::list_partition()</a>, <a class="el" href="a00452_source.html#l05296">std::discrete_distribution< _IntType >::max()</a>, <a class="el" href="a00599_source.html#l01753">std::operator==()</a>, <a class="el" href="a00599_source.html#l00824">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()</a>, and <a class="el" href="a00464_source.html#l00248">std::regex_traits< _CharType >::transform_primary()</a>.</p>
</div>
</div>
<a id="a97d8ff35af22b6787d9aa7c60b2ba3ff"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a97d8ff35af22b6787d9aa7c60b2ba3ff">◆ </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="a07923.html">std::vector</a>< _Tp, _Alloc >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a07923.html">vector</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 vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">__x</td><td>A vector of the same element and allocator types.</td></tr>
</table>
</dd>
</dl>
<p>This exchanges the elements between two vectors in constant time. (Three pointers, so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(v1,v2) 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="a00599_source.html#l01367">1367</a> of file <a class="el" href="a00599_source.html">stl_vector.h</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="a00599_source.html">stl_vector.h</a></li>
<li><a class="el" href="a00644_source.html">vector.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="a01541.html">std</a></li><li class="navelem"><a class="el" href="a07923.html">vector</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
4026
