Manpages - std_vector.3

typedef _Alloc allocator_type

typedef __gnu_cxx::__normal_iterator< const_pointer, vector > const_iterator

typedef _Alloc_traits::const_pointer const_pointer

typedef _Alloc_traits::const_reference const_reference

typedef std::reverse_iterator*< const_iterator > *const_reverse_iterator

typedef ptrdiff_t difference_type

typedef __gnu_cxx::__normal_iterator< pointer, vector > iterator

typedef _Base::pointer pointer

typedef _Alloc_traits::reference reference

typedef std::reverse_iterator*< iterator > *reverse_iterator

typedef size_t size_type

typedef _Tp value_type

vector ()=default
Creates a vector with no elements.

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> vector (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())
Builds a vector from a range.

vector (const allocator_type &__a) noexcept
Creates a vector with no elements.

vector (const vector &__x)
Vector copy constructor.

vector (const vector &__x, const allocator_type &__a)
Copy constructor with alternative allocator.

vector (*initializer_list*< value_type > __l, const allocator_type &__a=allocator_type())
Builds a vector from an initializer list.

vector (size_type __n, const allocator_type &__a=allocator_type())
Creates a vector with default constructed elements.

vector (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())
Creates a vector with copies of an exemplar element.

vector (vector &&) noexcept=default
Vector move constructor.

vector (vector &&__rv, const allocator_type &__m) noexcept(noexcept(vector*(std::declval< *vector && >(), std::declval< const allocator_type & >(), std::declval< typename _Alloc_traits::is_always_equal >())))
Move constructor with alternative allocator.

~vector () noexcept

template<typename… _Args> auto _M_emplace_aux (const_iterator __position, _Args &&… __args) -> iterator

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void assign (_InputIterator __first, _InputIterator __last)
Assigns a range to a vector.

void assign (*initializer_list*< value_type > __l)
Assigns an initializer list to a vector.

void assign (size_type __n, const value_type &__val)
Assigns a given value to a vector.

reference at (size_type __n)
Provides access to the data contained in the vector.

const_reference at (size_type __n) const
Provides access to the data contained in the vector.

const_reference back () const noexcept

reference back () noexcept

const_iterator begin () const noexcept

iterator begin () noexcept

size_type capacity () const noexcept

const_iterator cbegin () const noexcept

const_iterator cend () const noexcept

void clear () noexcept

const_reverse_iterator crbegin () const noexcept

const_reverse_iterator crend () const noexcept

const _Tp * data () const noexcept

_Tp * data () noexcept

template<typename… _Args> iterator emplace (const_iterator __position, _Args &&… __args)
Inserts an object in vector before specified iterator.

template<typename… _Args> reference emplace_back (_Args &&… __args)

bool empty () const noexcept

const_iterator end () const noexcept

iterator end () noexcept

iterator erase (const_iterator __first, const_iterator __last)
Remove a range of elements.

iterator erase (const_iterator __position)
Remove element at given position.

const_reference front () const noexcept

reference front () noexcept

allocator_type get_allocator () const noexcept
Get a copy of the memory allocation object.

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> iterator insert (const_iterator __position, _InputIterator __first, _InputIterator __last)
Inserts a range into the vector.

iterator insert (const_iterator __position, const value_type &__x)
Inserts given value into vector before specified iterator.

iterator insert (const_iterator __position, *initializer_list*< value_type > __l)
Inserts an initializer_list into the vector.

iterator insert (const_iterator __position, size_type __n, const value_type &__x)
Inserts a number of copies of given data into the vector.

iterator insert (const_iterator __position, value_type &&__x)
Inserts given rvalue into vector before specified iterator.

size_type max_size () const noexcept

vector & operator= (const vector &__x)
Vector assignment operator.

vector & operator= (*initializer_list*< value_type > __l)
Vector list assignment operator.

vector & operator= (vector &&__x) noexcept(_Alloc_traits::_S_nothrow_move())
Vector move assignment operator.

const_reference operator[] (size_type __n) const noexcept
Subscript access to the data contained in the vector.

reference operator[] (size_type __n) noexcept
Subscript access to the data contained in the vector.

void pop_back () noexcept
Removes last element.

void push_back (const value_type &__x)
Add data to the end of the vector.

void push_back (value_type &&__x)

const_reverse_iterator rbegin () const noexcept

reverse_iterator rbegin () noexcept

