25 template <
class T, QueueBehaviorIfFull kBehavior = QueueBehaviorIfFull::THROW>
47 while (!
queue_.readIfNotEmpty(item)) {
55 while (!
queue_.readIfNotEmpty(item)) {
constexpr detail::Map< Move > move
bool post()
Silently saturates if value is already 2^32-1.
—— Concurrent Priority Queue Implementation ——
LifoSemMPMCQueue(size_t max_capacity)
BlockingQueueAddResult add(T item) override
folly::MPMCQueue< T > queue_
folly::Optional< T > try_take_for(std::chrono::milliseconds time) override
bool try_wait_for(const std::chrono::duration< Rep, Period > &timeout)
std::chrono::nanoseconds time()