The concurrent_queue class is a sequence container class that allows first-in,
first-out access to its elements. It enables a limited set of concurrency-safe operations, such as
push and try_pop, to name a few.
template<
typename _Ty,
class _Ax
>
class concurrent_queue: public ::Concurrency::details::_Concurrent_queue_base_v4;
- _Ty
The data type of the elements to be stored in the queue.
- _Ax
The type that represents the stored allocator object that encapsulates details about the allocation and
deallocation of memory for this concurrent queue. This argument is optional and the default value is
allocator<_Ty>.
Public Typedefs
Name | Description |
|---|
allocator_type |
A type that represents the allocator class for the concurrent queue.
|
const_iterator |
A type that represents a non-thread-safe const iterator over elements in a concurrent queue.
|
const_reference |
A type that provides a reference to a const element stored in a concurrent queue for reading and
performing const operations.
|
difference_type |
A type that provides the signed distance between two elements in a concurrent queue.
|
iterator |
A type that represents a non-thread-safe iterator over the elements in a concurrent queue.
|
reference |
A type that provides a reference to an element stored in a concurrent queue.
|
size_type |
A type that counts the number of elements in a concurrent queue.
|
value_type |
A type that represents the data type stored in a concurrent queue.
|
Public Constructors
Public Methods
For more information, see Parallel Containers and Objects.
_Concurrent_queue_base_v4
concurrent_queue
Header: concurrent_queue.h
Reference