#include <oscl_vector.h>
Inheritance diagram for Oscl_Vector_Base:
Public Methods | |
uint32 | size () const |
uint32 | capacity () const |
bool | empty () const |
OSCL_IMPORT_REF void | reserve (uint32 n) |
Protected Methods | |
OSCL_IMPORT_REF void | construct (Oscl_Opaque_Type_Alloc *aType) |
OSCL_IMPORT_REF void | construct (Oscl_Opaque_Type_Alloc *aType, uint32 n) |
OSCL_IMPORT_REF void | construct (Oscl_Opaque_Type_Alloc *aType, const Oscl_Vector_Base &x) |
virtual | ~Oscl_Vector_Base () |
OSCL_IMPORT_REF void | push_back (const OsclAny *x) |
OSCL_IMPORT_REF void | pop_back () |
OSCL_IMPORT_REF void | push_front (const OsclAny *x) |
OSCL_IMPORT_REF OsclAny * | insert (OsclAny *pos, const OsclAny *x) |
OSCL_IMPORT_REF OsclAny * | erase (OsclAny *pos) |
OSCL_IMPORT_REF OsclAny * | erase (OsclAny *first, OsclAny *last) |
OSCL_IMPORT_REF void | assign_vector (const Oscl_Vector_Base &x) |
OSCL_IMPORT_REF void | destroy () |
Protected Attributes | |
uint32 | numelems |
uint32 | bufsize |
OsclAny * | elems |
uint32 | sizeof_T |
Friends | |
class | OsclPriorityQueueBase |
|
The destructor. |
|
|
|
Returns the allocated memory of the vector in units of number of elements. |
|
|
|
|
|
|
|
|
True if the vector's size is 0. |
|
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.
|
|
Inserts a new element at a specific position.
|
|
|
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.
|
|
Reallocates memory if necessary to a capacity of n elements. The main reason for reserve is efficiency. If you know the capacity to which your vector must grow, then it is more efficient to allocate the vector all at once rather than rely on the automatic reallocation scheme. This also helps cotrol the invalidation of iterators.
|
|
Returns the size of the vector in units of number of elements. |
|
|
|
|
|
|
|
|
|
|