libstdc++
std::vector< _Tp, _Alloc > Class Template Reference

#include <vector>

Inheritance diagram for std::vector< _Tp, _Alloc >:
[legend]

Public Types

typedef _Alloc allocator_type
typedef __gnu_cxx::__normal_iterator< const_pointer, vectorconst_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, vectoriterator
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

Public Member Functions

 vector ()=default
template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>
constexpr vector (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())
constexpr vector (const allocator_type &__a) noexcept
constexpr vector (const vector &__x)
constexpr vector (const vector &__x, const __type_identity_t< allocator_type > &__a)
constexpr vector (initializer_list< value_type > __l, const allocator_type &__a=allocator_type())
constexpr vector (size_type __n, const allocator_type &__a=allocator_type())
constexpr vector (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())
 vector (vector &&) noexcept=default
constexpr vector (vector &&__rv, const __type_identity_t< allocator_type > &__m) noexcept(noexcept(vector(std::declval< vector && >(), std::declval< const allocator_type & >(), std::declval< typename _Alloc_traits::is_always_equal >())))
constexpr ~vector () noexcept
template<typename... _Args>
constexpr auto _M_emplace_aux (const_iterator __position, _Args &&... __args) -> iterator
template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>
constexpr void assign (_InputIterator __first, _InputIterator __last)
constexpr void assign (initializer_list< value_type > __l)
constexpr void assign (size_type __n, const value_type &__val)
constexpr reference at (size_type __n)
constexpr const_reference at (size_type __n) const
constexpr const_reference back () const noexcept
constexpr reference back () noexcept
constexpr const_iterator begin () const noexcept
constexpr iterator begin () noexcept
constexpr size_type capacity () const noexcept
constexpr const_iterator cbegin () const noexcept
constexpr const_iterator cend () const noexcept
constexpr void clear () noexcept
constexpr const_reverse_iterator crbegin () const noexcept
constexpr const_reverse_iterator crend () const noexcept
constexpr const _Tp * data () const noexcept
constexpr _Tp * data () noexcept
template<typename... _Args>
constexpr iterator emplace (const_iterator __position, _Args &&... __args)
template<typename... _Args>
constexpr reference emplace_back (_Args &&... __args)
constexpr bool empty () const noexcept
constexpr const_iterator end () const noexcept
constexpr iterator end () noexcept
constexpr iterator erase (const_iterator __first, const_iterator __last)
constexpr iterator erase (const_iterator __position)
constexpr const_reference front () const noexcept
constexpr reference front () noexcept
constexpr allocator_type get_allocator () const noexcept
template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>
constexpr iterator insert (const_iterator __position, _InputIterator __first, _InputIterator __last)
constexpr iterator insert (const_iterator __position, const value_type &__x)
constexpr iterator insert (const_iterator __position, initializer_list< value_type > __l)
constexpr iterator insert (const_iterator __position, size_type __n, const value_type &__x)
constexpr iterator insert (const_iterator __position, value_type &&__x)
constexpr size_type max_size () const noexcept
constexpr vectoroperator= (const vector &__x)
constexpr vectoroperator= (initializer_list< value_type > __l)
constexpr vectoroperator= (vector &&__x) noexcept(_Alloc_traits::_S_nothrow_move())
constexpr const_reference operator[] (size_type __n) const noexcept
constexpr reference operator[] (size_type __n) noexcept
constexpr void pop_back () noexcept
constexpr void push_back (const value_type &__x)
constexpr void push_back (value_type &&__x)
constexpr const_reverse_iterator rbegin () const noexcept
constexpr reverse_iterator rbegin () noexcept
constexpr const_reverse_iterator rend () const noexcept
constexpr reverse_iterator rend () noexcept
constexpr void reserve (size_type __n)
constexpr void resize (size_type __new_size)
constexpr void resize (size_type __new_size, const value_type &__x)
constexpr void shrink_to_fit ()
constexpr size_type size () const noexcept
constexpr void swap (vector &__x) noexcept

Protected Member Functions

