-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbb.cpp
More file actions
67 lines (57 loc) · 1.22 KB
/
bb.cpp
File metadata and controls
67 lines (57 loc) · 1.22 KB
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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
class ThreadPool {
private:
std::queue<std::function<int(int,int)>> jobs;
std::condition_variable cv;
std::mutex mtx;
public:
bool enqueue(std::function<int(int,int)> func){
std::unique_lock<std::mutex> ul(mtx);
jobs.enqueue(func);
cv.nofity_all();
}
void run(){
while(true){
cv.wait([](){
{
std::unique_lock<std::mutex> ul(mtx);
while(jobs.empty()){
std::function<int(int,int)> func = jobs.dequeue();
func();
}
});
}
}
}
int main() {
ThreadPool p;
std::thread enqueuer[](){
for(int i = 0; i < 1000000; ++i){
p.enqueue([=](int i, int i){return i*i;});
}
}
p.run();
return 0;
}