class TMIDequeAsDoubleList

Public Methods

• T * GetLeft ()
• T * GetRight ()
• void  PutLeft ( T *t )
• void  PutRight ( T *t )
• T * PeekLeft () const
• T * PeekRight () const
• void  Flush ( TShouldDelete::DeleteType dt = TShouldDelete::DefDelete )
• void  ForEach ( IterFunc iter, void *args )
• T * FirstThat ( CondFunc cond, void *args ) const
• T * LastThat ( CondFunc cond, void *args ) const
• int  Detach ( T *t, TShouldDelete::DeleteType dt = TShouldDelete::NoDelete )
• template T * GetLeft ()
• template T * GetRight ()

Public Members

• friend class TMIDequeAsDoubleListIterator
• typedef void  (*IterFunc) (T&, void *)
• typedef int  (*CondFunc) (const T&, void *)

Private Types

• typedef TDequeAsDoubleListImp,T *> Parent

Detailed Description

template class TMIDequeAsDoubleList template class TMIDequeAsDoubleListIterator

Implements a managed dequeue of pointers to objects of type T, using a double-linked list as the underlying implementation.

[private]

[const]

[const]

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

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);

[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

[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

remove an element from queue without destroing it if need