libstdc++
|
#include <vector>
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>> | |
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 vector & | operator= (const vector &__x) |
constexpr vector & | operator= (initializer_list< value_type > __l) |
constexpr vector & | operator= (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 _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_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 |
A standard container which offers fixed time access to individual elements in any order.
_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 425 of file stl_vector.h.
typedef _Alloc std::vector< _Tp, _Alloc >::allocator_type |
Definition at line 462 of file stl_vector.h.
typedef __gnu_cxx::__normal_iterator<const_pointer, vector> std::vector< _Tp, _Alloc >::const_iterator |
Definition at line 457 of file stl_vector.h.
typedef _Alloc_traits::const_pointer std::vector< _Tp, _Alloc >::const_pointer |
Definition at line 452 of file stl_vector.h.
typedef _Alloc_traits::const_reference std::vector< _Tp, _Alloc >::const_reference |
Definition at line 454 of file stl_vector.h.
typedef std::reverse_iterator<const_iterator> std::vector< _Tp, _Alloc >::const_reverse_iterator |
Definition at line 458 of file stl_vector.h.
typedef ptrdiff_t std::vector< _Tp, _Alloc >::difference_type |
Definition at line 461 of file stl_vector.h.
typedef __gnu_cxx::__normal_iterator<pointer, vector> std::vector< _Tp, _Alloc >::iterator |
Definition at line 455 of file stl_vector.h.
typedef _Base::pointer std::vector< _Tp, _Alloc >::pointer |
Definition at line 451 of file stl_vector.h.
typedef _Alloc_traits::reference std::vector< _Tp, _Alloc >::reference |
Definition at line 453 of file stl_vector.h.
typedef std::reverse_iterator<iterator> std::vector< _Tp, _Alloc >::reverse_iterator |
Definition at line 459 of file stl_vector.h.
typedef size_t std::vector< _Tp, _Alloc >::size_type |
Definition at line 460 of file stl_vector.h.
typedef _Tp std::vector< _Tp, _Alloc >::value_type |
Definition at line 450 of file stl_vector.h.
|
default |
Creates a vector with no elements.
|
inlineexplicitconstexprnoexcept |
Creates a vector with no elements.
__a | An allocator object. |
Definition at line 539 of file stl_vector.h.
|
inlineexplicitconstexpr |
Creates a vector with default constructed elements.
__n | The number of elements to initially create. |
__a | An allocator. |
This constructor fills the vector with __n default constructed elements.
Definition at line 553 of file stl_vector.h.
|
inlineconstexpr |
Creates a vector with copies of an exemplar element.
__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 566 of file stl_vector.h.
|
inlineconstexpr |
Vector copy constructor.
__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 598 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::end().
|
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.
|
inlineconstexpr |
Copy constructor with alternative allocator.
Definition at line 621 of file stl_vector.h.
|
inlineconstexprnoexcept |
Move constructor with alternative allocator.
Definition at line 656 of file stl_vector.h.
|
inlineconstexpr |
Builds a vector from an initializer list.
__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 675 of file stl_vector.h.
|
inlineconstexpr |
Builds a vector from a range.
__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 704 of file stl_vector.h.
References std::__iterator_category().
|
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 730 of file stl_vector.h.
References std::_Destroy().
|
inlineconstexprprotected |
Definition at line 375 of file stl_vector.h.
|
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 1613 of file stl_vector.h.
|
constexprprotected |
Definition at line 315 of file vector.tcc.
|
constexprprotected |
Definition at line 296 of file vector.tcc.
|
inlineconstexprprotected |
Definition at line 1737 of file stl_vector.h.
|
inlineconstexprprotected |
Definition at line 1730 of file stl_vector.h.
|
inlineconstexprprotected |
Definition at line 1893 of file stl_vector.h.
|
inlineconstexprprotectedinherited |
Definition at line 393 of file stl_vector.h.
|
inlineconstexprprotected |
Definition at line 383 of file stl_vector.h.
|
constexprprotected |
Definition at line 634 of file vector.tcc.
|
inlineconstexprprotected |
Definition at line 1712 of file stl_vector.h.
|
constexpr |
Definition at line 381 of file vector.tcc.
|
inlineconstexprprotected |
Definition at line 1886 of file stl_vector.h.
|
constexprprotected |
Definition at line 195 of file vector.tcc.
|
constexprprotected |
Definition at line 181 of file vector.tcc.
|
inlineconstexprprotectednoexcept |
Definition at line 1930 of file stl_vector.h.
|
constexprprotected |
Definition at line 270 of file vector.tcc.
|
inlineconstexprprotected |
Definition at line 1701 of file stl_vector.h.
|
constexprprotected |
Definition at line 529 of file vector.tcc.
|
inlineconstexprprotectednoexcept |
Definition at line 303 of file stl_vector.h.
|
inlineconstexprprotectednoexcept |
Definition at line 298 of file stl_vector.h.
|
constexprprotected |
Definition at line 413 of file vector.tcc.
|
inlineconstexprprotected |
Definition at line 1778 of file stl_vector.h.
|
inlineconstexprprotected |
Definition at line 1770 of file stl_vector.h.
|
constexprprotected |
Definition at line 356 of file vector.tcc.
|
inlineconstexprprotected |
Safety check used only from at().
Definition at line 1152 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::size().
Referenced by std::vector< _Tp, _Alloc >::at(), and std::vector< _Tp, _Alloc >::at().
|
inlineconstexprprotected |
Definition at line 1684 of file stl_vector.h.
|
inlineconstexprprotected |
Definition at line 1664 of file stl_vector.h.
|
constexprprotected |
Definition at line 751 of file vector.tcc.
|
constexprprotected |
Definition at line 729 of file vector.tcc.
|
constexprprotected |
Definition at line 445 of file vector.tcc.
|
constexprprotected |
Definition at line 715 of file vector.tcc.
|
inlinestaticconstexprprotected |
Definition at line 1904 of file stl_vector.h.
|
inlinestaticconstexprprotectednoexcept |
Definition at line 1913 of file stl_vector.h.
|
inlineconstexpr |
Assigns a range to a vector.
__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 825 of file stl_vector.h.
References std::__iterator_category().
|
inlineconstexpr |
Assigns an initializer list to a vector.
__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 852 of file stl_vector.h.
|
inlineconstexpr |
Assigns a given value to a vector.
__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 805 of file stl_vector.h.
|
inlineconstexpr |
Provides access to the data contained in the vector.
__n | The index of the element for which data should be accessed. |
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 1175 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::_M_range_check().
|
inlineconstexpr |
Provides access to the data contained in the vector.
__n | The index of the element for which data should be accessed. |
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 1194 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::_M_range_check().
|
inlineconstexprnoexcept |
Returns a read-only (constant) reference to the data at the last element of the vector.
Definition at line 1242 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end().
|
inlineconstexprnoexcept |
Returns a read/write reference to the data at the last element of the vector.
Definition at line 1230 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end().
Referenced by std::piecewise_constant_distribution< _RealType >::max(), and std::piecewise_linear_distribution< _RealType >::max().
|
inlineconstexprnoexcept |
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 880 of file stl_vector.h.
|
inlineconstexprnoexcept |
Returns a read/write iterator that points to the first element in the vector. Iteration is done in ordinary element order.
Definition at line 870 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 >::erase(), std::vector< _Tp, _Alloc >::front(), std::vector< _Tp, _Alloc >::front(), std::vector< _Tp, _Alloc >::insert(), std::vector< _Tp, _Alloc >::insert(), std::vector< _Tp, _Alloc >::insert(), __gnu_parallel::multiway_merge_exact_splitting(), std::operator<(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< _Tp, _Alloc >::rend(), and std::vector< _Tp, _Alloc >::rend().
|
inlineconstexprnoexcept |
Returns the total number of elements that the vector can hold before needing to allocate more memory.
Definition at line 1075 of file stl_vector.h.
|
inlineconstexprnoexcept |
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 951 of file stl_vector.h.
Referenced by std::vector< _Tp, _Alloc >::erase(), std::vector< _Tp, _Alloc >::erase(), std::vector< _Tp, _Alloc >::insert(), std::vector< _Tp, _Alloc >::insert(), and std::vector< _Tp, _Alloc >::insert().
|
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 961 of file stl_vector.h.
|
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 1602 of file stl_vector.h.
|
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 971 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end().
|
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 981 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin().
|
inlineconstexprnoexcept |
Definition at line 1262 of file stl_vector.h.
|
inlineconstexprnoexcept |
Returns a pointer such that [data(), data() + size()) is a valid range. For a non-empty vector, data() == &front().
Definition at line 1257 of file stl_vector.h.
|
inlineconstexpr |
Inserts an object in vector before specified iterator.
__position | A const_iterator into the vector. |
__args | Arguments. |
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 1343 of file stl_vector.h.
|
constexpr |
Definition at line 111 of file vector.tcc.
|
inlineconstexprnoexcept |
Returns true if the vector is empty. (Thus begin() would equal end().)
Definition at line 1085 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::end().
Referenced by std::piecewise_constant_distribution< _RealType >::densities(), std::piecewise_linear_distribution< _RealType >::densities(), std::match_results< _Bi_iter, _Alloc >::end(), 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(), std::discrete_distribution< _IntType >::probabilities(), std::match_results< _Bi_iter, _Alloc >::ready(), and std::match_results< _Bi_iter, _Alloc >::size().
|
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 900 of file stl_vector.h.
|
inlineconstexprnoexcept |
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 890 of file stl_vector.h.
Referenced by std::vector< _Tp, _Alloc >::vector(), std::vector< _Tp, _Alloc >::back(), std::vector< _Tp, _Alloc >::back(), std::vector< _Tp, _Alloc >::crbegin(), std::vector< _Tp, _Alloc >::empty(), std::match_results< _Bi_iter, _Alloc >::end(), __gnu_parallel::multiway_merge_exact_splitting(), std::operator<(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< _Tp, _Alloc >::push_back(), std::vector< _Tp, _Alloc >::rbegin(), std::vector< _Tp, _Alloc >::rbegin(), and std::vector< _Tp, _Alloc >::resize().
|
inlineconstexpr |
Remove a range of elements.
__first | Iterator pointing to the first element to be erased. |
__last | Iterator pointing to one past the last element to be erased. |
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 1559 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().
|
inlineconstexpr |
Remove element at given position.
__position | Iterator pointing to element to be erased. |
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 1531 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().
|
inlineconstexprnoexcept |
Returns a read-only (constant) reference to the data at the first element of the vector.
Definition at line 1218 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin().
|
inlineconstexprnoexcept |
Returns a read/write reference to the data at the first element of the vector.
Definition at line 1206 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin().
Referenced by std::piecewise_constant_distribution< _RealType >::min(), and std::piecewise_linear_distribution< _RealType >::min().
|
inlineconstexprnoexcept |
Get a copy of the memory allocation object.
Definition at line 308 of file stl_vector.h.
Referenced by std::match_results< _Bi_iter, _Alloc >::get_allocator().
|
inlineconstexpr |
Inserts a range into the vector.
__position | A const_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 1479 of file stl_vector.h.
References std::__iterator_category(), std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().
|
constexpr |
Inserts given value into vector before specified iterator.
__position | A const_iterator into the vector. |
__x | Data to be inserted. |
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 std::begin(), std::cbegin(), std::end(), and std::move().
|
inlineconstexpr |
Inserts an initializer_list into the vector.
__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 1408 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().
|
inlineconstexpr |
Inserts a number of copies of given data into the vector.
__position | A const_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 1434 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::cbegin().
|
inlineconstexpr |
Inserts given rvalue into vector before specified iterator.
__position | A const_iterator into the vector. |
__x | Data to be inserted. |
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 1390 of file stl_vector.h.
References std::move().
|
inlineconstexprnoexcept |
Returns the size() of the largest possible vector.
Definition at line 995 of file stl_vector.h.
Referenced by std::match_results< _Bi_iter, _Alloc >::max_size().
|
constexpr |
Vector assignment operator.
__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 210 of file vector.tcc.
References std::__addressof(), std::_Destroy(), std::vector< _Tp, _Alloc >::begin(), std::begin(), std::vector< _Tp, _Alloc >::end(), std::end(), std::vector< _Tp, _Alloc >::size(), and std::size().
|
inlineconstexpr |
Vector list assignment operator.
__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 785 of file stl_vector.h.
|
inlineconstexprnoexcept |
Vector move assignment operator.
__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 763 of file stl_vector.h.
References std::move().
|
inlineconstexprnoexcept |
Subscript access to the data contained in the vector.
__n | The index of the element for which data should be accessed. |
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 1142 of file stl_vector.h.
|
inlineconstexprnoexcept |
Subscript access to the data contained in the vector.
__n | The index of the element for which data should be accessed. |
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 1123 of file stl_vector.h.
Referenced by std::match_results< _Bi_iter, _Alloc >::operator[]().
|
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 1319 of file stl_vector.h.
|
inlineconstexpr |
Add data to the end of the vector.
__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 1278 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end().
|
inlineconstexpr |
Definition at line 1295 of file stl_vector.h.
|
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 920 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end().
|
inlineconstexprnoexcept |
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 910 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end().
|
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 940 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin().
|
inlineconstexprnoexcept |
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 930 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::begin().
|
constexpr |
Attempt to preallocate enough memory for specified number of elements.
__n | Number of elements required. |
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().
|
inlineconstexpr |
Resizes the vector to the specified number of elements.
__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 1010 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::size().
Referenced by __gnu_parallel::__shrink_and_double(), and __gnu_parallel::multiway_merge_exact_splitting().
|
inlineconstexpr |
Resizes the vector to the specified number of elements.
__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 1031 of file stl_vector.h.
References std::vector< _Tp, _Alloc >::end(), and std::vector< _Tp, _Alloc >::size().
|
inlineconstexpr |
A non-binding request to reduce capacity() to size().
Definition at line 1065 of file stl_vector.h.
|
inlineconstexprnoexcept |
Returns the number of elements in the vector.
Definition at line 989 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::vector< _Tp, _Alloc >::operator=(), std::operator==(), std::vector< _Tp, _Alloc >::resize(), std::vector< _Tp, _Alloc >::resize(), and std::match_results< _Bi_iter, _Alloc >::size().
|
inlineconstexprnoexcept |
Swaps data with another vector.
__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 1583 of file stl_vector.h.
Referenced by std::match_results< _Bi_iter, _Alloc >::swap().
|
protected |
Definition at line 371 of file stl_vector.h.