#include <iostream>
#include <vector>
#include <queue>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <future>
#include <utility> // for std::move
class ThreadPool {
public:
explicit ThreadPool(size_t numThreads) : stop(false)
{
for (size_t i = 0; i < numThreads; ++i)
{
//使用emplace_back向vector容器中加入工作的线程函数
workers.emplace_back([this]
{
for (;;) //等同于while
{
std::function<void()> task;
std::unique_lock<std::mutex> lock(queue_mutex);
condition.wait(lock, [this] { return stop || !tasks.empty(); });
if (stop && tasks.empty()) return;
task = tasks.front();
tasks.pop();
task();
}
});
}
}
~ThreadPool()
{
std::unique_lock<std::mutex> lock(queue_mutex);
stop = true;
condition.notify_all();
for (std::thread &worker : workers)
{
worker.join();
}
}
template<typename Func, typename... Args>
auto enqueue(Func&& func, Args&&... args) -> std::future<typename std::result_of<Func(Args...)>::type> //推导返回类型
{
using return_type = typename std::result_of<Func(Args...)>::type;
auto task = std::make_shared<std::packaged_task<return_type()>>(
std::bind(std::forward<Func>(func), std::forward<Args>(args)...));
std::future<return_type> res = task->get_future(); //通过get_feature获得执行结果
{
std::unique_lock<std::mutex> lock(queue_mutex);
tasks.emplace([task]() { (*task)(); }); //任务加入队列 类似上面的emplace_back函数
}
condition.notify_one(); // 条件成立 通知一次
return res;
}
private:
std::vector<std::thread> workers;
std::queue<std::function<void()>> tasks;
std::mutex queue_mutex;
std::condition_variable condition;
bool stop;
};
float doWork(float x)
{
std::cout << "Processing " << x << " in thread " << std::this_thread::get_id() << std::endl;
return x * x;
}
void ThreadPoolTest()
{
ThreadPool pool(4); // 创建一个包含4个线程的线程池
std::vector<std::future<float>> results;
for (int i = 0; i < 8000; ++i) {
results.emplace_back(pool.enqueue(doWork, i+0.01)); // 提交任务到线程池
}
for (auto& result : results) {
std::cout << "Result: " << result.get() << std::endl; // 获取并打印结果
}
}
int main()
{
ThreadPoolTest();
}
C++11线程池的用法
于 2024-07-10 17:05:00 首次发布