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
|
#pragma once
#include "routing/edge_estimator.hpp"
#include "routing/geometry.hpp"
#include "routing/joint.hpp"
#include "routing/joint_index.hpp"
#include "routing/road_index.hpp"
#include "routing/road_point.hpp"
#include "geometry/point2d.hpp"
#include "std/cstdint.hpp"
#include "std/shared_ptr.hpp"
#include "std/unique_ptr.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"
namespace routing
{
class JointEdge final
{
public:
JointEdge(Joint::Id target, double weight) : m_target(target), m_weight(weight) {}
Joint::Id GetTarget() const { return m_target; }
double GetWeight() const { return m_weight; }
private:
// Target is vertex going to for outgoing edges, vertex going from for ingoing edges.
Joint::Id const m_target;
double const m_weight;
};
class IndexGraph final
{
public:
IndexGraph() = default;
explicit IndexGraph(unique_ptr<GeometryLoader> loader, shared_ptr<EdgeEstimator> estimator);
// Creates edge for points in same feature.
void GetDirectedEdge(uint32_t featureId, uint32_t pointFrom, uint32_t pointTo, Joint::Id target,
bool forward, vector<JointEdge> & edges);
void GetNeighboringEdges(RoadPoint const & rp, bool isOutgoing, vector<JointEdge> & edges);
// Put outgoing (or ingoing) egdes for jointId to the 'edges' vector.
void GetEdgeList(Joint::Id jointId, bool isOutgoing, vector<JointEdge> & edges);
Joint::Id GetJointId(RoadPoint const & rp) const { return m_roadIndex.GetJointId(rp); }
m2::PointD const & GetPoint(Joint::Id jointId);
m2::PointD const & GetPoint(RoadPoint const & rp);
Geometry & GetGeometry() { return m_geometry; }
EdgeEstimator const & GetEstimator() const { return *m_estimator; }
RoadJointIds const & GetRoad(uint32_t featureId) const { return m_roadIndex.GetRoad(featureId); }
uint32_t GetNumRoads() const { return m_roadIndex.GetSize(); }
uint32_t GetNumJoints() const { return m_jointIndex.GetNumJoints(); }
uint32_t GetNumPoints() const { return m_jointIndex.GetNumPoints(); }
void Build(uint32_t numJoints);
void Import(vector<Joint> const & joints);
Joint::Id InsertJoint(RoadPoint const & rp);
bool JointLiesOnRoad(Joint::Id jointId, uint32_t featureId) const;
void PushFromSerializer(Joint::Id jointId, RoadPoint const & rp)
{
m_roadIndex.PushFromSerializer(jointId, rp);
}
template <typename F>
void ForEachRoad(F && f) const
{
m_roadIndex.ForEachRoad(forward<F>(f));
}
template <typename F>
void ForEachPoint(Joint::Id jointId, F && f) const
{
m_jointIndex.ForEachPoint(jointId, forward<F>(f));
}
private:
void GetNeighboringEdge(RoadGeometry const & road, RoadPoint const & rp, bool forward,
vector<JointEdge> & edges) const;
Geometry m_geometry;
shared_ptr<EdgeEstimator> m_estimator;
RoadIndex m_roadIndex;
JointIndex m_jointIndex;
};
} // namespace routing
|
