A single-producer, single-consumer, lock-free bounded queue.
Declared in <folly/ProducerConsumerQueue.h>
template<class T>
struct ProducerConsumerQueue;| Name | Description |
|---|---|
value_type | The type of elements stored in the queue. |
| Name | Description |
|---|---|
ProducerConsumerQueue [constructor] | Constructors |
~ProducerConsumerQueue [destructor] | Destroy the queue and any elements still stored in it. |
operator= [deleted] | Copy assignment is deleted; the queue is not copyable. |
capacity | Return the maximum number of items the queue can hold. |
frontPtr | Pointer to the value at the front of the queue, for in-place use. |
isEmpty | Check whether the queue is empty. |
isFull | Check whether the queue is full. |
popFront | Remove the element at the front of the queue. |
read | Move (or copy) the value at the front of the queue into a given variable. |
sizeGuess | Return an approximate count of elements currently in the queue. |
write | Construct an element in place at the back of the queue. |