Public Types | |
typedef Base::reference | reference |
typedef Base::const_reference | const_reference |
typedef __gnu_debug::Safe_iterator< typename Base::iterator, vector > | iterator |
typedef __gnu_debug::Safe_iterator< typename Base::const_iterator, vector > | const_iterator |
typedef Base::size_type | size_type |
typedef Base::difference_type | difference_type |
typedef Type | value_type |
typedef Allocator | allocator_type |
typedef Allocator::pointer | pointer |
typedef Allocator::const_pointer | const_pointer |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
Public Member Functions | |
vector (const Allocator &a=Allocator()) | |
vector (size_type n, const Type &value=Type(), const Allocator &a=Allocator()) | |
template<class InputIterator> | |
vector (InputIterator first, InputIterator last, const Allocator &a=Allocator()) | |
vector (const vector< Type, Allocator > &x) | |
vector (const Base &x) | |
Construction from a release-mode vector. | |
~vector () | |
vector< Type, Allocator > & | operator= (const vector< Type, Allocator > &x) |
template<typename InputIterator> | |
void | assign (InputIterator first, InputIterator last) |
Assigns a range to a vector. | |
void | assign (size_type n, const Type &__u) |
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 |
void | resize (size_type sz, Type c=Type()) |
void | reserve (size_type n) |
reference | operator[] (size_type n) |
const_reference | operator[] (size_type n) const |
reference | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
void | push_back (const Type &x) |
Add data to the end of the vector. | |
void | pop_back () |
Removes last element. | |
iterator | insert (iterator position, const Type &x) |
void | insert (iterator position, size_type n, const Type &x) |
template<class InputIterator> | |
void | insert (iterator position, InputIterator first, InputIterator last) |
iterator | erase (iterator position) |
iterator | erase (iterator first, iterator last) |
void | swap (vector< Type, Allocator > &x) |
void | clear () |
Base & | M_base () |
const Base & | M_base () const |
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. | |
vector (InputIterator first, InputIterator last, const allocator_type &a=allocator_type()) | |
Builds a vector from a range. | |
void | assign (size_type n, const value_type &__val) |
Assigns a given value to a vector. | |
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. | |
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. | |
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 | M_invalidate_if (Predicate pred) |
void | M_transfer_iter (const Safe_iterator< Iterator, vector< Type, Allocator > > &x) |
void | M_invalidate_all () const |
Public Attributes | |
Safe_iterator_base * | M_iterators |
The list of mutable iterators that reference this container. | |
Safe_iterator_base * | M_const_iterators |
The list of constant iterators that reference this container. | |
unsigned int | M_version |
The container version number. This number may never be 0. | |
Protected Member Functions | |
void | M_range_check (size_type n) const |
pointer | M_allocate_and_copy (size_type n, ForwardIterator first, ForwardIterator last) |
void | M_initialize_dispatch (Integer n, Integer value, __true_type) |
void | M_initialize_dispatch (InputIterator first, InputIterator last, __false_type) |
void | M_range_initialize (InputIterator first, InputIterator last, input_iterator_tag) |
void | M_range_initialize (ForwardIterator first, ForwardIterator last, forward_iterator_tag) |
void | M_assign_dispatch (Integer n, Integer __val, __true_type) |
void | M_assign_dispatch (InputIterator first, InputIterator last, __false_type) |
void | M_insert_dispatch (iterator position, Integer n, Integer __val, __true_type) |
void | M_insert_dispatch (iterator position, InputIterator first, InputIterator last, __false_type) |
allocator_type | get_allocator () const |
Vector_base (const allocator_type &a) | |
Vector_base (size_t n, const allocator_type &a) | |
Type * | M_allocate (size_t n) |
void | M_deallocate (Type *__p, size_t n) |
void | M_detach_all () |
void | M_detach_singular () |
void | M_revalidate_singular () |
void | M_swap (Safe_sequence_base &x) |
Protected Attributes | |
Vector_impl | M_impl |
Private Types | |
typedef std::vector< Type, Allocator > | Base |
typedef __gnu_debug::Safe_sequence< vector > | Safe_base |
typedef Base::const_iterator | Base_const_iterator |
typedef __gnu_debug::After_nth_from< Base_const_iterator > | After_nth |
Private Member Functions | |
bool | M_requires_reallocation (size_type __elements) |
void | M_update_guaranteed_capacity () |
Private Attributes | |
size_type | M_guaranteed_capacity |
Definition at line 43 of file debug/vector.
|
Construction from a release-mode vector.
Definition at line 92 of file debug/vector. |
|
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. Reimplemented from std::vector< Type, Allocator >. Definition at line 95 of file debug/vector. |
|
Assigns a given value to a vector.
Definition at line 280 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. Reimplemented from std::vector< Type, Allocator >. Definition at line 108 of file debug/vector. |
|
Provides access to the data contained in the vector.
Definition at line 514 of file stl_vector.h. |
|
Provides access to the data contained in the vector.
Definition at line 500 of file stl_vector.h. |
|
Returns a read-only (constant) reference to the data at the last element of the vector. Reimplemented from std::vector< Type, Allocator >. Definition at line 227 of file debug/vector. |
|
Returns a read/write reference to the data at the last element of the vector. Reimplemented from std::vector< Type, Allocator >. Definition at line 220 of file debug/vector. |
|
Returns a read-only (constant) iterator that points to the first element in the vector. Iteration is done in ordinary element order. Reimplemented from std::vector< Type, Allocator >. Definition at line 132 of file debug/vector. |
|
Returns a read/write iterator that points to the first element in the vector. Iteration is done in ordinary element order. Reimplemented from std::vector< Type, Allocator >. Definition at line 128 of file debug/vector. Referenced by __gnu_debug_def::vector< Type, Allocator >::erase(), __gnu_debug_def::vector< Type, Allocator >::insert(), __gnu_debug_def::vector< Type, Allocator >::rend(), and __gnu_debug_def::vector< Type, Allocator >::resize(). |
|
Returns the total number of elements that the vector can hold before needing to allocate more memory. Definition at line 419 of file stl_vector.h. Referenced by __gnu_debug_def::vector< Type, Allocator >::M_requires_reallocation(). |
|
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. Reimplemented from std::vector< Type, Allocator >. Definition at line 336 of file debug/vector. |
|
Returns true if the vector is empty. (Thus begin() would equal end().) Definition at line 427 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. Reimplemented from std::vector< Type, Allocator >. Definition at line 140 of file debug/vector. |
|
Returns a read/write iterator that points one past the last element in the vector. Iteration is done in ordinary element order. Reimplemented from std::vector< Type, Allocator >. Definition at line 136 of file debug/vector. Referenced by __gnu_debug_def::vector< Type, Allocator >::pop_back(), and __gnu_debug_def::vector< Type, Allocator >::rbegin(). |
|
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. |
|
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. |
|
Returns a read-only (constant) reference to the data at the first element of the vector. Reimplemented from std::vector< Type, Allocator >. Definition at line 213 of file debug/vector. |
|
Returns a read/write reference to the data at the first element of the vector. Reimplemented from std::vector< Type, Allocator >. Definition at line 206 of file debug/vector. |
|
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 630 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 611 of file stl_vector.h. |
|
Inserts given value into vector before specified iterator.
|
|
Detach all iterators, leaving them singular. |
|
Detach all singular iterators.
|
|
Invalidates all iterators. Definition at line 202 of file safe_base.h. |
|
Invalidates all iterators |
|
Revalidates all attached singular iterators. This method may be used to validate iterators that were invalidated before (but for some reasion, such as an exception, need to become valid again). |
|
Swap this sequence with the given sequence. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container. Definition at line 172 of file debug.cc. References __gnu_debug::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Returns the size() of the largest possible vector. Definition at line 379 of file stl_vector.h. |
|
Subscript access to the data contained in the vector.
Definition at line 476 of file stl_vector.h. |
|
Subscript access to the data contained in the vector.
Definition at line 462 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. Reimplemented from std::vector< Type, Allocator >. Definition at line 245 of file debug/vector. References __gnu_debug_def::vector< Type, Allocator >::end(). |
|
Add data to the end of the vector.
Reimplemented from std::vector< Type, Allocator >. Definition at line 235 of file debug/vector. |
|
Returns a read-only (constant) reverse iterator that points to the last element in the vector. Iteration is done in reverse element order. Reimplemented from std::vector< Type, Allocator >. Definition at line 148 of file debug/vector. References __gnu_debug_def::vector< Type, Allocator >::end(). |
|
Returns a read/write reverse iterator that points to the last element in the vector. Iteration is done in reverse element order. Reimplemented from std::vector< Type, Allocator >. Definition at line 144 of file debug/vector. References __gnu_debug_def::vector< Type, Allocator >::end(). |
|
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. Reimplemented from std::vector< Type, Allocator >. Definition at line 156 of file debug/vector. References __gnu_debug_def::vector< Type, Allocator >::begin(). |
|
Returns a read/write reverse iterator that points to one before the first element in the vector. Iteration is done in reverse element order. Reimplemented from std::vector< Type, Allocator >. Definition at line 152 of file debug/vector. References __gnu_debug_def::vector< Type, Allocator >::begin(). |
|
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. |
|
Resizes the vector to the specified number of elements.
Definition at line 412 of file stl_vector.h. |
|
Resizes the vector to the specified number of elements.
Definition at line 393 of file stl_vector.h. |
|
Returns the number of elements in the vector. Definition at line 375 of file stl_vector.h. Referenced by __gnu_debug_def::vector< Type, Allocator >::M_update_guaranteed_capacity(), and __gnu_debug_def::vector< Type, Allocator >::resize(). |
|
Swaps data with another vector.
Definition at line 687 of file stl_vector.h. References std::swap(). |
|
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 241 of file stl_vector.h. |
|
Vector copy constructor.
Definition at line 219 of file stl_vector.h. References std::vector< Type, Alloc >::begin(), std::vector< Type, Alloc >::end(), and std::uninitialized_copy(). |
|
Create a vector with default elements.
Definition at line 205 of file stl_vector.h. References std::uninitialized_fill_n(). |
|
Create a vector with copies of an exemplar element.
Definition at line 191 of file stl_vector.h. References std::uninitialized_fill_n(). |
|
Default constructor creates no elements.
Definition at line 181 of file stl_vector.h. |
|
The list of constant iterators that reference this container.
Definition at line 156 of file safe_base.h. |
|
The list of mutable iterators that reference this container.
Definition at line 153 of file safe_base.h. |
|
The container version number. This number may never be 0.
Definition at line 159 of file safe_base.h. |