Inheritance diagram for std::vector< _Tp, _Alloc >:

[legend]

Public Types
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

Public Member Functions
	vector ()=default

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

	vector (const allocator_type &__a) noexcept

	vector (const vector &__x)

	vector (const vector &__x, const allocator_type &__a)

	vector (initializer_list< value_type > __l, const allocator_type &__a=allocator_type())

	vector (size_type __n, const allocator_type &__a=allocator_type())

	vector (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())

	vector (vector &&) noexcept=default

	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 >())))

	~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)

void	assign (initializer_list< value_type > __l)

void	assign (size_type __n, const value_type &__val)

reference	at (size_type __n)

const_reference	at (size_type __n) const

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)

template<typename... _Args>
void	emplace_back (_Args &&... __args)

bool	empty () const noexcept

const_iterator	end () const noexcept

iterator	end () noexcept

iterator	erase (const_iterator __first, const_iterator __last)

iterator	erase (const_iterator __position)

const_reference	front () const noexcept

reference	front () noexcept

allocator_type	get_allocator () const noexcept

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>>
iterator	insert (const_iterator __position, _InputIterator __first, _InputIterator __last)

iterator	insert (const_iterator __position, const value_type &__x)

iterator	insert (const_iterator __position, initializer_list< value_type > __l)

iterator	insert (const_iterator __position, size_type __n, const value_type &__x)

iterator	insert (const_iterator __position, value_type &&__x)

size_type	max_size () const noexcept

vector &	operator= (const vector &__x)

vector &	operator= (initializer_list< value_type > __l)

vector &	operator= (vector &&__x) noexcept(_Alloc_traits::_S_nothrow_move())

const_reference	operator[] (size_type __n) const noexcept

reference	operator[] (size_type __n) noexcept

void	pop_back () noexcept

void	push_back (const value_type &__x)

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)

void	resize (size_type __new_size)

void	resize (size_type __new_size, const value_type &__x)

void	shrink_to_fit ()

size_type	size () const noexcept

void	swap (vector &__x) noexcept

Protected Member Functions
pointer	_M_allocate (size_t __n)

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_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

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

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 ()

allocator_type	get_allocator () const noexcept

Static Protected Member Functions
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

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.

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.

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.

◆ vector() [2/10]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

std::vector< _Tp, _Alloc >::vector ( const allocator_type & __a )

inlineexplicitnoexcept

Creates a vector with no elements.

Parameters

__a	An allocator object.

Definition at line 497 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()`
	)

inlineexplicit

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.

◆ 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()`
	)

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.

◆ vector() [5/10]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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().

◆ 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 allocator_type &	__a
	)

inline

Copy constructor with alternative allocator.

Definition at line 575 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 allocator_type &	__m
	)

inlinenoexcept

Move constructor with alternative allocator.

Definition at line 607 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()`
	)

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.

◆ 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()`
	)

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().

◆ ~vector()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

std::vector< _Tp, _Alloc >::~vector ( )

inlinenoexcept

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().

Member Function Documentation

◆ _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
	)

inlineprotected

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.

◆ _M_range_check()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void std::vector< _Tp, _Alloc >::_M_range_check ( size_type __n ) const

inlineprotected

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().

◆ 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
	)

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.

◆ assign() [2/3]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void 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.

◆ assign() [3/3]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void 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.

◆ at() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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().

◆ at() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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().

◆ back() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reference std::vector< _Tp, _Alloc >::back ( ) const

inlinenoexcept

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.

◆ back() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

reference std::vector< _Tp, _Alloc >::back ( )

inlinenoexcept

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

Definition at line 1143 of file stl_vector.h.

Referenced by std::piecewise_constant_distribution< _RealType >::max(), and std::piecewise_linear_distribution< _RealType >::max().

◆ begin() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_iterator std::vector< _Tp, _Alloc >::begin ( ) const

inlinenoexcept

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.

◆ begin() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

iterator std::vector< _Tp, _Alloc >::begin ( )

inlinenoexcept

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().

◆ capacity()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

size_type std::vector< _Tp, _Alloc >::capacity ( ) const

inlinenoexcept

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.

◆ cbegin()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_iterator std::vector< _Tp, _Alloc >::cbegin ( ) const

inlinenoexcept

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().

◆ cend()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_iterator std::vector< _Tp, _Alloc >::cend ( ) const

inlinenoexcept

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.

◆ clear()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void std::vector< _Tp, _Alloc >::clear ( )

inlinenoexcept

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.

◆ crbegin()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reverse_iterator std::vector< _Tp, _Alloc >::crbegin ( ) const

inlinenoexcept

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().

◆ crend()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reverse_iterator std::vector< _Tp, _Alloc >::crend ( ) const

inlinenoexcept

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().

◆ data()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

_Tp* std::vector< _Tp, _Alloc >::data ( )

inlinenoexcept

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().

◆ emplace()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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.

