C++模板实现的队列多线程安全

直接给代码，没什么好说的。

#pragma once
#include <iostream>
#include <queue> 
#include <mutex>
#include <memory>
#include <condition_variable>
template<typename T>
class Threadsafe_queue
{
private :
    mutable std::mutex mut;
    std::queue<std::shared_ptr<T>> data_queue;
    std::condition_variable data_cond;
public:
    Threadsafe_queue(){}
    void wait_end_pop(T& value)
    {
        std::unique_lock<std::mutex> lk(mut);
        //等待队列不为空
        data_cond.wait(lk,[this]{return !data_queue.empty();});
        value=std::move(*data_queue.front());
        data_queue.pop();
    }
    bool try_pop(T& value)
    {
        std::lock_guard<std::mutex> lk(mut);
        if(data_queue.empty())
            return false;
        value=std::move(*data_queue.front());
        data_queue.pop();
        return true;
    }

    std::shared_ptr<T> wait_end_pop()
    {
        std::unique_lock<std::mutex> lk(mut);
        data_cond.wait(lk,[this]{return !data_queue.empty();});
        std::shared_ptr<T> res=data_queue.front();
        data_queue.pop();
        return res;
    }

    std::shared_ptr<T> try_pop()
    {
        std::lock_guard<std::mutex> lk(mut);
        if(data_queue.empty())
            return std::shared_ptr<T>();
        std::shared_ptr<T> res=data_queue.front();
        data_queue.pop();
        return res;
    }

    void push(T new_value)
    {
        std::shared_ptr<T> data(
            std::make_shared<T>(std::move(new_value)));
        std::lock_guard<std::mutex> lk(mut);
        data_queue.push(data);
        data_cond.notify_one();
    }

    bool empty() const
    {
        std::lock_guard<std::mutex> lk(mut);
        return data_queue.empty();
    }
};

使用方法

#include <thread>
Threadsafe_queue<int> mQueue=Threadsafe_queue<int>();
int main(int argc,char*argv[])
{
    //lambada表达式
    std::thread mThread([]
        {
            while(1)
            {
                int a;
                mQueue.wait_end_pop(a);
                std::cout<<a<<std::endl;
                if(a==1) break;
            }
        });
    mThread.detach();
    int j=1000;
    while(j--)
    {
        mQueue.push(j);
    }
}

提示：纯手打可能 大概也许 应该没手误。。。。。