#pragma once

#include <iostream>
#include <queue>
#include <pthread.h>
//定義一個(gè)模版類，方便我們使用任何類型進(jìn)行生產(chǎn)消費(fèi)
template <class T>
//定義一個(gè)阻塞隊(duì)列
class BlockQueue
{
	//隊(duì)列默認(rèn)最大容量
    static const int defalutnum = 20;

public:
    BlockQueue(int maxcap = defalutnum) : maxcap_(maxcap)
    {
    	//初始化互斥鎖和生產(chǎn)者和消費(fèi)者的條件變量
        pthread_mutex_init(&mutex_, nullptr);
        pthread_cond_init(&c_cond_, nullptr);
        pthread_cond_init(&p_cond_, nullptr);
        //下面注釋掉的是設(shè)置水位線，設(shè)置最低最高水位線
        //在阻塞隊(duì)列中的數(shù)據(jù)，在低于最低水位線時(shí)是不可被獲取的，只能寫入
        //在高于最高水位線時(shí)是不可被寫入的，只能獲取
        // low_water_ = maxcap_/3;
        // high_water_ = (maxcap_*2)/3;
    }

	//從隊(duì)列頭取出元素返回
    T pop()
    {
        pthread_mutex_lock(&mutex_);//加鎖
        //只能用while不能用if，原因是會(huì)出現(xiàn)誤喚醒問(wèn)題，下面說(shuō)
        while (q_.size() == 0)
        {
            pthread_cond_wait(&c_cond_, &mutex_); 
        }

        T out = q_.front();
        q_.pop();
		//這里是加了水位線的版本，在低于水位線的時(shí)候要喚醒生產(chǎn)者
        // if(q_.size()<low_water_) pthread_cond_signal(&p_cond_);
        pthread_cond_signal(&p_cond_); 
        pthread_mutex_unlock(&mutex_);//解鎖

        return out;
    }

    void push(const T &in)
    {
        pthread_mutex_lock(&mutex_);//加鎖
        //同pop函數(shù)
        while (q_.size() == maxcap_)
        {
            pthread_cond_wait(&p_cond_, &mutex_); 
        }
        q_.push(in); 
        
        //這里是加了水位線的版本，在高于水位線的時(shí)候要喚醒消費(fèi)者
        // if(q_.size() > high_water_) pthread_cond_signal(&c_cond_);
        pthread_cond_signal(&c_cond_);
        pthread_mutex_unlock(&mutex_);//解鎖
    }
	//析構(gòu)函數(shù)
    ~BlockQueue()
    {
        pthread_mutex_destroy(&mutex_);
        pthread_cond_destroy(&c_cond_);
        pthread_cond_destroy(&p_cond_);
    }

private:
    std::queue<T> q_; 
    
    int maxcap_; // 極大值
    
    pthread_mutex_t mutex_;
    pthread_cond_t c_cond_;
    pthread_cond_t p_cond_;
    
	//最低最高水位線
    // int low_water_;
    // int high_water_;
};

#pragma once
#include <iostream>
#include <string>

//定義運(yùn)算方法
std::string opers = "+-*/%";

//枚舉錯(cuò)誤
enum
{
    DivZero = 1,
    ModZero,
    Unknown
};

