C++怎么实现生产者消费者模型_C++多线程并发模型与生产者消费者实现

#include 
#include 
#include 
#include 
#include 
#include 

std::queue buffer;
std::mutex mtx;
std::condition_variable not_full;
std::condition_variable not_empty;

const int max_size = 5;

void producer(int id) {
    for (int i = 0; i < 10; ++i) {
        std::unique_lock lock(mtx);
        not_full.wait(lock, []() { return buffer.size() < max_size; });
        buffer.push(i);
        std::cout << "Producer " << id << " produced: " << i << "\n";
        lock.unlock();
        not_empty.notify_one();
        std::this_thread::sleep_for(std::chrono::milliseconds(100));
    }
}

void consumer(int id) {
    for (int i = 0; i < 10; ++i) {
        std::unique_lock lock(mtx);
        not_empty.wait(lock, []() { return !buffer.empty(); });
        int value = buffer.front();
        buffer.pop();
        std::cout << "Consumer " << id << " consumed: " << value << "\n";
        lock.unlock();
        not_full.notify_one();
        std::this_thread::sleep_for(std::chrono::milliseconds(150));
    }
}

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

    p1.join();
    p2.join();
    c1.join();
    c2.join();

    return 0;
}

bool done = false;
// 消费者中检测
not_empty.wait(lock, []() { return !buffer.empty() || done; });
if (done && buffer.empty()) break;