31#ifndef ETL_INTRUSIVE_STACK_INCLUDED
32#define ETL_INTRUSIVE_STACK_INCLUDED
90 template <
typename TLink>
96 typedef TLink link_type;
106 value.etl_next =
p_top;
118#if defined(ETL_CHECK_PUSH_POP)
121 link_type* p_next =
p_top->etl_next;
132 template <
typename TContainer>
146 link_type* current =
p_top;
151 next = current->etl_next;
152 current->etl_next = previous;
220 template <
typename TValue,
typename TLink>
258 const_reference
top()
const
Definition intrusive_stack.h:62
Definition intrusive_stack.h:48
Definition intrusive_stack.h:76
Definition exception.h:47
void pop()
Definition intrusive_stack.h:116
size_t size() const
Returns the number of elements.
Definition intrusive_stack.h:184
reference top()
Definition intrusive_stack.h:249
void reverse()
Reverses the stack order.
Definition intrusive_stack.h:143
void clear()
Clears the stack to the empty state.
Definition intrusive_stack.h:163
const_reference top() const
Definition intrusive_stack.h:258
~intrusive_stack_base()
Destructor.
Definition intrusive_stack.h:203
void pop_into(TContainer &destination)
Definition intrusive_stack.h:133
intrusive_stack()
Constructor.
Definition intrusive_stack.h:239
size_t current_size
Counts the number of elements in the list.
Definition intrusive_stack.h:210
bool empty() const
Checks if the stack is in the empty state.
Definition intrusive_stack.h:176
link_type * p_top
The current top of the stack.
Definition intrusive_stack.h:207
link_type terminator
Terminator link of the queue.
Definition intrusive_stack.h:208
void push(link_type &value)
Definition intrusive_stack.h:102
intrusive_stack_base()
Constructor.
Definition intrusive_stack.h:194
Definition intrusive_stack.h:222
Definition intrusive_stack.h:92
bitset_ext
Definition absolute.h:38
pair holds two objects of arbitrary type
Definition utility.h:164