class Task
{
public:
    Task(int x, int y, char op) : data1_(x), data2_(y), oper_(op), result_(0), exitcode_(0)
    {}
    void run()
    {
        switch (oper_)
        {
        case '+':
            result_ = data1_ + data2_;
            break;
        case '-':
            result_ = data1_ - data2_;
            break;
        case '*':
            result_ = data1_ * data2_;
            break;
        case '/':
        {
            if (data2_ == 0)
                exitcode_ = DivZero;
            else
                result_ = data1_ / data2_;
        }
        break;
        case '%':
        {
            if (data2_ == 0)
                exitcode_ = ModZero;
            else
                result_ = data1_ % data2_;
        }
        break;
        default:
            exitcode_ = Unknown;
            break;
        }
    }
    //偽函數(shù)，通過(guò)重載()使run可以像函數(shù)一樣調(diào)用
    void operator()()
    {
        run();
    }
    //返回的運(yùn)算結(jié)果以及錯(cuò)誤代碼
    std::string GetResult()
    {
        std::string r = std::to_string(data1_);
        r += oper_;
        r += std::to_string(data2_);
        r += "=";
        r += std::to_string(result_);
        r += "[code: ";
        r += std::to_string(exitcode_);
        r += "]";

        return r;
    }
    //返回運(yùn)算表達(dá)式
    std::string GetTask()
    {
        std::string r = std::to_string(data1_);
        r += oper_;
        r += std::to_string(data2_);
        r += "=?";
        return r;
    }
    ~Task()
    {}

private:
    int data1_;
    int data2_;
    char oper_;

    int result_;
    int exitcode_;
};

#include "BlockQueue.hpp"
#include "Task.hpp"
#include <unistd.h>
#include <ctime>

void *Consumer(void *args)
{
    BlockQueue<Task> *bq = static_cast<BlockQueue<Task> *>(args);

    while (true)
    {
        // 消費(fèi)
        Task t = bq->pop();
        // 計(jì)算
        t();
        
		//模擬消費(fèi)者處理任務(wù)
        std::cout << "處理任務(wù): " << t.GetTask() << " 運(yùn)算結(jié)果是： " << t.GetResult() << " thread id: " << pthread_self() << std::endl;
    }
}

void *Productor(void *args)
{
    int len = opers.size();
    BlockQueue<Task> *bq = static_cast<BlockQueue<Task> *>(args);
    int x = 10;
    int y = 20;
    while (true)
    {
        // 用隨機(jī)數(shù)運(yùn)算模擬生產(chǎn)者生產(chǎn)數(shù)據(jù)
        int data1 = rand() % 10 + 1; // [1,10]
        usleep(10);
        int data2 = rand() % 10;
        char op = opers[rand() % len];
        Task t(data1, data2, op);

        // 生產(chǎn)
        bq->push(t);
        std::cout << "生產(chǎn)了一個(gè)任務(wù): " << t.GetTask() << " thread id: " << pthread_self() << std::endl;
        sleep(1);
    }
}

int main()
{
	//隨機(jī)數(shù)種子
    srand(time(nullptr));

    //給阻塞隊(duì)列傳一個(gè)任務(wù)
    BlockQueue<Task> *bq = new BlockQueue<Task>();
    //多生產(chǎn)者多消費(fèi)者
    pthread_t c[3], p[5];
    for (int i = 0; i < 3; i++)
    {
        pthread_create(c + i, nullptr, Consumer, bq);
    }

    for (int i = 0; i < 5; i++)
    {
        pthread_create(p + i, nullptr, Productor, bq);
    }

    for (int i = 0; i < 3; i++)
    {
        pthread_join(c[i], nullptr);
    }
    for (int i = 0; i < 5; i++)
    {
        pthread_join(p[i], nullptr);
    }
    delete bq;
    return 0;
}

//...

	T pop()
    {
        pthread_mutex_lock(&mutex_);
        while (q_.size() == 0) //不能調(diào)用if而要用while
        {
            pthread_cond_wait(&c_cond_, &mutex_); 
        }

        T out = q_.front();
        q_.pop();

        pthread_cond_signal(&p_cond_); 
        pthread_mutex_unlock(&mutex_);

        return out;
    }

    void push(const T &in)
    {
        pthread_mutex_lock(&mutex_);
        while (q_.size() == maxcap_)
        {
            pthread_cond_wait(&p_cond_, &mutex_); 
        }
        q_.push(in); 
        
        pthread_cond_signal(&c_cond_);
        pthread_mutex_unlock(&mutex_);
        
//...