17template <
typename T,
typename Container = fl::deque<T>>
144template <
typename T,
typename Container>
queue()=default
Default constructor - creates an empty queue.
bool empty() const
Check if the queue is empty.
void push(const value_type &value)
Add an element to the back of the queue.
queue & operator=(const queue &other)=default
Copy assignment operator.
queue(Container &&container)
Construct queue by moving the given container.
const Container & get_container() const
Get access to the underlying container (const version)
queue(queue &&other)=default
Move constructor.
const_reference back() const
Access the last element (back of queue) - const version.
void swap(queue &other)
Swap the contents with another queue.
queue(const Container &container)
Construct queue with a copy of the given container.
queue(const queue &other)=default
Copy constructor.
Container & get_container()
Get access to the underlying container (for advanced use)
size_type size() const
Get the number of elements in the queue.
~queue()=default
Destructor.
void pop()
Remove the front element from the queue.
const T & const_reference
const_reference front() const
Access the first element (front of queue) - const version.
void push(value_type &&value)
Add an element to the back of the queue (move version)
queue & operator=(queue &&other)=default
Move assignment operator.
reference front()
Access the first element (front of queue)
reference back()
Access the last element (back of queue)
A first-in, first-out (FIFO) queue container adapter.
Implements the FastLED namespace macros.
constexpr remove_reference< T >::type && move(T &&t) noexcept
void swap(array< T, N > &lhs, array< T, N > &rhs) noexcept(noexcept(lhs.swap(rhs)))