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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
#define BOOST_TEST_MODULE network
#include <boost/test/data/test_case.hpp>
#include <boost/test/unit_test.hpp>
#include <array>
#include <collection.hpp>
#include <game/network/link.h>
#include <game/network/network.h>
#include <game/network/network.impl.h> // IWYU pragma: keep
#include <glm/glm.hpp>
#include <location.hpp>
#include <maths.h>
#include <memory>
#include <stdexcept>
#include <stream_support.hpp>
#include <utility>
#include <vector>
struct TestLink : public Link {
TestLink(NodePtr a, NodePtr b, float ad, float bd, float l) : Link {{std::move(a), ad}, {std::move(b), bd}, l} { }
[[nodiscard]] Location
positionAt(float, unsigned char) const override
{
throw std::runtime_error("not implemented");
}
};
constexpr glm::vec3 p000 {0, 0, 0}, p100 {1, 0, 0}, p200 {2, 0, 0}, p300 {3, 0, 0};
struct TestNetwork : public NetworkOf<TestLink> {
TestNetwork() : NetworkOf<TestLink> {RESDIR "rails.jpg"}
{
// 0 1 2
// p000 <-> p100 <-> p200 <-> p300
addLink<TestLink>(p000, p100, 0.F, pi, 1.F);
addLink<TestLink>(p100, p200, 0.F, pi, 1.F);
addLink<TestLink>(p200, p300, 0.F, pi, 1.F);
}
};
const auto VALID_NODES = boost::unit_test::data::make<glm::vec3>({
p000,
p100,
p200,
p300,
});
const auto INVALID_NODES = boost::unit_test::data::make<glm::vec3>({
{1000, 0, 0},
{0, 1000, 0},
{0, 0, 1000},
});
BOOST_FIXTURE_TEST_SUITE(tn, TestNetwork)
BOOST_DATA_TEST_CASE(findNodeAt_valid, VALID_NODES, p)
{
auto n = findNodeAt(p);
BOOST_REQUIRE(n);
BOOST_CHECK_EQUAL(n->pos, p);
}
BOOST_DATA_TEST_CASE(findNodeAt_invalid, INVALID_NODES, p)
{
BOOST_REQUIRE(!findNodeAt(p));
}
BOOST_DATA_TEST_CASE(nodeAt, VALID_NODES + INVALID_NODES, p)
{
auto n = nodeAt(p);
BOOST_REQUIRE(n);
BOOST_CHECK_EQUAL(n->pos, p);
}
BOOST_DATA_TEST_CASE(newNodeAt_existing, VALID_NODES, p)
{
auto n = newNodeAt(p);
BOOST_CHECK(!n.second);
BOOST_REQUIRE(n.first);
BOOST_CHECK_EQUAL(n.first->pos, p);
}
BOOST_DATA_TEST_CASE(newNodeAt_new, INVALID_NODES, p)
{
auto n = newNodeAt(p);
BOOST_CHECK(n.second);
BOOST_REQUIRE(n.first);
BOOST_CHECK_EQUAL(n.first->pos, p);
}
BOOST_AUTO_TEST_CASE(network_joins)
{
// Ends
BOOST_CHECK(links.objects[0]->ends[0].nexts.empty());
BOOST_CHECK(links.objects[2]->ends[1].nexts.empty());
// Join 0 <-> 1
BOOST_REQUIRE_EQUAL(links.objects[0]->ends[1].nexts.size(), 1);
BOOST_CHECK_EQUAL(links.objects[0]->ends[1].nexts.front().first.lock().get(), links.objects[1].get());
BOOST_CHECK_EQUAL(links.objects[0]->ends[1].nexts.front().second, 0);
BOOST_REQUIRE_EQUAL(links.objects[1]->ends[0].nexts.size(), 1);
BOOST_CHECK_EQUAL(links.objects[1]->ends[0].nexts.front().first.lock().get(), links.objects[0].get());
BOOST_CHECK_EQUAL(links.objects[1]->ends[0].nexts.front().second, 1);
// Join 1 <-> 2
BOOST_REQUIRE_EQUAL(links.objects[1]->ends[1].nexts.size(), 1);
BOOST_CHECK_EQUAL(links.objects[1]->ends[1].nexts.front().first.lock().get(), links.objects[2].get());
BOOST_CHECK_EQUAL(links.objects[1]->ends[1].nexts.front().second, 0);
BOOST_REQUIRE_EQUAL(links.objects[2]->ends[0].nexts.size(), 1);
BOOST_CHECK_EQUAL(links.objects[2]->ends[0].nexts.front().first.lock().get(), links.objects[1].get());
BOOST_CHECK_EQUAL(links.objects[2]->ends[0].nexts.front().second, 1);
}
BOOST_DATA_TEST_CASE(routeTo_nodeNotInNetwork, INVALID_NODES, dest)
{
const auto & start = links.objects.front()->ends[1];
BOOST_CHECK_THROW((void)routeFromTo(start, dest), std::out_of_range);
}
BOOST_AUTO_TEST_CASE(routeTo_noSteps)
{
const auto & start = links.objects.front()->ends[1];
auto r = this->routeFromTo(start, p100);
BOOST_CHECK(r.empty());
}
BOOST_AUTO_TEST_CASE(routeTo_upStream_to2)
{
const auto & start = links.objects.front()->ends[1];
auto r = this->routeFromTo(start, p200);
BOOST_REQUIRE_EQUAL(r.size(), 1);
BOOST_CHECK_EQUAL(r[0].lock().get(), links.objects[1].get());
}
BOOST_AUTO_TEST_CASE(routeTo_upStream_to3)
{
const auto & start = links.objects.front()->ends[1];
auto r = this->routeFromTo(start, p300);
BOOST_REQUIRE_EQUAL(r.size(), 2);
BOOST_CHECK_EQUAL(r[0].lock().get(), links.objects[1].get());
BOOST_CHECK_EQUAL(r[1].lock().get(), links.objects[2].get());
}
BOOST_AUTO_TEST_CASE(routeTo_downStream_to0)
{
const auto & start = links.objects.back()->ends[0];
auto r = this->routeFromTo(start, p000);
BOOST_REQUIRE_EQUAL(r.size(), 2);
BOOST_CHECK_EQUAL(r[0].lock().get(), links.objects[1].get());
BOOST_CHECK_EQUAL(r[1].lock().get(), links.objects[0].get());
}
BOOST_AUTO_TEST_SUITE_END()
|