◆ empty()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

bool std::vector< _Tp, _Alloc >::empty ( ) const

inlinenoexcept

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().

◆ end() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_iterator std::vector< _Tp, _Alloc >::end ( ) const

inlinenoexcept

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.

◆ end() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

iterator std::vector< _Tp, _Alloc >::end ( )

inlinenoexcept

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().

◆ erase() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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().

◆ erase() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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().

◆ front() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reference std::vector< _Tp, _Alloc >::front ( ) const

inlinenoexcept

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.

◆ front() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

reference std::vector< _Tp, _Alloc >::front ( )

inlinenoexcept

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

Definition at line 1121 of file stl_vector.h.

Referenced by std::piecewise_constant_distribution< _RealType >::min(), and std::piecewise_linear_distribution< _RealType >::min().

◆ get_allocator()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

allocator_type std::_Vector_base< _Tp, _Alloc >::get_allocator

inlinenoexcept

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().

◆ 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
	)

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().

◆ insert() [2/5]

template<typename _Tp , typename _Alloc >

vector< _Tp, _Alloc >::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().

◆ 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
	)

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().

◆ 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
	)

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().

◆ insert() [5/5]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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().

◆ max_size()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

size_type std::vector< _Tp, _Alloc >::max_size ( ) const

inlinenoexcept

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().

◆ operator=() [1/3]

template<typename _Tp , typename _Alloc >

vector< _Tp, _Alloc > & 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.

◆ operator=() [2/3]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

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.

◆ operator=() [3/3]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

vector& std::vector< _Tp, _Alloc >::operator= ( vector< _Tp, _Alloc > && __x )

inlinenoexcept

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().

◆ operator[]() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reference std::vector< _Tp, _Alloc >::operator[] ( size_type __n ) const

inlinenoexcept

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.

◆ operator[]() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

reference std::vector< _Tp, _Alloc >::operator[] ( size_type __n )

inlinenoexcept

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.

◆ pop_back()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void std::vector< _Tp, _Alloc >::pop_back ( )

inlinenoexcept

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.

◆ push_back()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void 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.

◆ rbegin() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reverse_iterator std::vector< _Tp, _Alloc >::rbegin ( ) const

inlinenoexcept

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().

◆ rbegin() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

reverse_iterator std::vector< _Tp, _Alloc >::rbegin ( )

inlinenoexcept

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().

◆ rend() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

const_reverse_iterator std::vector< _Tp, _Alloc >::rend ( ) const

inlinenoexcept

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().

◆ rend() [2/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

reverse_iterator std::vector< _Tp, _Alloc >::rend ( )

inlinenoexcept

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().

◆ reserve()

template<typename _Tp , typename _Alloc >

void vector::reserve ( 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.

◆ resize() [1/2]

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void 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().

◆ 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
	)

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().

◆ shrink_to_fit()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void 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()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

size_type std::vector< _Tp, _Alloc >::size ( ) const

inlinenoexcept

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(), std::match_results< _Bi_iter, _Alloc >::empty(), __gnu_parallel::list_partition(), std::discrete_distribution< _IntType >::max(), std::operator==(), std::vector< _Tp, _Alloc >::resize(), std::match_results< _Bi_iter, _Alloc >::size(), and std::regex_traits< _Ch_type >::transform_primary().

◆ swap()

template<typename _Tp , typename _Alloc = std::allocator<_Tp>>

void std::vector< _Tp, _Alloc >::swap ( vector< _Tp, _Alloc > & __x )

inlinenoexcept

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().

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

Public Types

Public Member Functions

Protected Member Functions

Static Protected Member Functions

Protected Attributes

Detailed Description

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

Constructor & Destructor Documentation

◆ vector() [1/10]

◆ vector() [2/10]

◆ vector() [3/10]

◆ vector() [4/10]

◆ vector() [5/10]

◆ vector() [6/10]

◆ vector() [7/10]

◆ vector() [8/10]

◆ vector() [9/10]

◆ vector() [10/10]

◆ ~vector()

Member Function Documentation

◆ _M_allocate_and_copy()

◆ _M_range_check()

◆ assign() [1/3]

◆ assign() [2/3]

◆ assign() [3/3]

◆ at() [1/2]

◆ at() [2/2]

◆ back() [1/2]

◆ back() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ cbegin()

◆ cend()

◆ clear()

◆ crbegin()

◆ crend()

◆ data()

◆ emplace()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ get_allocator()

◆ insert() [1/5]

◆ insert() [2/5]

◆ insert() [3/5]

◆ insert() [4/5]

◆ insert() [5/5]

◆ max_size()

◆ operator=() [1/3]

◆ operator=() [2/3]

◆ operator=() [3/3]

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ pop_back()

◆ push_back()

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ reserve()

◆ resize() [1/2]

◆ resize() [2/2]

◆ shrink_to_fit()

◆ size()

◆ swap()

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