#include <oscl_vector.h>
Inheritance diagram for Oscl_Vector< T, Alloc >:
Public Types | |
typedef T | value_type |
typedef T * | pointer |
typedef T & | reference |
typedef const T & | const_reference |
typedef T * | iterator |
typedef const T * | const_iterator |
Public Methods | |
Oscl_Vector () | |
Oscl_Vector (uint32 n) | |
Oscl_Vector (const Oscl_Vector< T, Alloc > &x) | |
virtual | ~Oscl_Vector () |
Oscl_Vector< T, Alloc > & | operator= (const Oscl_Vector< T, Alloc > &x) |
void | push_back (const T &x) |
void | push_front (const T &x) |
iterator | insert (iterator pos, const T &x) |
T & | operator[] (uint32 n) |
const T & | operator[] (uint32 n) const |
T & | front () |
const T & | front () const |
T & | back () |
const T & | back () const |
void | pop_back () |
void | clear () |
void | destroy () |
iterator | begin () const |
iterator | end () const |
iterator | erase (iterator pos) |
iterator | erase (iterator first, iterator last) |
|
|
|
|
|
|
|
|
|
|
|
|
|
Creates an empty vector. |
|
Creates an empty vector with capacity n.
|
|
Copy Constructor.
|
|
The destructor. |
|
Returns the last element. |
|
Returns the last element. |
|
Returns an iterator pointing to the beginning of the vector. Reimplemented from Oscl_Vector_Base. |
|
Removes all elements. |
|
Destroy -- this is like an explicit destructor call. Reimplemented from Oscl_Vector_Base. |
|
Returns an iterator pointing to the end of the vector.. Reimplemented from Oscl_Vector_Base. |
|
Erases elements in range [first, last). Erasing an element invalidates all iterators pointing to elements following the deletion point.
|
|
Erases the element pointed to by iterator pos. Erasing an element invalidates all iterators pointing to elements following the deletion point.
|
|
Returns the first element. |
|
Returns the first element. |
|
Inserts a new element before the one at pos.
|
|
The assignment operator |
|
Returns the n'th element.
|
|
Returns the n'th element.
|
|
Removes the last element. Reimplemented from Oscl_Vector_Base. |
|
Inserts a new element at the end. Inserting an element invalidates all iterators if memory reallocation occurs as a result of the insertion.
|
|
Inserts a new element at the front. Inserting an element invalidates all iterators if memory reallocation occurs as a result of the insertion.
|