c++11实现生产者、消费者

用互斥和条件变量实现：

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

using namespace std;


mutex mtx;
condition_variable produce,consume;

queue<int> que;
const int maxSize = 5;

void consumer()
{
    while (true)
    {
        this_thread::sleep_for(chrono::milliseconds(1000));
        unique_lock<mutex> lck(mtx);
        consume.wait(lck, []() {
            return que.size() !=0;
        });
        cout << "consumer" << this_thread::get_id() << ":";
        que.pop();
        cout << que.size() << endl;

        produce.notify_all();
    }
}

void producer(int id)
{
    while (true)
    {
        this_thread::sleep_for(chrono::milliseconds(800));//速度比消费者快一点
        unique_lock<mutex> lck(mtx);
        produce.wait(lck, []() {
            return que.size() != maxSize;
        });
        cout << "producer" << this_thread::get_id() << ":";
        que.push(id);
        cout << que.size() << endl;
        consume.notify_all();
    }
}

int main()
{
    thread consumers[2], producers[2];

    for (int i = 0; i < 2; ++i)
    {
        consumers[i] = thread(consumer);
        producers[i] = thread(producer, i + 1);
    }

    for (int i = 0; i < 2; ++i)
    {
        consumers[i].join();
        producers[i].join();
    }
}