const_reverse_iterator rend () const noexcept

reverse_iterator rend () noexcept

void reserve (size_type __n)
Attempt to preallocate enough memory for specified number of elements.

void resize (size_type __new_size)
Resizes the vector to the specified number of elements.

void resize (size_type __new_size, const value_type &__x)
Resizes the vector to the specified number of elements.

void shrink_to_fit ()

size_type size () const noexcept

void swap (vector &__x) noexcept
Swaps data with another vector.

pointer _M_allocate (size_t __n)

template<typename _ForwardIterator > pointer _M_allocate_and_copy (size_type __n, _ForwardIterator __first, _ForwardIterator __last)

template<typename _ForwardIterator > void _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)

template<typename _InputIterator > void _M_assign_aux (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)

template<typename _InputIterator > void _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type)

template<typename _Integer > void _M_assign_dispatch (_Integer __n, _Integer __val, __true_type)

size_type _M_check_len (size_type __n, const char *__s) const

void _M_create_storage (size_t __n)

void _M_deallocate (pointer __p, size_t __n)

void _M_default_append (size_type __n)

void _M_default_initialize (size_type __n)

template<typename… _Args> iterator _M_emplace_aux (const_iterator __position, _Args &&… __args)

iterator _M_emplace_aux (const_iterator __position, value_type &&__v)

iterator _M_erase (iterator __first, iterator __last)

iterator _M_erase (iterator __position)

void _M_erase_at_end (pointer __pos) noexcept

void _M_fill_assign (size_type __n, const value_type &__val)

void _M_fill_initialize (size_type __n, const value_type &__value)

void _M_fill_insert (iterator __pos, size_type __n, const value_type &__x)

const _Tp_alloc_type & _M_get_Tp_allocator () const noexcept

_Tp_alloc_type & _M_get_Tp_allocator () noexcept

template<typename _Arg > void _M_insert_aux (iterator __position, _Arg &&__arg)

template<typename _InputIterator > void _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)

template<typename _Integer > void _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __val, __true_type)

iterator _M_insert_rval (const_iterator __position, value_type &&__v)

void _M_range_check (size_type __n) const
Safety check used only from at().

template<typename _ForwardIterator > void _M_range_initialize (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)

template<typename _InputIterator > void _M_range_initialize (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)

template<typename _ForwardIterator > void _M_range_insert (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)

template<typename _InputIterator > void _M_range_insert (iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag)

template<typename… _Args> void _M_realloc_insert (iterator __position, _Args &&… __args)

bool _M_shrink_to_fit ()

static size_type _S_check_init_len (size_type __n, const allocator_type &__a)

static size_type _S_max_size (const _Tp_alloc_type &__a) noexcept

_Vector_impl _M_impl

class std::vector< _Tp, _Alloc >“A standard container which offers fixed time access to individual elements in any order.

Template Parameters

_Tp Type of element.
_Alloc Allocator type, defaults to allocator<_Tp>.

Meets the requirements of a container, a reversible container, and a sequence, including the optional sequence requirements with the exception of push_front and pop_front.

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 ( [] ) access is also provided as with C-style arrays.

Definition at line 389 of file stl_vector.h.

typedef _Alloc std::vector*< _Tp, _Alloc >::allocator_type Definition at line *426 of file stl_vector.h.

typedef __gnu_cxx::__normal_iterator<const_pointer, vector*> *std::vector*< _Tp, _Alloc >::const_iterator Definition at line *421 of file stl_vector.h.

typedef _Alloc_traits::const_pointer std::vector*< _Tp, _Alloc >::const_pointer Definition at line *416 of file stl_vector.h.

typedef _Alloc_traits::const_reference std::vector*< _Tp, _Alloc >::const_reference Definition at line *418 of file stl_vector.h.

typedef std::reverse_iterator*<const_iterator> *std::vector*< _Tp, _Alloc >::*const_reverse_iterator Definition at line 422 of file stl_vector.h.

typedef ptrdiff_t std::vector*< _Tp, _Alloc >::difference_type Definition at line *425 of file stl_vector.h.

typedef __gnu_cxx::__normal_iterator<pointer, vector*> *std::vector*< _Tp, _Alloc >::iterator Definition at line *419 of file stl_vector.h.

typedef _Base::pointer std::vector*< _Tp, _Alloc >::pointer Definition at line *415 of file stl_vector.h.

