.TH "std::vector< _Tp, _Alloc >" 3cxx "Tue Nov 27 2012" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::vector< _Tp, _Alloc > \- 
.SH SYNOPSIS
.br
.PP
.PP
Inherits \fBstd::_Vector_base< _Tp, _Alloc >\fP\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef _Alloc \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef 
.br
__gnu_cxx::__normal_iterator
.br
< const_pointer, \fBvector\fP > \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef 
.br
_Tp_alloc_type::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "typedef 
.br
_Tp_alloc_type::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "typedef \fBstd::reverse_iterator\fP
.br
< const_iterator > \fBconst_reverse_iterator\fP"
.br
.ti -1c
.RI "typedef ptrdiff_t \fBdifference_type\fP"
.br
.ti -1c
.RI "typedef 
.br
__gnu_cxx::__normal_iterator
.br
< pointer, \fBvector\fP > \fBiterator\fP"
.br
.ti -1c
.RI "typedef _Tp_alloc_type::pointer \fBpointer\fP"
.br
.ti -1c
.RI "typedef _Tp_alloc_type::reference \fBreference\fP"
.br
.ti -1c
.RI "typedef \fBstd::reverse_iterator\fP
.br
< iterator > \fBreverse_iterator\fP"
.br
.ti -1c
.RI "typedef size_t \fBsize_type\fP"
.br
.ti -1c
.RI "typedef _Tp \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fBvector\fP ()"
.br
.ti -1c
.RI "\fBvector\fP (const allocator_type &__a)"
.br
.ti -1c
.RI "\fBvector\fP (size_type __n)"
.br
.ti -1c
.RI "\fBvector\fP (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBvector\fP (const \fBvector\fP &__x)"
.br
.ti -1c
.RI "\fBvector\fP (\fBvector\fP &&__x)"
.br
.ti -1c
.RI "\fBvector\fP (\fBinitializer_list\fP< value_type > __l, const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBvector\fP (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fB~vector\fP ()"
.br
.ti -1c
.RI "void \fBassign\fP (size_type __n, const value_type &__val)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fBassign\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "void \fBassign\fP (\fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "reference \fBat\fP (size_type __n)"
.br
.ti -1c
.RI "const_reference \fBat\fP (size_type __n) const "
.br
.ti -1c
.RI "reference \fBback\fP ()"
.br
.ti -1c
.RI "const_reference \fBback\fP () const "
.br
.ti -1c
.RI "iterator \fBbegin\fP ()"
.br
.ti -1c
.RI "const_iterator \fBbegin\fP () const "
.br
.ti -1c
.RI "size_type \fBcapacity\fP () const "
.br
.ti -1c
.RI "const_iterator \fBcbegin\fP () const "
.br
.ti -1c
.RI "const_iterator \fBcend\fP () const "
.br
.ti -1c
.RI "void \fBclear\fP ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrbegin\fP () const "
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrend\fP () const "
.br
.ti -1c
.RI "_Tp * \fBdata\fP ()"
.br
.ti -1c
.RI "const _Tp * \fBdata\fP () const "
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> iterator \fBemplace\fP (iterator __position, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> void \fBemplace_back\fP (_Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "bool \fBempty\fP () const "
.br
.ti -1c
.RI "iterator \fBend\fP ()"
.br
.ti -1c
.RI "const_iterator \fBend\fP () const "
.br
.ti -1c
.RI "iterator \fBerase\fP (iterator __position)"
.br
.ti -1c
.RI "iterator \fBerase\fP (iterator __first, iterator __last)"
.br
.ti -1c
.RI "reference \fBfront\fP ()"
.br
.ti -1c
.RI "const_reference \fBfront\fP () const "
.br
.ti -1c
.RI "iterator \fBinsert\fP (iterator __position, const value_type &__x)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (iterator __position, value_type &&__x)"
.br
.ti -1c
.RI "void \fBinsert\fP (iterator __position, \fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "void \fBinsert\fP (iterator __position, size_type __n, const value_type &__x)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fBinsert\fP (iterator __position, _InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "size_type \fBmax_size\fP () const "
.br
.ti -1c
.RI "\fBvector\fP & \fBoperator=\fP (const \fBvector\fP &__x)"
.br
.ti -1c
.RI "\fBvector\fP & \fBoperator=\fP (\fBvector\fP &&__x)"
.br
.ti -1c
.RI "\fBvector\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > __l)"
.br
.ti -1c
.RI "reference \fBoperator[]\fP (size_type __n)"
.br
.ti -1c
.RI "const_reference \fBoperator[]\fP (size_type __n) const "
.br
.ti -1c
.RI "void \fBpop_back\fP ()"
.br
.ti -1c
.RI "void \fBpush_back\fP (const value_type &__x)"
.br
.ti -1c
.RI "void \fBpush_back\fP (value_type &&__x)"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrbegin\fP ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrbegin\fP () const "
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrend\fP ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrend\fP () const "
.br
.ti -1c
.RI "void \fBreserve\fP (size_type __n)"
.br
.ti -1c
.RI "void \fBresize\fP (size_type __new_size)"
.br
.ti -1c
.RI "void \fBresize\fP (size_type __new_size, const value_type &__x)"
.br
.ti -1c
.RI "void \fBshrink_to_fit\fP ()"
.br
.ti -1c
.RI "size_type \fBsize\fP () const "
.br
.ti -1c
.RI "void \fBswap\fP (\fBvector\fP &__x)"
.br
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "_Tp_alloc_type::pointer \fB_M_allocate\fP (size_t __n)"
.br
.ti -1c
.RI "template<typename _ForwardIterator > pointer \fB_M_allocate_and_copy\fP (size_type __n, _ForwardIterator __first, _ForwardIterator __last)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fB_M_assign_aux\fP (_InputIterator __first, _InputIterator __last, \fBstd::input_iterator_tag\fP)"
.br
.ti -1c
.RI "template<typename _ForwardIterator > void \fB_M_assign_aux\fP (_ForwardIterator __first, _ForwardIterator __last, \fBstd::forward_iterator_tag\fP)"
.br
.ti -1c
.RI "template<typename _Integer > void \fB_M_assign_dispatch\fP (_Integer __n, _Integer __val, __true_type)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fB_M_assign_dispatch\fP (_InputIterator __first, _InputIterator __last, __false_type)"
.br
.ti -1c
.RI "size_type \fB_M_check_len\fP (size_type __n, const char *__s) const "
.br
.ti -1c
.RI "void \fB_M_deallocate\fP (typename _Tp_alloc_type::pointer __p, size_t __n)"
.br
.ti -1c
.RI "void \fB_M_default_append\fP (size_type __n)"
.br
.ti -1c
.RI "void \fB_M_default_initialize\fP (size_type __n)"
.br
.ti -1c
.RI "void \fB_M_erase_at_end\fP (pointer __pos)"
.br
.ti -1c
.RI "void \fB_M_fill_assign\fP (size_type __n, const value_type &__val)"
.br
.ti -1c
.RI "void \fB_M_fill_initialize\fP (size_type __n, const value_type &__value)"
.br
.ti -1c
.RI "void \fB_M_fill_insert\fP (iterator __pos, size_type __n, const value_type &__x)"
.br
.ti -1c
.RI "_Tp_alloc_type & \fB_M_get_Tp_allocator\fP ()"
.br
.ti -1c
.RI "const _Tp_alloc_type & \fB_M_get_Tp_allocator\fP () const "
.br
.ti -1c
.RI "template<typename _Integer > void \fB_M_initialize_dispatch\fP (_Integer __n, _Integer __value, __true_type)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fB_M_initialize_dispatch\fP (_InputIterator __first, _InputIterator __last, __false_type)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> void \fB_M_insert_aux\fP (iterator __position, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "template<typename _Integer > void \fB_M_insert_dispatch\fP (iterator __pos, _Integer __n, _Integer __val, __true_type)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fB_M_insert_dispatch\fP (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)"
.br
.ti -1c
.RI "void \fB_M_range_check\fP (size_type __n) const "
.br
.ti -1c
.RI "template<typename _InputIterator > void \fB_M_range_initialize\fP (_InputIterator __first, _InputIterator __last, \fBstd::input_iterator_tag\fP)"
.br
.ti -1c
.RI "template<typename _ForwardIterator > void \fB_M_range_initialize\fP (_ForwardIterator __first, _ForwardIterator __last, \fBstd::forward_iterator_tag\fP)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fB_M_range_insert\fP (iterator __pos, _InputIterator __first, _InputIterator __last, \fBstd::input_iterator_tag\fP)"
.br
.ti -1c
.RI "template<typename _ForwardIterator > void \fB_M_range_insert\fP (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, \fBstd::forward_iterator_tag\fP)"
.br
.ti -1c
.RI "allocator_type \fBget_allocator\fP () const "
.br
.in -1c
.SS "Protected Attributes"

.in +1c
.ti -1c
.RI "_Vector_impl \fB_M_impl\fP"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>>class std::vector< _Tp, _Alloc >"
A standard container which offers fixed time access to individual elements in any order\&. 

Meets the requirements of a \fCcontainer\fP, a \fCreversible container\fP, and a \fCsequence\fP, including the \fCoptional sequence requirements\fP with the exception of \fCpush_front\fP and \fCpop_front\fP\&.
.PP
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 ( \fC\fP[] ) access is also provided as with C-style arrays\&. 
.PP
Definition at line 180 of file stl_vector\&.h\&.
.SH "Constructor & Destructor Documentation"
.PP 
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP ()\fC [inline]\fP"

.PP
Default constructor creates no elements\&. 
.PP
Definition at line 217 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (const allocator_type &__a)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Creates a vector with no elements\&. \fBParameters:\fP
.RS 4
\fIa\fP An allocator object\&. 
.RE
.PP

.PP
Definition at line 225 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (size_type__n)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Creates a vector with default constructed elements\&. \fBParameters:\fP
.RS 4
\fIn\fP The number of elements to initially create\&.
.RE
.PP
This constructor fills the vector with \fIn\fP default constructed elements\&. 
.PP
Definition at line 237 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (size_type__n, const value_type &__value, const allocator_type &__a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Creates a vector with copies of an exemplar element\&. \fBParameters:\fP
.RS 4
\fIn\fP The number of elements to initially create\&. 
.br
\fIvalue\fP An element to copy\&. 
.br
\fIa\fP An allocator\&.
.RE
.PP
This constructor fills the vector with \fIn\fP copies of \fIvalue\fP\&. 
.PP
Definition at line 249 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (const \fBvector\fP< _Tp, _Alloc > &__x)\fC [inline]\fP"

.PP
Vector copy constructor\&. \fBParameters:\fP
.RS 4
\fIx\fP A vector of identical element and allocator types\&.
.RE
.PP
The newly-created vector uses a copy of the allocation object used by \fIx\fP\&. All the elements of \fIx\fP are copied, but any extra memory in \fIx\fP (for fast expansion) will not be copied\&. 
.PP
Definition at line 278 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (\fBvector\fP< _Tp, _Alloc > &&__x)\fC [inline]\fP"

.PP
Vector move constructor\&. \fBParameters:\fP
.RS 4
\fIx\fP A vector of identical element and allocator types\&.
.RE
.PP
The newly-created vector contains the exact contents of \fIx\fP\&. The contents of \fIx\fP are a valid, but unspecified vector\&. 
.PP
Definition at line 294 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (\fBinitializer_list\fP< value_type >__l, const allocator_type &__a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Builds a vector from an initializer list\&. \fBParameters:\fP
.RS 4
\fIl\fP An \fBinitializer_list\fP\&. 
.br
\fIa\fP An allocator\&.
.RE
.PP
Create a vector consisting of copies of the elements in the \fBinitializer_list\fP \fIl\fP\&.
.PP
This will call the element type's copy constructor N times (where N is \fI\fBl\&.size()\fP\fP) and do no memory reallocation\&. 
.PP
Definition at line 308 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator > \fBstd::vector\fP< _Tp, _Alloc >::\fBvector\fP (_InputIterator__first, _InputIterator__last, const allocator_type &__a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Builds a vector from a range\&. \fBParameters:\fP
.RS 4
\fIfirst\fP An input iterator\&. 
.br
\fIlast\fP An input iterator\&. 
.br
\fIa\fP An allocator\&.
.RE
.PP
Create a vector consisting of copies of the elements from [first,last)\&.
.PP
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\&. 
.PP
Definition at line 334 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBstd::vector\fP< _Tp, _Alloc >::~\fBvector\fP ()\fC [inline]\fP"
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\&. 
.PP
Definition at line 349 of file stl_vector\&.h\&.
.SH "Member Function Documentation"
.PP 
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _ForwardIterator > pointer \fBstd::vector\fP< _Tp, _Alloc >::_M_allocate_and_copy (size_type__n, _ForwardIterator__first, _ForwardIterator__last)\fC [inline]\fP, \fC [protected]\fP"
Memory expansion handler\&. Uses the member allocation function to obtain \fIn\fP bytes of memory, and then copies [first,last) into it\&. 
.PP
Definition at line 1049 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::_M_range_check (size_type__n) const\fC [inline]\fP, \fC [protected]\fP"

.PP
Safety check used only from \fBat()\fP\&. 
.PP
Definition at line 716 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::at()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::assign (size_type__n, const value_type &__val)\fC [inline]\fP"

.PP
Assigns a given value to a vector\&. \fBParameters:\fP
.RS 4
\fIn\fP Number of elements to be assigned\&. 
.br
\fIval\fP Value to be assigned\&.
.RE
.PP
This function fills a vector with \fIn\fP 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\&. 
.PP
Definition at line 412 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator > void \fBstd::vector\fP< _Tp, _Alloc >::assign (_InputIterator__first, _InputIterator__last)\fC [inline]\fP"

.PP
Assigns a range to a vector\&. \fBParameters:\fP
.RS 4
\fIfirst\fP An input iterator\&. 
.br
\fIlast\fP An input iterator\&.
.RE
.PP
This function fills a vector with copies of the elements in the range [first,last)\&.
.PP
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\&. 
.PP
Definition at line 429 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::assign (\fBinitializer_list\fP< value_type >__l)\fC [inline]\fP"

.PP
Assigns an initializer list to a vector\&. \fBParameters:\fP
.RS 4
\fIl\fP An \fBinitializer_list\fP\&.
.RE
.PP
This function fills a vector with copies of the elements in the initializer list \fIl\fP\&.
.PP
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\&. 
.PP
Definition at line 449 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::assign()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference \fBstd::vector\fP< _Tp, _Alloc >::at (size_type__n)\fC [inline]\fP"

.PP
Provides access to the data contained in the vector\&. \fBParameters:\fP
.RS 4
\fIn\fP The index of the element for which data should be accessed\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read/write reference to data\&. 
.RE
.PP
\fBExceptions:\fP
.RS 4
\fI\fBstd::out_of_range\fP\fP If \fIn\fP is an invalid index\&.
.RE
.PP
This function provides for safer data access\&. The parameter is first checked that it is in the range of the vector\&. The function throws \fBout_of_range\fP if the check fails\&. 
.PP
Definition at line 735 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference \fBstd::vector\fP< _Tp, _Alloc >::at (size_type__n) const\fC [inline]\fP"

.PP
Provides access to the data contained in the vector\&. \fBParameters:\fP
.RS 4
\fIn\fP The index of the element for which data should be accessed\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) reference to data\&. 
.RE
.PP
\fBExceptions:\fP
.RS 4
\fI\fBstd::out_of_range\fP\fP If \fIn\fP is an invalid index\&.
.RE
.PP
This function provides for safer data access\&. The parameter is first checked that it is in the range of the vector\&. The function throws \fBout_of_range\fP if the check fails\&. 
.PP
Definition at line 753 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference \fBstd::vector\fP< _Tp, _Alloc >::back ()\fC [inline]\fP"
Returns a read/write reference to the data at the last element of the vector\&. 
.PP
Definition at line 780 of file stl_vector\&.h\&.
.PP
Referenced by std::piecewise_constant_distribution< _RealType >::max(), and std::piecewise_linear_distribution< _RealType >::max()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference \fBstd::vector\fP< _Tp, _Alloc >::back () const\fC [inline]\fP"
Returns a read-only (constant) reference to the data at the last element of the vector\&. 
.PP
Definition at line 788 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator \fBstd::vector\fP< _Tp, _Alloc >::begin ()\fC [inline]\fP"
Returns a read/write iterator that points to the first element in the vector\&. Iteration is done in ordinary element order\&. 
.PP
Definition at line 463 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crend(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::front(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::multiway_merge_exact_splitting(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rend(), and std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator \fBstd::vector\fP< _Tp, _Alloc >::begin () const\fC [inline]\fP"
Returns a read-only (constant) iterator that points to the first element in the vector\&. Iteration is done in ordinary element order\&. 
.PP
Definition at line 472 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type \fBstd::vector\fP< _Tp, _Alloc >::capacity () const\fC [inline]\fP"
Returns the total number of elements that the vector can hold before needing to allocate more memory\&. 
.PP
Definition at line 650 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator \fBstd::vector\fP< _Tp, _Alloc >::cbegin () const\fC [inline]\fP"
Returns a read-only (constant) iterator that points to the first element in the vector\&. Iteration is done in ordinary element order\&. 
.PP
Definition at line 536 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator \fBstd::vector\fP< _Tp, _Alloc >::cend () const\fC [inline]\fP"
Returns a read-only (constant) iterator that points one past the last element in the vector\&. Iteration is done in ordinary element order\&. 
.PP
Definition at line 545 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::clear ()\fC [inline]\fP"
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\&. 
.PP
Definition at line 1039 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBconst_reverse_iterator\fP \fBstd::vector\fP< _Tp, _Alloc >::crbegin () const\fC [inline]\fP"
Returns a read-only (constant) reverse iterator that points to the last element in the vector\&. Iteration is done in reverse element order\&. 
.PP
Definition at line 554 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBconst_reverse_iterator\fP \fBstd::vector\fP< _Tp, _Alloc >::crend () const\fC [inline]\fP"
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\&. 
.PP
Definition at line 563 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> _Tp* \fBstd::vector\fP< _Tp, _Alloc >::data ()\fC [inline]\fP"
Returns a pointer such that [\fBdata()\fP, \fBdata()\fP + \fBsize()\fP) is a valid range\&. For a non-empty vector, \fBdata()\fP == &\fBfront()\fP\&. 
.PP
Definition at line 803 of file stl_vector\&.h\&.
.SS "template<typename _Tp , typename _Alloc > template<typename\&.\&.\&. _Args> \fBvector\fP< _Tp, _Alloc >::iterator vector::emplace (iterator__position, _Args &&\&.\&.\&.__args)"

.PP
Inserts an object in vector before specified iterator\&. \fBParameters:\fP
.RS 4
\fIposition\fP An iterator into the vector\&. 
.br
\fIargs\fP Arguments\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted data\&.
.RE
.PP
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 \fBstd::list\fP\&. 
.PP
Definition at line 277 of file vector\&.tcc\&.
.PP
References std::begin(), and std::end()\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> bool \fBstd::vector\fP< _Tp, _Alloc >::empty () const\fC [inline]\fP"
Returns true if the vector is empty\&. (Thus \fBbegin()\fP would equal \fBend()\fP\&.) 
.PP
Definition at line 659 of file stl_vector\&.h\&.
.PP
Referenced by std::piecewise_constant_distribution< _RealType >::densities(), std::piecewise_linear_distribution< _RealType >::densities(), std::piecewise_constant_distribution< _RealType >::intervals(), std::piecewise_linear_distribution< _RealType >::intervals(), std::discrete_distribution< _IntType >::max(), std::piecewise_constant_distribution< _RealType >::max(), std::piecewise_linear_distribution< _RealType >::max(), std::piecewise_constant_distribution< _RealType >::min(), std::piecewise_linear_distribution< _RealType >::min(), and std::discrete_distribution< _IntType >::probabilities()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator \fBstd::vector\fP< _Tp, _Alloc >::end ()\fC [inline]\fP"
Returns a read/write iterator that points one past the last element in the vector\&. Iteration is done in ordinary element order\&. 
.PP
Definition at line 481 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::back(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crbegin(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::multiway_merge_exact_splitting(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::push_back(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rbegin(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize(), and std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator \fBstd::vector\fP< _Tp, _Alloc >::end () const\fC [inline]\fP"
Returns a read-only (constant) iterator that points one past the last element in the vector\&. Iteration is done in ordinary element order\&. 
.PP
Definition at line 490 of file stl_vector\&.h\&.
.SS "template<typename _Tp , typename _Alloc > \fBvector\fP< _Tp, _Alloc >::iterator vector::erase (iterator__position)"

.PP
Remove element at given position\&. \fBParameters:\fP
.RS 4
\fIposition\fP Iterator pointing to element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator pointing to the next element (or \fBend()\fP)\&.
.RE
.PP
This function will erase the element at the given position and thus shorten the vector by one\&.
.PP
Note This operation could be expensive and if it is frequently used the user should consider using \fBstd::list\fP\&. 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\&. 
.PP
Definition at line 136 of file vector\&.tcc\&.
.PP
References std::end()\&.
.SS "template<typename _Tp , typename _Alloc > \fBvector\fP< _Tp, _Alloc >::iterator vector::erase (iterator__first, iterator__last)"

.PP
Remove a range of elements\&. \fBParameters:\fP
.RS 4
\fIfirst\fP Iterator pointing to the first element to be erased\&. 
.br
\fIlast\fP Iterator pointing to one past the last element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator pointing to the element pointed to by \fIlast\fP prior to erasing (or \fBend()\fP)\&.
.RE
.PP
This function will erase the elements in the range [first,last) and shorten the vector accordingly\&.
.PP
Note This operation could be expensive and if it is frequently used the user should consider using \fBstd::list\fP\&. 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\&. 
.PP
Definition at line 148 of file vector\&.tcc\&.
.PP
References std::end()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference \fBstd::vector\fP< _Tp, _Alloc >::front ()\fC [inline]\fP"
Returns a read/write reference to the data at the first element of the vector\&. 
.PP
Definition at line 764 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::data(), std::piecewise_constant_distribution< _RealType >::min(), and std::piecewise_linear_distribution< _RealType >::min()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference \fBstd::vector\fP< _Tp, _Alloc >::front () const\fC [inline]\fP"
Returns a read-only (constant) reference to the data at the first element of the vector\&. 
.PP
Definition at line 772 of file stl_vector\&.h\&.
.SS "template<typename _Tp , typename _Alloc > \fBvector\fP< _Tp, _Alloc >::iterator vector::insert (iterator__position, const value_type &__x)"

.PP
Inserts given value into vector before specified iterator\&. \fBParameters:\fP
.RS 4
\fIposition\fP An iterator into the vector\&. 
.br
\fIx\fP Data to be inserted\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted data\&.
.RE
.PP
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 \fBstd::list\fP\&. 
.PP
Definition at line 109 of file vector\&.tcc\&.
.PP
References std::begin(), and std::end()\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator \fBstd::vector\fP< _Tp, _Alloc >::insert (iterator__position, value_type &&__x)\fC [inline]\fP"

.PP
Inserts given rvalue into vector before specified iterator\&. \fBParameters:\fP
.RS 4
\fIposition\fP An iterator into the vector\&. 
.br
\fIx\fP Data to be inserted\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted data\&.
.RE
.PP
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 \fBstd::list\fP\&. 
.PP
Definition at line 908 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::insert (iterator__position, \fBinitializer_list\fP< value_type >__l)\fC [inline]\fP"

.PP
Inserts an \fBinitializer_list\fP into the vector\&. \fBParameters:\fP
.RS 4
\fIposition\fP An iterator into the vector\&. 
.br
\fIl\fP An \fBinitializer_list\fP\&.
.RE
.PP
This function will insert copies of the data in the \fBinitializer_list\fP \fIl\fP into the vector before the location specified by \fIposition\fP\&.
.PP
Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using \fBstd::list\fP\&. 
.PP
Definition at line 925 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::insert (iterator__position, size_type__n, const value_type &__x)\fC [inline]\fP"

.PP
Inserts a number of copies of given data into the vector\&. \fBParameters:\fP
.RS 4
\fIposition\fP An iterator into the vector\&. 
.br
\fIn\fP Number of elements to be inserted\&. 
.br
\fIx\fP Data to be inserted\&.
.RE
.PP
This function will insert a specified number of copies of the given data before the location specified by \fIposition\fP\&.
.PP
Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using \fBstd::list\fP\&. 
.PP
Definition at line 943 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator > void \fBstd::vector\fP< _Tp, _Alloc >::insert (iterator__position, _InputIterator__first, _InputIterator__last)\fC [inline]\fP"

.PP
Inserts a range into the vector\&. \fBParameters:\fP
.RS 4
\fIposition\fP An iterator into the vector\&. 
.br
\fIfirst\fP An input iterator\&. 
.br
\fIlast\fP An input iterator\&.
.RE
.PP
This function will insert copies of the data in the range [first,last) into the vector before the location specified by \fIpos\fP\&.
.PP
Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using \fBstd::list\fP\&. 
.PP
Definition at line 962 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type \fBstd::vector\fP< _Tp, _Alloc >::max_size () const\fC [inline]\fP"
Returns the \fBsize()\fP of the largest possible vector\&. 
.PP
Definition at line 575 of file stl_vector\&.h\&.
.SS "template<typename _Tp , typename _Alloc > \fBvector\fP< _Tp, _Alloc > & vector::operator= (const \fBvector\fP< _Tp, _Alloc > &__x)"

.PP
Vector assignment operator\&. \fBParameters:\fP
.RS 4
\fIx\fP A vector of identical element and allocator types\&.
.RE
.PP
All the elements of \fIx\fP are copied, but any extra memory in \fIx\fP (for fast expansion) will not be copied\&. Unlike the copy constructor, the allocator object is not copied\&. 
.PP
Definition at line 162 of file vector\&.tcc\&.
.PP
References std::_Destroy(), std::begin(), std::vector< _Tp, _Alloc >::begin(), std::end(), std::vector< _Tp, _Alloc >::end(), std::vector< _Tp, _Alloc >::size(), and std::size()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBvector\fP& \fBstd::vector\fP< _Tp, _Alloc >::operator= (\fBvector\fP< _Tp, _Alloc > &&__x)\fC [inline]\fP"

.PP
Vector move assignment operator\&. \fBParameters:\fP
.RS 4
\fIx\fP A vector of identical element and allocator types\&.
.RE
.PP
The contents of \fIx\fP are moved into this vector (without copying)\&. \fIx\fP is a valid, but unspecified vector\&. 
.PP
Definition at line 373 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBvector\fP& \fBstd::vector\fP< _Tp, _Alloc >::operator= (\fBinitializer_list\fP< value_type >__l)\fC [inline]\fP"

.PP
Vector list assignment operator\&. \fBParameters:\fP
.RS 4
\fIl\fP An \fBinitializer_list\fP\&.
.RE
.PP
This function fills a vector with copies of the elements in the initializer list \fIl\fP\&.
.PP
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\&. 
.PP
Definition at line 394 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference \fBstd::vector\fP< _Tp, _Alloc >::operator[] (size_type__n)\fC [inline]\fP"

.PP
Subscript access to the data contained in the vector\&. \fBParameters:\fP
.RS 4
\fIn\fP The index of the element for which data should be accessed\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read/write reference to data\&.
.RE
.PP
This operator allows for easy, array-style, data access\&. Note that data access with this operator is unchecked and \fBout_of_range\fP lookups are not defined\&. (For checked lookups see \fBat()\fP\&.) 
.PP
Definition at line 695 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference \fBstd::vector\fP< _Tp, _Alloc >::operator[] (size_type__n) const\fC [inline]\fP"

.PP
Subscript access to the data contained in the vector\&. \fBParameters:\fP
.RS 4
\fIn\fP The index of the element for which data should be accessed\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) reference to data\&.
.RE
.PP
This operator allows for easy, array-style, data access\&. Note that data access with this operator is unchecked and \fBout_of_range\fP lookups are not defined\&. (For checked lookups see \fBat()\fP\&.) 
.PP
Definition at line 710 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::pop_back ()\fC [inline]\fP"

.PP
Removes last element\&. This is a typical stack operation\&. It shrinks the vector by one\&.
.PP
Note that no data is returned, and if the last element's data is needed, it should be retrieved before \fBpop_back()\fP is called\&. 
.PP
Definition at line 857 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::push_back (const value_type &__x)\fC [inline]\fP"

.PP
Add data to the end of the vector\&. \fBParameters:\fP
.RS 4
\fIx\fP Data to be added\&.
.RE
.PP
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\&. 
.PP
Definition at line 826 of file stl_vector\&.h\&.
.PP
Referenced by __gnu_parallel::multiseq_partition(), and __gnu_parallel::multiseq_selection()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBreverse_iterator\fP \fBstd::vector\fP< _Tp, _Alloc >::rbegin ()\fC [inline]\fP"
Returns a read/write reverse iterator that points to the last element in the vector\&. Iteration is done in reverse element order\&. 
.PP
Definition at line 499 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBconst_reverse_iterator\fP \fBstd::vector\fP< _Tp, _Alloc >::rbegin () const\fC [inline]\fP"
Returns a read-only (constant) reverse iterator that points to the last element in the vector\&. Iteration is done in reverse element order\&. 
.PP
Definition at line 508 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBreverse_iterator\fP \fBstd::vector\fP< _Tp, _Alloc >::rend ()\fC [inline]\fP"
Returns a read/write reverse iterator that points to one before the first element in the vector\&. Iteration is done in reverse element order\&. 
.PP
Definition at line 517 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> \fBconst_reverse_iterator\fP \fBstd::vector\fP< _Tp, _Alloc >::rend () const\fC [inline]\fP"
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\&. 
.PP
Definition at line 526 of file stl_vector\&.h\&.
.SS "template<typename _Tp , typename _Alloc > void vector::reserve (size_type__n)"

.PP
Attempt to preallocate enough memory for specified number of elements\&. \fBParameters:\fP
.RS 4
\fIn\fP Number of elements required\&. 
.RE
.PP
\fBExceptions:\fP
.RS 4
\fI\fBstd::length_error\fP\fP If \fIn\fP exceeds \fC\fBmax_size()\fP\fP\&.
.RE
.PP
This function attempts to reserve enough memory for the vector to hold the specified number of elements\&. If the number requested is more than \fBmax_size()\fP, \fBlength_error\fP is thrown\&.
.PP
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\&. 
.PP
Definition at line 67 of file vector\&.tcc\&.
.PP
References std::_Destroy(), and std::size()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::resize (size_type__new_size)\fC [inline]\fP"

.PP
Resizes the vector to the specified number of elements\&. \fBParameters:\fP
.RS 4
\fInew_size\fP Number of elements the vector should contain\&.
.RE
.PP
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\&. 
.PP
Definition at line 589 of file stl_vector\&.h\&.
.PP
Referenced by __gnu_parallel::__shrink_and_double(), __gnu_parallel::multiway_merge_exact_splitting(), and __gnu_parallel::parallel_sort_mwms()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::resize (size_type__new_size, const value_type &__x)\fC [inline]\fP"

.PP
Resizes the vector to the specified number of elements\&. \fBParameters:\fP
.RS 4
\fInew_size\fP Number of elements the vector should contain\&. 
.br
\fIx\fP Data with which new elements should be populated\&.
.RE
.PP
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\&. 
.PP
Definition at line 609 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::shrink_to_fit ()\fC [inline]\fP"
A non-binding request to reduce \fBcapacity()\fP to \fBsize()\fP\&. 
.PP
Definition at line 641 of file stl_vector\&.h\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type \fBstd::vector\fP< _Tp, _Alloc >::size () const\fC [inline]\fP"
Returns the number of elements in the vector\&. 
.PP
Definition at line 570 of file stl_vector\&.h\&.
.PP
Referenced by __gnu_parallel::__shrink(), __gnu_parallel::__shrink_and_double(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::_M_range_check(), __gnu_parallel::list_partition(), std::discrete_distribution< _IntType >::max(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), and std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize()\&.
.SS "template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void \fBstd::vector\fP< _Tp, _Alloc >::swap (\fBvector\fP< _Tp, _Alloc > &__x)\fC [inline]\fP"

.PP
Swaps data with another vector\&. \fBParameters:\fP
.RS 4
\fIx\fP A vector of the same element and allocator types\&.
.RE
.PP
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\&. 
.PP
Definition at line 1019 of file stl_vector\&.h\&.
.PP
Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::swap(), and std::swap()\&.

.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.