#include <stl_vector.h>
Inheritance diagram for std::vector< Type, Alloc >:
Public Member Functions | |
vector (const allocator_type &a=allocator_type()) | |
Default constructor creates no elements. | |
vector (size_type n, const value_type &value, const allocator_type &a=allocator_type()) | |
Create a vector with copies of an exemplar element. | |
vector (size_type n) | |
Create a vector with default elements. | |
vector (const vector &x) | |
Vector copy constructor. | |
template<typename InputIterator> | vector (InputIterator first, InputIterator last, const allocator_type &a=allocator_type()) |
Builds a vector from a range. | |
~vector () | |
vector & | operator= (const vector &x) |
Vector assignment operator. | |
void | assign (size_type n, const value_type &__val) |
Assigns a given value to a vector. | |
template<typename InputIterator> void | assign (InputIterator first, InputIterator last) |
Assigns a range to a vector. | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
size_type | size () const |
size_type | max_size () const |
void | resize (size_type new_size, const value_type &x) |
Resizes the vector to the specified number of elements. | |
void | resize (size_type new_size) |
Resizes the vector to the specified number of elements. | |
size_type | capacity () const |
bool | empty () const |
void | reserve (size_type n) |
Attempt to preallocate enough memory for specified number of elements. | |
reference | operator[] (size_type n) |
Subscript access to the data contained in the vector. | |
const_reference | operator[] (size_type n) const |
Subscript access to the data contained in the vector. | |
reference | at (size_type n) |
Provides access to the data contained in the vector. | |
const_reference | at (size_type n) const |
Provides access to the data contained in the vector. | |
reference | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
void | push_back (const value_type &x) |
Add data to the end of the vector. | |
void | pop_back () |
Removes last element. | |
iterator | insert (iterator position, const value_type &x) |
Inserts given value into vector before specified iterator. | |
void | insert (iterator position, size_type n, const value_type &x) |
Inserts a number of copies of given data into the vector. | |
template<typename InputIterator> void | insert (iterator position, InputIterator first, InputIterator last) |
Inserts a range into the vector. | |
iterator | erase (iterator position) |
Remove element at given position. | |
iterator | erase (iterator first, iterator last) |
Remove a range of elements. | |
void | swap (vector &x) |
Swaps data with another vector. | |
void | clear () |
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 147 of file stl_vector.h.
|
Default constructor creates no elements.
Definition at line 187 of file stl_vector.h. |
|
Create a vector with copies of an exemplar element.
Definition at line 198 of file stl_vector.h. |
|
Create a vector with default elements.
Definition at line 213 of file stl_vector.h. |
|
Vector copy constructor.
Definition at line 229 of file stl_vector.h. |
|
Builds a vector from a range.
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 253 of file stl_vector.h. |
|
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 268 of file stl_vector.h. |
|
Assigns a range to a vector.
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 310 of file stl_vector.h. |
|
Assigns a given value to a vector.
Definition at line 293 of file stl_vector.h. |
|
Provides access to the data contained in the vector.
Definition at line 546 of file stl_vector.h. |
|
Provides access to the data contained in the vector.
Definition at line 528 of file stl_vector.h. |
|
Returns a read-only (constant) reference to the data at the last element of the vector. Definition at line 581 of file stl_vector.h. |
|
Returns a read/write reference to the data at the last element of the vector. Definition at line 573 of file stl_vector.h. |
|
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 336 of file stl_vector.h. |
|
Returns a read/write iterator that points to the first element in the vector. Iteration is done in ordinary element order. Definition at line 327 of file stl_vector.h. Referenced by std::vector< Type, Alloc >::insert(), std::vector< Type, Alloc >::operator=(), std::operator==(), and std::vector< qual, qualAllocator >::vector(). |
|
Returns the total number of elements that the vector can hold before needing to allocate more memory. Definition at line 443 of file stl_vector.h. Referenced by std::vector< Type, Alloc >::operator=(), and std::vector< Type, Alloc >::reserve(). |
|
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 742 of file stl_vector.h. |
|
Returns true if the vector is empty. (Thus begin() would equal end().) Definition at line 452 of file stl_vector.h. |
|
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 354 of file stl_vector.h. |
|
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 345 of file stl_vector.h. Referenced by std::vector< Type, Alloc >::erase(), std::vector< Type, Alloc >::insert(), std::vector< Type, Alloc >::operator=(), std::operator==(), and std::vector< qual, qualAllocator >::vector(). |
|
Remove a range of elements.
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 121 of file vector.tcc. References std::copy(), and std::vector< Type, Alloc >::end(). |
|
Remove element at given position.
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 109 of file vector.tcc. References std::copy(), and std::vector< Type, Alloc >::end(). |
|
Returns a read-only (constant) reference to the data at the first element of the vector. Definition at line 565 of file stl_vector.h. |
|
Returns a read/write reference to the data at the first element of the vector. Definition at line 557 of file stl_vector.h. |
|
Inserts a range into the vector.
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 670 of file stl_vector.h. |
|
Inserts a number of copies of given data into the vector.
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 651 of file stl_vector.h. |
|
Inserts given value into vector before specified iterator.
Definition at line 92 of file vector.tcc. References std::vector< Type, Alloc >::begin(), and std::vector< Type, Alloc >::end(). |
|
Returns the size() of the largest possible vector. Definition at line 401 of file stl_vector.h. Referenced by std::vector< Type, Alloc >::reserve(). |
|
Vector assignment operator.
Definition at line 132 of file vector.tcc. References std::vector< Type, Alloc >::begin(), std::vector< Type, Alloc >::capacity(), std::copy(), std::vector< Type, Alloc >::end(), std::vector< Type, Alloc >::size(), and std::uninitialized_copy(). |
|
Subscript access to the data contained in the vector.
Definition at line 503 of file stl_vector.h. |
|
Subscript access to the data contained in the vector.
Definition at line 488 of file stl_vector.h. |
|
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 617 of file stl_vector.h. |
|
Add data to the end of the vector.
Definition at line 596 of file stl_vector.h. |
|
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 372 of file stl_vector.h. |
|
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 363 of file stl_vector.h. |
|
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 390 of file stl_vector.h. |
|
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 381 of file stl_vector.h. |
|
Attempt to preallocate enough memory for specified number of elements.
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 std::vector< Type, Alloc >::capacity(), std::vector< Type, Alloc >::max_size(), and std::vector< Type, Alloc >::size(). |
|
Resizes the vector to the specified number of elements.
Definition at line 435 of file stl_vector.h. |
|
Resizes the vector to the specified number of elements.
Definition at line 416 of file stl_vector.h. |
|
Returns the number of elements in the vector. Definition at line 396 of file stl_vector.h. Referenced by std::vector< Type, Alloc >::operator=(), std::operator==(), and std::vector< Type, Alloc >::reserve(). |
|
Swaps data with another vector.
Definition at line 727 of file stl_vector.h. Referenced by std::swap(). |