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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
#include "testing/testing.hpp"
#include "routing/road_access.hpp"
#include "routing/road_access_serialization.hpp"
#include "routing/routing_tests/index_graph_tools.hpp"
#include "coding/reader.hpp"
#include "coding/writer.hpp"
#include <algorithm>
#include <cstdint>
#include <unordered_map>
#include <vector>
using namespace routing;
using namespace routing_test;
using namespace std;
using TestEdge = TestIndexGraphTopology::Edge;
namespace
{
UNIT_TEST(RoadAccess_Serialization)
{
// Segment is (numMwmId, featureId, segmentIdx, isForward).
unordered_map<uint32_t, RoadAccess::Type> const m0 = {
{1, RoadAccess::Type::No},
{2, RoadAccess::Type::Private},
};
unordered_map<uint32_t, RoadAccess::Type> const m1 = {
{1, RoadAccess::Type::Private},
{2, RoadAccess::Type::Destination},
};
RoadAccess roadAccessCar;
roadAccessCar.SetFeatureTypesForTests(m0);
RoadAccess roadAccessPedestrian;
roadAccessPedestrian.SetFeatureTypesForTests(m1);
RoadAccessSerializer::RoadAccessByVehicleType roadAccessAllTypes;
roadAccessAllTypes[static_cast<size_t>(VehicleType::Car)] = roadAccessCar;
roadAccessAllTypes[static_cast<size_t>(VehicleType::Pedestrian)] = roadAccessPedestrian;
vector<uint8_t> buf;
{
MemWriter<decltype(buf)> writer(buf);
RoadAccessSerializer::Serialize(writer, roadAccessAllTypes);
}
{
RoadAccess deserializedRoadAccess;
MemReader memReader(buf.data(), buf.size());
ReaderSource<MemReader> src(memReader);
RoadAccessSerializer::Deserialize(src, VehicleType::Car, deserializedRoadAccess);
TEST_EQUAL(src.Size(), 0, ());
TEST_EQUAL(roadAccessCar, deserializedRoadAccess, ());
}
{
RoadAccess deserializedRoadAccess;
MemReader memReader(buf.data(), buf.size());
ReaderSource<MemReader> src(memReader);
RoadAccessSerializer::Deserialize(src, VehicleType::Pedestrian, deserializedRoadAccess);
TEST_EQUAL(src.Size(), 0, ());
TEST_EQUAL(roadAccessPedestrian, deserializedRoadAccess, ());
}
}
UNIT_TEST(RoadAccess_WayBlocked)
{
// Add edges to the graph in the following format: (from, to, weight).
// Block edges in the following format: (from, to).
uint32_t const numVertices = 4;
TestIndexGraphTopology graph(numVertices);
graph.AddDirectedEdge(0, 1, 1.0);
graph.AddDirectedEdge(1, 2, 1.0);
graph.AddDirectedEdge(2, 3, 1.0);
double const expectedWeight = 0.0;
vector<TestEdge> const expectedEdges = {};
graph.SetEdgeAccess(1, 2, RoadAccess::Type::No);
TestTopologyGraph(graph, 0, 3, false /* pathFound */, expectedWeight, expectedEdges);
}
UNIT_TEST(RoadAccess_WayBlocking)
{
uint32_t const numVertices = 6;
TestIndexGraphTopology graph(numVertices);
graph.AddDirectedEdge(0, 1, 1.0);
graph.AddDirectedEdge(1, 2, 1.0);
graph.AddDirectedEdge(2, 5, 1.0);
graph.AddDirectedEdge(0, 3, 1.0);
graph.AddDirectedEdge(3, 4, 2.0);
graph.AddDirectedEdge(4, 5, 1.0);
double expectedWeight;
vector<TestEdge> expectedEdges;
expectedWeight = 3.0;
expectedEdges = {{0, 1}, {1, 2}, {2, 5}};
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test avoid access=private while we have route with RoadAccess::Type::Yes.
graph.SetEdgeAccess(1, 2, RoadAccess::Type::Private);
expectedWeight = 4.0;
expectedEdges = {{0, 3}, {3, 4}, {4, 5}};
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test avoid access=destination while we have route with RoadAccess::Type::Yes.
graph.SetEdgeAccess(1, 2, RoadAccess::Type::Destination);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test avoid access=no while we have route with RoadAccess::Type::Yes.
graph.SetEdgeAccess(1, 2, RoadAccess::Type::No);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test it's possible to build the route because private usage restriction is not strict:
// we use minimal possible number of access=yes/access={private, destination} crossing
// but allow to use private/destination if there is no other way.
graph.SetEdgeAccess(3, 4, RoadAccess::Type::Private);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test we have the same behaviour for access=destination.
graph.SetEdgeAccess(3, 4, RoadAccess::Type::Destination);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test we have strict restriction for access=no and can not build route.
graph.SetEdgeAccess(3, 4, RoadAccess::Type::No);
TestTopologyGraph(graph, 0, 5, false /* pathFound */, expectedWeight, expectedEdges);
}
UNIT_TEST(RoadAccess_BarrierBypassing)
{
uint32_t const numVertices = 6;
TestIndexGraphTopology graph(numVertices);
graph.AddDirectedEdge(0, 1, 1.0);
graph.AddDirectedEdge(1, 2, 1.0);
graph.AddDirectedEdge(2, 5, 1.0);
graph.AddDirectedEdge(0, 3, 1.0);
graph.AddDirectedEdge(3, 4, 2.0);
graph.AddDirectedEdge(4, 5, 1.0);
double expectedWeight;
vector<TestEdge> expectedEdges;
expectedWeight = 3.0;
expectedEdges = {{0, 1}, {1, 2}, {2, 5}};
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test avoid access=private while we have route with RoadAccess::Type::Yes.
graph.SetVertexAccess(1, RoadAccess::Type::Private);
expectedWeight = 4.0;
expectedEdges = {{0, 3}, {3, 4}, {4, 5}};
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test avoid access=destination while we have route with RoadAccess::Type::Yes.
graph.SetVertexAccess(1, RoadAccess::Type::Destination);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test avoid access=no while we have route with RoadAccess::Type::Yes.
graph.SetVertexAccess(1, RoadAccess::Type::No);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test it's possible to build the route because private usage restriction is not strict:
// we use minimal possible number of access=yes/access={private, destination} crossing
// but allow to use private/destination if there is no other way.
graph.SetVertexAccess(3, RoadAccess::Type::Private);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test we have the same behaviour for access=destination.
graph.SetVertexAccess(3, RoadAccess::Type::Destination);
TestTopologyGraph(graph, 0, 5, true /* pathFound */, expectedWeight, expectedEdges);
// Test we have strict restriction for access=no and can not build route.
graph.SetVertexAccess(3, RoadAccess::Type::No);
TestTopologyGraph(graph, 0, 5, false /* pathFound */, expectedWeight, expectedEdges);
}
} // namespace
|