typedef _Alloc_traits::reference std::vector*< _Tp, _Alloc >::reference Definition at line *417 of file stl_vector.h.

typedef std::reverse_iterator*<iterator> *std::vector*< _Tp, _Alloc >::*reverse_iterator Definition at line 423 of file stl_vector.h.

typedef size_t std::vector*< _Tp, _Alloc >::size_type Definition at line *424 of file stl_vector.h.

typedef _Tp std::vector*< _Tp, _Alloc >::value_type Definition at line *414 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::*vector ()= [default]= Creates a vector with no elements.

std::vector*< _Tp, _Alloc >::*vector (const allocator_type & __a)= [inline]=, = [explicit]=, = [noexcept]= Creates a vector with no elements.

Parameters

__a An allocator object.

Definition at line 497 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::*vector (size_type __n, const allocator_type & __a = allocator_type())= [inline]=, = [explicit]= Creates a vector with default constructed elements.

Parameters

__n The number of elements to initially create.
__a An allocator.

This constructor fills the vector with __n default constructed elements.

Definition at line 510 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::*vector (size_type __n, const value_type & __value, const allocator_type & __a = allocator_type())= [inline]= Creates a vector with copies of an exemplar element.

Parameters

__n The number of elements to initially create.
__value An element to copy.
__a An allocator.

This constructor fills the vector with __n copies of __value.

Definition at line 522 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::*vector (const *vector*< _Tp, _Alloc > & __x)= [inline]= Vector copy constructor.

Parameters

__x A vector of identical element and allocator types.

All the elements of __x are copied, but any unused capacity in __x will not be copied (i.e. capacity() == size() in the new vector).

The newly-created vector uses a copy of the allocator object used by __x (unless the allocator traits dictate a different object).

Definition at line 553 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::end().

std::vector*< _Tp, _Alloc >::*vector (*vector*< _Tp, _Alloc > &&)= [default]=, = [noexcept]= Vector move constructor. The newly-created vector contains the exact contents of the moved instance. The contents of the moved instance are a valid, but unspecified vector.

std::vector*< _Tp, _Alloc >::*vector (const *vector*< _Tp, _Alloc > & __x, const allocator_type & __a)= [inline]= Copy constructor with alternative allocator.

Definition at line 575 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::*vector (*vector*< _Tp, _Alloc > && __rv, const allocator_type & __m)= [inline]=, = [noexcept]= Move constructor with alternative allocator.

Definition at line 607 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::*vector (*initializer_list*< value_type > __l, const allocator_type & __a = allocator_type())= [inline]= Builds a vector from an initializer list.

Parameters

__l An initializer_list.
__a An allocator.

Create a vector consisting of copies of the elements in the initializer_list __l.

This will call the element type’s copy constructor N times (where N is __l.size()) and do no memory reallocation.

Definition at line 625 of file stl_vector.h.

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> std::vector*< _Tp, _Alloc >::*vector (_InputIterator __first, _InputIterator __last, const allocator_type & __a = allocator_type())= [inline]= Builds a vector from a range.

Parameters

__first An input iterator.
__last An input iterator.
__a An allocator.

Create a vector consisting of copies of the elements from [first,last).

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.

Definition at line 653 of file stl_vector.h.

References std::__iterator_category().

std::vector*< _Tp, _Alloc >::~*vector ()= [inline]=, = [noexcept]= 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.

Definition at line 678 of file stl_vector.h.

References std::_Destroy().

pointer std::_Vector_base*< _Tp, _Alloc >::_M_allocate (size_t __n)= [inline]=, = [protected]= Definition at line *343 of file stl_vector.h.

template<typename _ForwardIterator > pointer *std::vector*< _Tp, _Alloc >::_M_allocate_and_copy (size_type __n, _ForwardIterator __first, _ForwardIterator __last)= [inline]=, = [protected]= Memory expansion handler. Uses the member allocation function to obtain n bytes of memory, and then copies [first,last) into it.

Definition at line 1508 of file stl_vector.h.

_ForwardIterator > void vector::_M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)= [protected]= Definition at line 300 of file vector.tcc.

_InputIterator > void vector::_M_assign_aux (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)= [protected]= Definition at line 282 of file vector.tcc.

template<typename _InputIterator > void std::vector*< _Tp, _Alloc >::_M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type)= [inline]=, = [protected]= Definition at line *1626 of file stl_vector.h.