constexpr pointer _M_allocate (size_t __n)
template<typename _ForwardIterator>
constexpr pointer _M_allocate_and_copy (size_type __n, _ForwardIterator __first, _ForwardIterator __last)
template<typename _ForwardIterator>
constexpr void _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)
template<typename _InputIterator>
constexpr void _M_assign_aux (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)
template<typename _InputIterator>
constexpr void _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
template<typename _Integer>
constexpr void _M_assign_dispatch (_Integer __n, _Integer __val, __true_type)
constexpr size_type _M_check_len (size_type __n, const char *__s) const
constexpr void _M_create_storage (size_t __n)
constexpr void _M_deallocate (pointer __p, size_t __n)
constexpr void _M_default_append (size_type __n)
constexpr void _M_default_initialize (size_type __n)
template<typename... _Args>
constexpr iterator _M_emplace_aux (const_iterator __position, _Args &&... __args)
constexpr iterator _M_emplace_aux (const_iterator __position, value_type &&__v)
constexpr iterator _M_erase (iterator __first, iterator __last)
constexpr iterator _M_erase (iterator __position)
constexpr void _M_erase_at_end (pointer __pos) noexcept
constexpr void _M_fill_assign (size_type __n, const value_type &__val)
constexpr void _M_fill_initialize (size_type __n, const value_type &__value)
constexpr void _M_fill_insert (iterator __pos, size_type __n, const value_type &__x)
constexpr const _Tp_alloc_type & _M_get_Tp_allocator () const noexcept
constexpr _Tp_alloc_type & _M_get_Tp_allocator () noexcept
template<typename _Arg>
constexpr void _M_insert_aux (iterator __position, _Arg &&__arg)
template<typename _InputIterator>
constexpr void _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)
template<typename _Integer>
constexpr void _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __val, __true_type)
constexpr iterator _M_insert_rval (const_iterator __position, value_type &&__v)
constexpr void _M_range_check (size_type __n) const
template<typename _ForwardIterator>
constexpr void _M_range_initialize (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)
template<typename _InputIterator>
constexpr void _M_range_initialize (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)
template<typename _Iterator, typename _Sentinel>
constexpr void _M_range_initialize_n (_Iterator __first, _Sentinel __last, size_type __n)
template<typename _ForwardIterator>
constexpr void _M_range_insert (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)
template<typename _InputIterator>
constexpr void _M_range_insert (iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag)
template<typename... _Args>
constexpr void _M_realloc_append (_Args &&... __args)
template<typename... _Args>
constexpr void _M_realloc_insert (iterator __position, _Args &&... __args)
constexpr bool _M_shrink_to_fit ()

Static Protected Member Functions

static constexpr size_type _S_check_init_len (size_type __n, const allocator_type &__a)
static constexpr size_type _S_max_size (const _Tp_alloc_type &__a) noexcept

Protected Attributes

_Vector_impl _M_impl

Detailed Description

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.

Since
C++98
Template Parameters
_TpType of element.
_AllocAllocator 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 458 of file stl_vector.h.

Member Typedef Documentation

◆ allocator_type

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef _Alloc std::vector< _Tp, _Alloc >::allocator_type

Definition at line 495 of file stl_vector.h.

◆ const_iterator

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef __gnu_cxx::__normal_iterator<const_pointer, vector> std::vector< _Tp, _Alloc >::const_iterator

Definition at line 490 of file stl_vector.h.

◆ const_pointer

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef _Alloc_traits::const_pointer std::vector< _Tp, _Alloc >::const_pointer

Definition at line 485 of file stl_vector.h.

◆ const_reference

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef _Alloc_traits::const_reference std::vector< _Tp, _Alloc >::const_reference

Definition at line 487 of file stl_vector.h.

◆ const_reverse_iterator

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef std::reverse_iterator<const_iterator> std::vector< _Tp, _Alloc >::const_reverse_iterator

Definition at line 491 of file stl_vector.h.

◆ difference_type

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef ptrdiff_t std::vector< _Tp, _Alloc >::difference_type

Definition at line 494 of file stl_vector.h.

