blob: 1374ae2c810f5d8db68f2913d12f4c9671ec2399 (
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
50
51
|
#pragma once
#include "routing/road_graph.hpp"
#include "routing_common/vehicle_model.hpp"
#include "geometry/point2d.hpp"
#include "indexer/feature_altitude.hpp"
#include "indexer/feature_decl.hpp"
#include "indexer/mwm_set.hpp"
#include <cstdint>
#include <limits>
#include <memory>
#include <utility>
#include <vector>
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 = std::numeric_limits<double>::max();
uint32_t m_segId = 0;
Junction m_segStart;
Junction m_segEnd;
Junction m_projPoint;
FeatureID m_fid;
bool m_bidirectional = true;
};
m2::PointD const m_point;
std::vector<Candidate> m_candidates;
public:
explicit NearestEdgeFinder(m2::PointD const & point);
inline bool HasCandidates() const { return !m_candidates.empty(); }
void AddInformationSource(FeatureID const & featureId,
IRoadGraph::JunctionVec const & junctions,
bool bidirectiona);
void MakeResult(std::vector<std::pair<Edge, Junction>> & res, size_t const maxCountFeatures);
};
} // namespace routing
|