template<typename _Integer > void std::vector*< _Tp, _Alloc >::_M_assign_dispatch (_Integer __n, _Integer __val, __true_type)= [inline]=, = [protected]= Definition at line *1620 of file stl_vector.h.

size_type std::vector*< _Tp, _Alloc >::_M_check_len (size_type __n, const char * __s) const= [inline]=, = [protected]= Definition at line *1756 of file stl_vector.h.

>::_M_create_storage (size_t __n)= [inline]=, = [protected]=, = [inherited]= Definition at line 359 of file stl_vector.h.

std::_Vector_base*< _Tp, _Alloc >::_M_deallocate (pointer __p, size_t __n)= [inline]=, = [protected]= Definition at line *350 of file stl_vector.h.

vector::_M_default_append (size_type __n)= [protected]= Definition at line 611 of file vector.tcc.

std::vector*< _Tp, _Alloc >::_M_default_initialize (size_type __n)= [inline]=, = [protected]= Definition at line *1603 of file stl_vector.h.

template<typename… _Args> auto *std::vector*< _Tp, _Alloc >::_M_emplace_aux (const_iterator __position, _Args &&… __args) -> iterator “

Definition at line 364 of file vector.tcc.

iterator std::vector*< _Tp, _Alloc >::_M_emplace_aux (const_iterator __position, value_type && __v)= [inline]=, = [protected]= Definition at line *1750 of file stl_vector.h.

>::iterator vector::_M_erase (iterator __first, iterator __last)= [protected]= Definition at line 184 of file vector.tcc.

>::iterator vector::_M_erase (iterator __position)= [protected]= Definition at line 171 of file vector.tcc.

std::vector*< _Tp, _Alloc >::_M_erase_at_end (pointer __pos)= [inline]=, = [protected]=, = [noexcept]= Definition at line *1792 of file stl_vector.h.

(size_type __n, const value_type & __val)= [protected]= Definition at line 257 of file vector.tcc.

std::vector*< _Tp, _Alloc >::_M_fill_initialize (size_type __n, const value_type & __value)= [inline]=, = [protected]= Definition at line *1593 of file stl_vector.h.

(iterator __pos, size_type __n, const value_type & __x)= [protected]= Definition at line 509 of file vector.tcc.

_Tp_alloc_type & std::_Vector_base*< _Tp, _Alloc >::_M_get_Tp_allocator () const= [inline]=, = [protected]=, = [noexcept]= Definition at line *280 of file stl_vector.h.

_Tp_alloc_type & std::_Vector_base*< _Tp, _Alloc >::_M_get_Tp_allocator ()= [inline]=, = [protected]=, = [noexcept]= Definition at line *276 of file stl_vector.h.

void vector::_M_insert_aux (iterator __position, _Arg && __arg)= [protected]= Definition at line 395 of file vector.tcc.

template<typename _InputIterator > void std::vector*< _Tp, _Alloc >::_M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)= [inline]=, = [protected]= Definition at line *1662 of file stl_vector.h.

template<typename _Integer > void std::vector*< _Tp, _Alloc >::_M_insert_dispatch (iterator __pos, _Integer __n, _Integer __val, __true_type)= [inline]=, = [protected]= Definition at line *1655 of file stl_vector.h.

(const_iterator __position, value_type && __v)= [protected]= Definition at line 340 of file vector.tcc.

*std::vector*< _Tp, _Alloc >::_M_range_check (size_type __n) const= [inline]=, = [protected]= Safety check used only from at().

Definition at line 1070 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::size().

Referenced by std::vector< _Tp, _Alloc >::at().

template<typename _ForwardIterator > void std::vector*< _Tp, _Alloc >::_M_range_initialize (_ForwardIterator __first, _ForwardIterator __last, *std::forward_iterator_tag)= [inline]=, = [protected]= Definition at line 1577 of file stl_vector.h.

template<typename _InputIterator > void std::vector*< _Tp, _Alloc >::_M_range_initialize (_InputIterator __first, _InputIterator __last, *std::input_iterator_tag)= [inline]=, = [protected]= Definition at line 1558 of file stl_vector.h.

_ForwardIterator > void vector::_M_range_insert (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)= [protected]= Definition at line 721 of file vector.tcc.

_InputIterator > void vector::_M_range_insert (iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag)= [protected]= Definition at line 700 of file vector.tcc.

void vector::_M_realloc_insert (iterator __position, _Args &&… __args)= [protected]= Definition at line 426 of file vector.tcc.

vector::_M_shrink_to_fit= [protected]= Definition at line 687 of file vector.tcc.

size_type std::vector*< _Tp, _Alloc >::_S_check_init_len (size_type __n, const allocator_type & __a)= [inline]=, = [static]=, = [protected]= Definition at line *1767 of file stl_vector.h.

size_type std::vector*< _Tp, _Alloc >::_S_max_size (const _Tp_alloc_type & __a)= [inline]=, = [static]=, = [protected]=, = [noexcept]= Definition at line *1776 of file stl_vector.h.

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void *std::vector*< _Tp, _Alloc >::assign (_InputIterator __first, _InputIterator __last)= [inline]= Assigns a range to a vector.

Parameters

__first An input iterator.
__last An input iterator.

This function fills a vector with copies of the elements in the range [__first,__last).

Note that the assignment completely changes the vector and that the resulting vector’s size is the same as the number of elements assigned.

Definition at line 768 of file stl_vector.h.

*std::vector*< _Tp, _Alloc >::assign (*initializer_list*< value_type > __l)= [inline]= Assigns an initializer list to a vector.

Parameters

__l An initializer_list.

This function fills a vector with copies of the elements in the initializer list __l.

Note that the assignment completely changes the vector and that the resulting vector’s size is the same as the number of elements assigned.

Definition at line 794 of file stl_vector.h.

*std::vector*< _Tp, _Alloc >::assign (size_type __n, const value_type & __val)= [inline]= Assigns a given value to a vector.

Parameters

__n Number of elements to be assigned.
__val Value to be assigned.

This function fills a vector with __n 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.

Definition at line 749 of file stl_vector.h.

reference *std::vector*< _Tp, _Alloc >::at (size_type __n)= [inline]= Provides access to the data contained in the vector.

Parameters

__n The index of the element for which data should be accessed.

Returns

Read/write reference to data.

Exceptions

std::out_of_range If __n is an invalid index.

This function provides for safer data access. The parameter is first checked that it is in the range of the vector. The function throws out_of_range if the check fails.

Definition at line 1092 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::_M_range_check().

const_reference *std::vector*< _Tp, _Alloc >::at (size_type __n) const= [inline]= Provides access to the data contained in the vector.

Parameters

__n The index of the element for which data should be accessed.

Returns

Read-only (constant) reference to data.

Exceptions

std::out_of_range If __n is an invalid index.

This function provides for safer data access. The parameter is first checked that it is in the range of the vector. The function throws out_of_range if the check fails.

Definition at line 1110 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::_M_range_check().

const_reference *std::vector*< _Tp, _Alloc >::back () const= [inline]=, = [noexcept]= Returns a read-only (constant) reference to the data at the last element of the vector.

Definition at line 1154 of file stl_vector.h.

reference *std::vector*< _Tp, _Alloc >::back ()= [inline]=, = [noexcept]= Returns a read/write reference to the data at the last element of the vector.

Definition at line 1143 of file stl_vector.h.

const_iterator *std::vector*< _Tp, _Alloc >::begin () const= [inline]=, = [noexcept]= Returns a read-only (constant) iterator that points to the first element in the vector. Iteration is done in ordinary element order.

Definition at line 820 of file stl_vector.h.

iterator *std::vector*< _Tp, _Alloc >::begin ()= [inline]=, = [noexcept]= Returns a read/write iterator that points to the first element in the vector. Iteration is done in ordinary element order.

Definition at line 811 of file stl_vector.h.

Referenced by std::vector< _Tp, _Alloc >::vector(), std::match_results< _Bi_iter, _Alloc >::begin(), std::vector< _Tp, _Alloc >::crend(), std::vector< _Tp, _Alloc >::empty(), std::vector< _Tp, _Alloc >::erase(), std::vector< _Tp, _Alloc >::insert(), std::operator<(), std::operator==(), and std::vector< _Tp, _Alloc >::rend().

size_type *std::vector*< _Tp, _Alloc >::capacity () const= [inline]=, = [noexcept]= Returns the total number of elements that the vector can hold before needing to allocate more memory.

Definition at line 998 of file stl_vector.h.

const_iterator *std::vector*< _Tp, _Alloc >::cbegin () const= [inline]=, = [noexcept]= Returns a read-only (constant) iterator that points to the first element in the vector. Iteration is done in ordinary element order.

