drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-20 13:23:59 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format all C++ and Java code via clang-format

Browse Source 
Signed-off-by: Konstantin Pastbin <konstantin.pastbin@gmail.com>
This commit is contained in:
Konstantin Pastbin
2025-08-17 14:32:37 +07:00
parent 9f0290c0ec
commit bfffa1fff4
2169 changed files with 56441 additions and 64188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
tools/track_analyzing/track_matcher.hpp
View File

@@ -22,8 +22,7 @@ namespace track_analyzing
class TrackMatcher final
{
public:
TrackMatcher(storage::Storage const & storage, routing::NumMwmId mwmId,
platform::CountryFile const & countryFile);
TrackMatcher(storage::Storage const & storage, routing::NumMwmId mwmId, platform::CountryFile const & countryFile);
void MatchTrack(std::vector<DataPoint> const & track, std::vector<MatchedTrack> & matchedTracks);
@@ -35,9 +34,7 @@ private:
class Candidate final
{
public:
Candidate(routing::Segment segment, double distance) : m_segment(segment), m_distance(distance)
{
}
Candidate(routing::Segment segment, double distance) : m_segment(segment), m_distance(distance) {}
routing::Segment const & GetSegment() const { return m_segment; }
double GetDistance() const { return m_distance; }
@@ -57,17 +54,14 @@ private:
DataPoint const & GetDataPoint() const { return m_dataPoint; }
routing::Segment const & GetSegment() const { return m_segment; }
bool HasCandidates() const { return !m_candidates.empty(); }
void FillCandidatesWithNearbySegments(DataSource const & dataSource,
routing::IndexGraph const & graph,
routing::VehicleModelInterface const & vehicleModel,
routing::NumMwmId mwmId);
void FillCandidatesWithNearbySegments(DataSource const & dataSource, routing::IndexGraph const & graph,
routing::VehicleModelInterface const & vehicleModel, routing::NumMwmId mwmId);
void FillCandidates(Step const & previousStep, routing::IndexGraph & graph);
void ChooseSegment(Step const & nextStep, routing::IndexGraph & indexGraph);
void ChooseNearestSegment();
private:
void AddCandidate(routing::Segment const & segment, double distance,
routing::IndexGraph const & graph);
void AddCandidate(routing::Segment const & segment, double distance, routing::IndexGraph const & graph);
DataPoint m_dataPoint;
m2::PointD m_point;