//
// 7.2.cpp
// c++1x tutorial
//
// created by changkun at changkun.de
//
// 生产者消费者模型
#include
#include
#include
#include
#include
#include
int main()
{
// 生产者数é‡
std::queue produced_nums;
// 互斥é”
std::mutex m;
// æ¡ä»¶å˜é‡
std::condition_variable cond_var;
// 结æŸæ ‡å¿—
bool done = false;
// é€šçŸ¥æ ‡å¿—
bool notified = false;
// 生产者线程
std::thread producer([&]() {
for (int i = 0; i < 5; ++i) {
std::this_thread::sleep_for(std::chrono::seconds(1));
// 创建互斥é”
std::unique_lock<:mutex> lock(m);
std::cout << "producing " << i << '\n';
produced_nums.push(i);
notified = true;
// 通知一个线程
cond_var.notify_one();
}
done = true;
notified = true;
cond_var.notify_one();
});
// 消费者线程
std::thread consumer([&]() {
std::unique_lock<:mutex> lock(m);
while (!done) {
while (!notified) { // 循环é¿å…虚å‡å”¤é†’
cond_var.wait(lock);
}
while (!produced_nums.empty()) {
std::cout << "consuming " << produced_nums.front() << '\n';
produced_nums.pop();
}
notified = false;
}
});
producer.join();
consumer.join();
}