Definition at line 884 of file stl_vector.h.

Referenced by std::vector< _Tp, _Alloc >::erase(), and std::vector< _Tp, _Alloc >::insert().

const_iterator *std::vector*< _Tp, _Alloc >::cend () const= [inline]=, = [noexcept]= Returns a read-only (constant) iterator that points one past the last element in the vector. Iteration is done in ordinary element order.

Definition at line 893 of file stl_vector.h.

*std::vector*< _Tp, _Alloc >::clear ()= [inline]=, = [noexcept]= 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.

Definition at line 1498 of file stl_vector.h.

const_reverse_iterator *std::vector*< _Tp, _Alloc >::crbegin () const= [inline]=, = [noexcept]= Returns a read-only (constant) reverse iterator that points to the last element in the vector. Iteration is done in reverse element order.

Definition at line 902 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::end().

const_reverse_iterator *std::vector*< _Tp, _Alloc >::crend () const= [inline]=, = [noexcept]= 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.

Definition at line 911 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin().

_Tp * std::vector*< _Tp, _Alloc >::data () const= [inline]=, = [noexcept]= Definition at line *1172 of file stl_vector.h.

*std::vector*< _Tp, _Alloc >::data ()= [inline]=, = [noexcept]= Returns a pointer such that [data(), data() + size()) is a valid range. For a non-empty vector, data() == &front().

Definition at line 1168 of file stl_vector.h.

Referenced by std::regex_traits< _Ch_type >::transform_primary().

template<typename… _Args> iterator *std::vector*< _Tp, _Alloc >::emplace (const_iterator __position, _Args &&… __args)= [inline]= Inserts an object in vector before specified iterator.

Parameters

__position A const_iterator into the vector.
__args Arguments.

Returns

An iterator that points to the inserted data.

This function will insert an object of type T constructed with T(std::forward<Args>(args)…) before the specified location. Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list.

Definition at line 1248 of file stl_vector.h.

vector*< _Tp, _Alloc >::reference vector::emplace_back (_Args &&… __args) Definition at line *109 of file vector.tcc.

*std::vector*< _Tp, _Alloc >::empty () const= [inline]=, = [noexcept]= Returns true if the vector is empty. (Thus begin() would equal end().)

Definition at line 1007 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::end().

Referenced by std::match_results< _Bi_iter, _Alloc >::ready(), and std::match_results< _Bi_iter, _Alloc >::size().

const_iterator *std::vector*< _Tp, _Alloc >::end () const= [inline]=, = [noexcept]= Returns a read-only (constant) iterator that points one past the last element in the vector. Iteration is done in ordinary element order.

Definition at line 838 of file stl_vector.h.

iterator *std::vector*< _Tp, _Alloc >::end ()= [inline]=, = [noexcept]= Returns a read/write iterator that points one past the last element in the vector. Iteration is done in ordinary element order.

Definition at line 829 of file stl_vector.h.

Referenced by std::vector< _Tp, _Alloc >::vector(), std::vector< _Tp, _Alloc >::crbegin(), std::vector< _Tp, _Alloc >::empty(), std::match_results< _Bi_iter, _Alloc >::end(), std::operator<(), std::operator==(), std::vector< _Tp, _Alloc >::rbegin(), and std::vector< _Tp, _Alloc >::resize().

iterator *std::vector*< _Tp, _Alloc >::erase (const_iterator __first, const_iterator __last)= [inline]= Remove a range of elements.

Parameters

__first Iterator pointing to the first element to be erased.
__last Iterator pointing to one past the last element to be erased.

Returns

An iterator pointing to the element pointed to by __last prior to erasing (or end()).

This function will erase the elements in the range [__first,__last) and shorten the vector accordingly.

Note This operation could be expensive and if it is frequently used the user should consider using std::list. The user is also cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user’s responsibility.

Definition at line 1457 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().

iterator *std::vector*< _Tp, _Alloc >::erase (const_iterator __position)= [inline]= Remove element at given position.

Parameters

__position Iterator pointing to element to be erased.

Returns

An iterator pointing to the next element (or end()).

This function will erase the element at the given position and thus shorten the vector by one.

Note This operation could be expensive and if it is frequently used the user should consider using std::list. The user is also cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user’s responsibility.

Definition at line 1430 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().

const_reference *std::vector*< _Tp, _Alloc >::front () const= [inline]=, = [noexcept]= Returns a read-only (constant) reference to the data at the first element of the vector.

