|
| | Q () |
| | Default Constructor.
|
| |
| | ~Q () |
| | Default destructor.
|
| |
| Atomic * | lock () |
| |
| void | insert (QMember *item, unsigned index=0) |
| | Add an item to the back of the queue.
|
| |
| void | insert_locked (QMember *item, unsigned index=0) |
| | Add an item to the back of the queue.
|
| |
| QMember * | next (unsigned index) |
| | Get an item from the front of the queue.
|
| |
| Result | next () |
| | Get an item from the front of the queue.
|
| |
| Result | next_locked () |
| | Get an item from the front of the queue.
|
| |
| size_t | pending (unsigned index) |
| | Get the number of pending items in the queue.
|
| |
| size_t | pending () |
| | Get the number of pending items in the queue.
|
| |
| bool | empty (unsigned index) |
| | Test if the queue is empty.
|
| |
| bool | empty () |
| | Test if the queue is empty.
|
| |
This class implements a linked list "queue" of buffers.
It may be instantiated to use the mainBufferPool for its memory pool, or optionally another BufferPool instance may be specified for its memory pool.
Definition at line 97 of file Queue.hxx.