TBlockableAtomicQuasiQueue.h

Go to the documentation of this file.

#pragma once
 
#include <moodycamel/blockingconcurrentqueue.h>
 
#include <cstddef>
#include <iterator>
 
namespace ph
{
 
template<typename T>
class TBlockableAtomicQuasiQueue final
{
public:
    TBlockableAtomicQuasiQueue();
    explicit TBlockableAtomicQuasiQueue(std::size_t initialCapacity);
 
    template<typename U>
    void enqueue(U&& item);
 
    template<std::input_iterator Iterator>
    void enqueueBulk(Iterator firstItem, std::size_t numItems);
 
    template<typename U>
    bool tryEnqueue(U&& item);
 
    bool tryDequeue(T* out_item);
 
    void waitDequeue(T* out_item);
 
    template<std::output_iterator<T> Iterator>
    std::size_t waitDequeueBulk(Iterator out_firstItem, std::size_t numItems);
 
    std::size_t estimatedSize() const;
 
private:
    /*
    For more information about the queue, please see the documentation of `TAtomicQuasiQueue::m_queue` as they
    share similar properties.
    */
    moodycamel::BlockingConcurrentQueue<T> m_queue;
};
 
}// end namespace ph
 
#include "Utility/Concurrent/TBlockableAtomicQuasiQueue.ipp"