#include <oscl_queue.h>
Inheritance diagram for Oscl_Queue_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) |
virtual | ~Oscl_Queue_Base () |
OSCL_IMPORT_REF void | destroy () |
OSCL_IMPORT_REF void | push (const OsclAny *x) |
OSCL_IMPORT_REF void | pop () |
OSCL_IMPORT_REF void | clear () |
Protected Attributes | |
uint32 | numelems |
uint32 | bufsize |
OsclAny * | elems |
uint32 | sizeof_T |
uint32 | ifront |
uint32 | irear |
|
The destructor. |
|
Returns the allocated memory of the queue. |
|
Removes all elements. Reimplemented in Oscl_Queue< T, Alloc >. |
|
|
|
|
|
Like an explicit destructor call. |
|
True if there are no elements in the queue |
|
Removes the first element Reimplemented in Oscl_Queue< T, Alloc >. |
|
Inserts a new element at the end. Queue will be grown if necessary. If allocation fails, an OSCL_LEAVE will occur
|
|
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 queue. |
|
|
|
|
|
|
|
|
|
|
|
|