文章目录
- 前言
- 1. 生产者/消费者模式介绍
- 2. 生产者/消费者模式实现
- 总结
前言
最近在复习C++多线程方面的知识,借此机会实现了生产者-消费者模式。
1. 生产者/消费者模式介绍
本次实现的生产者消费模式,读者可以类比馒头生产和销售。馒头生产最多存储10个大馒头,再多就不新鲜了,哈哈。这里以c++ 容器 deque来保存生产的馒头,详细的过程参考代码实现中的注释即可。
2. 生产者/消费者模式实现
std::deque<int> deqProducts;
static int PRODUCT_MAX_NUM = 10;
bool bTerminate = false;
std::mutex mProducer, mConsumer, mPrint;
std::condition_variable cvProducer, cvConsumer;
auto producer = [&](int i) {
std::unique_lock<std::mutex> uLock(mProducer);
while (deqProducts.size() > PRODUCT_MAX_NUM) {
cvProducer.wait(uLock);
}
mPrint.lock();
std::cout << "Producer will produce product: " << i << std::endl;
mPrint.unlock();
deqProducts.push_back(i);
cvConsumer.notify_all();
};
auto consumer = [&]() {
while (true) {
std::unique_lock<std::mutex> uLock(mConsumer);
while (deqProducts.empty() && !bTerminate) {
cvConsumer.wait(uLock);
}
if (bTerminate) {
break;
}
int product = deqProducts.front();
deqProducts.pop_front();
mPrint.lock();
std::cout << "Consumer already consume product: " << product << std::endl;
mPrint.unlock();
cvProducer.notify_all();
}
};
std::vector<std::thread> vecThProducers;
vecThProducers.reserve(PRODUCT_MAX_NUM);
std::thread thConsumer = std::thread(consumer);
for (int i = 0; i < PRODUCT_MAX_NUM; i++) {
vecThProducers.push_back(std::thread(producer, i + 1));
}
std::this_thread::sleep_for(std::chrono::milliseconds(5000));
bTerminate = true;
std::cout << "main - bTerminate:" << bTerminate << std::endl;
cvConsumer.notify_all();
thConsumer.join();
for (auto& thProducer : vecThProducers) {
thProducer.join();
}
总结
上述实例仅仅用于展示复习的多线程知识点:std::thread, std::mutex, std::condition_variable,希望也能对各位读者有点帮助,如有错误,欢迎指正啊。
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)