#include <lock_free_intrusive_stamped_stack.h>
|
typedef T * | pointer |
|
typedef const T * | const_pointer |
|
typedef T & | reference |
|
typedef const T & | const_reference |
|
typedef AZStd::size_t | difference_type |
|
typedef AZStd::size_t | size_type |
|
typedef T | value_type |
|
typedef T | node_type |
|
typedef node_type * | node_ptr_type |
|
typedef lock_free_intrusive_stack_node< T > | hook_node_type |
|
typedef hook_node_type * | hook_node_ptr_type |
|
|
void | push (const_reference value) |
| Pushes a value onto the top of the stack.
|
|
pointer | pop () |
|
bool | empty () const |
| Tests if the stack is empty, limited utility for a concurrent container.
|
|
template<typename T, typename Hook>
class AZStd::lock_free_intrusive_stamped_stack< T, Hook >
A lock-free intrusive stack implementation. The stored type must either inherit from lock_free_intrusive_stack_node or include it as a member, and the appropriate hook type must be specified. Unlike lock_free_intrusive_stack, this uses stamped references to avoid the ABA problem.
◆ pop()
template<typename T , typename Hook >
Attempts to pop a value from the top of the stack. Returns NULL if the stack was empty, otherwise returns a pointer to the popped value
The documentation for this class was generated from the following file:
- Code/Framework/AzCore/AzCore/std/parallel/containers/lock_free_intrusive_stamped_stack.h