|
|
bool | push_unlocked (const_reference value) |
| | Push a value to the queue without locking.
|
|
bool | push (const_reference value) |
| | Push a value to the queue.
|
|
template<typename T1> |
| bool | emplace_unlocked (const T1 &value1) |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1, typename T2> |
| bool | emplace_unlocked (const T1 &value1, const T2 &value2) |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1, typename T2, typename T3> |
| bool | emplace_unlocked (const T1 &value1, const T2 &value2, const T3 &value3) |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1, typename T2, typename T3, typename T4> |
| bool | emplace_unlocked (const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4) |
| | Constructs a value in the queue 'in place'.
|
|
bool | emplace () |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1> |
| bool | emplace (const T1 &value1) |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1, typename T2> |
| bool | emplace (const T1 &value1, const T2 &value2) |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1, typename T2, typename T3> |
| bool | emplace (const T1 &value1, const T2 &value2, const T3 &value3) |
| | Constructs a value in the queue 'in place'.
|
|
template<typename T1, typename T2, typename T3, typename T4> |
| bool | emplace (const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4) |
| | Constructs a value in the queue 'in place'.
|
|
bool | pop_unlocked () |
| | Pop a value from the queue without locking, and discard.
|
|
bool | pop () |
| | Pop a value from the queue and discard.
|
|
bool | pop_unlocked (reference value) |
| | Pop a value from the queue without locking.
|
|
bool | pop (reference value) |
| | Pop a value from the queue.
|
|
reference | front_unlocked () |
| | Peek a value at the front of the queue without locking.
|
|
const_reference | front_unlocked () const |
| | Peek a value at the front of the queue without locking.
|
|
reference | front () |
| | Peek a value at the front of the queue.
|
|
const_reference | front () const |
| | Peek a value at the front of the queue.
|
|
void | clear_unlocked () |
| | Clear the queue, unlocked.
|
|
void | clear () |
| | Clear the queue.
|
|
virtual | ~queue_lockable_base () |
| | Destructor.
|
| size_type | available_unlocked () const |
|
size_type | available () const |
| | How much free space available in the queue.
|
| bool | empty_unlocked () const |
|
bool | empty () const |
| | Is the queue empty?
|
| bool | full_unlocked () const |
|
bool | full () const |
| | Is the queue full?
|
| size_type | size_unlocked () const |
|
size_type | size () const |
| | How many items in the queue?
|
|
size_type | capacity () const |
| | How many items can the queue hold.
|
|
size_type | max_size () const |
| | How many items can the queue hold.
|
template<typename T, const size_t VMemory_Model = etl::memory_model::MEMORY_MODEL_LARGE>
class etl::iqueue_lockable< T, VMemory_Model >
This is the base for all queues that contain a particular type.
Normally a reference to this type will be taken from a derived queue_lockable. This queue supports concurrent access by one producer and one consumer.
- Template Parameters
-