-
-
Save skynowa/b36d23178a01a087b3f4904c492a36cc to your computer and use it in GitHub Desktop.
Consumer - producer example using C++11 thread
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
| #include <condition_variable> | |
| #include <mutex> | |
| #include <future> | |
| #include <iostream> | |
| #include <chrono> | |
| #include <queue> | |
| bool isReady; | |
| std::mutex mutex; | |
| std::condition_variable condvar; | |
| std::queue<int> messageQ; | |
| void Producer() | |
| { | |
| std::cout << "=== Producer ===" << std::endl; | |
| for (auto x = 0; x < 10; x++) | |
| { | |
| std::lock_guard<std::mutex> guard(mutex); | |
| std::cout << "Producing message: " << x << " th" << std::endl; | |
| messageQ.push(x); | |
| std::this_thread::sleep_for(std::chrono::seconds(1)); | |
| } | |
| { | |
| std::lock_guard<std::mutex> guard(mutex); | |
| isReady = true; | |
| } | |
| std::cout << "=== Producer has completed ===" << std::endl; | |
| condvar.notify_one(); | |
| } | |
| void Consumer() | |
| { | |
| { | |
| std::unique_lock<std::mutex> ulock(mutex); | |
| condvar.wait(ulock, [] { | |
| return isReady; } | |
| ); | |
| } | |
| std::cout << "\n\n=== Consumer is ready to get message ===" << std::endl; | |
| while(!messageQ.empty()) | |
| { | |
| std::lock_guard<std::mutex> guard(mutex); | |
| int i = messageQ.front(); | |
| std::cout << "Consuming message: " << i << " th" << std::endl; | |
| messageQ.pop(); | |
| } | |
| if(!messageQ.empty()) | |
| std::cout << "There are still messages remained from producer" << std::endl; | |
| else | |
| std::cout << "All messages from producer has been processed" << std::endl; | |
| } | |
| int main() | |
| { | |
| auto t1 = std::async(std::launch::async, Producer); | |
| auto t2 = std::async(std::launch::async, Consumer); | |
| t1.get(); | |
| t2.get(); | |
| } | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment