|
| | 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 _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> |
| reference | emplace_back (_Args &&... __args) |
| bool | empty () const noexcept |
| const_iterator | end () const noexcept |
| iterator | end () noexcept |
| iterator | erase (const_iterator __first, const_iterator __last) |
| 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 |
|
| pointer | _M_allocate (size_t __n) |
| template<typename _ForwardIterator> |
| pointer | _M_allocate_and_copy (size_type __n, _ForwardIterator __first, _ForwardIterator __last) |
| template<typename _ForwardIterator> |
| void | _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) |
| template<typename _InputIterator> |
| void | _M_assign_aux (_InputIterator __first, _InputIterator __last, std::input_iterator_tag) |
| template<typename _InputIterator> |
| void | _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type) |
| template<typename _Integer> |
| void | _M_assign_dispatch (_Integer __n, _Integer __val, __true_type) |
| size_type | _M_check_len (size_type __n, const char *__s) const |
| void | _M_create_storage (size_t __n) |
| void | _M_deallocate (pointer __p, size_t __n) |
| void | _M_default_append (size_type __n) |
| void | _M_default_initialize (size_type __n) |
| template<typename... _Args> |
| iterator | _M_emplace_aux (const_iterator __position, _Args &&... __args) |
| iterator | _M_emplace_aux (const_iterator __position, value_type &&__v) |
| iterator | _M_erase (iterator __first, iterator __last) |
| iterator | _M_erase (iterator __position) |
| void | _M_erase_at_end (pointer __pos) noexcept |
| void | _M_fill_assign (size_type __n, const value_type &__val) |
| void | _M_fill_initialize (size_type __n, const value_type &__value) |
| void | _M_fill_insert (iterator __pos, size_type __n, const value_type &__x) |
| const _Tp_alloc_type & | _M_get_Tp_allocator () const noexcept |
| _Tp_alloc_type & | _M_get_Tp_allocator () noexcept |
| template<typename _Arg> |
| void | _M_insert_aux (iterator __position, _Arg &&__arg) |
| template<typename _InputIterator> |
| void | _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) |
| template<typename _Integer> |
| void | _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __val, __true_type) |
| iterator | _M_insert_rval (const_iterator __position, value_type &&__v) |
| void | _M_range_check (size_type __n) const |
| 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 () |
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 (
Definition at line 389 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. |
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.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
Builds a vector from an initializer list.
- Parameters
-
| __l | An initializer_list. |
| __a | An allocator. |
Create a vector consisting of copies of the elements in the initializer_list __l.
This will call the element type's copy constructor N times (where N is __l.size()) and do no memory reallocation.
Definition at line 625 of file stl_vector.h.
template<typename _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.
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.
Referenced by operator=(), and reserve().
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.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
Assigns an initializer list to a vector.
- Parameters
-
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.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
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.
Referenced by operator=().
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.
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.
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.
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.
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 vector(), std::begin(), std::cbegin(), std::end(), insert(), and std::move().
Referenced by insert().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
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.
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.
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.
References vector(), std::_Destroy(), _M_allocate_and_copy(), begin(), capacity(), clear(), std::end(), end(), std::size(), and size().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
Vector list assignment operator.
- Parameters
-
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.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
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.
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.
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.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
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.
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.
References std::_Destroy(), _M_allocate_and_copy(), capacity(), max_size(), and std::size().
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
| void std::vector< _Tp, _Alloc >::resize |
( |
size_type | __new_size | ) |
|
|
inline |
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.
template<typename _Tp, typename _Alloc = std::allocator<_Tp>>
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::swap().
1.17.0