31#ifndef ETL_INTRUSIVE_QUEUE_INCLUDED
32#define ETL_INTRUSIVE_QUEUE_INCLUDED
90 template <
typename TLink>
96 typedef TLink link_type;
112 p_back->etl_next = &value;
131 link_type* p_next =
p_front->etl_next;
149 template <
typename TContainer>
218 template <
typename TValue,
typename TLink>
227 typedef TValue value_type;
228 typedef value_type* pointer;
229 typedef const value_type* const_pointer;
230 typedef value_type& reference;
231 typedef const value_type& const_reference;
232 typedef size_t size_type;
Definition intrusive_queue.h:62
Definition intrusive_queue.h:48
Definition intrusive_queue.h:76
Definition exception.h:47
void pop_into(TContainer &destination)
Definition intrusive_queue.h:150
const_reference front() const
Definition intrusive_queue.h:267
const_reference back() const
Definition intrusive_queue.h:277
reference back()
Definition intrusive_queue.h:257
size_t current_size
Counts the number of elements in the list.
Definition intrusive_queue.h:208
void pop()
Definition intrusive_queue.h:125
link_type terminator
This link terminates the queue and points to the front of the queue.
Definition intrusive_queue.h:206
bool empty() const
Checks if the queue is in the empty state.
Definition intrusive_queue.h:173
intrusive_queue()
Constructor.
Definition intrusive_queue.h:237
~intrusive_queue_base()
Destructor.
Definition intrusive_queue.h:201
void push(link_type &value)
Definition intrusive_queue.h:102
reference front()
Definition intrusive_queue.h:247
link_type * p_back
Pointer to the current back of the queue.
Definition intrusive_queue.h:205
void clear()
Clears the queue to the empty state.
Definition intrusive_queue.h:160
intrusive_queue_base()
Constructor.
Definition intrusive_queue.h:191
size_t size() const
Returns the number of elements.
Definition intrusive_queue.h:181
Definition intrusive_queue.h:220
Definition intrusive_queue.h:92
bitset_ext
Definition absolute.h:39
ETL_NODISCARD ETL_CONSTEXPR14 T round_half_even_unscaled(T value) ETL_NOEXCEPT
Definition scaled_rounding.h:315