-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdagger_test.cpp
66 lines (62 loc) · 2.72 KB
/
dagger_test.cpp
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
#include "dagger.h"
#include <gtest/gtest.h>
#include <memory>
TEST(Dagger, Linear) {
dagger::DagManager mgr(10);
auto node1 = std::make_unique<dagger::Node>(
"1", []() { printf("1\n"); }, std::vector<dagger::Node *>{});
auto node2 = std::make_unique<dagger::Node>(
"2", []() { printf("2\n"); }, std::vector<dagger::Node *>{node1.get()});
auto node3 = std::make_unique<dagger::Node>(
"3", []() { printf("3\n"); }, std::vector<dagger::Node *>{node2.get()});
auto node4 = std::make_unique<dagger::Node>(
"4", []() { printf("4\n"); }, std::vector<dagger::Node *>{node3.get()});
auto node5 = std::make_unique<dagger::Node>(
"5", []() { printf("5\n"); }, std::vector<dagger::Node *>{node4.get()});
mgr.AddNode(std::move(node1));
mgr.AddNode(std::move(node2));
mgr.AddNode(std::move(node3));
mgr.AddNode(std::move(node4));
mgr.AddNode(std::move(node5));
mgr.BlockingRun();
}
TEST(Dagger, LastThreeNodesRandomOrder) {
dagger::DagManager mgr(6);
auto node1 = std::make_unique<dagger::Node>(
"1", []() { printf("1\n"); }, std::vector<dagger::Node *>{});
auto node2 = std::make_unique<dagger::Node>(
"2", []() { printf("2\n"); }, std::vector<dagger::Node *>{node1.get()});
auto node3 = std::make_unique<dagger::Node>(
"3", []() { printf("3\n"); }, std::vector<dagger::Node *>{node2.get()});
auto node4 = std::make_unique<dagger::Node>(
"4", []() { printf("4\n"); }, std::vector<dagger::Node *>{node2.get()});
auto node5 = std::make_unique<dagger::Node>(
"5", []() { printf("5\n"); }, std::vector<dagger::Node *>{node2.get()});
mgr.AddNode(std::move(node1));
mgr.AddNode(std::move(node2));
mgr.AddNode(std::move(node3));
mgr.AddNode(std::move(node4));
mgr.AddNode(std::move(node5));
mgr.BlockingRun();
}
TEST(Dagger, LastTwoNodesRandomOrder) {
printf("std::thread::hardware_concurrency() %d\n",
std::thread::hardware_concurrency());
dagger::DagManager mgr(12);
auto node1 = std::make_unique<dagger::Node>(
"1", []() { printf("1\n"); }, std::vector<dagger::Node *>{});
auto node2 = std::make_unique<dagger::Node>(
"2", []() { printf("2\n"); }, std::vector<dagger::Node *>{node1.get()});
auto node3 = std::make_unique<dagger::Node>(
"3", []() { printf("3\n"); }, std::vector<dagger::Node *>{node2.get()});
auto node4 = std::make_unique<dagger::Node>(
"4", []() { printf("4\n"); }, std::vector<dagger::Node *>{node3.get()});
auto node5 = std::make_unique<dagger::Node>(
"5", []() { printf("5\n"); }, std::vector<dagger::Node *>{node3.get()});
mgr.AddNode(std::move(node1));
mgr.AddNode(std::move(node2));
mgr.AddNode(std::move(node3));
mgr.AddNode(std::move(node4));
mgr.AddNode(std::move(node5));
mgr.BlockingRun();
}