#include <stl_vector.h>
Inheritance diagram for vector:
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 148 of file stl_vector.h.
|
Default constructor creates no elements.
Definition at line 188 of file stl_vector.h. |
|
Create a vector with copies of an exemplar element.
Definition at line 199 of file stl_vector.h. |
|
Create a vector with default elements.
Definition at line 215 of file stl_vector.h. |
|
Vector copy constructor.
Definition at line 231 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 254 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 269 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 311 of file stl_vector.h. |
|
Assigns a given value to a vector.
Definition at line 294 of file stl_vector.h. |
|
Provides access to the data contained in the vector.
Definition at line 547 of file stl_vector.h. |
|
Provides access to the data contained in the vector.
Definition at line 529 of file stl_vector.h. |
|
Returns a read-only (constant) reference to the data at the last element of the vector. Definition at line 582 of file stl_vector.h. |
|
Returns a read/write reference to the data at the last element of the vector. Definition at line 574 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 337 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 328 of file stl_vector.h. Referenced by vector::insert(), vector::operator=(), std::operator==(), and vector< qual, qualAllocator >::vector(). |
|
Returns the total number of elements that the vector can hold before needing to allocate more memory. Definition at line 444 of file stl_vector.h. Referenced by vector::operator=(), and vector::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 743 of file stl_vector.h. |
|
Returns true if the vector is empty. (Thus begin() would equal end().) Definition at line 453 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 355 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 346 of file stl_vector.h. Referenced by vector::erase(), vector::insert(), vector::operator=(), std::operator==(), and 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 vector::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 vector::end(). |
|
Returns a read-only (constant) reference to the data at the first element of the vector. Definition at line 566 of file stl_vector.h. |
|
Returns a read/write reference to the data at the first element of the vector. Definition at line 558 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 671 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 652 of file stl_vector.h. |
|
Inserts given value into vector before specified iterator.
Definition at line 92 of file vector.tcc. References vector::begin(), and vector::end(). |
|
Returns the size() of the largest possible vector. Definition at line 402 of file stl_vector.h. Referenced by vector::reserve(). |
|
Vector assignment operator.
Definition at line 132 of file vector.tcc. References vector::begin(), vector::capacity(), std::copy(), vector::end(), vector::size(), and std::uninitialized_copy(). |
|
Subscript access to the data contained in the vector.
Definition at line 504 of file stl_vector.h. |
|
Subscript access to the data contained in the vector.
Definition at line 489 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 618 of file stl_vector.h. |
|
Add data to the end of the vector.
Definition at line 597 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 373 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 364 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 391 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 382 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 vector::capacity(), vector::max_size(), and vector::size(). |
|
Resizes the vector to the specified number of elements.
Definition at line 436 of file stl_vector.h. |
|
Resizes the vector to the specified number of elements.
Definition at line 417 of file stl_vector.h. |
|
Returns the number of elements in the vector. Definition at line 397 of file stl_vector.h. Referenced by vector::operator=(), std::operator==(), and vector::reserve(). |
|
Swaps data with another vector.
Definition at line 728 of file stl_vector.h. Referenced by std::swap(). |