#include <crtdefs.h>
#include <memory>
#include <cstddef>
#include <crtdbg.h>
#include <concrt.h>
#include <utility>
 
Go to the source code of this file.
 | 
| class   | Concurrency::concurrent_queue< _Ty, _Ax > | 
|   | 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.  More...
  | 
|   | 
| class   | Concurrency::details::_Concurrent_queue_iterator< _Container, _Value > | 
|   | 
| class   | Concurrency::details::_Concurrent_queue_base_v4 | 
|   | 
| struct   | Concurrency::details::_Concurrent_queue_base_v4::_Page | 
|   | 
| struct   | Concurrency::details::_Micro_queue | 
|   | 
| class   | Concurrency::details::_Concurrent_queue_rep | 
|   | 
| class   | Concurrency::details::_Concurrent_queue_iterator_base_v4 | 
|   | 
| class   | Concurrency::details::_Concurrent_queue_iterator< _Container, _Value > | 
|   | 
| struct   | Concurrency::details::std::_Is_checked_helper< _Concurrent_queue_iterator< _Container, _Value > > | 
|   | 
| class   | Concurrency::concurrent_queue< _Ty, _Ax > | 
|   | 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.  More...
  | 
|   | 
| class   | Concurrency::concurrent_queue< _Ty, _Ax >::_Destroyer | 
|   | 
 | 
| template<typename _C , typename _Ty , typename _U >  | 
| bool  | Concurrency::details::operator== (const _Concurrent_queue_iterator< _C, _Ty > &_I, const _Concurrent_queue_iterator< _C, _U > &_J) | 
|   | 
| template<typename _C , typename _Ty , typename _U >  | 
| bool  | Concurrency::details::operator!= (const _Concurrent_queue_iterator< _C, _Ty > &_I, const _Concurrent_queue_iterator< _C, _U > &_J) | 
|   |