生产者消费者模型(C++11示例)

一个生产者,两个消费者消费数字示例代码

关键知识点

  • std::thread (c++11线程对象)
  • std::unique_lock + std::mutex + std::condition_variable 配套使用
  • 如何停止消费者线程(std::atomic_bool)

示例代码

#include <iostream>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <chrono>
#include <queue>
#include <atomic>

std::queue<int> buffer_;
std::mutex mutex_;
std::condition_variable cv_;
std::atomic_bool stop_(false);

void producer() {
    for (int i = 0; i < 10; i++) {
        {
            std::lock_guard<std::mutex> lk(mutex_);
            buffer_.push(i);
        }
        std::cout << "producer produce number " << i << std::endl;
        cv_.notify_one();

        // sleep 100ms
        std::this_thread::sleep_for(std::chrono::milliseconds(100));
    }
}

void consumer(int index) {
    while(!stop_.load()) {
        std::unique_lock<std::mutex> lk(mutex_);
        cv_.wait(lk);
        if (!buffer_.empty()) {
            int tmp = buffer_.front();
            buffer_.pop();
            std::cout << "consumer #" << index << " consume number " << tmp << std::endl;
        }
    }
}

int main() 
{
    std::thread p1(producer);
    std::thread c1(consumer, 1);
    std::thread c2(consumer, 2);

    p1.join();
    stop_.store(true); // 消费者线程退出
    cv_.notify_all(); // 唤醒所有消费者线程,退出cv_阻塞
    c1.join();
    c2.join();

    return 0;
}

输出结果

xufengbao@MacBook-Pro study % g++ test.cpp -std=c++11
xufengbao@MacBook-Pro study % ./a.out                
producer produce number 0
consumer #1 consume number 0
producer produce number 1
consumer #2 consume number 1
producer produce number 2
consumer #1 consume number 2
producer produce number 3
consumer #2 consume number 3
producer produce number 4
consumer #1 consume number 4
producer produce number 5
consumer #2 consume number 5
producer produce number 6
consumer #1 consume number 6
producer produce number 7
consumer #2 consume number 7
producer produce number 8
consumer #1 consume number 8
producer produce number 9
consumer #2 consume number 9
  • 9
    点赞
  • 10
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值