class TMIDequeAsVector

More...

Definition#include <classlib/include/classlib/deques.h>
Template formTMIDequeAsVector<class T>
InheritsTDequeAsVectorImp [public ], TShouldDelete [public ]
Inherited byTIDeque, TIDequeAsVector, TIQueue, TIQueueAsVector, TMIQueueAsVector
List of all Methods
Annotated List
Files
Globals
Hierarchy
Index

Public Methods

Public Members

Private Types


Detailed Description

template class TMIDequeAsVector

Implements a managed dequeue of pointers to objects of type T, using a vector as the underlying implementation.

typedef TDequeAsVectorImp<TMIVectorImp,T *> Parent

Parent

[private]

friend class TMIDequeAsVectorIterator

TMIDequeAsVectorIterator

typedef void  (*IterFunc) (T&, void *)

(*IterFunc)

typedef int  (*CondFunc) (const T &, void *)

(*CondFunc)

 TMIDequeAsVector ( unsigned sz = DEFAULT_DEQUE_SIZE )

TMIDequeAsVector

 ~TMIDequeAsVector ()

~TMIDequeAsVector

T * PeekLeft ()

PeekLeft

[const]

T * PeekRight ()

PeekRight

[const]

T * GetLeft ()

GetLeft

T * GetRight ()

GetRight

void  PutLeft ( T *t )

PutLeft

void  PutRight ( T *t )

PutRight

void  Flush ( TShouldDelete::DeleteType = TShouldDelete::DefDelete )

Flush

empty the queue; if the ownership is on also the elements in the queue will be destroyed

void  ForEach ( IterFunc iter, void *args )

ForEach

auto iterator: use an iterator function calling it for every element of the array; the function must have a prototype like this: void iterFunc(T&, void* args);

T * FirstThat ( CondFunc cond, void *args )

FirstThat

[const]

auto iterator: use a test function calling it for every element of the array; the function must have a prototype like this: int testFunc(const T&, void* args); the function must return 0 if the test fail, != 0 if test is ok; the first element that testing successful will be returned or NULL if no elements is ok

T * LastThat ( CondFunc cond, void *args )

LastThat

[const]

auto iterator: use a test function calling it for every element of the array; the function must have a prototype like this: int testFunc(const T&, void* args); the function must return 0 if the test fail, != 0 if test is ok; the last element that testing successful will be returned or NULL if no elements is ok

template T * GetRight ()

GetRight

template void  PutRight ( T *t )

PutRight

template T * GetLeft ()

GetLeft

template void  PutLeft ( T *t )

PutLeft

template void  Flush ( TShouldDelete::DeleteType dt )

Flush

template void  ForEach ( IterFunc iter, void *args )

ForEach

template T * FirstThat ( CondFunc cond, void *args )

FirstThat

[const]

template T * LastThat ( CondFunc cond, void *args )

LastThat

[const]


Generated by: nicola on gulliver.wadahome.it on Sun May 25 13:54:34 2003, using kdoc 2.0a53.