BLOCK_SIZE | ConcurrentQueue< T, Traits > | static |
ConcurrentQueue(size_t capacity=32 *BLOCK_SIZE) | ConcurrentQueue< T, Traits > | inlineexplicit |
ConcurrentQueue(size_t minCapacity, size_t maxExplicitProducers, size_t maxImplicitProducers) | ConcurrentQueue< T, Traits > | inline |
ConcurrentQueue(ConcurrentQueue const &)=delete | ConcurrentQueue< T, Traits > | |
ConcurrentQueue(ConcurrentQueue &&other) noexcept | ConcurrentQueue< T, Traits > | inline |
consumer_token_t typedef | ConcurrentQueue< T, Traits > | |
enqueue(T const &item) | ConcurrentQueue< T, Traits > | inline |
enqueue(T &&item) | ConcurrentQueue< T, Traits > | inline |
enqueue(producer_token_t const &token, T const &item) | ConcurrentQueue< T, Traits > | inline |
enqueue(producer_token_t const &token, T &&item) | ConcurrentQueue< T, Traits > | inline |
enqueue_bulk(It itemFirst, size_t count) | ConcurrentQueue< T, Traits > | inline |
enqueue_bulk(producer_token_t const &token, It itemFirst, size_t count) | ConcurrentQueue< T, Traits > | inline |
EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD | ConcurrentQueue< T, Traits > | static |
EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE | ConcurrentQueue< T, Traits > | static |
EXPLICIT_INITIAL_INDEX_SIZE | ConcurrentQueue< T, Traits > | static |
IMPLICIT_INITIAL_INDEX_SIZE | ConcurrentQueue< T, Traits > | static |
index_t typedef | ConcurrentQueue< T, Traits > | |
INITIAL_IMPLICIT_PRODUCER_HASH_SIZE | ConcurrentQueue< T, Traits > | static |
is_lock_free() | ConcurrentQueue< T, Traits > | inlinestatic |
MAX_SUBQUEUE_SIZE | ConcurrentQueue< T, Traits > | static |
moodycamel::swap | ConcurrentQueue< T, Traits > | friend |
operator=(ConcurrentQueue const &)=delete | ConcurrentQueue< T, Traits > | |
operator=(ConcurrentQueue &&other) noexcept | ConcurrentQueue< T, Traits > | inline |
producer_token_t typedef | ConcurrentQueue< T, Traits > | |
size_approx() const | ConcurrentQueue< T, Traits > | inline |
size_t typedef | ConcurrentQueue< T, Traits > | |
swap(ConcurrentQueue &other) noexcept | ConcurrentQueue< T, Traits > | inline |
try_dequeue(U &item) | ConcurrentQueue< T, Traits > | inline |
try_dequeue(consumer_token_t &token, U &item) | ConcurrentQueue< T, Traits > | inline |
try_dequeue_bulk(It itemFirst, size_t max) | ConcurrentQueue< T, Traits > | inline |
try_dequeue_bulk(consumer_token_t &token, It itemFirst, size_t max) | ConcurrentQueue< T, Traits > | inline |
try_dequeue_bulk_from_producer(producer_token_t const &producer, It itemFirst, size_t max) | ConcurrentQueue< T, Traits > | inline |
try_dequeue_from_producer(producer_token_t const &producer, U &item) | ConcurrentQueue< T, Traits > | inline |
try_dequeue_non_interleaved(U &item) | ConcurrentQueue< T, Traits > | inline |
try_enqueue(T const &item) | ConcurrentQueue< T, Traits > | inline |
try_enqueue(T &&item) | ConcurrentQueue< T, Traits > | inline |
try_enqueue(producer_token_t const &token, T const &item) | ConcurrentQueue< T, Traits > | inline |
try_enqueue(producer_token_t const &token, T &&item) | ConcurrentQueue< T, Traits > | inline |
try_enqueue_bulk(It itemFirst, size_t count) | ConcurrentQueue< T, Traits > | inline |
try_enqueue_bulk(producer_token_t const &token, It itemFirst, size_t count) | ConcurrentQueue< T, Traits > | inline |
~ConcurrentQueue() | ConcurrentQueue< T, Traits > | inline |