Definition at line 1132 of file stl_vector.h.

reference *std::vector*< _Tp, _Alloc >::front ()= [inline]=, = [noexcept]= Returns a read/write reference to the data at the first element of the vector.

Definition at line 1121 of file stl_vector.h.

allocator_type *std::_Vector_base*< _Tp, _Alloc >::get_allocator () const= [inline]=, = [noexcept]= Get a copy of the memory allocation object.

Definition at line 284 of file stl_vector.h.

Referenced by std::match_results< _Bi_iter, _Alloc >::get_allocator().

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> iterator *std::vector*< _Tp, _Alloc >::insert (const_iterator __position, _InputIterator __first, _InputIterator __last)= [inline]= Inserts a range into the vector.

Parameters

__position A const_iterator into the vector.
__first An input iterator.
__last An input iterator.

Returns

An iterator that points to the inserted data.

This function will insert copies of the data in the range [__first,__last) into the vector before the location specified by pos.

Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list.

Definition at line 1379 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().

>::iterator vector::insert (const_iterator __position, const value_type & __x) Inserts given value into vector before specified iterator.

Parameters

__position A const_iterator into the vector.
__x Data to be inserted.

Returns

An iterator that points to the inserted data.

This function will insert a copy of the given value before the specified location. Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list.

Definition at line 130 of file vector.tcc.

References std::begin(), and std::end().

iterator *std::vector*< _Tp, _Alloc >::insert (const_iterator __position, *initializer_list*< value_type > __l)= [inline]= Inserts an initializer_list into the vector.

Parameters

__position An iterator into the vector.
__l An initializer_list.

This function will insert copies of the data in the initializer_list l into the vector before the location specified by position.

Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list.

Definition at line 1310 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().

iterator *std::vector*< _Tp, _Alloc >::insert (const_iterator __position, size_type __n, const value_type & __x)= [inline]= Inserts a number of copies of given data into the vector.

Parameters

__position A const_iterator into the vector.
__n Number of elements to be inserted.
__x Data to be inserted.

Returns

An iterator that points to the inserted data.

This function will insert a specified number of copies of the given data before the location specified by position.

Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list.

Definition at line 1335 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().

iterator *std::vector*< _Tp, _Alloc >::insert (const_iterator __position, value_type && __x)= [inline]= Inserts given rvalue into vector before specified iterator.

Parameters

__position A const_iterator into the vector.
__x Data to be inserted.

Returns

An iterator that points to the inserted data.

This function will insert a copy of the given rvalue before the specified location. Note that this kind of operation could be expensive for a vector and if it is frequently used the user should consider using std::list.

Definition at line 1293 of file stl_vector.h.

References std::move().

size_type *std::vector*< _Tp, _Alloc >::max_size () const= [inline]=, = [noexcept]= Returns the size() of the largest possible vector.

Definition at line 923 of file stl_vector.h.

Referenced by std::match_results< _Bi_iter, _Alloc >::max_size().

vector::operator= (const *vector*< _Tp, _Alloc > & __x) Vector assignment operator.

Parameters

__x A vector of identical element and allocator types.

All the elements of __x are copied, but any unused capacity in __x will not be copied.

Whether the allocator is copied depends on the allocator traits.

Definition at line 198 of file vector.tcc.

vector & *std::vector*< _Tp, _Alloc >::operator= (*initializer_list*< value_type > __l)= [inline]= Vector list assignment operator.

Parameters

__l An initializer_list.

This function fills a vector with copies of the elements in the initializer list __l.

Note that the assignment completely changes the vector and that the resulting vector’s size is the same as the number of elements assigned.

Definition at line 730 of file stl_vector.h.

vector & *std::vector*< _Tp, _Alloc >::operator= (*vector*< _Tp, _Alloc > && __x)= [inline]=, = [noexcept]= Vector move assignment operator.

Parameters

__x A vector of identical element and allocator types.

The contents of __x are moved into this vector (without copying, if the allocators permit it). Afterwards __x is a valid, but unspecified vector.

Whether the allocator is moved depends on the allocator traits.

Definition at line 709 of file stl_vector.h.

References std::move().

const_reference *std::vector*< _Tp, _Alloc >::operator[] (size_type __n) const= [inline]=, = [noexcept]= Subscript access to the data contained in the vector.

Parameters

__n The index of the element for which data should be accessed.

