class TMDequeAsDoubleList

Public Methods

• T  GetLeft ()
• T  GetRight ()
• void  PutLeft ( const T& t )
• void  PutRight ( const T& t )
• const T&  PeekLeft () const
• const T&  PeekRight () const
• void  ForEach ( IterFunc iter, void *args )
• T * FirstThat ( CondFunc cond, void *args ) const
• T * LastThat ( CondFunc cond, void *args ) const
• void  Flush ()
• int  Detach ( const T& t )
• template T  GetLeft ()
• template T  GetRight ()

Public Members

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

Private Types

• typedef TDequeAsDoubleListImp,T> Parent

Detailed Description

template class TMDequeAsDoubleList template class TMDequeAsDoubleListIterator

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

[private]

[const]

[const]

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

Discarge every element in the queue