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

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

List of all members.

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 ()
• vector (const allocator_type &__a)
• vector (size_type __n)
• vector (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())
• vector (const vector &__x)
• vector (vector &&__x) noexcept
• vector (const vector &__x, const allocator_type &__a)
• vector (vector &&__rv, const allocator_type &__m)
• vector (initializer_list< value_type > __l, const allocator_type &__a=allocator_type())
• template<typename _InputIterator > vector (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())
• ~vector () _GLIBCXX_NOEXCEPT
• void assign (size_type __n, const value_type &__val)
• template<typename _InputIterator > void assign (_InputIterator __first, _InputIterator __last)
• void assign (initializer_list< value_type > __l)
• reference at (size_type __n)
• const_reference at (size_type __n) const
• reference back ()
• const_reference back () const
• iterator begin () _GLIBCXX_NOEXCEPT
• const_iterator begin () const _GLIBCXX_NOEXCEPT
• size_type capacity () const _GLIBCXX_NOEXCEPT
• const_iterator cbegin () const noexcept
• const_iterator cend () const noexcept
• void clear () _GLIBCXX_NOEXCEPT
• const_reverse_iterator crbegin () const noexcept
• const_reverse_iterator crend () const noexcept
• _Tp * data () _GLIBCXX_NOEXCEPT
• const _Tp * data () const _GLIBCXX_NOEXCEPT
• template<typename... _Args> iterator emplace (iterator __position, _Args &&...__args)
• template<typename... _Args> void emplace_back (_Args &&...__args)
• bool empty () const _GLIBCXX_NOEXCEPT
• iterator end () _GLIBCXX_NOEXCEPT
• const_iterator end () const _GLIBCXX_NOEXCEPT
• iterator erase (iterator __position)
• iterator erase (iterator __first, iterator __last)
• reference front ()
• const_reference front () const
• iterator insert (iterator __position, const value_type &__x)
• iterator insert (iterator __position, value_type &&__x)
• void insert (iterator __position, initializer_list< value_type > __l)
• void insert (iterator __position, size_type __n, const value_type &__x)
• template<typename _InputIterator > void insert (iterator __position, _InputIterator __first, _InputIterator __last)
• size_type max_size () const _GLIBCXX_NOEXCEPT
• vector & operator= (const vector &__x)
• vector & operator= (vector &&__x) noexcept(_Alloc_traits
• vector & operator= (initializer_list< value_type > __l)
• reference operator[] (size_type __n)
• const_reference operator[] (size_type __n) const
• void pop_back ()
• void push_back (const value_type &__x)
• void push_back (value_type &&__x)
• reverse_iterator rbegin () _GLIBCXX_NOEXCEPT
• const_reverse_iterator rbegin () const _GLIBCXX_NOEXCEPT
• reverse_iterator rend () _GLIBCXX_NOEXCEPT
• const_reverse_iterator rend () const _GLIBCXX_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 _GLIBCXX_NOEXCEPT
• void swap (vector &__x) noexcept(_Alloc_traits

Protected Member Functions

• pointer _M_allocate (size_t __n)
• template<typename _ForwardIterator > pointer _M_allocate_and_copy (size_type __n, _ForwardIterator __first, _ForwardIterator __last)
• template<typename _InputIterator > void _M_assign_aux (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)
• template<typename _ForwardIterator > void _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)
• template<typename _Integer > void _M_assign_dispatch (_Integer __n, _Integer __val, __true_type)
• template<typename _InputIterator > void _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
• size_type _M_check_len (size_type __n, const char *__s) const
• 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> void _M_emplace_back_aux (_Args &&...__args)
• void _M_erase_at_end (pointer __pos)
• 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)
• _Tp_alloc_type & _M_get_Tp_allocator () _GLIBCXX_NOEXCEPT
• const _Tp_alloc_type & _M_get_Tp_allocator () const _GLIBCXX_NOEXCEPT
• template<typename _Integer > void _M_initialize_dispatch (_Integer __n, _Integer __value, __true_type)
• template<typename _InputIterator > void _M_initialize_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
• template<typename... _Args> void _M_insert_aux (iterator __position, _Args &&...__args)
• template<typename _Integer > void _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __val, __true_type)
• template<typename _InputIterator > void _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)
• void _M_range_check (size_type __n) const
• template<typename _InputIterator > void _M_range_initialize (_InputIterator __first, _InputIterator __last, std::input_iterator_tag)
• template<typename _ForwardIterator > void _M_range_initialize (_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 _ForwardIterator > void _M_range_insert (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag)
• bool _M_shrink_to_fit ()
• allocator_type get_allocator () const _GLIBCXX_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.

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

---

Constructor & Destructor Documentation

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

std::vector< _Tp, _Alloc >::vector

(

)

[inline]

Default constructor creates no elements.

Definition at line 246 of file stl_vector.h.

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

std::vector< _Tp, _Alloc >::vector

(

const allocator_type &

__a

)

[inline, explicit]

Creates a vector with no elements.

Parameters:

__a	An allocator object.

Definition at line 254 of file stl_vector.h.

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

std::vector< _Tp, _Alloc >::vector

(

size_type

__n

)

[inline, explicit]

Creates a vector with default constructed elements.

Parameters:

__n	The number of elements to initially create.

This constructor fills the vector with __n default constructed elements.

Definition at line 266 of file stl_vector.h.

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

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.

The newly-created vector uses a copy of the allocation object used by __x. All the elements of __x are copied, but any extra memory in __x (for fast expansion) will not be copied.

Definition at line 307 of file stl_vector.h.

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

std::vector< _Tp, _Alloc >::vector

(

vector< _Tp, _Alloc > &&

__x

)

[inline]

Vector move constructor.

Parameters:

__x	A vector of identical element and allocator types.

The newly-created vector contains the exact contents of __x. The contents of __x are a valid, but unspecified vector.

Definition at line 324 of file stl_vector.h.

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

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

std::vector< _Tp, _Alloc >::vector	(	vector< _Tp, _Alloc > &&	__rv,
		const allocator_type &	__m
	)		[inline]

Move constructor with alternative allocator.

Definition at line 337 of file stl_vector.h.

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

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

template<typename _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 387 of file stl_vector.h.

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

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

(

)

[inline]

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

---

Member Function Documentation

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
	)		[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 1124 of file stl_vector.h.

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

void std::vector< _Tp, _Alloc >::_M_range_check

(

size_type

__n

)

const [inline, protected]

Safety check used only from at().

Definition at line 789 of file stl_vector.h.

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::at().

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. Old data may be lost.

Definition at line 485 of file stl_vector.h.

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=().

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

template<typename _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. Old data may be lost.

Definition at line 502 of file stl_vector.h.

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. Old data may be lost.

Definition at line 522 of file stl_vector.h.

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::assign().

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

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

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

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

(

)

[inline]

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

Definition at line 853 of file stl_vector.h.

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

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

const_reference std::vector< _Tp, _Alloc >::back

(

)

const [inline]

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

Definition at line 861 of file stl_vector.h.

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

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

(

)

[inline]

Returns a read/write iterator that points to the first element in the vector. Iteration is done in ordinary element order.

Definition at line 536 of file stl_vector.h.

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crend(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::front(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::multiway_merge_exact_splitting(), std::operator<(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rend(), and std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector().

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

const_iterator std::vector< _Tp, _Alloc >::begin

(

)

const [inline]

Returns a read-only (constant) iterator that points to the first element in the vector. Iteration is done in ordinary element order.

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 545 of file stl_vector.h.

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

size_type std::vector< _Tp, _Alloc >::capacity

(

)

const [inline]

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

Definition at line 723 of file stl_vector.h.

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

const_iterator std::vector< _Tp, _Alloc >::cbegin

(

)

const [inline]

Returns a read-only (constant) iterator that points to the first element in the vector. Iteration is done in ordinary element order.

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 609 of file stl_vector.h.

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

const_iterator std::vector< _Tp, _Alloc >::cend

(

)

const [inline]

Returns a read-only (constant) iterator that points one past the last element in the vector. Iteration is done in ordinary element order.

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 618 of file stl_vector.h.

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

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

(

)

[inline]

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

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::operator=().

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

const_reverse_iterator std::vector< _Tp, _Alloc >::crbegin

(

)

const [inline]

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

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

const_reverse_iterator std::vector< _Tp, _Alloc >::crend

(

)

const [inline]

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

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

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

(

)

[inline]

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

Definition at line 876 of file stl_vector.h.

template<typename _Tp , typename _Alloc >

template<typename... _Args>

vector< _Tp, _Alloc >::iterator vector::emplace	(	iterator	__position,
		_Args &&...	__args
	)

Inserts an object in vector before specified iterator.

Parameters:

__position	An 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 293 of file vector.tcc.

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

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert().

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

bool std::vector< _Tp, _Alloc >::empty

(

)

const [inline]

Returns true if the vector is empty. (Thus begin() would equal end().)

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 732 of file stl_vector.h.

Referenced by std::piecewise_constant_distribution< _RealType >::densities(), std::piecewise_linear_distribution< _RealType >::densities(), std::piecewise_constant_distribution< _RealType >::intervals(), std::piecewise_linear_distribution< _RealType >::intervals(), std::discrete_distribution< _IntType >::max(), std::piecewise_constant_distribution< _RealType >::max(), std::piecewise_linear_distribution< _RealType >::max(), std::piecewise_constant_distribution< _RealType >::min(), std::piecewise_linear_distribution< _RealType >::min(), and std::discrete_distribution< _IntType >::probabilities().

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

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

(

)

[inline]

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

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::back(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::crbegin(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::empty(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::multiway_merge_exact_splitting(), std::operator<(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::push_back(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::rbegin(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize(), and std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::vector().

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

const_iterator std::vector< _Tp, _Alloc >::end

(

)

const [inline]

Returns a read-only (constant) iterator that points one past the last element in the vector. Iteration is done in ordinary element order.

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 563 of file stl_vector.h.

template<typename _Tp , typename _Alloc >

vector< _Tp, _Alloc >::iterator vector::erase

(

iterator

__position

)

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 136 of file vector.tcc.

References std::end().

template<typename _Tp , typename _Alloc >

vector< _Tp, _Alloc >::iterator vector::erase	(	iterator	__first,
		iterator	__last
	)

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 148 of file vector.tcc.

References std::end().

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

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

(

)

[inline]

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

Definition at line 837 of file stl_vector.h.

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::data(), std::piecewise_constant_distribution< _RealType >::min(), and std::piecewise_linear_distribution< _RealType >::min().

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

const_reference std::vector< _Tp, _Alloc >::front

(

)

const [inline]

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

Definition at line 845 of file stl_vector.h.

template<typename _Tp , typename _Alloc >

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

Inserts given value into vector before specified iterator.

Parameters:

__position	An 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 109 of file vector.tcc.

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

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize().

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

iterator std::vector< _Tp, _Alloc >::insert	(	iterator	__position,
		value_type &&	__x
	)		[inline]

Inserts given rvalue into vector before specified iterator.

Parameters:

__position	An 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 986 of file stl_vector.h.

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

void std::vector< _Tp, _Alloc >::insert	(	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 1003 of file stl_vector.h.

Referenced by std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::insert().

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

void std::vector< _Tp, _Alloc >::insert	(	iterator	__position,
		size_type	__n,
		const value_type &	__x
	)		[inline]

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

Parameters:

__position	An iterator into the vector.
__n	Number of elements to be inserted.
__x	Data to be inserted.

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

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

template<typename _InputIterator >

void std::vector< _Tp, _Alloc >::insert	(	iterator	__position,
		_InputIterator	__first,
		_InputIterator	__last
	)		[inline]

Inserts a range into the vector.

Parameters:

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

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

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

size_type std::vector< _Tp, _Alloc >::max_size

(

)

const [inline]

Returns the size() of the largest possible vector.

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 648 of file stl_vector.h.

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 extra memory in __x (for fast expansion) will not be copied. Unlike the copy constructor, the allocator object is not copied.

Definition at line 162 of file vector.tcc.

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

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

vector& std::vector< _Tp, _Alloc >::operator=

(

vector< _Tp, _Alloc > &&

__x

)

[inline]

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). __x is a valid, but unspecified vector.

Definition at line 426 of file stl_vector.h.

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. Old data may be lost.

Definition at line 467 of file stl_vector.h.

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

reference std::vector< _Tp, _Alloc >::operator[]

(

size_type

__n

)

[inline]

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

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

const_reference std::vector< _Tp, _Alloc >::operator[]

(

size_type

__n

)

const [inline]

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

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

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

(

)

[inline]

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

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

Referenced by __gnu_parallel::multiseq_partition(), and __gnu_parallel::multiseq_selection().

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

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

(

)

[inline]

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

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

const_reverse_iterator std::vector< _Tp, _Alloc >::rbegin

(

)

const [inline]

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

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

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

(

)

[inline]

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

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

const_reverse_iterator std::vector< _Tp, _Alloc >::rend

(

)

const [inline]

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

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 67 of file vector.tcc.

References std::_Destroy(), and std::size().

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

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

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

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

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

size_type std::vector< _Tp, _Alloc >::size

(

)

const [inline]

Returns the number of elements in the vector.

Reimplemented in std::match_results< _Bi_iter, _Allocator >, std::match_results< _Bi_iter >, and std::match_results< _FwdIterT, _Alloc >.

Definition at line 643 of file stl_vector.h.

Referenced by __gnu_parallel::__shrink(), __gnu_parallel::__shrink_and_double(), std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::_M_range_check(), __gnu_parallel::list_partition(), std::discrete_distribution< _IntType >::max(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), and std::vector< sub_match< _Bi_iter >, allocator< sub_match< _Bi_iter > > >::resize().

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

void std::vector< _Tp, _Alloc >::swap

(

vector< _Tp, _Alloc > &

__x

)

[inline]

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.

Definition at line 1097 of file stl_vector.h.

Referenced by std::swap().

---

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

• stl_vector.h
• vector.tcc