Returns

Read-only (constant) reference to data.

This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().)

Definition at line 1061 of file stl_vector.h.

reference *std::vector*< _Tp, _Alloc >::operator[] (size_type __n)= [inline]=, = [noexcept]= Subscript access to the data contained in the vector.

Parameters

__n The index of the element for which data should be accessed.

Returns

Read/write reference to data.

This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().)

Definition at line 1043 of file stl_vector.h.

*std::vector*< _Tp, _Alloc >::pop_back ()= [inline]=, = [noexcept]= Removes last element. This is a typical stack operation. It shrinks the vector by one.

Note that no data is returned, and if the last element’s data is needed, it should be retrieved before pop_back() is called.

Definition at line 1225 of file stl_vector.h.

*std::vector*< _Tp, _Alloc >::push_back (const value_type & __x)= [inline]= Add data to the end of the vector.

Parameters

__x Data to be added.

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.

Definition at line 1187 of file stl_vector.h.

std::vector*< _Tp, _Alloc >::push_back (value_type && __x)= [inline]= Definition at line *1203 of file stl_vector.h.

const_reverse_iterator *std::vector*< _Tp, _Alloc >::rbegin () const= [inline]=, = [noexcept]= Returns a read-only (constant) reverse iterator that points to the last element in the vector. Iteration is done in reverse element order.

Definition at line 856 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::end().

reverse_iterator *std::vector*< _Tp, _Alloc >::rbegin ()= [inline]=, = [noexcept]= Returns a read/write reverse iterator that points to the last element in the vector. Iteration is done in reverse element order.

Definition at line 847 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::end().

const_reverse_iterator *std::vector*< _Tp, _Alloc >::rend () const= [inline]=, = [noexcept]= 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.

Definition at line 874 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin().

reverse_iterator *std::vector*< _Tp, _Alloc >::rend ()= [inline]=, = [noexcept]= Returns a read/write reverse iterator that points to one before the first element in the vector. Iteration is done in reverse element order.

Definition at line 865 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::begin().

(size_type __n) Attempt to preallocate enough memory for specified number of elements.

Parameters

__n Number of elements required.

Exceptions

std::length_error If n exceeds max_size().

This function attempts to reserve enough memory for the vector to hold the specified number of elements. If the number requested is more than max_size(), length_error is thrown.

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.

Definition at line 66 of file vector.tcc.

*std::vector*< _Tp, _Alloc >::resize (size_type __new_size)= [inline]= Resizes the vector to the specified number of elements.

Parameters

__new_size Number of elements the vector should contain.

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.

Definition at line 937 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::size().

Referenced by __gnu_parallel::__shrink_and_double().

*std::vector*< _Tp, _Alloc >::resize (size_type __new_size, const value_type & __x)= [inline]= Resizes the vector to the specified number of elements.

Parameters

__new_size Number of elements the vector should contain.
__x Data with which new elements should be populated.

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.

Definition at line 957 of file stl_vector.h.

References std::vector< _Tp, _Alloc >::end(), and std::vector< _Tp, _Alloc >::size().

*std::vector*< _Tp, _Alloc >::shrink_to_fit ()= [inline]= A non-binding request to reduce capacity() to size().

Definition at line 989 of file stl_vector.h.

size_type *std::vector*< _Tp, _Alloc >::size () const= [inline]=, = [noexcept]= Returns the number of elements in the vector.

Definition at line 918 of file stl_vector.h.

Referenced by __gnu_parallel::__shrink(), __gnu_parallel::__shrink_and_double(), std::vector< _Tp, _Alloc >::_M_range_check(), __gnu_parallel::list_partition(), std::operator==(), std::vector< _Tp, _Alloc >::resize(), std::match_results< _Bi_iter, _Alloc >::size(), and std::regex_traits< _Ch_type >::transform_primary().

*std::vector*< _Tp, _Alloc >::swap (*vector*< _Tp, _Alloc > & __x)= [inline]=, = [noexcept]= Swaps data with another vector.

Parameters

__x A vector of the same element and allocator types.

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.

Whether the allocators are swapped depends on the allocator traits.

Definition at line 1480 of file stl_vector.h.

Referenced by std::match_results< _Bi_iter, _Alloc >::swap().

_Vector_impl std::_Vector_base*< _Tp, _Alloc >::_M_impl= [protected]= Definition at line *340 of file stl_vector.h.