| 71 | } |
| 72 | |
| 73 | void ScoreCandidatePointsGetter::EnrichWithProjectionPoints(m2::PointD const & p, ScoreEdgeVec & edgeCandidates) |
| 74 | { |
| 75 | m_graph.ResetFakes(); |
| 76 | |
| 77 | std::vector<std::pair<Graph::Edge, geometry::PointWithAltitude>> vicinities; |
| 78 | m_graph.FindClosestEdges(p, static_cast<uint32_t>(m_maxProjectionCandidates), vicinities); |
| 79 | for (auto const & v : vicinities) |
| 80 | { |
| 81 | auto const & edge = v.first; |
| 82 | auto const & proj = v.second; |
| 83 | |
| 84 | CHECK(edge.HasRealPart(), ()); |
| 85 | CHECK(!edge.IsFake(), ()); |
| 86 | |
| 87 | if (mercator::DistanceOnEarth(p, proj.GetPoint()) >= kRadius) |
| 88 | continue; |
| 89 | |
| 90 | edgeCandidates.emplace_back(GetScoreByDistance(p, proj.GetPoint()), edge); |
| 91 | } |
| 92 | } |
| 93 | |
| 94 | bool ScoreCandidatePointsGetter::IsJunction(m2::PointD const & p) |
| 95 | { |
nothing calls this directly
no test coverage detected