#include <stl_vector.h>
Inheritance diagram for std::vector< Type, Alloc >:
Public Types | |
typedef Type | value_type |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef __gnu_cxx::normal_iterator< pointer, vector_type > | iterator |
typedef __gnu_cxx::normal_iterator< const_pointer, vector_type > | const_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef size_t | size_type |
typedef ptrdiff_t | difference_type |
typedef Base::allocator_type | allocator_type |
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. | |
allocator_type | get_allocator () const |
Get a copy of the memory allocation object. | |
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 () |
Protected Member Functions | |
void | M_range_check (size_type n) const |
template<typename ForwardIterator> | |
pointer | M_allocate_and_copy (size_type n, ForwardIterator first, ForwardIterator last) |
template<typename Integer> | |
void | M_initialize_dispatch (Integer n, Integer value, __true_type) |
template<typename InputIter> | |
void | M_initialize_dispatch (InputIter first, InputIter last, __false_type) |
template<typename InputIterator> | |
void | M_range_initialize (InputIterator first, InputIterator last, input_iterator_tag) |
template<typename ForwardIterator> | |
void | M_range_initialize (ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
template<typename Integer> | |
void | M_assign_dispatch (Integer n, Integer __val, __true_type) |
template<typename InputIter> | |
void | M_assign_dispatch (InputIter first, InputIter last, __false_type) |
template<typename InputIterator> | |
void | M_assign_aux (InputIterator first, InputIterator last, input_iterator_tag) |
template<typename ForwardIterator> | |
void | M_assign_aux (ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_fill_assign (size_type n, const value_type &__val) |
template<typename Integer> | |
void | M_insert_dispatch (iterator position, Integer n, Integer __val, __true_type) |
template<typename InputIterator> | |
void | M_insert_dispatch (iterator position, InputIterator first, InputIterator last, __false_type) |
template<typename InputIterator> | |
void | M_range_insert (iterator position, InputIterator first, InputIterator last, input_iterator_tag) |
template<typename ForwardIterator> | |
void | M_range_insert (iterator position, ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_fill_insert (iterator position, size_type n, const value_type &x) |
void | M_insert_aux (iterator position, const value_type &x) |
Type * | M_allocate (size_t n) |
void | M_deallocate (Type *__p, size_t n) |
Protected Attributes | |
allocator_type | M_data_allocator |
Type * | M_start |
Type * | M_finish |
Type * | M_end_of_storage |
Private Types | |
typedef Vector_base< Type, Alloc > | Base |
typedef vector< Type, Alloc > | vector_type |
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 185 of file stl_vector.h.
std::vector< Type, Alloc >::vector | ( | const allocator_type & | a = allocator_type() |
) | [inline, explicit] |
std::vector< Type, Alloc >::vector | ( | size_type | n, | |
const value_type & | value, | |||
const allocator_type & | a = allocator_type() | |||
) | [inline] |
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 238 of file stl_vector.h.
std::vector< Type, Alloc >::vector | ( | size_type | n | ) | [inline, explicit] |
Create a vector with default elements.
n | The number of elements to initially create. |
Definition at line 251 of file stl_vector.h.
std::vector< Type, Alloc >::vector | ( | const vector< Type, Alloc > & | x | ) | [inline] |
Vector copy constructor.
x | A vector of identical element and allocator types. |
Definition at line 264 of file stl_vector.h.
std::vector< Type, Alloc >::vector | ( | InputIterator | first, | |
InputIterator | last, | |||
const allocator_type & | a = allocator_type() | |||
) | [inline] |
Builds a vector from a range.
first | An input iterator. | |
last | An input iterator. |
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 283 of file stl_vector.h.
std::vector< Type, 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 responsibilty.
Definition at line 297 of file stl_vector.h.
void std::vector< Type, Alloc >::assign | ( | InputIterator | first, | |
InputIterator | last | |||
) | [inline] |
Assigns a range to a vector.
first | An input iterator. | |
last | An input iterator. |
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 338 of file stl_vector.h.
void std::vector< Type, 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 321 of file stl_vector.h.
const_reference std::vector< Type, 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 553 of file stl_vector.h.
reference std::vector< Type, 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 539 of file stl_vector.h.
const_reference std::vector< Type, Alloc >::back | ( | ) | const [inline] |
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.
reference std::vector< Type, Alloc >::back | ( | ) | [inline] |
Returns a read/write reference to the data at the last element of the vector.
Definition at line 574 of file stl_vector.h.
const_iterator std::vector< Type, 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.
Definition at line 363 of file stl_vector.h.
iterator std::vector< Type, 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 355 of file stl_vector.h.
Referenced by std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::capacity(), std::vector< bool, Alloc >::capacity(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::clear(), std::vector< bool, Alloc >::clear(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::empty(), std::vector< bool, Alloc >::empty(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::front(), std::vector< bool, Alloc >::front(), std::vector< Type, Alloc >::insert(), std::vector< bool, Alloc >::insert(), std::vector< Type, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_assign_aux(), std::vector< Type, Alloc >::M_fill_assign(), std::vector< bool, Alloc >::M_fill_assign(), std::vector< Type, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_fill_insert(), std::vector< Type, Alloc >::M_insert_aux(), std::vector< bool, Alloc >::M_insert_aux(), std::vector< bool, Alloc >::M_insert_range(), std::vector< bool, Alloc >::operator=(), std::operator==(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::operator[](), std::vector< bool, Alloc >::operator[](), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::rend(), std::vector< bool, Alloc >::rend(), std::vector< bool, Alloc >::reserve(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::resize(), std::vector< bool, Alloc >::resize(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::size(), std::vector< bool, Alloc >::size(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::vector(), and std::vector< bool, Alloc >::vector().
size_type std::vector< Type, Alloc >::capacity | ( | ) | const [inline] |
Returns the total number of elements that the vector can hold before needing to allocate more memory.
Definition at line 459 of file stl_vector.h.
Referenced by std::vector< Type, Alloc >::M_assign_aux(), std::vector< Type, Alloc >::M_fill_assign(), std::vector< bool, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_insert_range(), and std::vector< bool, Alloc >::operator=().
void std::vector< Type, 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 responsibilty.
Definition at line 759 of file stl_vector.h.
bool std::vector< Type, Alloc >::empty | ( | ) | const [inline] |
Returns true if the vector is empty. (Thus begin() would equal end().)
Definition at line 467 of file stl_vector.h.
const_iterator std::vector< Type, 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.
Definition at line 378 of file stl_vector.h.
iterator std::vector< Type, 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 371 of file stl_vector.h.
Referenced by std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::back(), std::vector< bool, Alloc >::back(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::clear(), std::vector< bool, Alloc >::clear(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::empty(), std::vector< bool, Alloc >::empty(), std::vector< Type, Alloc >::erase(), std::vector< bool, Alloc >::erase(), std::vector< Type, Alloc >::insert(), std::vector< bool, Alloc >::insert(), std::vector< Type, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_assign_aux(), std::vector< Type, Alloc >::M_fill_assign(), std::vector< bool, Alloc >::M_fill_assign(), std::vector< Type, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_fill_insert(), std::vector< Type, Alloc >::M_insert_aux(), std::vector< bool, Alloc >::M_insert_aux(), std::vector< bool, Alloc >::M_insert_range(), std::vector< Type, Alloc >::M_range_insert(), std::vector< bool, Alloc >::operator=(), std::operator==(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::push_back(), std::vector< bool, Alloc >::push_back(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::rbegin(), std::vector< bool, Alloc >::rbegin(), std::vector< bool, Alloc >::reserve(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::resize(), std::vector< bool, Alloc >::resize(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::size(), std::vector< bool, Alloc >::size(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::vector(), and std::vector< bool, Alloc >::vector().
vector< Type, Alloc >::iterator std::vector< Type, Alloc >::erase | ( | iterator | first, | |
iterator | last | |||
) |
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 116 of file vector.tcc.
References std::copy(), and std::vector< Type, Alloc >::end().
vector< Type, Alloc >::iterator std::vector< Type, Alloc >::erase | ( | iterator | position | ) |
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 104 of file vector.tcc.
References std::copy(), and std::vector< Type, Alloc >::end().
Referenced by std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::clear(), std::vector< bool, Alloc >::clear(), std::vector< Type, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_assign_aux(), std::vector< Type, Alloc >::M_fill_assign(), std::vector< bool, Alloc >::M_fill_assign(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::resize(), and std::vector< bool, Alloc >::resize().
const_reference std::vector< Type, Alloc >::front | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the first element of the vector.
Definition at line 567 of file stl_vector.h.
reference std::vector< Type, Alloc >::front | ( | ) | [inline] |
Returns a read/write reference to the data at the first element of the vector.
Definition at line 560 of file stl_vector.h.
allocator_type std::vector< Type, Alloc >::get_allocator | ( | ) | const [inline] |
Get a copy of the memory allocation object.
Reimplemented from std::Vector_alloc_base< Type, Allocator, IsStatic >.
Definition at line 347 of file stl_vector.h.
Referenced by std::vector< Type, Alloc >::M_fill_assign().
void std::vector< Type, Alloc >::insert | ( | iterator | position, | |
InputIterator | first, | |||
InputIterator | last | |||
) | [inline] |
Inserts a range into the vector.
pos | An iterator into the vector. | |
first | An input iterator. | |
last | An input iterator. |
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 689 of file stl_vector.h.
void std::vector< Type, 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 670 of file stl_vector.h.
vector< Type, Alloc >::iterator std::vector< Type, Alloc >::insert | ( | iterator | position, | |
const value_type & | x | |||
) |
Inserts given value into vector before specified iterator.
position | An iterator into the vector. | |
x | Data to be inserted. |
Definition at line 88 of file vector.tcc.
References std::vector< Type, Alloc >::begin(), and std::vector< Type, Alloc >::end().
Referenced by std::vector< Type, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_fill_assign(), std::vector< bool, Alloc >::M_insert_range(), std::vector< Type, Alloc >::M_range_insert(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::resize(), and std::vector< bool, Alloc >::resize().
size_type std::vector< Type, Alloc >::max_size | ( | ) | const [inline] |
Returns the size() of the largest possible vector.
Definition at line 419 of file stl_vector.h.
vector& std::vector< Type, Alloc >::operator= | ( | const vector< Type, Alloc > & | x | ) |
Vector assignment operator.
x | A vector of identical element and allocator types. |
const_reference std::vector< Type, 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. |
Definition at line 515 of file stl_vector.h.
reference std::vector< Type, 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 501 of file stl_vector.h.
void std::vector< Type, 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 615 of file stl_vector.h.
void std::vector< Type, Alloc >::push_back | ( | const value_type & | x | ) | [inline] |
Add data to the end of the vector.
x | Data to be added. |
Definition at line 595 of file stl_vector.h.
Referenced by std::vector< bool, Alloc >::M_initialize_range(), and std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::M_range_initialize().
const_reverse_iterator std::vector< Type, 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 394 of file stl_vector.h.
reverse_iterator std::vector< Type, 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 386 of file stl_vector.h.
const_reverse_iterator std::vector< Type, 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 410 of file stl_vector.h.
reverse_iterator std::vector< Type, 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 402 of file stl_vector.h.
void std::vector< Type, Alloc >::reserve | ( | size_type | n | ) |
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 std::__throw_length_error(), and std::vector< Type, Alloc >::size().
void std::vector< Type, Alloc >::resize | ( | size_type | new_size | ) | [inline] |
Resizes the vector to the specified number of elements.
new_size | Number of elements the vector should contain. |
Definition at line 452 of file stl_vector.h.
void std::vector< Type, Alloc >::resize | ( | size_type | new_size, | |
const value_type & | x | |||
) | [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 433 of file stl_vector.h.
Referenced by std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::resize().
size_type std::vector< Type, Alloc >::size | ( | ) | const [inline] |
Returns the number of elements in the vector.
Definition at line 415 of file stl_vector.h.
Referenced by std::vector< Type, Alloc >::M_assign_aux(), std::vector< bool, Alloc >::M_assign_aux(), std::vector< Type, Alloc >::M_fill_assign(), std::vector< bool, Alloc >::M_fill_assign(), std::vector< Type, Alloc >::M_fill_insert(), std::vector< bool, Alloc >::M_fill_insert(), std::vector< Type, Alloc >::M_insert_aux(), std::vector< bool, Alloc >::M_insert_aux(), std::vector< bool, Alloc >::M_insert_range(), std::vector< Type, Alloc >::M_range_insert(), std::vector< bool, Alloc >::operator=(), std::operator==(), std::vector< Type, Alloc >::reserve(), std::vector< __gnu_cxx::Hashtable_node< Val > *, Alloc >::resize(), std::vector< bool, Alloc >::resize(), and std::vector< bool, Alloc >::vector().
void std::vector< Type, Alloc >::swap | ( | vector< Type, Alloc > & | x | ) | [inline] |
Swaps data with another vector.
x | A vector of the same element and allocator types. |
Definition at line 745 of file stl_vector.h.
Referenced by std::vector< Type, Alloc >::M_fill_assign(), and std::swap().