priority_queue
priority_queue.hSimilar to:
std::priority_queueA fixed capacity priority queue.
etl::priority_queue<typename T, const size_t SIZE>Inherits from etl::ipriority_queue<T>
etl::ipriority_queue may be used as a size independent pointer or reference type for any etl::priority_queue instance.
Member types
value_type T
size_type std::size_tConstructor
etl::priority_queue<typename T, const size_t SIZE>();Element access
T& top()
const T& top() constDescription
Returns a reference or const reference to the first element.
Undefined behaviour if the queue is empty.
Capacity
bool empty() constDescription
Returns true if the size of the queue is zero, otherwise false.
bool full() constDescription
Returns true if the size of the queue is SIZE, otherwise false.
size_t size() constDescription
Returns the size of the queue.
size_t available() constDescription
Returns the remaining available capacity in the queue.
size_t max_size() constDescription
Returns the maximum possible size of the queue.
size_t capacity() constDescription
Returns the maximum possible size of the queue.
Modifiers
void push(const T& value);
void push(T&& value);Description
Pushes a value to the queue.
If the queue is full then emits an etl::queue_full error.
If asserts or exceptions are not enabled then undefined behaviour occurs.
C++03
void emplace(const T1& value1);
void emplace(const T1& value1, const T2& value2);
void emplace(const T1& value1, const T2& value2, const T3& value3);
void emplace(const T1& value1, const T2& value2, const T3& value3, const T4& value4);C++11
void emplace(Args&&… args);Description
Constructs an item in the the queue ‘in place’.
C++03: Supports up to four constructor parameters.
Emits an etl::queue_full if the queue is full and ETL_CHECK_PUSH_POP is defined.
If asserts or exceptions are not enabled then undefined behaviour occurs.
void pop();Description
Pop a value from the front of the list.
Undefined behaviour if the queue is empty.
void clear();Description
Clears the queue to a size of zero.