moodycamel Namespace Reference

Namespaces
	details
	spsc_sema

Data Structures
class	weak_atomic
class	BlockingConcurrentQueue
struct	ConcurrentQueueDefaultTraits
class	ConcurrentQueue
struct	ProducerToken
struct	ConsumerToken
class	ReaderWriterQueue
class	BlockingReaderWriterQueue

Enumerations
enum	memory_order {   memory_order_relaxed , memory_order_acquire , memory_order_release , memory_order_acq_rel ,   memory_order_seq_cst , memory_order_sync = memory_order_seq_cst }

Functions
AE_FORCEINLINE void	compiler_fence (memory_order order)
AE_FORCEINLINE void	fence (memory_order order)
template<typename T , typename Traits >
void	swap (BlockingConcurrentQueue< T, Traits > &a, BlockingConcurrentQueue< T, Traits > &b) MOODYCAMEL_NOEXCEPT
template<typename T , typename Traits >
void	swap (typename ConcurrentQueue< T, Traits >::ImplicitProducerKVP &a, typename ConcurrentQueue< T, Traits >::ImplicitProducerKVP &b) MOODYCAMEL_NOEXCEPT
template<typename T , typename Traits >
void	swap (ConcurrentQueue< T, Traits > &a, ConcurrentQueue< T, Traits > &b) MOODYCAMEL_NOEXCEPT
void	swap (ProducerToken &a, ProducerToken &b) MOODYCAMEL_NOEXCEPT
void	swap (ConsumerToken &a, ConsumerToken &b) MOODYCAMEL_NOEXCEPT

Enumeration Type Documentation

memory_order

enum moodycamel::memory_order

Enumerator
memory_order_relaxed
memory_order_acquire
memory_order_release
memory_order_acq_rel
memory_order_seq_cst
memory_order_sync

Function Documentation

compiler_fence()

AE_FORCEINLINE void moodycamel::compiler_fence

(

memory_order

order

)

Here is the caller graph for this function:

fence()

AE_FORCEINLINE void moodycamel::fence

(

memory_order

order

)

Here is the caller graph for this function:

swap() [1/5]

template<typename T , typename Traits >

void moodycamel::swap ( BlockingConcurrentQueue< T, Traits > &  a, BlockingConcurrentQueue< T, Traits > &  b  )

inline

Here is the caller graph for this function:

swap() [2/5]

template<typename T , typename Traits >

void moodycamel::swap ( ConcurrentQueue< T, Traits > &  a, ConcurrentQueue< T, Traits > &  b  )

inline

swap() [3/5]

void moodycamel::swap ( ConsumerToken &  a, ConsumerToken &  b  )

inline

Here is the caller graph for this function:

swap() [4/5]

void moodycamel::swap ( ProducerToken &  a, ProducerToken &  b  )

inline

swap() [5/5]

template<typename T , typename Traits >

void moodycamel::swap ( typename ConcurrentQueue< T, Traits >::ImplicitProducerKVP &  a, typename ConcurrentQueue< T, Traits >::ImplicitProducerKVP &  b  )

inline