c++11线程池

//线程池的实现

#ifndef THREAD_POOL_H
#define THREAD_POOL_H

#include <vector>
#include <queue>
#include <memory>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <future>
#include <functional>
#include <stdexcept>

class ThreadPool {
public:
    static ThreadPool* getInstance();
    template<class F, class... Args>
    auto enqueue(F&& f, Args&&... args)
        ->std::future < typename std::result_of<F(Args...)>::type > ;
    ~ThreadPool();
private:
    ThreadPool(size_t);
    // need to keep track of threads so we can join them
    std::vector< std::thread > workers;
    // the task queue
    std::queue< std::function<void()> > tasks;

    // synchronization
    std::mutex queue_mutex;
    std::condition_variable condition;
    bool stop;
};
static ThreadPool *g_threadPool = nullptr;

ThreadPool* ThreadPool::getInstance()
{
    if (g_threadPool == nullptr)
    {
        g_threadPool = new ThreadPool(5);
    }
    return g_threadPool;
}

// the constructor just launches some amount of workers
inline ThreadPool::ThreadPool(size_t threads)
    : stop(false)
{
    for (size_t i = 0; i < threads; ++i)
        workers.emplace_back(
        [this]
    {
        for (;;)
        {
            std::function<void()> task;

            {
                std::unique_lock<std::mutex> lock(this->queue_mutex);
                this->condition.wait(lock,
                    [this]{ return this->stop || !this->tasks.empty(); });
                if (this->stop && this->tasks.empty())
                    return;
                task = std::move(this->tasks.front());
                this->tasks.pop();
            }

            task();
        }
    }
    );
}

// add new work item to the pool
template<class F, class... Args>
auto ThreadPool::enqueue(F&& f, Args&&... args)
-> std::future < typename std::result_of<F(Args...)>::type >
{
    using return_type = typename std::result_of<F(Args...)>::type;

    auto task = std::make_shared< std::packaged_task<return_type()> >(
        std::bind(std::forward<F>(f), std::forward<Args>(args)...)
        );

    std::future<return_type> res = task->get_future();
    {
        std::unique_lock<std::mutex> lock(queue_mutex);

        // don't allow enqueueing after stopping the pool
        if (stop)
            throw std::runtime_error("enqueue on stopped ThreadPool");

        tasks.emplace([task](){ (*task)(); });
    }
    condition.notify_one();
    return res;
}

// the destructor joins all threads
inline ThreadPool::~ThreadPool()
{
    {
        std::unique_lock<std::mutex> lock(queue_mutex);
        stop = true;
    }
    condition.notify_all();
    for (std::thread &worker : workers)
        worker.join();
}

#endif

 

//使用方式:

#include <iostream>
#include "ThreadPool.h"
#if defined(_MSC_VER) || defined(_MINGW_)
#include <windows.h>
#else
#include <unistd.h>
#define Sleep(x) sleep(x)
#endif

using namespace std;

void func()
{
    std::this_thread::sleep_for(std::chrono::milliseconds(100));
    std::cout << "worker thread ID:" << std::this_thread::get_id() << std::endl;
}

int main()
{
    ThreadPool *pThreadPool = ThreadPool::getInstance();
    while (1)
    {
        pThreadPool->enqueue(func);
        Sleep(10);//不加睡眠长时间跑会崩溃
    }
    system("pause");
    return 0;
}

这篇也写的蛮好的,mark下:https://blog.csdn.net/qq_41681241/article/details/86723964

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值