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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
#include "routing/single_vehicle_world_graph.hpp"
#include <utility>
namespace routing
{
using namespace std;
SingleVehicleWorldGraph::SingleVehicleWorldGraph(unique_ptr<CrossMwmGraph> crossMwmGraph,
unique_ptr<IndexGraphLoader> loader,
shared_ptr<EdgeEstimator> estimator)
: m_crossMwmGraph(move(crossMwmGraph)), m_loader(move(loader)), m_estimator(estimator)
{
CHECK(m_loader, ());
CHECK(m_estimator, ());
}
void SingleVehicleWorldGraph::CheckAndProcessTransitFeatures(Segment const & parent,
vector<JointEdge> & jointEdges,
vector<RouteWeight> & parentWeights,
bool isOutgoing)
{
bool opposite = !isOutgoing;
vector<JointEdge> newCrossMwmEdges;
for (size_t i = 0; i < jointEdges.size(); ++i)
{
JointSegment const & target = jointEdges[i].GetTarget();
if (!m_crossMwmGraph->IsFeatureTransit(target.GetMwmId(), target.GetFeatureId()))
continue;
auto & currentIndexGraph = GetIndexGraph(parent.GetMwmId());
vector<Segment> twins;
m_crossMwmGraph->GetTwinFeature(target.GetSegment(true /* start */), isOutgoing, twins);
for (auto const & twin : twins)
{
NumMwmId const twinMwmId = twin.GetMwmId();
uint32_t const twinFeatureId = twin.GetFeatureId();
Segment const start(twinMwmId, twinFeatureId, target.GetSegmentId(!opposite), target.IsForward());
auto & twinIndexGraph = GetIndexGraph(twinMwmId);
vector<uint32_t> lastPoints;
twinIndexGraph.GetLastPointsForJoint({start}, isOutgoing, lastPoints);
ASSERT_EQUAL(lastPoints.size(), 1, ());
if (auto edge = currentIndexGraph.GetJointEdgeByLastPoint(parent, target.GetSegment(!opposite),
isOutgoing, lastPoints.back()))
{
newCrossMwmEdges.emplace_back(*edge);
newCrossMwmEdges.back().GetTarget().GetFeatureId() = twinFeatureId;
newCrossMwmEdges.back().GetTarget().GetMwmId() = twinMwmId;
parentWeights.emplace_back(parentWeights[i]);
}
}
}
jointEdges.insert(jointEdges.end(), newCrossMwmEdges.begin(), newCrossMwmEdges.end());
}
void SingleVehicleWorldGraph::GetEdgeList(Segment const & parent, bool isOutgoing,
vector<JointEdge> & jointEdges,
vector<RouteWeight> & parentWeights)
{
// Fake segments aren't processed here. All work must be done
// on the IndexGraphStarterJoints abstraction-level.
if (!parent.IsRealSegment())
return;
auto & indexGraph = GetIndexGraph(parent.GetMwmId());
indexGraph.GetEdgeList(parent, isOutgoing, jointEdges, parentWeights);
if (m_mode != WorldGraphMode::JointSingleMwm)
CheckAndProcessTransitFeatures(parent, jointEdges, parentWeights, isOutgoing);
}
void SingleVehicleWorldGraph::GetEdgeList(Segment const & segment, bool isOutgoing,
vector<SegmentEdge> & edges)
{
if (m_mode == WorldGraphMode::LeapsOnly)
{
CHECK(m_crossMwmGraph, ());
// Ingoing edges listing is not supported for leaps because we do not have enough information
// to calculate |segment| weight. See https://jira.mail.ru/browse/MAPSME-5743 for details.
CHECK(isOutgoing, ("Ingoing edges listing is not supported for LeapsOnly mode."));
if (m_crossMwmGraph->IsTransition(segment, isOutgoing))
GetTwins(segment, isOutgoing, edges);
else
m_crossMwmGraph->GetOutgoingEdgeList(segment, edges);
return;
}
IndexGraph & indexGraph = m_loader->GetIndexGraph(segment.GetMwmId());
indexGraph.GetEdgeList(segment, isOutgoing, edges);
if (m_mode != WorldGraphMode::SingleMwm && m_crossMwmGraph && m_crossMwmGraph->IsTransition(segment, isOutgoing))
GetTwins(segment, isOutgoing, edges);
}
Junction const & SingleVehicleWorldGraph::GetJunction(Segment const & segment, bool front)
{
return GetRoadGeometry(segment.GetMwmId(), segment.GetFeatureId())
.GetJunction(segment.GetPointId(front));
}
m2::PointD const & SingleVehicleWorldGraph::GetPoint(Segment const & segment, bool front)
{
return GetJunction(segment, front).GetPoint();
}
bool SingleVehicleWorldGraph::IsOneWay(NumMwmId mwmId, uint32_t featureId)
{
return GetRoadGeometry(mwmId, featureId).IsOneWay();
}
bool SingleVehicleWorldGraph::IsPassThroughAllowed(NumMwmId mwmId, uint32_t featureId)
{
return GetRoadGeometry(mwmId, featureId).IsPassThroughAllowed();
}
void SingleVehicleWorldGraph::GetOutgoingEdgesList(Segment const & segment,
vector<SegmentEdge> & edges)
{
edges.clear();
GetEdgeList(segment, true /* isOutgoing */, edges);
}
void SingleVehicleWorldGraph::GetIngoingEdgesList(Segment const & segment,
vector<SegmentEdge> & edges)
{
edges.clear();
GetEdgeList(segment, false /* isOutgoing */, edges);
}
RouteWeight SingleVehicleWorldGraph::HeuristicCostEstimate(Segment const & from, Segment const & to)
{
return HeuristicCostEstimate(GetPoint(from, true /* front */), GetPoint(to, true /* front */));
}
RouteWeight SingleVehicleWorldGraph::HeuristicCostEstimate(Segment const & from, m2::PointD const & to)
{
return HeuristicCostEstimate(GetPoint(from, true /* front */), to);
}
RouteWeight SingleVehicleWorldGraph::HeuristicCostEstimate(m2::PointD const & from,
m2::PointD const & to)
{
return RouteWeight(m_estimator->CalcHeuristic(from, to));
}
RouteWeight SingleVehicleWorldGraph::CalcSegmentWeight(Segment const & segment)
{
return RouteWeight(m_estimator->CalcSegmentWeight(
segment, GetRoadGeometry(segment.GetMwmId(), segment.GetFeatureId())));
}
RouteWeight SingleVehicleWorldGraph::CalcLeapWeight(m2::PointD const & from,
m2::PointD const & to) const
{
return RouteWeight(m_estimator->CalcLeapWeight(from, to));
}
RouteWeight SingleVehicleWorldGraph::CalcOffroadWeight(m2::PointD const & from,
m2::PointD const & to) const
{
return RouteWeight(m_estimator->CalcOffroadWeight(from, to));
}
double SingleVehicleWorldGraph::CalcSegmentETA(Segment const & segment)
{
return m_estimator->CalcSegmentETA(segment, GetRoadGeometry(segment.GetMwmId(), segment.GetFeatureId()));
}
vector<Segment> const & SingleVehicleWorldGraph::GetTransitions(NumMwmId numMwmId, bool isEnter)
{
return m_crossMwmGraph->GetTransitions(numMwmId, isEnter);
}
unique_ptr<TransitInfo> SingleVehicleWorldGraph::GetTransitInfo(Segment const &) { return {}; }
vector<RouteSegment::SpeedCamera> SingleVehicleWorldGraph::GetSpeedCamInfo(Segment const & segment)
{
ASSERT(segment.IsRealSegment(), ());
return m_loader->GetSpeedCameraInfo(segment);
}
RoadGeometry const & SingleVehicleWorldGraph::GetRoadGeometry(NumMwmId mwmId, uint32_t featureId)
{
return m_loader->GetGeometry(mwmId).GetRoad(featureId);
}
void SingleVehicleWorldGraph::GetTwinsInner(Segment const & segment, bool isOutgoing,
vector<Segment> & twins)
{
m_crossMwmGraph->GetTwins(segment, isOutgoing, twins);
}
bool SingleVehicleWorldGraph::IsRoutingOptionsGood(Segment const & segment)
{
auto const & geometry = GetRoadGeometry(segment.GetMwmId(), segment.GetFeatureId());
return geometry.SuitableForOptions(m_avoidRoutingOptions);
}
RoutingOptions SingleVehicleWorldGraph::GetRoutingOptions(Segment const & segment)
{
ASSERT(segment.IsRealSegment(), ());
auto const & geometry = GetRoadGeometry(segment.GetMwmId(), segment.GetFeatureId());
return geometry.GetRoutingOptions();
}
} // namespace routing
|
