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
|
#include "routing/routing_benchmarks/helpers.hpp"
#include "testing/testing.hpp"
#include "routing/base/astar_algorithm.hpp"
#include "routing/features_road_graph.hpp"
#include "routing/route.hpp"
#include "routing/router_delegate.hpp"
#include "routing_integration_tests/routing_test_tools.hpp"
#include "indexer/classificator_loader.hpp"
#include "indexer/mwm_set.hpp"
#include "platform/local_country_file.hpp"
#include "platform/local_country_file_utils.hpp"
#include "platform/platform.hpp"
#include "geometry/polyline2d.hpp"
#include "base/logging.hpp"
#include "base/math.hpp"
#include "base/stl_add.hpp"
#include "base/timer.hpp"
#include <limits>
using namespace std;
namespace
{
void TestRouter(routing::IRouter & router, m2::PointD const & startPos,
m2::PointD const & finalPos, routing::Route & foundRoute)
{
routing::RouterDelegate delegate;
LOG(LINFO, ("Calculating routing ...", router.GetName()));
routing::Route route("");
my::Timer timer;
auto const resultCode = router.CalculateRoute(routing::Checkpoints(startPos, finalPos),
m2::PointD::Zero() /* startDirection */,
false /* adjust */, delegate, route);
double const elapsedSec = timer.ElapsedSeconds();
TEST_EQUAL(routing::RouterResultCode::NoError, resultCode, ());
TEST(route.IsValid(), ());
m2::PolylineD const & poly = route.GetPoly();
TEST(my::AlmostEqualAbs(poly.Front(), startPos, routing::kPointsEqualEpsilon), ());
TEST(my::AlmostEqualAbs(poly.Back(), finalPos, routing::kPointsEqualEpsilon), ());
LOG(LINFO, ("Route polyline size:", route.GetPoly().GetSize()));
LOG(LINFO, ("Route distance, meters:", route.GetTotalDistanceMeters()));
LOG(LINFO, ("Elapsed, seconds:", elapsedSec));
foundRoute.Swap(route);
}
m2::PointD GetPointOnEdge(routing::Edge const & e, double posAlong)
{
if (posAlong <= 0.0)
return e.GetStartJunction().GetPoint();
if (posAlong >= 1.0)
return e.GetEndJunction().GetPoint();
m2::PointD const d = e.GetEndJunction().GetPoint() - e.GetStartJunction().GetPoint();
return e.GetStartJunction().GetPoint() + d * posAlong;
}
} // namespace
RoutingTest::RoutingTest(routing::IRoadGraph::Mode mode, set<string> const & neededMaps)
: m_mode(mode), m_neededMaps(neededMaps), m_numMwmIds(my::make_unique<routing::NumMwmIds>())
{
classificator::Load();
Platform & platform = GetPlatform();
m_cig = storage::CountryInfoReader::CreateCountryInfoReader(platform);
platform::FindAllLocalMapsAndCleanup(numeric_limits<int64_t>::max(), m_localFiles);
set<string> registeredMaps;
for (auto const & localFile : m_localFiles)
{
m_numMwmIds->RegisterFile(localFile.GetCountryFile());
auto const & name = localFile.GetCountryName();
if (m_neededMaps.count(name) == 0)
continue;
UNUSED_VALUE(m_dataSource.RegisterMap(localFile));
auto const & countryFile = localFile.GetCountryFile();
TEST(m_dataSource.IsLoaded(countryFile), ());
MwmSet::MwmId const id = m_dataSource.GetMwmIdByCountryFile(countryFile);
TEST(id.IsAlive(), ());
registeredMaps.insert(name);
}
if (registeredMaps != m_neededMaps)
{
for (auto const & file : m_neededMaps)
{
if (registeredMaps.count(file) == 0)
LOG(LERROR, ("Can't find map:", file));
}
TEST(false, ("Some maps can't be found. See error messages above."));
}
}
void RoutingTest::TestRouters(m2::PointD const & startPos, m2::PointD const & finalPos)
{
// Find route by A*-bidirectional algorithm.
routing::Route routeFoundByAstarBidirectional("");
{
auto router = CreateRouter("test-astar-bidirectional");
TestRouter(*router, startPos, finalPos, routeFoundByAstarBidirectional);
}
// Find route by A* algorithm.
routing::Route routeFoundByAstar("");
{
auto router = CreateRouter("test-astar");
TestRouter(*router, startPos, finalPos, routeFoundByAstar);
}
double constexpr kEpsilon = 1e-6;
TEST(my::AlmostEqualAbs(routeFoundByAstar.GetTotalDistanceMeters(),
routeFoundByAstarBidirectional.GetTotalDistanceMeters(), kEpsilon),
());
}
void RoutingTest::TestTwoPointsOnFeature(m2::PointD const & startPos, m2::PointD const & finalPos)
{
vector<pair<routing::Edge, routing::Junction>> startEdges;
GetNearestEdges(startPos, startEdges);
TEST(!startEdges.empty(), ());
vector<pair<routing::Edge, routing::Junction>> finalEdges;
GetNearestEdges(finalPos, finalEdges);
TEST(!finalEdges.empty(), ());
m2::PointD const startPosOnFeature =
GetPointOnEdge(startEdges.front().first, 0.0 /* the start point of the feature */);
m2::PointD const finalPosOnFeature =
GetPointOnEdge(finalEdges.front().first, 1.0 /* the end point of the feature */);
TestRouters(startPosOnFeature, finalPosOnFeature);
}
unique_ptr<routing::IRouter> RoutingTest::CreateRouter(string const & name)
{
vector<platform::LocalCountryFile> neededLocalFiles;
neededLocalFiles.reserve(m_neededMaps.size());
for (auto const & file : m_localFiles)
{
if (m_neededMaps.count(file.GetCountryName()) != 0)
neededLocalFiles.push_back(file);
}
unique_ptr<routing::IRouter> router = integration::CreateVehicleRouter(
m_dataSource, *m_cig, m_trafficCache, neededLocalFiles, routing::VehicleType::Pedestrian);
return router;
}
void RoutingTest::GetNearestEdges(m2::PointD const & pt,
vector<pair<routing::Edge, routing::Junction>> & edges)
{
routing::FeaturesRoadGraph graph(m_dataSource, m_mode, CreateModelFactory());
graph.FindClosestEdges(pt, 1 /* count */, edges);
}
|
