drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-19 13:03:36 +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

31
libs/routing/ruler_router.cpp
View File

@@ -6,13 +6,12 @@ namespace routing
{
using namespace std;
void RulerRouter::ClearState()
{
void RulerRouter::ClearState() {}
void RulerRouter::SetGuides(GuidesTracks && guides)
{ /*m_guides = GuidesConnections(guides);*/
}
void RulerRouter::SetGuides(GuidesTracks && guides) { /*m_guides = GuidesConnections(guides);*/ }
/* Ruler router doesn't read roads graph and uses only checkpoints to build a route.
1-----------2
@@ -45,10 +44,8 @@ void RulerRouter::SetGuides(GuidesTracks && guides) { /*m_guides = GuidesConnect
* m_subroutes.size() == m_routeSegments.size()-1
*/
RouterResultCode RulerRouter::CalculateRoute(Checkpoints const & checkpoints,
m2::PointD const & startDirection,
bool adjustToPrevRoute,
RouterDelegate const & delegate, Route & route)
RouterResultCode RulerRouter::CalculateRoute(Checkpoints const & checkpoints, m2::PointD const & startDirection,
bool adjustToPrevRoute, RouterDelegate const & delegate, Route & route)
{
vector<m2::PointD> const & points = checkpoints.GetPoints();
size_t const count = points.size();
@@ -61,10 +58,7 @@ RouterResultCode RulerRouter::CalculateRoute(Checkpoints const & checkpoints,
Segment const segment(kFakeNumMwmId, 0, 0, false);
auto const ToPointWA = [](m2::PointD const & p)
{
return geometry::PointWithAltitude(p, 0 /* altitude */);
};
auto const ToPointWA = [](m2::PointD const & p) { return geometry::PointWithAltitude(p, 0 /* altitude */); };
for (uint32_t i = 0; i < count; ++i)
{
@@ -89,17 +83,17 @@ RouterResultCode RulerRouter::CalculateRoute(Checkpoints const & checkpoints,
route.SetRouteSegments(std::move(routeSegments));
vector<Route::SubrouteAttrs> subroutes;
for(size_t i = 1; i < count; ++i)
for (size_t i = 1; i < count; ++i)
{
subroutes.emplace_back(ToPointWA(points[i-1]), ToPointWA(points[i]), i*2-2, i*2);
subroutes.emplace_back(ToPointWA(points[i-1]), ToPointWA(points[i]), i*2-1, i*2);
subroutes.emplace_back(ToPointWA(points[i - 1]), ToPointWA(points[i]), i * 2 - 2, i * 2);
subroutes.emplace_back(ToPointWA(points[i - 1]), ToPointWA(points[i]), i * 2 - 1, i * 2);
}
route.SetCurrentSubrouteIdx(checkpoints.GetPassedIdx());
route.SetSubroteAttrs(std::move(subroutes));
vector<m2::PointD> routeGeometry;
for (auto p: points)
for (auto p : points)
{
routeGeometry.push_back(p);
routeGeometry.push_back(p);
@@ -110,8 +104,7 @@ RouterResultCode RulerRouter::CalculateRoute(Checkpoints const & checkpoints,
return RouterResultCode::NoError;
}
bool RulerRouter::FindClosestProjectionToRoad(m2::PointD const & point,
m2::PointD const & direction, double radius,
bool RulerRouter::FindClosestProjectionToRoad(m2::PointD const & point, m2::PointD const & direction, double radius,
EdgeProj & proj)
{
// Ruler router has no connection to road graph.