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
|
#include "closure.hh"
#include <gtest/gtest.h>
namespace nix {
using namespace std;
map<string, set<string>> testGraph = {
{ "A", { "B", "C", "G" } },
{ "B", { "A" } }, // Loops back to A
{ "C", { "F" } }, // Indirect reference
{ "D", { "A" } }, // Not reachable, but has backreferences
{ "E", {} }, // Just not reachable
{ "F", {} },
{ "G", { "G" } }, // Self reference
};
TEST(closure, correctClosure) {
set<string> expectedClosure = {"A", "B", "C", "F", "G"};
set<string> aClosure = computeClosure<string>(
{"A"},
[&](const string currentNode) {
return testGraph[currentNode];
}
);
ASSERT_EQ(aClosure, expectedClosure);
}
TEST(closure, properlyHandlesDirectExceptions) {
struct TestExn : std::exception {};
EXPECT_THROW(
computeClosure<string>(
{"A"},
[&](const string currentNode) -> set<string> {
throw TestExn();
}
),
TestExn
);
}
}
|
