Atomic FIFO of a pre-defined size for copy-able class. More...
#include <atomic_queue.h>
Public Types | |
typedef atomic_pointer_queue < T, SIZE >::nospace_error | nospace_error |
typedef uint_cas_max | key |
Public Member Functions | |
void | push (const T &t) |
void | pop () |
This is not reentrant. | |
T & | front () |
This is not reentrant. | |
bool | empty () const |
This is not reentrant. | |
unsigned int | size () const |
bool | atomicPop (key item) |
key | atomicFront (T *val) |
Try to obtain the front item. | |
Private Member Functions | |
int | key2index (key i) |
int | key2serial (key i) |
key | key_index_serial (int index, int serial) |
Private Attributes | |
atomic_nonzero_pod_queue< key, SIZE > | m_queue |
atomic_nonzero_pod_queue< key, SIZE > | m_reservoir |
T | m_array [SIZE] |
Atomic FIFO of a pre-defined size for copy-able class.
Definition at line 209 of file atomic_queue.h.
|
inline |
Try to pop the front item.
item | to be released. |
Definition at line 272 of file atomic_queue.h.