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 170 of file stl_vector.h.
std::vector< _Tp, _Alloc >::vector | ( | ) | [inline] |
std::vector< _Tp, _Alloc >::vector | ( | const allocator_type & | __a | ) | [inline, explicit] |
Creates a vector with no elements.
a | An allocator object. |
Definition at line 215 of file stl_vector.h.
std::vector< _Tp, _Alloc >::vector | ( | size_type | __n, | |
const value_type & | __value = value_type() , |
|||
const allocator_type & | __a = allocator_type() | |||
) | [inline, explicit] |
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. |
Definition at line 227 of file stl_vector.h.
std::vector< _Tp, _Alloc >::vector | ( | const vector< _Tp, _Alloc > & | __x | ) | [inline] |
Vector copy constructor.
x | A vector of identical element and allocator types. |
Definition at line 241 of file stl_vector.h.
std::vector< _Tp, _Alloc >::vector | ( | vector< _Tp, _Alloc > && | __x | ) | [inline] |
Vector move constructor.
x | A vector of identical element and allocator types. |
Definition at line 257 of file stl_vector.h.
std::vector< _Tp, _Alloc >::vector | ( | initializer_list< value_type > | __l, | |
const allocator_type & | __a = allocator_type() | |||
) | [inline] |
Builds a vector from an initializer list.
l | An initializer_list. | |
a | An allocator. |
This will call the element type's copy constructor N times (where N is l.size()) and do no memory reallocation.
Definition at line 271 of file stl_vector.h.
std::vector< _Tp, _Alloc >::vector | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const allocator_type & | __a = allocator_type() | |||
) | [inline] |
Builds a vector from a range.
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 297 of file stl_vector.h.
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 312 of file stl_vector.h.
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 960 of file stl_vector.h.
Referenced by std::vector< _Tp, _Alloc >::operator=().
void std::vector< _Tp, _Alloc >::_M_range_check | ( | size_type | __n | ) | const [inline, protected] |
void std::vector< _Tp, _Alloc >::assign | ( | initializer_list< value_type > | __l | ) | [inline] |
Assigns an initializer list to a vector.
l | An initializer_list. |
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 411 of file stl_vector.h.
Referenced by std::vector< _Node *, _Nodeptr_Alloc >::assign().
void std::vector< _Tp, _Alloc >::assign | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
Assigns a range to a vector.
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 391 of file stl_vector.h.
void std::vector< _Tp, _Alloc >::assign | ( | size_type | __n, | |
const value_type & | __val | |||
) | [inline] |
Assigns a given value to a vector.
n | Number of elements to be assigned. | |
val | Value to be assigned. |
Definition at line 374 of file stl_vector.h.
const_reference std::vector< _Tp, _Alloc >::at | ( | size_type | __n | ) | const [inline] |
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. |
Definition at line 668 of file stl_vector.h.
reference std::vector< _Tp, _Alloc >::at | ( | size_type | __n | ) | [inline] |
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. |
Definition at line 650 of file stl_vector.h.
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 703 of file stl_vector.h.
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 695 of file stl_vector.h.
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 >, and std::match_results< _Bi_iter >.
Definition at line 434 of file stl_vector.h.
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 425 of file stl_vector.h.
Referenced by std::vector< _Tp, _Alloc >::emplace(), std::vector< _Tp, _Alloc >::insert(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), __gnu_parallel::multiway_merge_exact_splitting(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), __gnu_parallel::parallel_sort_mwms_pu(), and std::vector< _Node *, _Nodeptr_Alloc >::vector().
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 565 of file stl_vector.h.
Referenced by std::vector< _Tp, _Alloc >::operator=().
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 >, and std::match_results< _Bi_iter >.
Definition at line 498 of file stl_vector.h.
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 >, and std::match_results< _Bi_iter >.
Definition at line 507 of file stl_vector.h.
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 950 of file stl_vector.h.
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 516 of file stl_vector.h.
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 525 of file stl_vector.h.
pointer std::vector< _Tp, _Alloc >::data | ( | ) | [inline] |
vector< _Tp, _Alloc >::iterator vector::emplace | ( | iterator | __position, | |
_Args &&... | __args | |||
) | [inline] |
Inserts an object in vector before specified iterator.
position | An iterator into the vector. | |
args | Arguments. |
Definition at line 272 of file vector.tcc.
References std::vector< _Tp, _Alloc >::begin(), and std::vector< _Tp, _Alloc >::end().
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 >, and std::match_results< _Bi_iter >.
Definition at line 574 of file stl_vector.h.
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 >, and std::match_results< _Bi_iter >.
Definition at line 452 of file stl_vector.h.
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 443 of file stl_vector.h.
Referenced by std::vector< _Tp, _Alloc >::emplace(), std::vector< _Tp, _Alloc >::erase(), std::vector< _Tp, _Alloc >::insert(), __gnu_parallel::multiseq_partition(), __gnu_parallel::multiseq_selection(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), __gnu_parallel::parallel_sort_mwms_pu(), and std::vector< _Node *, _Nodeptr_Alloc >::vector().
vector< _Tp, _Alloc >::iterator vector::erase | ( | iterator | __first, | |
iterator | __last | |||
) | [inline] |
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. |
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 146 of file vector.tcc.
References std::vector< _Tp, _Alloc >::end().
vector< _Tp, _Alloc >::iterator vector::erase | ( | iterator | __position | ) | [inline] |
Remove element at given position.
position | Iterator pointing to element to be erased. |
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 134 of file vector.tcc.
References std::vector< _Tp, _Alloc >::end().
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 687 of file stl_vector.h.
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 679 of file stl_vector.h.
void std::vector< _Tp, _Alloc >::insert | ( | iterator | __position, | |
_InputIterator | __first, | |||
_InputIterator | __last | |||
) | [inline] |
Inserts a range into the vector.
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 869 of file stl_vector.h.
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.
position | An iterator into the vector. | |
n | Number of elements to be inserted. | |
x | Data to be inserted. |
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 850 of file stl_vector.h.
void std::vector< _Tp, _Alloc >::insert | ( | iterator | __position, | |
initializer_list< value_type > | __l | |||
) | [inline] |
Inserts an initializer_list into the vector.
position | An iterator into the vector. | |
l | An initializer_list. |
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 832 of file stl_vector.h.
Referenced by std::vector< _Node *, _Nodeptr_Alloc >::insert().
iterator std::vector< _Tp, _Alloc >::insert | ( | iterator | __position, | |
value_type && | __x | |||
) | [inline] |
Inserts given rvalue into vector before specified iterator.
position | An iterator into the vector. | |
x | Data to be inserted. |
Definition at line 815 of file stl_vector.h.
vector< _Tp, _Alloc >::iterator vector::insert | ( | iterator | __position, | |
const value_type & | __x | |||
) | [inline] |
Inserts given value into vector before specified iterator.
position | An iterator into the vector. | |
x | Data to be inserted. |
Definition at line 107 of file vector.tcc.
References std::vector< _Tp, _Alloc >::begin(), std::vector< _Tp, _Alloc >::end(), and std::move().
size_type std::vector< _Tp, _Alloc >::max_size | ( | ) | const [inline] |
Returns the size() of the largest possible vector.
Definition at line 537 of file stl_vector.h.
vector& std::vector< _Tp, _Alloc >::operator= | ( | initializer_list< value_type > | __l | ) | [inline] |
Vector list assignment operator.
l | An initializer_list. |
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 356 of file stl_vector.h.
vector& std::vector< _Tp, _Alloc >::operator= | ( | vector< _Tp, _Alloc > && | __x | ) | [inline] |
Vector move assignment operator.
x | A vector of identical element and allocator types. |
Definition at line 336 of file stl_vector.h.
vector< _Tp, _Alloc > & vector::operator= | ( | const vector< _Tp, _Alloc > & | __x | ) | [inline] |
Vector assignment operator.
x | A vector of identical element and allocator types. |
Definition at line 157 of file vector.tcc.
References std::_Destroy(), std::vector< _Tp, _Alloc >::_M_allocate_and_copy(), std::vector< _Tp, _Alloc >::begin(), std::vector< _Tp, _Alloc >::capacity(), std::vector< _Tp, _Alloc >::end(), and std::vector< _Tp, _Alloc >::size().
const_reference std::vector< _Tp, _Alloc >::operator[] | ( | size_type | __n | ) | const [inline] |
Subscript access to the data contained in the vector.
n | The index of the element for which data should be accessed. |
Reimplemented in std::match_results< _Bi_iter >.
Definition at line 625 of file stl_vector.h.
reference std::vector< _Tp, _Alloc >::operator[] | ( | size_type | __n | ) | [inline] |
Subscript access to the data contained in the vector.
n | The index of the element for which data should be accessed. |
Definition at line 610 of file stl_vector.h.
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 764 of file stl_vector.h.
void std::vector< _Tp, _Alloc >::push_back | ( | const value_type & | __x | ) | [inline] |
Add data to the end of the vector.
x | Data to be added. |
Definition at line 733 of file stl_vector.h.
Referenced by __gnu_parallel::multiseq_partition(), and __gnu_parallel::multiseq_selection().
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 470 of file stl_vector.h.
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 461 of file stl_vector.h.
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 488 of file stl_vector.h.
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 479 of file stl_vector.h.
void vector::reserve | ( | size_type | __n | ) | [inline] |
Attempt to preallocate enough memory for specified number of elements.
n | Number of elements required. |
std::length_error | If n exceeds max_size() . |
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 65 of file vector.tcc.
References std::_Destroy().
void std::vector< _Tp, _Alloc >::resize | ( | size_type | __new_size, | |
value_type | __x = value_type() | |||
) | [inline] |
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. |
Definition at line 552 of file stl_vector.h.
Referenced by __gnu_parallel::multiway_merge_exact_splitting(), __gnu_parallel::parallel_sort_mwms(), and __gnu_parallel::shrink_and_double().
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 >, and std::match_results< _Bi_iter >.
Definition at line 532 of file stl_vector.h.
Referenced by __gnu_parallel::list_partition(), std::vector< _Tp, _Alloc >::operator=(), std::operator==(), __gnu_parallel::shrink(), and __gnu_parallel::shrink_and_double().
void std::vector< _Tp, _Alloc >::swap | ( | vector< _Tp, _Alloc > && | __x | ) | [inline] |
Swaps data with another vector.
x | A vector of the same element and allocator types. |
Definition at line 927 of file stl_vector.h.
Referenced by std::swap().