blob: ca83564abdcc8cbcc5e96c901db21dba1bd38f99 (
plain)
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
|
#pragma once
#include "routing/road_graph.hpp"
#include "routing/vehicle_model.hpp"
#include "geometry/point2d.hpp"
#include "indexer/feature_altitude.hpp"
#include "indexer/feature_decl.hpp"
#include "indexer/index.hpp"
#include "indexer/mwm_set.hpp"
#include "std/unique_ptr.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"
namespace routing
{
/// Helper functor class to filter nearest roads to the given starting point.
/// Class returns pairs of outgoing edge and projection point on the edge
class NearestEdgeFinder
{
struct Candidate
{
double m_dist;
uint32_t m_segId;
Junction m_segStart;
Junction m_segEnd;
Junction m_projPoint;
FeatureID m_fid;
Candidate();
};
m2::PointD const m_point;
vector<Candidate> m_candidates;
public:
NearestEdgeFinder(m2::PointD const & point);
inline bool HasCandidates() const { return !m_candidates.empty(); }
void AddInformationSource(FeatureID const & featureId, IRoadGraph::RoadInfo const & roadInfo);
void MakeResult(vector<pair<Edge, Junction>> & res, size_t const maxCountFeatures);
};
} // namespace routing
|
