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
|
#include "routing/pedestrian_directions.hpp"
#include "routing/road_graph.hpp"
#include "indexer/classificator.hpp"
#include "indexer/feature.hpp"
#include "indexer/ftypes_matcher.hpp"
#include "base/assert.hpp"
#include "base/logging.hpp"
namespace
{
bool HasType(uint32_t type, feature::TypesHolder const & types)
{
for (uint32_t t : types)
{
t = ftypes::BaseChecker::PrepareToMatch(t, 2);
if (type == t)
return true;
}
return false;
}
} // namespace
namespace routing
{
PedestrianDirectionsEngine::PedestrianDirectionsEngine()
: m_typeSteps(classif().GetTypeByPath({"highway", "steps"}))
, m_typeLiftGate(classif().GetTypeByPath({"barrier", "lift_gate"}))
, m_typeGate(classif().GetTypeByPath({"barrier", "gate"}))
{
}
void PedestrianDirectionsEngine::Generate(IRoadGraph const & graph, vector<Junction> const & path,
Route::TTimes & times, Route::TTurns & turns,
vector<Junction> & routeGeometry,
vector<traffic::TrafficInfo::RoadSegmentId> & /* trafficSegs */,
my::Cancellable const & cancellable)
{
times.clear();
turns.clear();
routeGeometry.clear();
if (path.size() <= 1)
return;
CalculateTimes(graph, path, times);
vector<Edge> routeEdges;
if (!ReconstructPath(graph, path, routeEdges, cancellable))
{
LOG(LDEBUG, ("Couldn't reconstruct path."));
// use only "arrival" direction
turns.emplace_back(path.size() - 1, turns::PedestrianDirection::ReachedYourDestination);
return;
}
CalculateTurns(graph, routeEdges, turns, cancellable);
routeGeometry = path;
}
void PedestrianDirectionsEngine::CalculateTurns(IRoadGraph const & graph,
vector<Edge> const & routeEdges,
Route::TTurns & turns,
my::Cancellable const & cancellable) const
{
for (size_t i = 0; i < routeEdges.size(); ++i)
{
if (cancellable.IsCancelled())
return;
Edge const & edge = routeEdges[i];
feature::TypesHolder types;
graph.GetEdgeTypes(edge, types);
if (HasType(m_typeSteps, types))
{
if (edge.IsForward())
turns.emplace_back(i, turns::PedestrianDirection::Upstairs);
else
turns.emplace_back(i, turns::PedestrianDirection::Downstairs);
}
else
{
graph.GetJunctionTypes(edge.GetStartJunction(), types);
if (HasType(m_typeLiftGate, types))
turns.emplace_back(i, turns::PedestrianDirection::LiftGate);
else if (HasType(m_typeGate, types))
turns.emplace_back(i, turns::PedestrianDirection::Gate);
}
}
// direction "arrival"
// (index of last junction is the same as number of edges)
turns.emplace_back(routeEdges.size(), turns::PedestrianDirection::ReachedYourDestination);
}
} // namespace routing
|