◆ iterator

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef __gnu_cxx::__normal_iterator<pointer, vector> std::vector< _Tp, _Alloc >::iterator

Definition at line 488 of file stl_vector.h.

◆ pointer

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef _Base::pointer std::vector< _Tp, _Alloc >::pointer

Definition at line 484 of file stl_vector.h.

◆ reference

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef _Alloc_traits::reference std::vector< _Tp, _Alloc >::reference

Definition at line 486 of file stl_vector.h.

◆ reverse_iterator

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef std::reverse_iterator<iterator> std::vector< _Tp, _Alloc >::reverse_iterator

Definition at line 492 of file stl_vector.h.

◆ size_type

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef size_t std::vector< _Tp, _Alloc >::size_type

Definition at line 493 of file stl_vector.h.

◆ value_type

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
typedef _Tp std::vector< _Tp, _Alloc >::value_type

Definition at line 483 of file stl_vector.h.

Constructor & Destructor Documentation

◆ vector() [1/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( )
default

Creates a vector with no elements.

Referenced by insert(), and operator=().

◆ vector() [2/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( const allocator_type & __a)
inlineexplicitconstexprnoexcept

Creates a vector with no elements.

Parameters
__aAn allocator object.

Definition at line 572 of file stl_vector.h.

◆ vector() [3/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( size_type __n,
const allocator_type & __a = allocator_type() )
inlineexplicitconstexpr

Creates a vector with default constructed elements.

Parameters
__nThe number of elements to initially create.
__aAn allocator.

This constructor fills the vector with __n default constructed elements.

Definition at line 586 of file stl_vector.h.

◆ vector() [4/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( size_type __n,
const value_type & __value,
const allocator_type & __a = allocator_type() )
inlineconstexpr

Creates a vector with copies of an exemplar element.

Parameters
__nThe number of elements to initially create.
__valueAn element to copy.
__aAn allocator.

This constructor fills the vector with __n copies of __value.

Definition at line 599 of file stl_vector.h.

◆ vector() [5/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( const vector< _Tp, _Alloc > & __x)
inlineconstexpr

Vector copy constructor.

Parameters
__xA 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 631 of file stl_vector.h.

◆ vector() [6/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( vector< _Tp, _Alloc > && )
defaultnoexcept

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.

◆ vector() [7/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( const vector< _Tp, _Alloc > & __x,
const __type_identity_t< allocator_type > & __a )
inlineconstexpr

Copy constructor with alternative allocator.

Definition at line 654 of file stl_vector.h.

◆ vector() [8/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( vector< _Tp, _Alloc > && __rv,
const __type_identity_t< allocator_type > & __m )
inlineconstexprnoexcept

Move constructor with alternative allocator.

Definition at line 689 of file stl_vector.h.

◆ vector() [9/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::vector ( initializer_list< value_type > __l,
const allocator_type & __a = allocator_type() )
inlineconstexpr

Builds a vector from an initializer list.

Parameters
__lAn initializer_list.
__aAn 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 708 of file stl_vector.h.

◆ vector() [10/10]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>
std::vector< _Tp, _Alloc >::vector ( _InputIterator __first,
_InputIterator __last,
const allocator_type & __a = allocator_type() )
inlineconstexpr

Builds a vector from a range.

Parameters
__firstAn input iterator.
__lastAn input iterator.
__aAn 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 736 of file stl_vector.h.

◆ ~vector()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
std::vector< _Tp, _Alloc >::~vector ( )
inlineconstexprnoexcept

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 800 of file stl_vector.h.

Member Function Documentation

◆ _M_allocate()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
pointer std::_Vector_base< _Tp, _Alloc >::_M_allocate ( size_t __n)
inlineconstexprprotected

Definition at line 384 of file stl_vector.h.

◆ _M_allocate_and_copy()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _ForwardIterator>
pointer std::vector< _Tp, _Alloc >::_M_allocate_and_copy ( size_type __n,
_ForwardIterator __first,
_ForwardIterator __last )
inlineconstexprprotected

Memory expansion handler. Uses the member allocation function to obtain n bytes of memory, and then copies [first,last) into it.

Definition at line 1907 of file stl_vector.h.

Referenced by operator=(), and reserve().

◆ _M_assign_aux() [1/2]

template<typename _Tp, typename _Alloc>
template<typename _ForwardIterator>
void vector::_M_assign_aux ( _ForwardIterator __first,
_ForwardIterator __last,
std::forward_iterator_tag  )
constexprprotected

Definition at line 318 of file vector.tcc.

◆ _M_assign_aux() [2/2]

template<typename _Tp, typename _Alloc>
template<typename _InputIterator>
void vector::_M_assign_aux ( _InputIterator __first,
_InputIterator __last,
std::input_iterator_tag  )
constexprprotected

Definition at line 299 of file vector.tcc.

◆ _M_assign_dispatch() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _InputIterator>
void std::vector< _Tp, _Alloc >::_M_assign_dispatch ( _InputIterator __first,
_InputIterator __last,
__false_type  )
inlineconstexprprotected

Definition at line 2032 of file stl_vector.h.

◆ _M_assign_dispatch() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _Integer>
void std::vector< _Tp, _Alloc >::_M_assign_dispatch ( _Integer __n,
_Integer __val,
__true_type  )
inlineconstexprprotected

Definition at line 2025 of file stl_vector.h.

◆ _M_check_len()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
size_type std::vector< _Tp, _Alloc >::_M_check_len ( size_type __n,
const char * __s ) const
inlineconstexprprotected

Definition at line 2196 of file stl_vector.h.

◆ _M_create_storage()

template<typename _Tp, typename _Alloc>
void std::_Vector_base< _Tp, _Alloc >::_M_create_storage ( size_t __n)
inlineconstexprprotectedinherited

Definition at line 403 of file stl_vector.h.

◆ _M_deallocate()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::_Vector_base< _Tp, _Alloc >::_M_deallocate ( pointer __p,
size_t __n )
inlineconstexprprotected

Definition at line 392 of file stl_vector.h.

◆ _M_default_append()

template<typename _Tp, typename _Alloc>
void vector::_M_default_append ( size_type __n)
constexprprotected

Definition at line 757 of file vector.tcc.

◆ _M_default_initialize()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::_M_default_initialize ( size_type __n)
inlineconstexprprotected

Definition at line 2007 of file stl_vector.h.

◆ _M_emplace_aux() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename... _Args>
auto std::vector< _Tp, _Alloc >::_M_emplace_aux ( const_iterator __position,
_Args &&... __args ) -> iterator
constexpr

Definition at line 388 of file vector.tcc.

◆ _M_emplace_aux() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
iterator std::vector< _Tp, _Alloc >::_M_emplace_aux ( const_iterator __position,
value_type && __v )
inlineconstexprprotected

Definition at line 2189 of file stl_vector.h.

◆ _M_erase() [1/2]

template<typename _Tp, typename _Alloc>
vector< _Tp, _Alloc >::iterator vector::_M_erase ( iterator __first,
iterator __last )
constexprprotected

Definition at line 195 of file vector.tcc.

◆ _M_erase() [2/2]

template<typename _Tp, typename _Alloc>
vector< _Tp, _Alloc >::iterator vector::_M_erase ( iterator __position)
constexprprotected

Definition at line 181 of file vector.tcc.

◆ _M_erase_at_end()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::_M_erase_at_end ( pointer __pos)
inlineconstexprprotectednoexcept

Definition at line 2233 of file stl_vector.h.

◆ _M_fill_assign()

template<typename _Tp, typename _Alloc>
void vector::_M_fill_assign ( size_type __n,
const value_type & __val )
constexprprotected

Definition at line 270 of file vector.tcc.

◆ _M_fill_initialize()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::_M_fill_initialize ( size_type __n,
const value_type & __value )
inlineconstexprprotected

Definition at line 1996 of file stl_vector.h.

◆ _M_fill_insert()

template<typename _Tp, typename _Alloc>
void vector::_M_fill_insert ( iterator __pos,
size_type __n,
const value_type & __x )
constexprprotected

Definition at line 652 of file vector.tcc.

◆ _M_get_Tp_allocator() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const _Tp_alloc_type & std::_Vector_base< _Tp, _Alloc >::_M_get_Tp_allocator ( ) const
inlineconstexprprotectednoexcept

Definition at line 312 of file stl_vector.h.

◆ _M_get_Tp_allocator() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
_Tp_alloc_type & std::_Vector_base< _Tp, _Alloc >::_M_get_Tp_allocator ( )
inlineconstexprprotectednoexcept

Definition at line 307 of file stl_vector.h.

◆ _M_insert_aux()

template<typename _Tp, typename _Alloc>
template<typename _Arg>
void vector::_M_insert_aux ( iterator __position,
_Arg && __arg )
constexprprotected

Definition at line 420 of file vector.tcc.

◆ _M_insert_dispatch() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _InputIterator>
void std::vector< _Tp, _Alloc >::_M_insert_dispatch ( iterator __pos,
_InputIterator __first,
_InputIterator __last,
__false_type  )
inlineconstexprprotected

Definition at line 2073 of file stl_vector.h.

◆ _M_insert_dispatch() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _Integer>
void std::vector< _Tp, _Alloc >::_M_insert_dispatch ( iterator __pos,
_Integer __n,
_Integer __val,
__true_type  )
inlineconstexprprotected

Definition at line 2065 of file stl_vector.h.

◆ _M_insert_rval()

template<typename _Tp, typename _Alloc>
auto vector::_M_insert_rval ( const_iterator __position,
value_type && __v )
constexprprotected

Definition at line 363 of file vector.tcc.

◆ _M_range_check()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::_M_range_check ( size_type __n) const
inlineconstexprprotected

Safety check used only from at().

Definition at line 1290 of file stl_vector.h.

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

◆ _M_range_initialize() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _ForwardIterator>
void std::vector< _Tp, _Alloc >::_M_range_initialize ( _ForwardIterator __first,
_ForwardIterator __last,
std::forward_iterator_tag  )
inlineconstexprprotected

Definition at line 1971 of file stl_vector.h.

◆ _M_range_initialize() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _InputIterator>
void std::vector< _Tp, _Alloc >::_M_range_initialize ( _InputIterator __first,
_InputIterator __last,
std::input_iterator_tag  )
inlineconstexprprotected

Definition at line 1951 of file stl_vector.h.

◆ _M_range_initialize_n()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _Iterator, typename _Sentinel>
void std::vector< _Tp, _Alloc >::_M_range_initialize_n ( _Iterator __first,
_Sentinel __last,
size_type __n )
inlineconstexprprotected

Definition at line 1981 of file stl_vector.h.

◆ _M_range_insert() [1/2]

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

Definition at line 885 of file vector.tcc.

◆ _M_range_insert() [2/2]

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

Definition at line 863 of file vector.tcc.

◆ _M_realloc_append()

template<typename _Tp, typename _Alloc>
template<typename... _Args>
void vector::_M_realloc_append ( _Args &&... __args)
constexprprotected

Definition at line 557 of file vector.tcc.

◆ _M_realloc_insert()

template<typename _Tp, typename _Alloc>
template<typename... _Args>
void vector::_M_realloc_insert ( iterator __position,
_Args &&... __args )
constexprprotected

Definition at line 452 of file vector.tcc.

◆ _M_shrink_to_fit()

template<typename _Tp, typename _Alloc>
bool vector::_M_shrink_to_fit ( )
constexprprotected

Definition at line 849 of file vector.tcc.

◆ _S_check_init_len()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
constexpr size_type std::vector< _Tp, _Alloc >::_S_check_init_len ( size_type __n,
const allocator_type & __a )
inlinestaticconstexprprotected

Definition at line 2207 of file stl_vector.h.

◆ _S_max_size()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
constexpr size_type std::vector< _Tp, _Alloc >::_S_max_size ( const _Tp_alloc_type & __a)
inlinestaticconstexprprotectednoexcept

Definition at line 2216 of file stl_vector.h.

◆ assign() [1/3]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>
void std::vector< _Tp, _Alloc >::assign ( _InputIterator __first,
_InputIterator __last )
inlineconstexpr

Assigns a range to a vector.

Parameters
__firstAn input iterator.
__lastAn 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 895 of file stl_vector.h.

◆ assign() [2/3]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::assign ( initializer_list< value_type > __l)
inlineconstexpr

Assigns an initializer list to a vector.

Parameters
__lAn 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 922 of file stl_vector.h.

◆ assign() [3/3]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::assign ( size_type __n,
const value_type & __val )
inlineconstexpr

Assigns a given value to a vector.

Parameters
__nNumber of elements to be assigned.
__valValue 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 875 of file stl_vector.h.

◆ at() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
reference std::vector< _Tp, _Alloc >::at ( size_type __n)
inlinenodiscardconstexpr

Provides access to the data contained in the vector.

Parameters
__nThe index of the element for which data should be accessed.
Returns
Read/write reference to data.
Exceptions
std::out_of_rangeIf __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 1313 of file stl_vector.h.

◆ at() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reference std::vector< _Tp, _Alloc >::at ( size_type __n) const
inlinenodiscardconstexpr

Provides access to the data contained in the vector.

Parameters
__nThe index of the element for which data should be accessed.
Returns
Read-only (constant) reference to data.
Exceptions
std::out_of_rangeIf __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 1332 of file stl_vector.h.

◆ back() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reference std::vector< _Tp, _Alloc >::back ( ) const
inlinenodiscardconstexprnoexcept

Returns a read-only (constant) reference to the data at the last element of the vector.

Definition at line 1380 of file stl_vector.h.

◆ back() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
reference std::vector< _Tp, _Alloc >::back ( )
inlinenodiscardconstexprnoexcept

Returns a read/write reference to the data at the last element of the vector.

Definition at line 1368 of file stl_vector.h.

◆ begin() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_iterator std::vector< _Tp, _Alloc >::begin ( ) const
inlinenodiscardconstexprnoexcept

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 1008 of file stl_vector.h.

◆ begin() [2/2]

◆ capacity()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
size_type std::vector< _Tp, _Alloc >::capacity ( ) const
inlinenodiscardconstexprnoexcept

Returns the total number of elements that the vector can hold before needing to allocate more memory.

Definition at line 1208 of file stl_vector.h.

Referenced by operator=(), and reserve().

◆ cbegin()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_iterator std::vector< _Tp, _Alloc >::cbegin ( ) const
inlineconstexprnoexcept

◆ cend()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_iterator std::vector< _Tp, _Alloc >::cend ( ) const
inlineconstexprnoexcept

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 1089 of file stl_vector.h.

◆ clear()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::clear ( )
inlineconstexprnoexcept

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 1863 of file stl_vector.h.

Referenced by operator=().

◆ crbegin()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reverse_iterator std::vector< _Tp, _Alloc >::crbegin ( ) const
inlineconstexprnoexcept

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 1099 of file stl_vector.h.

◆ crend()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reverse_iterator std::vector< _Tp, _Alloc >::crend ( ) const
inlineconstexprnoexcept

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 1109 of file stl_vector.h.

◆ data() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const _Tp * std::vector< _Tp, _Alloc >::data ( ) const
inlinenodiscardconstexprnoexcept

Definition at line 1400 of file stl_vector.h.

◆ data() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
_Tp * std::vector< _Tp, _Alloc >::data ( )
inlinenodiscardconstexprnoexcept

Returns a pointer such that [data(), data() + size()) is a valid range. For a non-empty vector, data() == &front().

Definition at line 1395 of file stl_vector.h.

◆ emplace()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename... _Args>
iterator std::vector< _Tp, _Alloc >::emplace ( const_iterator __position,
_Args &&... __args )
inlineconstexpr

Inserts an object in vector before specified iterator.

Parameters
__positionA const_iterator into the vector.
__argsArguments.
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 1481 of file stl_vector.h.

◆ emplace_back()

template<typename _Tp, typename _Alloc>
template<typename... _Args>
vector< _Tp, _Alloc >::reference vector::emplace_back ( _Args &&... __args)
constexpr

Definition at line 111 of file vector.tcc.

◆ empty()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
bool std::vector< _Tp, _Alloc >::empty ( ) const
inlinenodiscardconstexprnoexcept

◆ end() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_iterator std::vector< _Tp, _Alloc >::end ( ) const
inlinenodiscardconstexprnoexcept

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 1028 of file stl_vector.h.

◆ end() [2/2]

◆ erase() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
iterator std::vector< _Tp, _Alloc >::erase ( const_iterator __first,
const_iterator __last )
inlineconstexpr

Remove a range of elements.

Parameters
__firstIterator pointing to the first element to be erased.
__lastIterator 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 1820 of file stl_vector.h.

◆ erase() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
iterator std::vector< _Tp, _Alloc >::erase ( const_iterator __position)
inlineconstexpr

Remove element at given position.

Parameters
__positionIterator 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 1792 of file stl_vector.h.

◆ front() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reference std::vector< _Tp, _Alloc >::front ( ) const
inlinenodiscardconstexprnoexcept

Returns a read-only (constant) reference to the data at the first element of the vector.

Definition at line 1356 of file stl_vector.h.

◆ front() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
reference std::vector< _Tp, _Alloc >::front ( )
inlinenodiscardconstexprnoexcept

Returns a read/write reference to the data at the first element of the vector.

Definition at line 1344 of file stl_vector.h.

◆ get_allocator()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
allocator_type std::_Vector_base< _Tp, _Alloc >::get_allocator ( ) const
inlineconstexprnoexcept

Get a copy of the memory allocation object.

Definition at line 317 of file stl_vector.h.

References get_allocator().

Referenced by get_allocator().

◆ insert() [1/5]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>
iterator std::vector< _Tp, _Alloc >::insert ( const_iterator __position,
_InputIterator __first,
_InputIterator __last )
inlineconstexpr

Inserts a range into the vector.

Parameters
__positionA const_iterator into the vector.
__firstAn input iterator.
__lastAn 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 1617 of file stl_vector.h.

◆ insert() [2/5]

template<typename _Tp, typename _Alloc>
vector< _Tp, _Alloc >::iterator vector::insert ( const_iterator __position,
const value_type & __x )
constexpr

Inserts given value into vector before specified iterator.

Parameters
__positionA const_iterator into the vector.
__xData 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 133 of file vector.tcc.

References vector(), std::begin(), std::cbegin(), std::end(), insert(), and std::move().

Referenced by insert().

◆ insert() [3/5]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
iterator std::vector< _Tp, _Alloc >::insert ( const_iterator __position,
initializer_list< value_type > __l )
inlineconstexpr

Inserts an initializer_list into the vector.

Parameters
__positionAn iterator into the vector.
__lAn 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 1546 of file stl_vector.h.

◆ insert() [4/5]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
iterator std::vector< _Tp, _Alloc >::insert ( const_iterator __position,
size_type __n,
const value_type & __x )
inlineconstexpr

Inserts a number of copies of given data into the vector.

Parameters
__positionA const_iterator into the vector.
__nNumber of elements to be inserted.
__xData 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 1572 of file stl_vector.h.

◆ insert() [5/5]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
iterator std::vector< _Tp, _Alloc >::insert ( const_iterator __position,
value_type && __x )
inlineconstexpr

Inserts given rvalue into vector before specified iterator.

Parameters
__positionA const_iterator into the vector.
__xData 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 1528 of file stl_vector.h.

◆ max_size()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
size_type std::vector< _Tp, _Alloc >::max_size ( ) const
inlinenodiscardconstexprnoexcept

Returns the size() of the largest possible vector.

Definition at line 1128 of file stl_vector.h.

Referenced by reserve().

◆ operator=() [1/3]

template<typename _Tp, typename _Alloc>
vector< _Tp, _Alloc > & vector::operator= ( const vector< _Tp, _Alloc > & __x)
constexpr

Vector assignment operator.

Parameters
__xA 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 210 of file vector.tcc.

References vector(), std::__addressof(), std::_Destroy(), _M_allocate_and_copy(), begin(), capacity(), clear(), std::end(), end(), std::size(), and size().

◆ operator=() [2/3]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
vector & std::vector< _Tp, _Alloc >::operator= ( initializer_list< value_type > __l)
inlineconstexpr

Vector list assignment operator.

Parameters
__lAn 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 855 of file stl_vector.h.

◆ operator=() [3/3]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
vector & std::vector< _Tp, _Alloc >::operator= ( vector< _Tp, _Alloc > && __x)
inlineconstexprnoexcept

Vector move assignment operator.

Parameters
__xA 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 833 of file stl_vector.h.

◆ operator[]() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reference std::vector< _Tp, _Alloc >::operator[] ( size_type __n) const
inlinenodiscardconstexprnoexcept

Subscript access to the data contained in the vector.

Parameters
__nThe 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 1280 of file stl_vector.h.

◆ operator[]() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
reference std::vector< _Tp, _Alloc >::operator[] ( size_type __n)
inlinenodiscardconstexprnoexcept

Subscript access to the data contained in the vector.

Parameters
__nThe 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 1261 of file stl_vector.h.

◆ pop_back()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::pop_back ( )
inlineconstexprnoexcept

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 1457 of file stl_vector.h.

◆ push_back() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::push_back ( const value_type & __x)
inlineconstexpr

Add data to the end of the vector.

Parameters
__xData 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 1416 of file stl_vector.h.

◆ push_back() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::push_back ( value_type && __x)
inlineconstexpr

Definition at line 1433 of file stl_vector.h.

◆ rbegin() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reverse_iterator std::vector< _Tp, _Alloc >::rbegin ( ) const
inlinenodiscardconstexprnoexcept

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 1048 of file stl_vector.h.

◆ rbegin() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
reverse_iterator std::vector< _Tp, _Alloc >::rbegin ( )
inlinenodiscardconstexprnoexcept

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 1038 of file stl_vector.h.

◆ rend() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
const_reverse_iterator std::vector< _Tp, _Alloc >::rend ( ) const
inlinenodiscardconstexprnoexcept

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 1068 of file stl_vector.h.

◆ rend() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
reverse_iterator std::vector< _Tp, _Alloc >::rend ( )
inlinenodiscardconstexprnoexcept

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 1058 of file stl_vector.h.

◆ reserve()

template<typename _Tp, typename _Alloc>
void vector::reserve ( size_type __n)
constexpr

Attempt to preallocate enough memory for specified number of elements.

Parameters
__nNumber of elements required.
Exceptions
std::length_errorIf 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 67 of file vector.tcc.

References std::_Destroy(), _M_allocate_and_copy(), capacity(), max_size(), and std::size().

◆ resize() [1/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::resize ( size_type __new_size)
inlineconstexpr

Resizes the vector to the specified number of elements.

Parameters
__new_sizeNumber 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 1143 of file stl_vector.h.

Referenced by __gnu_parallel::__shrink_and_double(), and __gnu_parallel::multiway_merge_exact_splitting().

◆ resize() [2/2]

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::resize ( size_type __new_size,
const value_type & __x )
inlineconstexpr

Resizes the vector to the specified number of elements.

Parameters
__new_sizeNumber of elements the vector should contain.
__xData 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 1164 of file stl_vector.h.

◆ shrink_to_fit()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::shrink_to_fit ( )
inlineconstexpr

A non-binding request to reduce capacity() to size().

Definition at line 1198 of file stl_vector.h.

◆ size()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
size_type std::vector< _Tp, _Alloc >::size ( ) const
inlinenodiscardconstexprnoexcept

◆ swap()

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
void std::vector< _Tp, _Alloc >::swap ( vector< _Tp, _Alloc > & __x)
inlineconstexprnoexcept

Swaps data with another vector.

Parameters
__xA 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 1844 of file stl_vector.h.

Member Data Documentation

◆ _M_impl

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
_Vector_impl std::_Vector_base< _Tp, _Alloc >::_M_impl
protected

Definition at line 380 of file stl_vector.h.


The documentation for this class was generated from the following files: