class TISTQueue

Public Methods

•  TISTQueue ()
• T * Get ()
• void  Put ( T *t )
• void  Flush ()
• int  Detach ( T *t )
• void  ForEach ( IterFunc iter, void *args )
• T * FirstThat ( CondFunc cond, void *args )
• T * LastThat ( CondFunc cond, void *args )
• void  LockIfEmpty ()

Public Members

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

Protected Members

• CCriticalSection csec
• CEvent evitem

Private Types

• typedef TIQueueAsDoubleList Parent

Detailed Description

Thread safe queue. This class implements a thread safe queue ready to use in multitread application. The queue have a CriticalSection (see) for syncronization of insertion end extraction from the queue. It can notify a waiting thread when new item are inserted into the queue (see the LockIfEmpty method). The internal implementation is a linked list queue.

[private]

Construct the queue and the semaphore in non blocking state

Get an element from the queue. The get operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

Put an element into the queue. The put operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

Destroy all elements into the queue. The flush operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

Detach an element from the queue. The detach operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

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); The operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

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 tested successful will be returned or NULL if no elements is ok. The operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

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 tested successful will be returned or NULL if no elements is ok. The operation request the lock of a CriticalSection (see) to proceed. The calling thread will be locked if another thread is accessing another lock method.

[protected]

[protected]