<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: std::vector< _Tp, _Alloc > Class Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a00739.html','');
</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> </div>
<div class="headertitle">
<div class="title">std::vector< _Tp, _Alloc > Class Template Reference<div class="ingroups"><a class="el" href="a01159.html">Sequences</a></div></div> </div>
</div>
<div class="contents">
<!-- doxytag: class="std::vector" --><!-- doxytag: inherits="std::_Vector_base" -->
<p>A standard container which offers fixed time access to individual elements in any order.
<a href="a00739.html#details">More...</a></p>
<div class="dynheader">
Inheritance diagram for std::vector< _Tp, _Alloc >:</div>
<div class="dyncontent">
<div class="center"><img src="a02435.png" border="0" usemap="#std_1_1vector_3_01___tp_00_01___alloc_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="std_1_1vector_3_01___tp_00_01___alloc_01_4_inherit__map" id="std_1_1vector_3_01___tp_00_01___alloc_01_4_inherit__map">
<area shape="rect" id="node5" href="a00739.html" title="std::vector\< sub_match\< _Bi_iter \>, _Allocator \>" alt="" coords="805,227,1085,256"/><area shape="rect" id="node13" href="a00739.html" title="std::vector\< double \>" alt="" coords="879,120,1012,149"/><area shape="rect" id="node15" href="a00739.html" title="std::vector\< int \>" alt="" coords="891,173,1000,203"/><area shape="rect" id="node17" href="a00739.html" title="std::vector\< sub_match\< _FwdIterT \>, _Alloc \>" alt="" coords="1183,535,1452,564"/><area shape="rect" id="node20" href="a00739.html" title="std::vector\< _RealType \>" alt="" coords="867,280,1024,309"/><area shape="rect" id="node22" href="a00739.html" title="std::vector\< _Node *, _Nodeptr_Alloc \>" alt="" coords="829,333,1061,363"/><area shape="rect" id="node24" href="a00739.html" title="std::vector\< _Piece\< _DifferenceType \> \>" alt="" coords="823,387,1068,416"/><area shape="rect" id="node26" href="a00739.html" title="std::vector\< result_type \>" alt="" coords="867,440,1024,469"/><area shape="rect" id="node28" href="a00739.html" title="std::vector\< _StateSeq \>" alt="" coords="868,493,1023,523"/><area shape="rect" id="node30" href="a00739.html" title="std::vector\< _State \>" alt="" coords="880,547,1011,576"/><area shape="rect" id="node32" href="a00739.html" title="std::vector\< sub_match\< _Bi_iter \>, allocator\< sub_match\< _Bi_iter \> \> \>" alt="" coords="1111,109,1524,139"/><area shape="rect" id="node2" href="a00242.html" title="See bits/stl_deque.h's _Deque_base for an explanation." alt="" coords="7,333,207,363"/><area shape="rect" id="node7" href="a00261.html" title="The results of a match or search operation." alt="" coords="1549,227,1792,256"/><area shape="rect" id="node9" href="a00261.html" title="std::match_results\< _Bi_iter \>" alt="" coords="1981,188,2163,217"/><area shape="rect" id="node11" href="a00261.html" title="std::match_results\< _FwdIterT, _Alloc \>" alt="" coords="1955,301,2189,331"/></map>
<center><span class="legend">[<a target="top" href="graph_legend.html">legend</a>]</span></center></div>
<p><a href="a02436.html">List of all members.</a></p>
<h2><a name="pub-types"></a>
Public Types</h2>
<ul>
<li><a class="anchor" id="af6e9591d666d2751689d46b67ebe1054"></a><!-- doxytag: member="std::vector::allocator_type" ref="af6e9591d666d2751689d46b67ebe1054" args="" -->
typedef _Alloc <b>allocator_type</b>
<li><a class="anchor" id="ad1e57b89b9260db15b3b3c0c63549876"></a><!-- doxytag: member="std::vector::const_iterator" ref="ad1e57b89b9260db15b3b3c0c63549876" args="" -->
typedef <br class="typebreak"/>
__gnu_cxx::__normal_iterator<br class="typebreak"/>
< const_pointer, <a class="el" href="a00739.html">vector</a> > <b>const_iterator</b>
<li><a class="anchor" id="a65eb8a062b932a4e4d1d22221a44c255"></a><!-- doxytag: member="std::vector::const_pointer" ref="a65eb8a062b932a4e4d1d22221a44c255" args="" -->
typedef <br class="typebreak"/>
_Tp_alloc_type::const_pointer <b>const_pointer</b>
<li><a class="anchor" id="aa831d1639e830c3d5df0aade48a141f8"></a><!-- doxytag: member="std::vector::const_reference" ref="aa831d1639e830c3d5df0aade48a141f8" args="" -->
typedef <br class="typebreak"/>
_Tp_alloc_type::const_reference <b>const_reference</b>
<li><a class="anchor" id="aead130cd36f83bf0c8ff5520c5cf9e75"></a><!-- doxytag: member="std::vector::const_reverse_iterator" ref="aead130cd36f83bf0c8ff5520c5cf9e75" args="" -->
typedef <a class="el" href="a00693.html">std::reverse_iterator</a><br class="typebreak"/>
< const_iterator > <b>const_reverse_iterator</b>
<li><a class="anchor" id="a416c92b8ab1a276a90da34fed46f8fea"></a><!-- doxytag: member="std::vector::difference_type" ref="a416c92b8ab1a276a90da34fed46f8fea" args="" -->
typedef ptrdiff_t <b>difference_type</b>
<li><a class="anchor" id="a6115ff023e7a32c02012726db8104cbe"></a><!-- doxytag: member="std::vector::iterator" ref="a6115ff023e7a32c02012726db8104cbe" args="" -->
typedef <br class="typebreak"/>
__gnu_cxx::__normal_iterator<br class="typebreak"/>
< pointer, <a class="el" href="a00739.html">vector</a> > <b>iterator</b>
<li><a class="anchor" id="a948d54c2b313796f50db7078b343a11e"></a><!-- doxytag: member="std::vector::pointer" ref="a948d54c2b313796f50db7078b343a11e" args="" -->
typedef _Tp_alloc_type::pointer <b>pointer</b>
<li><a class="anchor" id="a6e896198f87cc8a350cefceacb162408"></a><!-- doxytag: member="std::vector::reference" ref="a6e896198f87cc8a350cefceacb162408" args="" -->
typedef _Tp_alloc_type::reference <b>reference</b>
<li><a class="anchor" id="a872c5273d5967f4a3ab4e3ba7bdfd5f8"></a><!-- doxytag: member="std::vector::reverse_iterator" ref="a872c5273d5967f4a3ab4e3ba7bdfd5f8" args="" -->
typedef <a class="el" href="a00693.html">std::reverse_iterator</a><br class="typebreak"/>
< iterator > <b>reverse_iterator</b>
<li><a class="anchor" id="a0c431c4aa8cb312a241413a5b669c853"></a><!-- doxytag: member="std::vector::size_type" ref="a0c431c4aa8cb312a241413a5b669c853" args="" -->
typedef size_t <b>size_type</b>
<li><a class="anchor" id="a44e0c2e27828d3d892b9fa50e45e1d93"></a><!-- doxytag: member="std::vector::value_type" ref="a44e0c2e27828d3d892b9fa50e45e1d93" args="" -->
typedef _Tp <b>value_type</b>
</ul>
<h2><a name="pub-methods"></a>
Public Member Functions</h2>
<ul>
<li><a class="el" href="a00739.html#a00a1d38b2d84de73741b233f537784e3">vector</a> ()
<li><a class="el" href="a00739.html#a0093749103bd73bf20a3a304de79e2cf">vector</a> (const allocator_type &__a)
<li><a class="el" href="a00739.html#a501b56f5a3b8558587ca1be9029e1de5">vector</a> (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())
<li>template<typename _InputIterator > <a class="el" href="a00739.html#a06bd5af62785777b36551280d2084405">vector</a> (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())
<li><a class="el" href="a00739.html#a002b00e3596af506a260bd957bee0212">vector</a> (const <a class="el" href="a00739.html">vector</a> &__x)
<li><a class="el" href="a00739.html#a526287c7a31e4452cc3589c79a1ffdf5">vector</a> (size_type __n)
<li><a class="el" href="a00739.html#a40dc8d67d09859c9e166b15cdc7b3dce">vector</a> (<a class="el" href="a00739.html">vector</a> &&__x)
<li><a class="el" href="a00739.html#a010e6e6c437a7eb67dae7c052790cf94">vector</a> (<a class="el" href="a00524.html">initializer_list</a>< value_type > __l, const allocator_type &__a=allocator_type())
<li><a class="el" href="a00739.html#a74df616f0698e427d0ac85bf271ed80e">~vector</a> ()
<li>void <a class="el" href="a00739.html#a943d35baf02f390b9870351f0f78c1d7">assign</a> (size_type __n, const value_type &__val)
<li>template<typename _InputIterator > void <a class="el" href="a00739.html#a452b32689442052132e58aff0a6e7763">assign</a> (_InputIterator __first, _InputIterator __last)
<li>void <a class="el" href="a00739.html#acda096d477c2ef09ee0b3e7fb3ca558c">assign</a> (<a class="el" href="a00524.html">initializer_list</a>< value_type > __l)
<li>reference <a class="el" href="a00739.html#a11362894b61f87331541b5268d0cb033">at</a> (size_type __n)
<li>const_reference <a class="el" href="a00739.html#a0773df246f5a16ac928086ad4ad99e31">at</a> (size_type __n) const
<li>reference <a class="el" href="a00739.html#a3f9019aa7188e241c10a3fe010cf7f0b">back</a> ()
<li>const_reference <a class="el" href="a00739.html#a3d9a15dee6ba98e2fee5996e458cceee">back</a> () const
<li>iterator <a class="el" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin</a> ()
<li>const_iterator <a class="el" href="a00739.html#a09a852db57c594f9cfae8c3703faa84c">begin</a> () const
<li>size_type <a class="el" href="a00739.html#a566ce30a571bb5621946950405bb0e64">capacity</a> () const
<li>const_iterator <a class="el" href="a00739.html#a117e6357d3ae22271fc1e2540bb6f6ae">cbegin</a> () const
<li>const_iterator <a class="el" href="a00739.html#a3b0331c1ef4fe376bd70ef6a5d5e9b37">cend</a> () const
<li>void <a class="el" href="a00739.html#aaeee7e2ec5ff98c6d75b2c31059189ea">clear</a> ()
<li><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html#af696128a0d6a1e1089766522e57fc962">crbegin</a> () const
<li><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html#ae9e98d098cc02c0dc08459704886bbd7">crend</a> () const
<li>_Tp * <a class="el" href="a00739.html#a0c7a1ed90614646b6bb50fb1bbb7a733">data</a> ()
<li><a class="anchor" id="a39bd3f65cadec768b23f2e5c44c2e0ba"></a><!-- doxytag: member="std::vector::data" ref="a39bd3f65cadec768b23f2e5c44c2e0ba" args="() const " -->
const _Tp * <b>data</b> () const
<li>template<typename... _Args> iterator <a class="el" href="a00739.html#a0bba92692c6f4d980a09d6a6c3cd3cf8">emplace</a> (iterator __position, _Args &&...__args)
<li><a class="anchor" id="a206d925347d3b4ad707abed5b3b6df51"></a><!-- doxytag: member="std::vector::emplace_back" ref="a206d925347d3b4ad707abed5b3b6df51" args="(_Args &&...__args)" -->
template<typename... _Args> void <b>emplace_back</b> (_Args &&...__args)
<li>bool <a class="el" href="a00739.html#a5c5f31793e938ca343a70bc74a3ffa10">empty</a> () const
<li>iterator <a class="el" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end</a> ()
<li>const_iterator <a class="el" href="a00739.html#a0a17bdad14b8d9aa408b473d46c9abbd">end</a> () const
<li>iterator <a class="el" href="a00739.html#a1239d8128978ef13223f169d4a1a1fb8">erase</a> (iterator __first, iterator __last)
<li>iterator <a class="el" href="a00739.html#a161093a193b38c249c70f2ea35d09db4">erase</a> (iterator __position)
<li>const_reference <a class="el" href="a00739.html#a197f08fcdbc3fc6f5fe29548185f71c8">front</a> () const
<li>reference <a class="el" href="a00739.html#a6430e8ffbe3e8305d90c25e1eb51e97e">front</a> ()
<li>iterator <a class="el" href="a00739.html#a4b6b7d15cc8a77ac3bc94155c1c77ce5">insert</a> (iterator __position, value_type &&__x)
<li>template<typename _InputIterator > void <a class="el" href="a00739.html#aea01a0e07f8363d72f69ea3d85dcd490">insert</a> (iterator __position, _InputIterator __first, _InputIterator __last)
<li>void <a class="el" href="a00739.html#a33f1fee1be2a08581a361d7f399d65e4">insert</a> (iterator __position, <a class="el" href="a00524.html">initializer_list</a>< value_type > __l)
<li>void <a class="el" href="a00739.html#a1c9bad3d30995b552ddab7b57d36c3f6">insert</a> (iterator __position, size_type __n, const value_type &__x)
<li>iterator <a class="el" href="a00739.html#a53d2a978afcbb3fdf5276a95e323842b">insert</a> (iterator __position, const value_type &__x)
<li>size_type <a class="el" href="a00739.html#a68fc9ad8180aacdca3a3cf15b8e1ddb9">max_size</a> () const
<li><a class="el" href="a00739.html">vector</a> & <a class="el" href="a00739.html#a5badc45ac5ba40fafcbb6ec5a0b8a745">operator=</a> (<a class="el" href="a00524.html">initializer_list</a>< value_type > __l)
<li><a class="el" href="a00739.html">vector</a> & <a class="el" href="a00739.html#a378f8be875b0d63c7144072f409a5f23">operator=</a> (<a class="el" href="a00739.html">vector</a> &&__x)
<li><a class="el" href="a00739.html">vector</a> & <a class="el" href="a00739.html#a9c56711f1fdb6aeb4a287570da90a688">operator=</a> (const <a class="el" href="a00739.html">vector</a> &__x)
<li>reference <a class="el" href="a00739.html#a475f606b188e2096932501e97d20ec80">operator[]</a> (size_type __n)
<li>const_reference <a class="el" href="a00739.html#aca0657aa65542b2bbdb444d78c7d4a98">operator[]</a> (size_type __n) const
<li>void <a class="el" href="a00739.html#a74b162cd471d2baa7ad393c3cd416a59">pop_back</a> ()
<li><a class="anchor" id="a74b2762e80090843e3e6e6b609bf0ea0"></a><!-- doxytag: member="std::vector::push_back" ref="a74b2762e80090843e3e6e6b609bf0ea0" args="(value_type &&__x)" -->
void <b>push_back</b> (value_type &&__x)
<li>void <a class="el" href="a00739.html#a6f2144e852790296d3c62cdec92c95ce">push_back</a> (const value_type &__x)
<li><a class="el" href="a00693.html">reverse_iterator</a> <a class="el" href="a00739.html#ae317a81cb77cdb08432c3a8c00b31df4">rbegin</a> ()
<li><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html#a2a81a8fc74492159cc03b9ac41aae880">rbegin</a> () const
<li><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html#ae1db339bb0b8ab83ee5d1c98c6a279da">rend</a> () const
<li><a class="el" href="a00693.html">reverse_iterator</a> <a class="el" href="a00739.html#aa8471fb4e9eb65ad51ae65a9f06d1570">rend</a> ()
<li>void <a class="el" href="a00739.html#a8ab62036345a72d8126fa30425dfe869">reserve</a> (size_type __n)
<li>void <a class="el" href="a00739.html#a1134bcc83ff6c70cf78bab3cd426feaf">resize</a> (size_type __new_size)
<li>void <a class="el" href="a00739.html#a53e627a12d33d2df15d4a9c25c872785">resize</a> (size_type __new_size, const value_type &__x)
<li>void <a class="el" href="a00739.html#a4f4dc31fc105124cd9a5e4a90ae99c44">shrink_to_fit</a> ()
<li>size_type <a class="el" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size</a> () const
<li>void <a class="el" href="a00739.html#aa01966bffe0a347ddc419558a01ce050">swap</a> (<a class="el" href="a00739.html">vector</a> &__x)
</ul>
<h2><a name="pro-methods"></a>
Protected Member Functions</h2>
<ul>
<li><a class="anchor" id="af80afbafca3978c2dd7f6f4e4bf89af8"></a><!-- doxytag: member="std::vector::_M_allocate" ref="af80afbafca3978c2dd7f6f4e4bf89af8" args="(size_t __n)" -->
_Tp_alloc_type::pointer <b>_M_allocate</b> (size_t __n)
<li>template<typename _ForwardIterator > pointer <a class="el" href="a00739.html#aa3678536973ff63f93fb6074915774ef">_M_allocate_and_copy</a> (size_type __n, _ForwardIterator __first, _ForwardIterator __last)
<li><a class="anchor" id="a865072fb43c64d9a0e3f41233f76464f"></a><!-- doxytag: member="std::vector::_M_assign_aux" ref="a865072fb43c64d9a0e3f41233f76464f" args="(_InputIterator __first, _InputIterator __last, std::input_iterator_tag)" -->
template<typename _InputIterator > void <b>_M_assign_aux</b> (_InputIterator __first, _InputIterator __last, <a class="el" href="a00525.html">std::input_iterator_tag</a>)
<li><a class="anchor" id="a7d539723273f13b35147975781448018"></a><!-- doxytag: member="std::vector::_M_assign_aux" ref="a7d539723273f13b35147975781448018" args="(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)" -->
template<typename _ForwardIterator > void <b>_M_assign_aux</b> (_ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a00474.html">std::forward_iterator_tag</a>)
<li><a class="anchor" id="a96a25b73e50c883bdef8b99b30e7f85c"></a><!-- doxytag: member="std::vector::_M_assign_dispatch" ref="a96a25b73e50c883bdef8b99b30e7f85c" args="(_Integer __n, _Integer __val, __true_type)" -->
template<typename _Integer > void <b>_M_assign_dispatch</b> (_Integer __n, _Integer __val, __true_type)
<li><a class="anchor" id="a9bf81da7f9e62bd78952a5b3dfed43b4"></a><!-- doxytag: member="std::vector::_M_assign_dispatch" ref="a9bf81da7f9e62bd78952a5b3dfed43b4" args="(_InputIterator __first, _InputIterator __last, __false_type)" -->
template<typename _InputIterator > void <b>_M_assign_dispatch</b> (_InputIterator __first, _InputIterator __last, __false_type)
<li><a class="anchor" id="a8a1f1b8bca9bf8b24c8d774120f5c716"></a><!-- doxytag: member="std::vector::_M_check_len" ref="a8a1f1b8bca9bf8b24c8d774120f5c716" args="(size_type __n, const char *__s) const " -->
size_type <b>_M_check_len</b> (size_type __n, const char *__s) const
<li><a class="anchor" id="a5620b8fdd19935f8a4765ff4ea6aa3a7"></a><!-- doxytag: member="std::vector::_M_deallocate" ref="a5620b8fdd19935f8a4765ff4ea6aa3a7" args="(typename _Tp_alloc_type::pointer __p, size_t __n)" -->
void <b>_M_deallocate</b> (typename _Tp_alloc_type::pointer __p, size_t __n)
<li><a class="anchor" id="a5bc3c30680c623031c1b659ed1f4baa2"></a><!-- doxytag: member="std::vector::_M_default_append" ref="a5bc3c30680c623031c1b659ed1f4baa2" args="(size_type __n)" -->
void <b>_M_default_append</b> (size_type __n)
<li><a class="anchor" id="a8ff15aec0260b1c1e0a067c5c1e6dd95"></a><!-- doxytag: member="std::vector::_M_default_initialize" ref="a8ff15aec0260b1c1e0a067c5c1e6dd95" args="(size_type __n)" -->
void <b>_M_default_initialize</b> (size_type __n)
<li><a class="anchor" id="a831449d34ee88c2565b644a73fc8d5e8"></a><!-- doxytag: member="std::vector::_M_erase_at_end" ref="a831449d34ee88c2565b644a73fc8d5e8" args="(pointer __pos)" -->
void <b>_M_erase_at_end</b> (pointer __pos)
<li><a class="anchor" id="a0db26d051403045a28d5287abc00540d"></a><!-- doxytag: member="std::vector::_M_fill_assign" ref="a0db26d051403045a28d5287abc00540d" args="(size_type __n, const value_type &__val)" -->
void <b>_M_fill_assign</b> (size_type __n, const value_type &__val)
<li><a class="anchor" id="a2df134aac8d559b54496f00b63294a39"></a><!-- doxytag: member="std::vector::_M_fill_initialize" ref="a2df134aac8d559b54496f00b63294a39" args="(size_type __n, const value_type &__value)" -->
void <b>_M_fill_initialize</b> (size_type __n, const value_type &__value)
<li><a class="anchor" id="a097dcde87121f08e6da0f0b0a931e837"></a><!-- doxytag: member="std::vector::_M_fill_insert" ref="a097dcde87121f08e6da0f0b0a931e837" args="(iterator __pos, size_type __n, const value_type &__x)" -->
void <b>_M_fill_insert</b> (iterator __pos, size_type __n, const value_type &__x)
<li><a class="anchor" id="a1845e8ac2f0986596630953e9ccd248f"></a><!-- doxytag: member="std::vector::_M_get_Tp_allocator" ref="a1845e8ac2f0986596630953e9ccd248f" args="()" -->
_Tp_alloc_type & <b>_M_get_Tp_allocator</b> ()
<li><a class="anchor" id="a28e9b30f12ee4a450fe8202488da7ff3"></a><!-- doxytag: member="std::vector::_M_get_Tp_allocator" ref="a28e9b30f12ee4a450fe8202488da7ff3" args="() const " -->
const _Tp_alloc_type & <b>_M_get_Tp_allocator</b> () const
<li><a class="anchor" id="af888d15e52d83d44a1a8773398d5957c"></a><!-- doxytag: member="std::vector::_M_initialize_dispatch" ref="af888d15e52d83d44a1a8773398d5957c" args="(_InputIterator __first, _InputIterator __last, __false_type)" -->
template<typename _InputIterator > void <b>_M_initialize_dispatch</b> (_InputIterator __first, _InputIterator __last, __false_type)
<li><a class="anchor" id="ae85883a1a83af3314bebaed70f4b0514"></a><!-- doxytag: member="std::vector::_M_initialize_dispatch" ref="ae85883a1a83af3314bebaed70f4b0514" args="(_Integer __n, _Integer __value, __true_type)" -->
template<typename _Integer > void <b>_M_initialize_dispatch</b> (_Integer __n, _Integer __value, __true_type)
<li><a class="anchor" id="a96b58bc3c1e7b0d1240f9e3af8156ce7"></a><!-- doxytag: member="std::vector::_M_insert_aux" ref="a96b58bc3c1e7b0d1240f9e3af8156ce7" args="(iterator __position, _Args &&...__args)" -->
template<typename... _Args> void <b>_M_insert_aux</b> (iterator __position, _Args &&...__args)
<li><a class="anchor" id="ae87270187106024653d6be52fd2c381b"></a><!-- doxytag: member="std::vector::_M_insert_dispatch" ref="ae87270187106024653d6be52fd2c381b" args="(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)" -->
template<typename _InputIterator > void <b>_M_insert_dispatch</b> (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)
<li><a class="anchor" id="a85e3f533530682d3cd12e28c4e028994"></a><!-- doxytag: member="std::vector::_M_insert_dispatch" ref="a85e3f533530682d3cd12e28c4e028994" args="(iterator __pos, _Integer __n, _Integer __val, __true_type)" -->
template<typename _Integer > void <b>_M_insert_dispatch</b> (iterator __pos, _Integer __n, _Integer __val, __true_type)
<li>void <a class="el" href="a00739.html#afca73b397aca7ec340c2d69b68c0aa4a">_M_range_check</a> (size_type __n) const
<li><a class="anchor" id="ab0e712572811f68ed4838d2171b3140c"></a><!-- doxytag: member="std::vector::_M_range_initialize" ref="ab0e712572811f68ed4838d2171b3140c" args="(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)" -->
template<typename _ForwardIterator > void <b>_M_range_initialize</b> (_ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a00474.html">std::forward_iterator_tag</a>)
<li><a class="anchor" id="ab95e29de3ee4a55b468307bd6f088252"></a><!-- doxytag: member="std::vector::_M_range_initialize" ref="ab95e29de3ee4a55b468307bd6f088252" args="(_InputIterator __first, _InputIterator __last, std::input_iterator_tag)" -->
template<typename _InputIterator > void <b>_M_range_initialize</b> (_InputIterator __first, _InputIterator __last, <a class="el" href="a00525.html">std::input_iterator_tag</a>)
<li><a class="anchor" id="aea51d7c757c7d6510d71d6ba94a8f6e1"></a><!-- doxytag: member="std::vector::_M_range_insert" ref="aea51d7c757c7d6510d71d6ba94a8f6e1" args="(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)" -->
template<typename _ForwardIterator > void <b>_M_range_insert</b> (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, <a class="el" href="a00474.html">std::forward_iterator_tag</a>)
<li><a class="anchor" id="af67a549d97b58b0de68139fc04586f52"></a><!-- doxytag: member="std::vector::_M_range_insert" ref="af67a549d97b58b0de68139fc04586f52" args="(iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag)" -->
template<typename _InputIterator > void <b>_M_range_insert</b> (iterator __pos, _InputIterator __first, _InputIterator __last, <a class="el" href="a00525.html">std::input_iterator_tag</a>)
<li><a class="anchor" id="aa981aa0ef850615393f67131d132e224"></a><!-- doxytag: member="std::vector::get_allocator" ref="aa981aa0ef850615393f67131d132e224" args="() const " -->
allocator_type <b>get_allocator</b> () const
</ul>
<h2><a name="pro-attribs"></a>
Protected Attributes</h2>
<ul>
<li><a class="anchor" id="a1f01a554f9c151b5b56ab81b8da228bd"></a><!-- doxytag: member="std::vector::_M_impl" ref="a1f01a554f9c151b5b56ab81b8da228bd" args="" -->
_Vector_impl <b>_M_impl</b>
</ul>
<hr/><a name="details" id="details"></a><h2>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>
<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>Definition at line <a class="el" href="a01069_source.html#l00180">180</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div><hr/><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" id="a00a1d38b2d84de73741b233f537784e3"></a><!-- doxytag: member="std::vector::vector" ref="a00a1d38b2d84de73741b233f537784e3" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Default constructor creates no elements. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00217">217</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a0093749103bd73bf20a3a304de79e2cf"></a><!-- doxytag: member="std::vector::vector" ref="a0093749103bd73bf20a3a304de79e2cf" args="(const allocator_type &__a)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramtype">const allocator_type & </td>
<td class="paramname"><em>__a</em></td><td>)</td>
<td><code> [inline, explicit]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Creates a vector with no elements. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>An allocator object. </td></tr>
</table>
</dd>
</dl>
<p>Definition at line <a class="el" href="a01069_source.html#l00225">225</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a526287c7a31e4452cc3589c79a1ffdf5"></a><!-- doxytag: member="std::vector::vector" ref="a526287c7a31e4452cc3589c79a1ffdf5" args="(size_type __n)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramtype">size_type </td>
<td class="paramname"><em>__n</em></td><td>)</td>
<td><code> [inline, explicit]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Creates a vector with default constructed elements. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>The number of elements to initially create.</td></tr>
</table>
</dd>
</dl>
<p>This constructor fills the vector with <em>n</em> default constructed elements. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00237">237</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a501b56f5a3b8558587ca1be9029e1de5"></a><!-- doxytag: member="std::vector::vector" ref="a501b56f5a3b8558587ca1be9029e1de5" args="(size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Creates a vector with copies of an exemplar element. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l00249">249</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a002b00e3596af506a260bd957bee0212"></a><!-- doxytag: member="std::vector::vector" ref="a002b00e3596af506a260bd957bee0212" args="(const vector &__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00739.html">vector</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Vector copy constructor. </p>
<dl><dt><b>Parameters:</b></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 uses a copy of the allocation object used by <em>x</em>. All the elements of <em>x</em> are copied, but any extra memory in <em>x</em> (for fast expansion) will not be copied. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00278">278</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a40dc8d67d09859c9e166b15cdc7b3dce"></a><!-- doxytag: member="std::vector::vector" ref="a40dc8d67d09859c9e166b15cdc7b3dce" args="(vector &&__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00739.html">vector</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Vector move constructor. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l00294">294</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a010e6e6c437a7eb67dae7c052790cf94"></a><!-- doxytag: member="std::vector::vector" ref="a010e6e6c437a7eb67dae7c052790cf94" args="(initializer_list< value_type > __l, const allocator_type &__a=allocator_type())" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00524.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Builds a vector from an initializer list. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">l</td><td>An <a class="el" href="a00524.html" title="initializer_list">initializer_list</a>. </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 <a class="el" href="a00524.html" title="initializer_list">initializer_list</a> <em>l</em>.</p>
<p>This will call the element type's copy constructor N times (where N is <em><a class="el" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">l.size()</a></em>) and do no memory reallocation. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00308">308</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a06bd5af62785777b36551280d2084405"></a><!-- doxytag: member="std::vector::vector" ref="a06bd5af62785777b36551280d2084405" args="(_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::<a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Builds a vector from a range. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l00334">334</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a74df616f0698e427d0ac85bf271ed80e"></a><!-- doxytag: member="std::vector::~vector" ref="a74df616f0698e427d0ac85bf271ed80e" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::~<a class="el" href="a00739.html">vector</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00349">349</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="aa3678536973ff63f93fb6074915774ef"></a><!-- doxytag: member="std::vector::_M_allocate_and_copy" ref="aa3678536973ff63f93fb6074915774ef" args="(size_type __n, _ForwardIterator __first, _ForwardIterator __last)" -->
<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="memname">
<tr>
<td class="memname">pointer <a class="el" href="a00739.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><code> [inline, protected]</code></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>Definition at line <a class="el" href="a01069_source.html#l01049">1049</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="afca73b397aca7ec340c2d69b68c0aa4a"></a><!-- doxytag: member="std::vector::_M_range_check" ref="afca73b397aca7ec340c2d69b68c0aa4a" args="(size_type __n) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.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<code> [inline, protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Safety check used only from <a class="el" href="a00739.html#a11362894b61f87331541b5268d0cb033" title="Provides access to the data contained in the vector.">at()</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00716">716</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00735">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::at()</a>.</p>
</div>
</div>
<a class="anchor" id="a452b32689442052132e58aff0a6e7763"></a><!-- doxytag: member="std::vector::assign" ref="a452b32689442052132e58aff0a6e7763" args="(_InputIterator __first, _InputIterator __last)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Assigns a range to a vector. </p>
<dl><dt><b>Parameters:</b></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. Old data may be lost. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00429">429</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a943d35baf02f390b9870351f0f78c1d7"></a><!-- doxytag: member="std::vector::assign" ref="a943d35baf02f390b9870351f0f78c1d7" args="(size_type __n, const value_type &__val)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Assigns a given value to a vector. </p>
<dl><dt><b>Parameters:</b></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. Old data may be lost. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00412">412</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00394">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=()</a>.</p>
</div>
</div>
<a class="anchor" id="acda096d477c2ef09ee0b3e7fb3ca558c"></a><!-- doxytag: member="std::vector::assign" ref="acda096d477c2ef09ee0b3e7fb3ca558c" args="(initializer_list< value_type > __l)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::assign </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00524.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Assigns an initializer list to a vector. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">l</td><td>An <a class="el" href="a00524.html" title="initializer_list">initializer_list</a>.</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. Old data may be lost. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00449">449</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00449">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::assign()</a>.</p>
</div>
</div>
<a class="anchor" id="a11362894b61f87331541b5268d0cb033"></a><!-- doxytag: member="std::vector::at" ref="a11362894b61f87331541b5268d0cb033" args="(size_type __n)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Provides access to the data contained in the vector. </p>
<dl><dt><b>Parameters:</b></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="return"><dt><b>Returns:</b></dt><dd>Read/write reference to data. </dd></dl>
<dl><dt><b>Exceptions:</b></dt><dd>
<table class="exception">
<tr><td class="paramname"><a class="el" href="a00646.html">std::out_of_range</a></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 <a class="el" href="a00646.html">out_of_range</a> if the check fails. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00735">735</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a0773df246f5a16ac928086ad4ad99e31"></a><!-- doxytag: member="std::vector::at" ref="a0773df246f5a16ac928086ad4ad99e31" args="(size_type __n) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a00739.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<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Provides access to the data contained in the vector. </p>
<dl><dt><b>Parameters:</b></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="return"><dt><b>Returns:</b></dt><dd>Read-only (constant) reference to data. </dd></dl>
<dl><dt><b>Exceptions:</b></dt><dd>
<table class="exception">
<tr><td class="paramname"><a class="el" href="a00646.html">std::out_of_range</a></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 <a class="el" href="a00646.html">out_of_range</a> if the check fails. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00753">753</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a3d9a15dee6ba98e2fee5996e458cceee"></a><!-- doxytag: member="std::vector::back" ref="a3d9a15dee6ba98e2fee5996e458cceee" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::back </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00788">788</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a3f9019aa7188e241c10a3fe010cf7f0b"></a><!-- doxytag: member="std::vector::back" ref="a3f9019aa7188e241c10a3fe010cf7f0b" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::back </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00780">780</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a00997_source.html#l05266">std::piecewise_linear_distribution< _RealType >::max()</a>, and <a class="el" href="a00997_source.html#l05024">std::piecewise_constant_distribution< _RealType >::max()</a>.</p>
</div>
</div>
<a class="anchor" id="a09a852db57c594f9cfae8c3703faa84c"></a><!-- doxytag: member="std::vector::begin" ref="a09a852db57c594f9cfae8c3703faa84c" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Reimplemented in <a class="el" href="a00261.html#a0af59bb1979baeba54cbc5771d1db2c4">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#a0af59bb1979baeba54cbc5771d1db2c4">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#a0af59bb1979baeba54cbc5771d1db2c4">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00472">472</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a52e9b3c0d3157f9db067259fc2591085"></a><!-- doxytag: member="std::vector::begin" ref="a52e9b3c0d3157f9db067259fc2591085" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::begin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00463">463</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00563">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crend()</a>, <a class="el" href="a01069_source.html#l00659">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty()</a>, <a class="el" href="a01069_source.html#l00764">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::front()</a>, <a class="el" href="a00950_source.html#l00124">__gnu_parallel::multiseq_partition()</a>, <a class="el" href="a00950_source.html#l00390">__gnu_parallel::multiseq_selection()</a>, <a class="el" href="a00953_source.html#l01117">__gnu_parallel::multiway_merge_exact_splitting()</a>, <a class="el" href="a01117_source.html#l00162">std::vector< _Tp, _Alloc >::operator=()</a>, <a class="el" href="a01069_source.html#l01273">std::operator==()</a>, <a class="el" href="a01069_source.html#l00517">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rend()</a>, and <a class="el" href="a01069_source.html#l00278">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector()</a>.</p>
</div>
</div>
<a class="anchor" id="a566ce30a571bb5621946950405bb0e64"></a><!-- doxytag: member="std::vector::capacity" ref="a566ce30a571bb5621946950405bb0e64" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::capacity </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00650">650</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a117e6357d3ae22271fc1e2540bb6f6ae"></a><!-- doxytag: member="std::vector::cbegin" ref="a117e6357d3ae22271fc1e2540bb6f6ae" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::cbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Reimplemented in <a class="el" href="a00261.html#ae83a3d13cac80f8f361dda783bd47ed3">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#ae83a3d13cac80f8f361dda783bd47ed3">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#ae83a3d13cac80f8f361dda783bd47ed3">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00536">536</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a3b0331c1ef4fe376bd70ef6a5d5e9b37"></a><!-- doxytag: member="std::vector::cend" ref="a3b0331c1ef4fe376bd70ef6a5d5e9b37" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::cend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Reimplemented in <a class="el" href="a00261.html#ac713b9d86427bb02944867523ee7b70c">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#ac713b9d86427bb02944867523ee7b70c">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#ac713b9d86427bb02944867523ee7b70c">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00545">545</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="aaeee7e2ec5ff98c6d75b2c31059189ea"></a><!-- doxytag: member="std::vector::clear" ref="aaeee7e2ec5ff98c6d75b2c31059189ea" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::clear </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l01039">1039</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00373">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=()</a>.</p>
</div>
</div>
<a class="anchor" id="af696128a0d6a1e1089766522e57fc962"></a><!-- doxytag: member="std::vector::crbegin" ref="af696128a0d6a1e1089766522e57fc962" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::crbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00554">554</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="ae9e98d098cc02c0dc08459704886bbd7"></a><!-- doxytag: member="std::vector::crend" ref="ae9e98d098cc02c0dc08459704886bbd7" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::crend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00563">563</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a0c7a1ed90614646b6bb50fb1bbb7a733"></a><!-- doxytag: member="std::vector::data" ref="a0c7a1ed90614646b6bb50fb1bbb7a733" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">_Tp* <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::data </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Returns a pointer such that [<a class="el" href="a00739.html#a0c7a1ed90614646b6bb50fb1bbb7a733">data()</a>, <a class="el" href="a00739.html#a0c7a1ed90614646b6bb50fb1bbb7a733">data()</a> + <a class="el" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size()</a>) is a valid range. For a non-empty vector, <a class="el" href="a00739.html#a0c7a1ed90614646b6bb50fb1bbb7a733">data()</a> == &<a class="el" href="a00739.html#a6430e8ffbe3e8305d90c25e1eb51e97e">front()</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00803">803</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a0bba92692c6f4d980a09d6a6c3cd3cf8"></a><!-- doxytag: member="std::vector::emplace" ref="a0bba92692c6f4d980a09d6a6c3cd3cf8" args="(iterator __position, _Args &&...__args)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp , typename _Alloc > </div>
<div class="memtemplate">
template<typename... _Args> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">vector</a>< _Tp, _Alloc >::iterator vector::emplace </td>
<td>(</td>
<td class="paramtype">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>
</div>
<div class="memdoc">
<p>Inserts an object in vector before specified iterator. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">position</td><td>An iterator into the vector. </td></tr>
<tr><td class="paramname">args</td><td>Arguments. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. </p>
<p>Definition at line <a class="el" href="a01117_source.html#l00277">277</a> of file <a class="el" href="a01117_source.html">vector.tcc</a>.</p>
<p>References <a class="el" href="a00906_source.html#l00086">std::begin()</a>, and <a class="el" href="a00906_source.html#l00096">std::end()</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00908">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert()</a>.</p>
</div>
</div>
<a class="anchor" id="a5c5f31793e938ca343a70bc74a3ffa10"></a><!-- doxytag: member="std::vector::empty" ref="a5c5f31793e938ca343a70bc74a3ffa10" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::empty </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Returns true if the vector is empty. (Thus <a class="el" href="a00739.html#a52e9b3c0d3157f9db067259fc2591085">begin()</a> would equal <a class="el" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end()</a>.) </p>
<p>Reimplemented in <a class="el" href="a00261.html#a01f256463c4910fbb4eb6a60283b54d7">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#a01f256463c4910fbb4eb6a60283b54d7">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#a01f256463c4910fbb4eb6a60283b54d7">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00659">659</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a00997_source.html#l05231">std::piecewise_linear_distribution< _RealType >::densities()</a>, <a class="el" href="a00997_source.html#l04989">std::piecewise_constant_distribution< _RealType >::densities()</a>, <a class="el" href="a00997_source.html#l05214">std::piecewise_linear_distribution< _RealType >::intervals()</a>, <a class="el" href="a00997_source.html#l04973">std::piecewise_constant_distribution< _RealType >::intervals()</a>, <a class="el" href="a00997_source.html#l05266">std::piecewise_linear_distribution< _RealType >::max()</a>, <a class="el" href="a00997_source.html#l05024">std::piecewise_constant_distribution< _RealType >::max()</a>, <a class="el" href="a00997_source.html#l04786">std::discrete_distribution< _IntType >::max()</a>, <a class="el" href="a00997_source.html#l05256">std::piecewise_linear_distribution< _RealType >::min()</a>, <a class="el" href="a00997_source.html#l05014">std::piecewise_constant_distribution< _RealType >::min()</a>, and <a class="el" href="a00997_source.html#l04754">std::discrete_distribution< _IntType >::probabilities()</a>.</p>
</div>
</div>
<a class="anchor" id="a8c27a1d92949b353ac4503001c0d1066"></a><!-- doxytag: member="std::vector::end" ref="a8c27a1d92949b353ac4503001c0d1066" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::end </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00481">481</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00780">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::back()</a>, <a class="el" href="a01069_source.html#l00554">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crbegin()</a>, <a class="el" href="a01069_source.html#l00659">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty()</a>, <a class="el" href="a00950_source.html#l00124">__gnu_parallel::multiseq_partition()</a>, <a class="el" href="a00950_source.html#l00390">__gnu_parallel::multiseq_selection()</a>, <a class="el" href="a00953_source.html#l01117">__gnu_parallel::multiway_merge_exact_splitting()</a>, <a class="el" href="a01117_source.html#l00162">std::vector< _Tp, _Alloc >::operator=()</a>, <a class="el" href="a01069_source.html#l01273">std::operator==()</a>, <a class="el" href="a01069_source.html#l00826">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::push_back()</a>, <a class="el" href="a01069_source.html#l00499">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rbegin()</a>, <a class="el" href="a01069_source.html#l00609">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()</a>, and <a class="el" href="a01069_source.html#l00278">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector()</a>.</p>
</div>
</div>
<a class="anchor" id="a0a17bdad14b8d9aa408b473d46c9abbd"></a><!-- doxytag: member="std::vector::end" ref="a0a17bdad14b8d9aa408b473d46c9abbd" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::end </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Reimplemented in <a class="el" href="a00261.html#ad78390cbbb4075b714388c71ee501f96">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#ad78390cbbb4075b714388c71ee501f96">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#ad78390cbbb4075b714388c71ee501f96">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00490">490</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a161093a193b38c249c70f2ea35d09db4"></a><!-- doxytag: member="std::vector::erase" ref="a161093a193b38c249c70f2ea35d09db4" args="(iterator __position)" -->
<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="a00739.html">vector</a>< _Tp, _Alloc >::iterator vector::erase </td>
<td>(</td>
<td class="paramtype">iterator </td>
<td class="paramname"><em>__position</em></td><td>)</td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Remove element at given position. </p>
<dl><dt><b>Parameters:</b></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="return"><dt><b>Returns:</b></dt><dd>An iterator pointing to the next element (or <a class="el" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end()</a>).</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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. 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>Definition at line <a class="el" href="a01117_source.html#l00136">136</a> of file <a class="el" href="a01117_source.html">vector.tcc</a>.</p>
<p>References <a class="el" href="a00906_source.html#l00096">std::end()</a>.</p>
</div>
</div>
<a class="anchor" id="a1239d8128978ef13223f169d4a1a1fb8"></a><!-- doxytag: member="std::vector::erase" ref="a1239d8128978ef13223f169d4a1a1fb8" args="(iterator __first, iterator __last)" -->
<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="a00739.html">vector</a>< _Tp, _Alloc >::iterator vector::erase </td>
<td>(</td>
<td class="paramtype">iterator </td>
<td class="paramname"><em>__first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">iterator </td>
<td class="paramname"><em>__last</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Remove a range of elements. </p>
<dl><dt><b>Parameters:</b></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="return"><dt><b>Returns:</b></dt><dd>An iterator pointing to the element pointed to by <em>last</em> prior to erasing (or <a class="el" href="a00739.html#a8c27a1d92949b353ac4503001c0d1066">end()</a>).</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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. 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>Definition at line <a class="el" href="a01117_source.html#l00148">148</a> of file <a class="el" href="a01117_source.html">vector.tcc</a>.</p>
<p>References <a class="el" href="a00906_source.html#l00096">std::end()</a>.</p>
</div>
</div>
<a class="anchor" id="a6430e8ffbe3e8305d90c25e1eb51e97e"></a><!-- doxytag: member="std::vector::front" ref="a6430e8ffbe3e8305d90c25e1eb51e97e" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00764">764</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00803">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::data()</a>, <a class="el" href="a00997_source.html#l05256">std::piecewise_linear_distribution< _RealType >::min()</a>, and <a class="el" href="a00997_source.html#l05014">std::piecewise_constant_distribution< _RealType >::min()</a>.</p>
</div>
</div>
<a class="anchor" id="a197f08fcdbc3fc6f5fe29548185f71c8"></a><!-- doxytag: member="std::vector::front" ref="a197f08fcdbc3fc6f5fe29548185f71c8" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00772">772</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="aea01a0e07f8363d72f69ea3d85dcd490"></a><!-- doxytag: member="std::vector::insert" ref="aea01a0e07f8363d72f69ea3d85dcd490" args="(iterator __position, _InputIterator __first, _InputIterator __last)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<div class="memtemplate">
template<typename _InputIterator > </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Inserts a range into the vector. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">position</td><td>An 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>
<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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00962">962</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a4b6b7d15cc8a77ac3bc94155c1c77ce5"></a><!-- doxytag: member="std::vector::insert" ref="a4b6b7d15cc8a77ac3bc94155c1c77ce5" args="(iterator __position, value_type &&__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">iterator <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Inserts given rvalue into vector before specified iterator. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">position</td><td>An iterator into the vector. </td></tr>
<tr><td class="paramname">x</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00908">908</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a33f1fee1be2a08581a361d7f399d65e4"></a><!-- doxytag: member="std::vector::insert" ref="a33f1fee1be2a08581a361d7f399d65e4" args="(iterator __position, initializer_list< value_type > __l)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">iterator </td>
<td class="paramname"><em>__position</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00524.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Inserts an <a class="el" href="a00524.html" title="initializer_list">initializer_list</a> into the vector. </p>
<dl><dt><b>Parameters:</b></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 <a class="el" href="a00524.html" title="initializer_list">initializer_list</a>.</td></tr>
</table>
</dd>
</dl>
<p>This function will insert copies of the data in the <a class="el" href="a00524.html" title="initializer_list">initializer_list</a> <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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00925">925</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00925">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert()</a>.</p>
</div>
</div>
<a class="anchor" id="a1c9bad3d30995b552ddab7b57d36c3f6"></a><!-- doxytag: member="std::vector::insert" ref="a1c9bad3d30995b552ddab7b57d36c3f6" args="(iterator __position, size_type __n, const value_type &__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::insert </td>
<td>(</td>
<td class="paramtype">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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Inserts a number of copies of given data into the vector. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">position</td><td>An 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>
<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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00943">943</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a53d2a978afcbb3fdf5276a95e323842b"></a><!-- doxytag: member="std::vector::insert" ref="a53d2a978afcbb3fdf5276a95e323842b" args="(iterator __position, const value_type &__x)" -->
<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="a00739.html">vector</a>< _Tp, _Alloc >::iterator vector::insert </td>
<td>(</td>
<td class="paramtype">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><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">position</td><td>An iterator into the vector. </td></tr>
<tr><td class="paramname">x</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="return"><dt><b>Returns:</b></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 <a class="el" href="a00580.html" title="A standard container with linear time access to elements, and fixed time insertion/deletion at any po...">std::list</a>. </p>
<p>Definition at line <a class="el" href="a01117_source.html#l00109">109</a> of file <a class="el" href="a01117_source.html">vector.tcc</a>.</p>
<p>References <a class="el" href="a00906_source.html#l00086">std::begin()</a>, and <a class="el" href="a00906_source.html#l00096">std::end()</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00609">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()</a>.</p>
</div>
</div>
<a class="anchor" id="a68fc9ad8180aacdca3a3cf15b8e1ddb9"></a><!-- doxytag: member="std::vector::max_size" ref="a68fc9ad8180aacdca3a3cf15b8e1ddb9" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::max_size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Returns the <a class="el" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size()</a> of the largest possible vector. </p>
<p>Reimplemented in <a class="el" href="a00261.html#a92bea784d857a88370b1658b427038b7">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#a92bea784d857a88370b1658b427038b7">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#a92bea784d857a88370b1658b427038b7">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00575">575</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a378f8be875b0d63c7144072f409a5f23"></a><!-- doxytag: member="std::vector::operator=" ref="a378f8be875b0d63c7144072f409a5f23" args="(vector &&__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">vector</a>& <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00739.html">vector</a>< _Tp, _Alloc > && </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Vector move assignment operator. </p>
<dl><dt><b>Parameters:</b></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). <em>x</em> is a valid, but unspecified vector. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00373">373</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a9c56711f1fdb6aeb4a287570da90a688"></a><!-- doxytag: member="std::vector::operator=" ref="a9c56711f1fdb6aeb4a287570da90a688" args="(const vector &__x)" -->
<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="a00739.html">vector</a>< _Tp, _Alloc > & vector::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00739.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><dt><b>Parameters:</b></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 extra memory in <em>x</em> (for fast expansion) will not be copied. Unlike the copy constructor, the allocator object is not copied. </p>
<p>Definition at line <a class="el" href="a01117_source.html#l00162">162</a> of file <a class="el" href="a01117_source.html">vector.tcc</a>.</p>
<p>References <a class="el" href="a01048_source.html#l00093">std::_Destroy()</a>, <a class="el" href="a00906_source.html#l00086">std::begin()</a>, <a class="el" href="a01069_source.html#l00463">std::vector< _Tp, _Alloc >::begin()</a>, <a class="el" href="a00906_source.html#l00096">std::end()</a>, <a class="el" href="a01069_source.html#l00481">std::vector< _Tp, _Alloc >::end()</a>, <a class="el" href="a00775_source.html#l01275">std::size()</a>, and <a class="el" href="a01069_source.html#l00570">std::vector< _Tp, _Alloc >::size()</a>.</p>
</div>
</div>
<a class="anchor" id="a5badc45ac5ba40fafcbb6ec5a0b8a745"></a><!-- doxytag: member="std::vector::operator=" ref="a5badc45ac5ba40fafcbb6ec5a0b8a745" args="(initializer_list< value_type > __l)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00739.html">vector</a>& <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00524.html">initializer_list</a>< value_type > </td>
<td class="paramname"><em>__l</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Vector list assignment operator. </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">l</td><td>An <a class="el" href="a00524.html" title="initializer_list">initializer_list</a>.</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. Old data may be lost. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00394">394</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="aca0657aa65542b2bbdb444d78c7d4a98"></a><!-- doxytag: member="std::vector::operator[]" ref="aca0657aa65542b2bbdb444d78c7d4a98" args="(size_type __n) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">const_reference <a class="el" href="a00739.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<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Subscript access to the data contained in the vector. </p>
<dl><dt><b>Parameters:</b></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="return"><dt><b>Returns:</b></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 <a class="el" href="a00646.html">out_of_range</a> lookups are not defined. (For checked lookups see <a class="el" href="a00739.html#a11362894b61f87331541b5268d0cb033" title="Provides access to the data contained in the vector.">at()</a>.) </p>
<p>Reimplemented in <a class="el" href="a00261.html#a42c31209217e8d89893363f1bbaf3100">std::match_results< _Bi_iter ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00710">710</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a475f606b188e2096932501e97d20ec80"></a><!-- doxytag: member="std::vector::operator[]" ref="a475f606b188e2096932501e97d20ec80" args="(size_type __n)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">reference <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Subscript access to the data contained in the vector. </p>
<dl><dt><b>Parameters:</b></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="return"><dt><b>Returns:</b></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 <a class="el" href="a00646.html">out_of_range</a> lookups are not defined. (For checked lookups see <a class="el" href="a00739.html#a11362894b61f87331541b5268d0cb033" title="Provides access to the data contained in the vector.">at()</a>.) </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00695">695</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a74b162cd471d2baa7ad393c3cd416a59"></a><!-- doxytag: member="std::vector::pop_back" ref="a74b162cd471d2baa7ad393c3cd416a59" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::pop_back </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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 <a class="el" href="a00739.html#a74b162cd471d2baa7ad393c3cd416a59" title="Removes last element.">pop_back()</a> is called. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00857">857</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a6f2144e852790296d3c62cdec92c95ce"></a><!-- doxytag: member="std::vector::push_back" ref="a6f2144e852790296d3c62cdec92c95ce" args="(const value_type &__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Add data to the end of the vector. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l00826">826</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a00950_source.html#l00124">__gnu_parallel::multiseq_partition()</a>, and <a class="el" href="a00950_source.html#l00390">__gnu_parallel::multiseq_selection()</a>.</p>
</div>
</div>
<a class="anchor" id="ae317a81cb77cdb08432c3a8c00b31df4"></a><!-- doxytag: member="std::vector::rbegin" ref="ae317a81cb77cdb08432c3a8c00b31df4" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00693.html">reverse_iterator</a> <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::rbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00499">499</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a2a81a8fc74492159cc03b9ac41aae880"></a><!-- doxytag: member="std::vector::rbegin" ref="a2a81a8fc74492159cc03b9ac41aae880" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::rbegin </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00508">508</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="aa8471fb4e9eb65ad51ae65a9f06d1570"></a><!-- doxytag: member="std::vector::rend" ref="aa8471fb4e9eb65ad51ae65a9f06d1570" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00693.html">reverse_iterator</a> <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::rend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00517">517</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="ae1db339bb0b8ab83ee5d1c98c6a279da"></a><!-- doxytag: member="std::vector::rend" ref="ae1db339bb0b8ab83ee5d1c98c6a279da" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00693.html">const_reverse_iterator</a> <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::rend </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></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>Definition at line <a class="el" href="a01069_source.html#l00526">526</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a8ab62036345a72d8126fa30425dfe869"></a><!-- doxytag: member="std::vector::reserve" ref="a8ab62036345a72d8126fa30425dfe869" args="(size_type __n)" -->
<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><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>Number of elements required. </td></tr>
</table>
</dd>
</dl>
<dl><dt><b>Exceptions:</b></dt><dd>
<table class="exception">
<tr><td class="paramname"><a class="el" href="a00576.html">std::length_error</a></td><td>If <em>n</em> exceeds <code><a class="el" href="a00739.html#a68fc9ad8180aacdca3a3cf15b8e1ddb9">max_size()</a></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 <a class="el" href="a00739.html#a68fc9ad8180aacdca3a3cf15b8e1ddb9">max_size()</a>, <a class="el" href="a00576.html">length_error</a> 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>Definition at line <a class="el" href="a01117_source.html#l00067">67</a> of file <a class="el" href="a01117_source.html">vector.tcc</a>.</p>
<p>References <a class="el" href="a01048_source.html#l00093">std::_Destroy()</a>, and <a class="el" href="a00775_source.html#l01275">std::size()</a>.</p>
</div>
</div>
<a class="anchor" id="a53e627a12d33d2df15d4a9c25c872785"></a><!-- doxytag: member="std::vector::resize" ref="a53e627a12d33d2df15d4a9c25c872785" args="(size_type __new_size, const value_type &__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Resizes the vector to the specified number of elements. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l00609">609</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a1134bcc83ff6c70cf78bab3cd426feaf"></a><!-- doxytag: member="std::vector::resize" ref="a1134bcc83ff6c70cf78bab3cd426feaf" args="(size_type __new_size)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.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><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Resizes the vector to the specified number of elements. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l00589">589</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a00923_source.html#l00050">__gnu_parallel::__shrink_and_double()</a>, <a class="el" href="a00953_source.html#l01117">__gnu_parallel::multiway_merge_exact_splitting()</a>, and <a class="el" href="a00954_source.html#l00396">__gnu_parallel::parallel_sort_mwms()</a>.</p>
</div>
</div>
<a class="anchor" id="a4f4dc31fc105124cd9a5e4a90ae99c44"></a><!-- doxytag: member="std::vector::shrink_to_fit" ref="a4f4dc31fc105124cd9a5e4a90ae99c44" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::shrink_to_fit </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>A non-binding request to reduce <a class="el" href="a00739.html#a566ce30a571bb5621946950405bb0e64">capacity()</a> to <a class="el" href="a00739.html#a49e9afae414f8d8e3a2e1221c3a050c6">size()</a>. </p>
<p>Definition at line <a class="el" href="a01069_source.html#l00641">641</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
</div>
</div>
<a class="anchor" id="a49e9afae414f8d8e3a2e1221c3a050c6"></a><!-- doxytag: member="std::vector::size" ref="a49e9afae414f8d8e3a2e1221c3a050c6" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">size_type <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Returns the number of elements in the vector. </p>
<p>Reimplemented in <a class="el" href="a00261.html#a045ce3d38bdd30a73d729098bfcaf8f0">std::match_results< _Bi_iter, _Allocator ></a>, <a class="el" href="a00261.html#a045ce3d38bdd30a73d729098bfcaf8f0">std::match_results< _Bi_iter ></a>, and <a class="el" href="a00261.html#a045ce3d38bdd30a73d729098bfcaf8f0">std::match_results< _FwdIterT, _Alloc ></a>.</p>
<p>Definition at line <a class="el" href="a01069_source.html#l00570">570</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a00923_source.html#l00070">__gnu_parallel::__shrink()</a>, <a class="el" href="a00923_source.html#l00050">__gnu_parallel::__shrink_and_double()</a>, <a class="el" href="a01069_source.html#l00716">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::_M_range_check()</a>, <a class="el" href="a00923_source.html#l00101">__gnu_parallel::list_partition()</a>, <a class="el" href="a00997_source.html#l04786">std::discrete_distribution< _IntType >::max()</a>, <a class="el" href="a01117_source.html#l00162">std::vector< _Tp, _Alloc >::operator=()</a>, <a class="el" href="a01069_source.html#l01273">std::operator==()</a>, and <a class="el" href="a01069_source.html#l00589">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()</a>.</p>
</div>
</div>
<a class="anchor" id="aa01966bffe0a347ddc419558a01ce050"></a><!-- doxytag: member="std::vector::swap" ref="aa01966bffe0a347ddc419558a01ce050" args="(vector &__x)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Tp, typename _Alloc = std::allocator<_Tp>> </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="a00739.html">std::vector</a>< _Tp, _Alloc >::swap </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00739.html">vector</a>< _Tp, _Alloc > & </td>
<td class="paramname"><em>__x</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Swaps data with another vector. </p>
<dl><dt><b>Parameters:</b></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>Definition at line <a class="el" href="a01069_source.html#l01019">1019</a> of file <a class="el" href="a01069_source.html">stl_vector.h</a>.</p>
<p>Referenced by <a class="el" href="a01069_source.html#l00373">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=()</a>, <a class="el" href="a01069_source.html#l01321">std::swap()</a>, and <a class="el" href="a01069_source.html#l01019">std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::swap()</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="a01069_source.html">stl_vector.h</a></li>
<li><a class="el" href="a01117_source.html">vector.tcc</a></li>
</ul>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a01137.html">std</a> </li>
<li class="navelem"><a class="el" href="a00739.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.7.4 </li>
</ul>
</div>
</body>
</html>
