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
|
#include "routing/routing_helpers.hpp"
#include "routing/road_point.hpp"
#include "routing/segment.hpp"
#include "traffic/traffic_info.hpp"
#include "base/stl_helpers.hpp"
#include <algorithm>
#include <utility>
namespace routing
{
using namespace std;
using namespace traffic;
void FillSegmentInfo(vector<Segment> const & segments, vector<Junction> const & junctions,
Route::TTurns const & turns, Route::TStreets const & streets,
Route::TTimes const & times, shared_ptr<TrafficStash> const & trafficStash,
vector<RouteSegment> & routeSegment)
{
CHECK_EQUAL(segments.size() + 1, junctions.size(), ());
CHECK(!turns.empty(), ());
CHECK(!times.empty(), ());
CHECK(is_sorted(turns.cbegin(), turns.cend(), base::LessBy(&turns::TurnItem::m_index)), ());
CHECK(is_sorted(streets.cbegin(), streets.cend(), base::LessBy(&Route::TStreetItem::first)), ());
CHECK(is_sorted(times.cbegin(), times.cend(), base::LessBy(&Route::TTimeItem::first)), ());
CHECK_LESS(turns.back().m_index, junctions.size(), ());
if (!streets.empty())
CHECK_LESS(streets.back().first, junctions.size(), ());
CHECK_LESS(times.back().first, junctions.size(), ());
routeSegment.clear();
if (segments.empty())
return;
routeSegment.reserve(segments.size());
// Note. |turns|, |streets| and |times| have point based index.
// On the other hand turns, street names and times are considered for further end of |segments| after conversion
// to |segmentInfo|. It means that street, turn and time information of zero point will be lost after
// conversion to |segmentInfo|.
size_t turnIdx = turns[0].m_index != 0 ? 0 : 1;
size_t streetIdx = (!streets.empty() && streets[0].first != 0) ? 0 : 1;
size_t timeIdx = times[0].first != 0 ? 0 : 1;
double routeLengthMeters = 0.0;
double routeLengthMerc = 0.0;
double timeFromBeginningS = 0.0;
for (size_t i = 0; i < segments.size(); ++i)
{
size_t const segmentEndPointIdx = i + 1;
turns::TurnItem curTurn;
CHECK_LESS_OR_EQUAL(turnIdx, turns.size(), ());
if (turnIdx != turns.size() && turns[turnIdx].m_index == segmentEndPointIdx)
{
curTurn = turns[turnIdx];
if (turnIdx + 1 < turns.size())
++turnIdx;
}
string curStreet;
if (!streets.empty())
{
CHECK_LESS_OR_EQUAL(streetIdx, streets.size(), ());
if (streetIdx != streets.size() && streets[streetIdx].first == segmentEndPointIdx)
{
curStreet = streets[streetIdx].second;
if (streetIdx + 1 < streets.size())
++streetIdx;
}
}
CHECK_LESS_OR_EQUAL(timeIdx, times.size(), ());
if (timeIdx != times.size() && times[timeIdx].first == segmentEndPointIdx)
{
timeFromBeginningS = times[timeIdx].second;
if (timeIdx + 1 < times.size())
++timeIdx;
}
routeLengthMeters +=
MercatorBounds::DistanceOnEarth(junctions[i].GetPoint(), junctions[i + 1].GetPoint());
routeLengthMerc += junctions[i].GetPoint().Length(junctions[i + 1].GetPoint());
routeSegment.emplace_back(
segments[i], curTurn, junctions[i + 1], curStreet, routeLengthMeters, routeLengthMerc,
timeFromBeginningS,
trafficStash ? trafficStash->GetSpeedGroup(segments[i]) : traffic::SpeedGroup::Unknown,
nullptr /* transitInfo */);
}
}
void ReconstructRoute(IDirectionsEngine & engine, IndexRoadGraph const & graph,
shared_ptr<TrafficStash> const & trafficStash,
base::Cancellable const & cancellable, vector<Junction> const & path,
Route::TTimes && times, Route & route)
{
if (path.empty())
{
LOG(LERROR, ("Can't reconstruct route from an empty list of positions."));
return;
}
CHECK_EQUAL(path.size(), times.size(), ());
Route::TTurns turnsDir;
vector<Junction> junctions;
Route::TStreets streetNames;
vector<Segment> segments;
if (!engine.Generate(graph, path, cancellable, turnsDir, streetNames, junctions, segments))
return;
if (cancellable.IsCancelled())
return;
// In case of any errors in IDirectionsEngine::Generate() |junctions| is empty.
if (junctions.empty())
{
LOG(LERROR, ("Internal error happened while turn generation."));
return;
}
CHECK_EQUAL(path.size(), junctions.size(),
("Size of path:", path.size(), "size of junctions:", junctions.size()));
vector<RouteSegment> segmentInfo;
FillSegmentInfo(segments, junctions, turnsDir, streetNames, times, trafficStash, segmentInfo);
CHECK_EQUAL(segmentInfo.size(), segments.size(), ());
route.SetRouteSegments(move(segmentInfo));
// @TODO(bykoianko) If the start and the finish of a route lies on the same road segment
// engine->Generate() fills with empty vectors |times|, |turnsDir|, |junctions| and |segments|.
// It's not correct and should be fixed. It's necessary to work correctly with such routes.
vector<m2::PointD> routeGeometry;
JunctionsToPoints(junctions, routeGeometry);
route.SetGeometry(routeGeometry.begin(), routeGeometry.end());
}
Segment ConvertEdgeToSegment(NumMwmIds const & numMwmIds, Edge const & edge)
{
if (edge.IsFake())
return Segment();
NumMwmId const numMwmId =
numMwmIds.GetId(edge.GetFeatureId().m_mwmId.GetInfo()->GetLocalFile().GetCountryFile());
return Segment(numMwmId, edge.GetFeatureId().m_index, edge.GetSegId(), edge.IsForward());
}
} // namespace routing
|
