Created
August 6, 2016 16:00
-
-
Save AALEKH/7fe1fae2a5a86597abe765d47f6b269f to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // | |
| // Copyright (c) 2013 Juan Palacios juan.palacios.puyana@gmail.com | |
| // Subject to the BSD 2-Clause License | |
| // - see < http://opensource.org/licenses/BSD-2-Clause> | |
| // | |
| #ifndef CONCURRENT_QUEUE_ | |
| #define CONCURRENT_QUEUE_ | |
| #include <queue> | |
| #include <thread> | |
| #include <mutex> | |
| #include <condition_variable> | |
| template <typename T> | |
| class Queue | |
| { | |
| public: | |
| T pop() | |
| { | |
| std::unique_lock<std::mutex> mlock(mutex_); | |
| while (queue_.empty()) | |
| { | |
| cond_.wait(mlock); | |
| } | |
| auto val = queue_.front(); | |
| queue_.pop(); | |
| return val; | |
| } | |
| void pop(T& item) | |
| { | |
| std::unique_lock<std::mutex> mlock(mutex_); | |
| while (queue_.empty()) | |
| { | |
| cond_.wait(mlock); | |
| } | |
| item = queue_.front(); | |
| queue_.pop(); | |
| } | |
| void push(const T& item) | |
| { | |
| std::unique_lock<std::mutex> mlock(mutex_); | |
| queue_.push(item); | |
| mlock.unlock(); | |
| cond_.notify_one(); | |
| } | |
| Queue()=default; | |
| Queue(const Queue&) = delete; // disable copying | |
| Queue& operator=(const Queue&) = delete; // disable assignment | |
| private: | |
| std::queue<T> queue_; | |
| std::mutex mutex_; | |
| std::condition_variable cond_; | |
| }; | |
| #endif |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment