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 158 of file stl_vector.h.
vector | ( | const allocator_type & | __a = allocator_type() |
) | [inline, explicit] |
vector | ( | size_type | __n, | |
const value_type & | __value = value_type() , |
|||
const allocator_type & | __a = allocator_type() | |||
) | [inline, explicit] |
Create a vector with copies of an exemplar element.
n | The number of elements to initially create. | |
value | An element to copy. |
Definition at line 214 of file stl_vector.h.
Vector copy constructor.
x | A vector of identical element and allocator types. |
Definition at line 232 of file stl_vector.h.
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 256 of file stl_vector.h.
~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 responsibilty.
Definition at line 271 of file stl_vector.h.
void 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 315 of file stl_vector.h.
void 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 298 of file stl_vector.h.
const_reference 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 537 of file stl_vector.h.
reference 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 519 of file stl_vector.h.
const_reference back | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the last element of the vector.
Definition at line 572 of file stl_vector.h.
reference back | ( | ) | [inline] |
Returns a read/write reference to the data at the last element of the vector.
Definition at line 564 of file stl_vector.h.
const_iterator 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.
Definition at line 341 of file stl_vector.h.
iterator 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 332 of file stl_vector.h.
Referenced by vector::insert(), vector::operator=(), std::operator==(), and vector< _Node *, _Nodeptr_Alloc >::vector().
size_type capacity | ( | ) | const [inline] |
Returns the total number of elements that the vector can hold before needing to allocate more memory.
Definition at line 434 of file stl_vector.h.
Referenced by vector::operator=(), and vector::reserve().
void 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 responsibilty.
Definition at line 748 of file stl_vector.h.
pointer data | ( | ) | [inline] |
bool empty | ( | ) | const [inline] |
Returns true if the vector is empty. (Thus begin() would equal end().)
Definition at line 443 of file stl_vector.h.
const_iterator 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.
Definition at line 359 of file stl_vector.h.
iterator 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 350 of file stl_vector.h.
Referenced by vector::erase(), vector::insert(), vector::operator=(), std::operator==(), and vector< _Node *, _Nodeptr_Alloc >::vector().
vector< _Tp, _Alloc >::iterator 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 responsibilty.
Definition at line 122 of file vector.tcc.
References std::copy(), and vector::end().
vector< _Tp, _Alloc >::iterator 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 responsibilty.
Definition at line 110 of file vector.tcc.
References std::copy(), and vector::end().
const_reference front | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the first element of the vector.
Definition at line 556 of file stl_vector.h.
reference front | ( | ) | [inline] |
Returns a read/write reference to the data at the first element of the vector.
Definition at line 548 of file stl_vector.h.
void 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 676 of file stl_vector.h.
void 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 657 of file stl_vector.h.
vector< _Tp, _Alloc >::iterator 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 93 of file vector.tcc.
References vector::begin(), and vector::end().
size_type max_size | ( | ) | const [inline] |
Returns the size() of the largest possible vector.
Definition at line 406 of file stl_vector.h.
Referenced by vector::reserve().
Vector assignment operator.
x | A vector of identical element and allocator types. |
Definition at line 133 of file vector.tcc.
References vector::begin(), vector::capacity(), std::copy(), vector::end(), and vector::size().
const_reference 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. |
Definition at line 494 of file stl_vector.h.
reference 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 479 of file stl_vector.h.
void 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 623 of file stl_vector.h.
void push_back | ( | const value_type & | __x | ) | [inline] |
Add data to the end of the vector.
x | Data to be added. |
Definition at line 602 of file stl_vector.h.
const_reverse_iterator 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 377 of file stl_vector.h.
reverse_iterator 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 368 of file stl_vector.h.
const_reverse_iterator 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 395 of file stl_vector.h.
reverse_iterator 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 386 of file stl_vector.h.
void 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 69 of file vector.tcc.
References vector::capacity(), vector::max_size(), and vector::size().
void 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 421 of file stl_vector.h.
size_type size | ( | ) | const [inline] |
Returns the number of elements in the vector.
Definition at line 401 of file stl_vector.h.
Referenced by vector::operator=(), std::operator==(), and vector::reserve().
void swap | ( | vector< _Tp, _Alloc > & | __x | ) | [inline] |
Swaps data with another vector.
x | A vector of the same element and allocator types. |
Definition at line 733 of file stl_vector.h.
Referenced by std::swap().