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
|
#include "gtest/gtest.h"
#include "lldb/Utility/TaskPool.h"
TEST(TaskPoolTest, AddTask) {
auto fn = [](int x) { return x * x + 1; };
auto f1 = TaskPool::AddTask(fn, 1);
auto f2 = TaskPool::AddTask(fn, 2);
auto f3 = TaskPool::AddTask(fn, 3);
auto f4 = TaskPool::AddTask(fn, 4);
ASSERT_EQ(10, f3.get());
ASSERT_EQ(2, f1.get());
ASSERT_EQ(17, f4.get());
ASSERT_EQ(5, f2.get());
}
TEST(TaskPoolTest, RunTasks) {
std::vector<int> r(4);
auto fn = [](int x, int &y) { y = x * x + 1; };
TaskPool::RunTasks([fn, &r]() { fn(1, r[0]); }, [fn, &r]() { fn(2, r[1]); },
[fn, &r]() { fn(3, r[2]); }, [fn, &r]() { fn(4, r[3]); });
ASSERT_EQ(2, r[0]);
ASSERT_EQ(5, r[1]);
ASSERT_EQ(10, r[2]);
ASSERT_EQ(17, r[3]);
}
TEST(TaskPoolTest, TaskRunner) {
auto fn = [](int x) { return std::make_pair(x, x * x); };
TaskRunner<std::pair<int, int>> tr;
tr.AddTask(fn, 1);
tr.AddTask(fn, 2);
tr.AddTask(fn, 3);
tr.AddTask(fn, 4);
int count = 0;
while (true) {
auto f = tr.WaitForNextCompletedTask();
if (!f.valid())
break;
++count;
std::pair<int, int> v = f.get();
ASSERT_EQ(v.first * v.first, v.second);
}
ASSERT_EQ(4, count);
}
|
