ThreadPool

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#pragma once
#include <vector>
#include <string>
#include <thread>
#include <queue>
#include <condition_variable>
#include <functional>
#include <future>

class ThreadPool
{
public:
void DoTask()
{
while (true)
{
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 = std::move(tasks.front());
tasks.pop();
}
task();
}
}

ThreadPool(size_t threads) : stop(false)
{
for (size_t i = 0; i < threads; ++i)
{
workers.emplace_back(std::bind(&ThreadPool::DoTask, this));
}
}

~ThreadPool()
{
{
std::unique_lock<std::mutex> ul{queue_mutex};
stop = true;
}
condition.notify_all();
for (auto &worker : workers)
{
worker.join();
}
}

template <class F, class... Args>
auto 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};
if (stop)
{
throw std::runtime_error("enqueue on stopped ThreadPool");
}
tasks.emplace(
[task]()
{
(*task)();
});
}
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;
};

[^1]:


ThreadPool
https://xifenggood.github.io/2025/08/01/note/ThreadPool/
作者
Jie Wang
发布于
2025年8月1日
许可协议