-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconcurrent_dag_executor_test.cpp
More file actions
50 lines (41 loc) · 1.17 KB
/
concurrent_dag_executor_test.cpp
File metadata and controls
50 lines (41 loc) · 1.17 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
// main.cpp
#include "concurrent_dag_executor.h"
#include <chrono>
#include <thread>
#include <iostream>
int main() {
Node A(1, [] {
std::cout << "[A] Start\n";
std::this_thread::sleep_for(std::chrono::milliseconds(200));
std::cout << "[A] Done\n";
});
Node B(2, [] {
std::cout << "[B] Start\n";
std::this_thread::sleep_for(std::chrono::milliseconds(300));
std::cout << "[B] Done\n";
});
Node C(3, [] {
std::cout << "[C] Start\n";
std::this_thread::sleep_for(std::chrono::milliseconds(100));
std::cout << "[C] Done\n";
});
Node D(4, [] {
std::cout << "[D] Start\n";
std::this_thread::sleep_for(std::chrono::milliseconds(150));
std::cout << "[D] Done\n";
});
// D 依赖 B 和 C；B 和 C 依赖 A
B.addPredecessor(&A);
C.addPredecessor(&A);
D.addPredecessor(&B);
D.addPredecessor(&C);
DAGExecutor executor(4);
executor.addNode(&A);
executor.addNode(&B);
executor.addNode(&C);
executor.addNode(&D);
std::cout << "🚀 Executing DAG...\n";
executor.executeAndWait();
std::cout << "✅ All done!\n";
return 0;
}