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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
|
#include "generator/routing_index_generator.hpp"
#include "generator/borders.hpp"
#include "generator/routing_helpers.hpp"
#include "routing/base/astar_algorithm.hpp"
#include "routing/base/astar_graph.hpp"
#include "routing/cross_mwm_connector.hpp"
#include "routing/cross_mwm_connector_serialization.hpp"
#include "routing/cross_mwm_ids.hpp"
#include "routing/fake_feature_ids.hpp"
#include "routing/index_graph.hpp"
#include "routing/index_graph_loader.hpp"
#include "routing/index_graph_serialization.hpp"
#include "routing/index_graph_starter_joints.hpp"
#include "routing/joint_segment.hpp"
#include "routing/vehicle_mask.hpp"
#include "routing_common/bicycle_model.hpp"
#include "routing_common/car_model.hpp"
#include "routing_common/pedestrian_model.hpp"
#include "transit/transit_graph_data.hpp"
#include "transit/transit_serdes.hpp"
#include "indexer/data_header.hpp"
#include "indexer/feature.hpp"
#include "indexer/feature_processor.hpp"
#include "coding/file_container.hpp"
#include "coding/geometry_coding.hpp"
#include "coding/point_coding.hpp"
#include "coding/reader.hpp"
#include "geometry/point2d.hpp"
#include "base/checked_cast.hpp"
#include "base/file_name_utils.hpp"
#include "base/geo_object_id.hpp"
#include "base/logging.hpp"
#include "base/timer.hpp"
#include <algorithm>
#include <cstdint>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <unordered_map>
#include <vector>
using namespace feature;
using namespace platform;
using namespace routing;
using namespace std;
using namespace std::placeholders;
namespace
{
class VehicleMaskBuilder final
{
public:
VehicleMaskBuilder(string const & country,
CountryParentNameGetterFn const & countryParentNameGetterFn)
: m_pedestrianModel(
PedestrianModelFactory(countryParentNameGetterFn).GetVehicleModelForCountry(country))
, m_bicycleModel(
BicycleModelFactory(countryParentNameGetterFn).GetVehicleModelForCountry(country))
, m_carModel(CarModelFactory(countryParentNameGetterFn).GetVehicleModelForCountry(country))
{
CHECK(m_pedestrianModel, ());
CHECK(m_bicycleModel, ());
CHECK(m_carModel, ());
}
VehicleMask CalcRoadMask(FeatureType & f) const
{
return CalcMask(
f, [&](VehicleModelInterface const & model, FeatureType & f) { return model.IsRoad(f); });
}
VehicleMask CalcOneWayMask(FeatureType & f) const
{
return CalcMask(
f, [&](VehicleModelInterface const & model, FeatureType & f) { return model.IsOneWay(f); });
}
private:
template <class Fn>
VehicleMask CalcMask(FeatureType & f, Fn && fn) const
{
VehicleMask mask = 0;
if (fn(*m_pedestrianModel, f))
mask |= kPedestrianMask;
if (fn(*m_bicycleModel, f))
mask |= kBicycleMask;
if (fn(*m_carModel, f))
mask |= kCarMask;
return mask;
}
shared_ptr<VehicleModelInterface> const m_pedestrianModel;
shared_ptr<VehicleModelInterface> const m_bicycleModel;
shared_ptr<VehicleModelInterface> const m_carModel;
};
class Processor final
{
public:
Processor(string const & country, CountryParentNameGetterFn const & countryParentNameGetterFn)
: m_maskBuilder(country, countryParentNameGetterFn)
{
}
void ProcessAllFeatures(string const & filename)
{
feature::ForEachFromDat(filename, bind(&Processor::ProcessFeature, this, _1, _2));
}
void BuildGraph(IndexGraph & graph) const
{
vector<Joint> joints;
for (auto const & it : m_posToJoint)
{
// Need only connected points (2 or more roads)
if (it.second.GetSize() >= 2)
joints.emplace_back(it.second);
}
graph.Import(joints);
}
unordered_map<uint32_t, VehicleMask> const & GetMasks() const { return m_masks; }
private:
void ProcessFeature(FeatureType & f, uint32_t id)
{
VehicleMask const mask = m_maskBuilder.CalcRoadMask(f);
if (mask == 0)
return;
m_masks[id] = mask;
f.ParseGeometry(FeatureType::BEST_GEOMETRY);
for (size_t i = 0; i < f.GetPointsCount(); ++i)
{
uint64_t const locationKey = PointToInt64Obsolete(f.GetPoint(i), kPointCoordBits);
m_posToJoint[locationKey].AddPoint(RoadPoint(id, base::checked_cast<uint32_t>(i)));
}
}
VehicleMaskBuilder const m_maskBuilder;
unordered_map<uint64_t, Joint> m_posToJoint;
unordered_map<uint32_t, VehicleMask> m_masks;
};
class IndexGraphWrapper final
{
public:
IndexGraphWrapper(IndexGraph & graph, Segment const & start)
: m_graph(graph), m_start(start) {}
// Just for compatibility with IndexGraphStarterJoints
// @{
Segment GetStartSegment() const { return m_start; }
Segment GetFinishSegment() const { return {}; }
bool ConvertToReal(Segment const & /* segment */) const { return false; }
RouteWeight HeuristicCostEstimate(Segment const & /* from */, m2::PointD const & /* to */)
{
CHECK(false, ("This method exists only for compatibility with IndexGraphStarterJoints"));
return GetAStarWeightZero<RouteWeight>();
}
bool AreWavesConnectible(map<JointSegment, JointSegment> const & /* forwardParents */,
JointSegment const & /* commonVertex */,
map<JointSegment, JointSegment> const & /* backwardParents */,
function<uint32_t(JointSegment const &)> && /* fakeFeatureConverter */)
{
return true;
}
// @}
m2::PointD const & GetPoint(Segment const & s, bool forward)
{
return m_graph.GetPoint(s, forward);
}
void SetAStarParents(bool /* forward */, map<JointSegment, JointSegment> & parents)
{
m_AStarParents = &parents;
}
void GetEdgesList(Segment const & child, bool isOutgoing, vector<SegmentEdge> & edges)
{
m_graph.GetEdgeList(child, isOutgoing, edges);
}
void GetEdgeList(JointSegment const & parentJoint, Segment const & parent, bool isOutgoing,
vector<JointEdge> & edges, vector<RouteWeight> & parentWeights) const
{
CHECK(m_AStarParents, ());
return m_graph.GetEdgeList(parentJoint, parent, isOutgoing, edges, parentWeights, *m_AStarParents);
}
bool IsJoint(Segment const & segment, bool fromStart) const
{
if (m_graph.IsJoint(segment.GetRoadPoint(fromStart)))
return true;
// For features, that ends out of mwm. In this case |m_graph.IsJoint| returns false, but we should
// think, that it's Joint anyway.
uint32_t const pointId = segment.GetPointId(fromStart);
uint32_t const pointsNumber = m_graph.GetGeometry().GetRoad(segment.GetFeatureId()).GetPointsCount();
return pointId == 0 || pointId + 1 == pointsNumber;
}
template <typename Vertex>
RouteWeight HeuristicCostEstimate(Vertex const & /* from */, m2::PointD const & /* to */)
{
CHECK(false, ("This method should not be use, it is just for compatibility with "
"IndexGraphStarterJoints."));
return GetAStarWeightZero<RouteWeight>();
}
private:
map<JointSegment, JointSegment> * m_AStarParents = nullptr;
IndexGraph & m_graph;
Segment m_start;
};
class DijkstraWrapperJoints : public IndexGraphStarterJoints<IndexGraphWrapper>
{
public:
DijkstraWrapperJoints(IndexGraphWrapper & graph, Segment const & start)
: IndexGraphStarterJoints<IndexGraphWrapper>(graph, start) {}
Weight HeuristicCostEstimate(Vertex const & /* from */, Vertex const & /* to */) override
{
return GetAStarWeightZero<Weight>();
}
};
// Calculate distance from the starting border point to the transition along the border.
// It could be measured clockwise or counterclockwise, direction doesn't matter.
template <typename CrossMwmId>
double CalcDistanceAlongTheBorders(vector<m2::RegionD> const & borders,
CrossMwmConnectorSerializer::Transition<CrossMwmId> const & transition)
{
auto distance = GetAStarWeightZero<double>();
for (m2::RegionD const & region : borders)
{
vector<m2::PointD> const & points = region.Data();
CHECK(!points.empty(), ());
m2::PointD const * prev = &points.back();
for (m2::PointD const & curr : points)
{
m2::PointD intersection;
if (m2::RegionD::IsIntersect(transition.GetBackPoint(), transition.GetFrontPoint(), *prev,
curr, intersection))
{
distance += prev->Length(intersection);
return distance;
}
distance += prev->Length(curr);
prev = &curr;
}
}
CHECK(false, ("Intersection not found, feature:", transition.GetFeatureId(), "segment:",
transition.GetSegmentIdx(), "back:", transition.GetBackPoint(), "front:",
transition.GetFrontPoint()));
return distance;
}
/// \brief Fills |transitions| for osm id case. That means |Transition::m_roadMask| for items in
/// |transitions| will be combination of |VehicleType::Pedestrian|, |VehicleType::Bicycle|
/// and |VehicleType::Car|.
void CalcCrossMwmTransitions(
string const & mwmFile, string const & mappingFile, vector<m2::RegionD> const & borders,
string const & country, CountryParentNameGetterFn const & countryParentNameGetterFn,
vector<CrossMwmConnectorSerializer::Transition<base::GeoObjectId>> & transitions)
{
VehicleMaskBuilder const maskMaker(country, countryParentNameGetterFn);
map<uint32_t, base::GeoObjectId> featureIdToOsmId;
CHECK(ParseRoadsFeatureIdToOsmIdMapping(mappingFile, featureIdToOsmId),
("Can't parse feature id to osm id mapping. File:", mappingFile));
ForEachFromDat(mwmFile, [&](FeatureType & f, uint32_t featureId) {
VehicleMask const roadMask = maskMaker.CalcRoadMask(f);
if (roadMask == 0)
return;
f.ParseGeometry(FeatureType::BEST_GEOMETRY);
size_t const pointsCount = f.GetPointsCount();
if (pointsCount == 0)
return;
auto const it = featureIdToOsmId.find(featureId);
CHECK(it != featureIdToOsmId.end(), ("Can't find osm id for feature id", featureId));
auto const osmId = it->second;
CHECK(osmId.GetType() == base::GeoObjectId::Type::ObsoleteOsmWay, ());
bool prevPointIn = m2::RegionsContain(borders, f.GetPoint(0));
for (size_t i = 1; i < pointsCount; ++i)
{
bool const currPointIn = m2::RegionsContain(borders, f.GetPoint(i));
if (currPointIn == prevPointIn)
continue;
auto const segmentIdx = base::asserted_cast<uint32_t>(i - 1);
VehicleMask const oneWayMask = maskMaker.CalcOneWayMask(f);
transitions.emplace_back(osmId, featureId, segmentIdx, roadMask, oneWayMask, currPointIn,
f.GetPoint(i - 1), f.GetPoint(i));
prevPointIn = currPointIn;
}
});
}
/// \brief Fills |transitions| for transit case. That means Transition::m_roadMask for items in
/// |transitions| will be equal to VehicleType::Transit after call of this method.
void CalcCrossMwmTransitions(string const & mwmFile, string const & mappingFile,
vector<m2::RegionD> const & borders, string const & country,
CountryParentNameGetterFn const & /* countryParentNameGetterFn */,
vector<CrossMwmConnectorSerializer::Transition<connector::TransitId>> & transitions)
{
CHECK(mappingFile.empty(), ());
try
{
FilesContainerR cont(mwmFile);
if (!cont.IsExist(TRANSIT_FILE_TAG))
{
LOG(LINFO, ("Transit cross mwm section is not generated because no transit section in mwm:",
mwmFile));
return;
}
auto reader = cont.GetReader(TRANSIT_FILE_TAG);
transit::GraphData graphData;
graphData.DeserializeForCrossMwm(*reader.GetPtr());
auto const & stops = graphData.GetStops();
auto const & edges = graphData.GetEdges();
auto const getStopIdPoint = [&stops](transit::StopId stopId) -> m2::PointD const & {
auto const it = equal_range(stops.cbegin(), stops.cend(), transit::Stop(stopId));
CHECK_EQUAL(
distance(it.first, it.second), 1,
("A stop with id:", stopId, "is not unique or there's no such item in stops:", stops));
return it.first->GetPoint();
};
// Index |i| is a zero based edge index. This zero based index should be increased with
// |FakeFeatureIds::kTransitGraphFeaturesStart| by setting it as |featureNumerationOffset| for
// CrossMwmConnector (see CrossMwmIndexGraph::Deserialize()) and then used in Segment class as
// feature id in transit case.
for (size_t i = 0; i < edges.size(); ++i)
{
auto const & e = edges[i];
m2::PointD const & stop1Point = getStopIdPoint(e.GetStop1Id());
m2::PointD const & stop2Point = getStopIdPoint(e.GetStop2Id());
bool const stop2In = m2::RegionsContain(borders, stop2Point);
if (m2::RegionsContain(borders, stop1Point) == stop2In)
continue;
// Note. One way mask is set to kTransitMask because all transit edges are one way edges.
transitions.emplace_back(connector::TransitId(e.GetStop1Id(), e.GetStop2Id(), e.GetLineId()),
i /* feature id */, 0 /* segment index */, kTransitMask,
kTransitMask /* one way mask */, stop2In /* forward is enter */,
stop1Point, stop2Point);
}
}
catch (Reader::OpenException const & e)
{
CHECK(false, ("Error while reading", TRANSIT_FILE_TAG, "section.", e.Msg()));
}
}
/// \brief Fills |transitions| and |connectors| params.
/// \note This method fills only |connections| which are applicable for |CrossMwmId|.
/// For example |VehicleType::Pedestrian|, |VehicleType::Bicycle| and |VehicleType::Car|
/// are applicable for |connector::OsmId|.
/// And |VehicleType::Transit| is applicable for |connector::TransitId|.
template <typename CrossMwmId>
void CalcCrossMwmConnectors(
string const & path, string const & mwmFile, string const & country,
CountryParentNameGetterFn const & countryParentNameGetterFn, string const & mappingFile,
vector<CrossMwmConnectorSerializer::Transition<CrossMwmId>> & transitions,
CrossMwmConnectorPerVehicleType<CrossMwmId> & connectors)
{
base::Timer timer;
string const polyFile = base::JoinPath(path, BORDERS_DIR, country + BORDERS_EXTENSION);
vector<m2::RegionD> borders;
borders::LoadBorders(polyFile, borders);
// Note 1. CalcCrossMwmTransitions() method fills vector |transitions|.
// There are two implementation of the method for |connector::OsmId| and for |connector::TransitId|.
// For all items in |transitions| |Transition::m_roadMask| may be set to any combination of masks:
// GetVehicleMask(VehicleType::Pedestrian), GetVehicleMask(VehicleType::Bicycle) and
// GetVehicleMask(VehicleType::Car) for |connector::OsmId| implementation.
// For all items in |transitions| |Transition::m_roadMask| is set to
// GetVehicleMask(VehicleType::Transit) for |connector::TransitId| implementation.
// Note 2. Taking into account note 1 it's clear that field |Transition<TransitId>::m_roadMask|
// is always set to |VehicleType::Transit| and field |Transition<OsmId>::m_roadMask| can't have
// |VehicleType::Transit| value.
CalcCrossMwmTransitions(mwmFile, mappingFile, borders, country, countryParentNameGetterFn,
transitions);
LOG(LINFO, ("Transitions finished, transitions:", transitions.size(),
", elapsed:", timer.ElapsedSeconds(), "seconds"));
timer.Reset();
sort(transitions.begin(), transitions.end(),
[&](CrossMwmConnectorSerializer::Transition<CrossMwmId> const & lhs,
CrossMwmConnectorSerializer::Transition<CrossMwmId> const & rhs) {
return CalcDistanceAlongTheBorders(borders, lhs) <
CalcDistanceAlongTheBorders(borders, rhs);
});
LOG(LINFO, ("Transition sorted in", timer.ElapsedSeconds(), "seconds"));
for (auto const & transition : transitions)
{
for (size_t i = 0; i < connectors.size(); ++i)
{
VehicleMask const mask = GetVehicleMask(static_cast<VehicleType>(i));
CrossMwmConnectorSerializer::AddTransition(transition, mask, connectors[i]);
}
}
for (size_t i = 0; i < connectors.size(); ++i)
{
auto const vehicleType = static_cast<VehicleType>(i);
auto const & connector = connectors[i];
LOG(LINFO, (vehicleType, "model. Number of enters:", connector.GetEnters().size(),
"Number of exits:", connector.GetExits().size()));
}
}
template <typename CrossMwmId>
void FillWeights(string const & path, string const & mwmFile, string const & country,
CountryParentNameGetterFn const & countryParentNameGetterFn,
bool disableCrossMwmProgress, CrossMwmConnector<CrossMwmId> & connector)
{
base::Timer timer;
shared_ptr<VehicleModelInterface> vehicleModel =
CarModelFactory(countryParentNameGetterFn).GetVehicleModelForCountry(country);
IndexGraph graph(
make_shared<Geometry>(GeometryLoader::CreateFromFile(mwmFile, vehicleModel)),
EdgeEstimator::Create(VehicleType::Car, *vehicleModel, nullptr /* trafficStash */));
MwmValue mwmValue(LocalCountryFile(path, platform::CountryFile(country), 0 /* version */));
DeserializeIndexGraph(mwmValue, VehicleType::Car, graph);
map<Segment, map<Segment, RouteWeight>> weights;
auto const numEnters = connector.GetEnters().size();
size_t foundCount = 0;
size_t notFoundCount = 0;
for (size_t i = 0; i < numEnters; ++i)
{
if (i % 10 == 0)
LOG(LINFO, ("Building leaps:", i, "/", numEnters, "waves passed"));
Segment const & enter = connector.GetEnter(i);
using Algorithm = AStarAlgorithm<JointSegment, JointEdge, RouteWeight>;
Algorithm astar;
IndexGraphWrapper indexGraphWrapper(graph, enter);
DijkstraWrapperJoints wrapper(indexGraphWrapper, enter);
AStarAlgorithm<JointSegment, JointEdge, RouteWeight>::Context context;
indexGraphWrapper.SetAStarParents(true /* forward */, context.GetParents());
unordered_map<uint32_t, vector<JointSegment>> visitedVertexes;
astar.PropagateWave(wrapper, wrapper.GetStartJoint(),
[&](JointSegment const & vertex)
{
if (vertex.IsFake())
{
Segment start = wrapper.GetSegmentOfFakeJoint(vertex, true /* start */);
Segment end = wrapper.GetSegmentOfFakeJoint(vertex, false /* start */);
if (start.IsForward() != end.IsForward())
return true;
visitedVertexes[end.GetFeatureId()].emplace_back(start, end);
}
else
{
visitedVertexes[vertex.GetFeatureId()].emplace_back(vertex);
}
return true;
} /* visitVertex */,
context);
for (Segment const & exit : connector.GetExits())
{
auto const it = visitedVertexes.find(exit.GetFeatureId());
if (it == visitedVertexes.cend())
{
++notFoundCount;
continue;
}
uint32_t const id = exit.GetSegmentIdx();
bool const forward = exit.IsForward();
for (auto const & jointSegment : it->second)
{
if (jointSegment.IsForward() != forward)
continue;
if ((jointSegment.GetStartSegmentId() <= id && id <= jointSegment.GetEndSegmentId()) ||
(jointSegment.GetEndSegmentId() <= id && id <= jointSegment.GetStartSegmentId()))
{
RouteWeight weight;
Segment parentSegment;
if (context.HasParent(jointSegment))
{
JointSegment const & parent = context.GetParent(jointSegment);
parentSegment = parent.IsFake() ? wrapper.GetSegmentOfFakeJoint(parent, false /* start */)
: parent.GetSegment(false /* start */);
weight = context.GetDistance(parent);
}
else
{
parentSegment = enter;
}
Segment const & firstChild = jointSegment.GetSegment(true /* start */);
uint32_t const lastPoint = exit.GetPointId(true /* front */);
static map<JointSegment, JointSegment> kEmptyParents;
auto optionalEdge = graph.GetJointEdgeByLastPoint(parentSegment, firstChild,
true /* isOutgoing */, lastPoint);
if (!optionalEdge)
continue;
weight += (*optionalEdge).GetWeight();
weights[enter][exit] = weight;
++foundCount;
break;
}
}
}
}
connector.FillWeights([&](Segment const & enter, Segment const & exit) {
auto it0 = weights.find(enter);
if (it0 == weights.end())
return connector::kNoRoute;
auto it1 = it0->second.find(exit);
if (it1 == it0->second.end())
return connector::kNoRoute;
return it1->second.ToCrossMwmWeight();
});
LOG(LINFO, ("Leaps finished, elapsed:", timer.ElapsedSeconds(), "seconds, routes found:",
foundCount, ", not found:", notFoundCount));
}
serial::GeometryCodingParams LoadGeometryCodingParams(string const & mwmFile)
{
DataHeader const dataHeader(mwmFile);
return dataHeader.GetDefGeometryCodingParams();
}
} // namespace
namespace routing
{
bool BuildRoutingIndex(string const & filename, string const & country,
CountryParentNameGetterFn const & countryParentNameGetterFn)
{
LOG(LINFO, ("Building routing index for", filename));
try
{
Processor processor(country, countryParentNameGetterFn);
processor.ProcessAllFeatures(filename);
IndexGraph graph;
processor.BuildGraph(graph);
FilesContainerW cont(filename, FileWriter::OP_WRITE_EXISTING);
FileWriter writer = cont.GetWriter(ROUTING_FILE_TAG);
auto const startPos = writer.Pos();
IndexGraphSerializer::Serialize(graph, processor.GetMasks(), writer);
auto const sectionSize = writer.Pos() - startPos;
LOG(LINFO, ("Routing section created:", sectionSize, "bytes,", graph.GetNumRoads(), "roads,",
graph.GetNumJoints(), "joints,", graph.GetNumPoints(), "points"));
return true;
}
catch (RootException const & e)
{
LOG(LERROR, ("An exception happened while creating", ROUTING_FILE_TAG, "section:", e.what()));
return false;
}
}
/// \brief Serializes all the cross mwm information to |sectionName| of |mwmFile| including:
/// * header
/// * transitions
/// * weight buffers if any
template <typename CrossMwmId>
void SerializeCrossMwm(string const & mwmFile, string const & sectionName,
CrossMwmConnectorPerVehicleType<CrossMwmId> const & connectors,
vector<CrossMwmConnectorSerializer::Transition<CrossMwmId>> const & transitions)
{
serial::GeometryCodingParams const codingParams = LoadGeometryCodingParams(mwmFile);
FilesContainerW cont(mwmFile, FileWriter::OP_WRITE_EXISTING);
auto writer = cont.GetWriter(sectionName);
auto const startPos = writer.Pos();
CrossMwmConnectorSerializer::Serialize(transitions, connectors, codingParams, writer);
auto const sectionSize = writer.Pos() - startPos;
LOG(LINFO, ("Cross mwm section generated, size:", sectionSize, "bytes"));
}
void BuildRoutingCrossMwmSection(string const & path, string const & mwmFile,
string const & country,
CountryParentNameGetterFn const & countryParentNameGetterFn,
string const & osmToFeatureFile, bool disableCrossMwmProgress)
{
LOG(LINFO, ("Building cross mwm section for", country));
using CrossMwmId = base::GeoObjectId;
CrossMwmConnectorPerVehicleType<CrossMwmId> connectors;
vector<CrossMwmConnectorSerializer::Transition<CrossMwmId>> transitions;
CalcCrossMwmConnectors(path, mwmFile, country, countryParentNameGetterFn, osmToFeatureFile,
transitions, connectors);
// We use leaps for cars only. To use leaps for other vehicle types add weights generation
// here and change WorldGraph mode selection rule in IndexRouter::CalculateSubroute.
FillWeights(path, mwmFile, country, countryParentNameGetterFn, disableCrossMwmProgress,
connectors[static_cast<size_t>(VehicleType::Car)]);
CHECK(connectors[static_cast<size_t>(VehicleType::Transit)].IsEmpty(), ());
SerializeCrossMwm(mwmFile, CROSS_MWM_FILE_TAG, connectors, transitions);
}
void BuildTransitCrossMwmSection(string const & path, string const & mwmFile,
string const & country,
CountryParentNameGetterFn const & countryParentNameGetterFn)
{
LOG(LINFO, ("Building transit cross mwm section for", country));
using CrossMwmId = connector::TransitId;
CrossMwmConnectorPerVehicleType<CrossMwmId> connectors;
vector<CrossMwmConnectorSerializer::Transition<CrossMwmId>> transitions;
CalcCrossMwmConnectors(path, mwmFile, country, countryParentNameGetterFn, "" /* mapping file */,
transitions, connectors);
CHECK(connectors[static_cast<size_t>(VehicleType::Pedestrian)].IsEmpty(), ());
CHECK(connectors[static_cast<size_t>(VehicleType::Bicycle)].IsEmpty(), ());
CHECK(connectors[static_cast<size_t>(VehicleType::Car)].IsEmpty(), ());
SerializeCrossMwm(mwmFile, TRANSIT_CROSS_MWM_FILE_TAG, connectors, transitions);
}
} // namespace routing
|