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

14
libs/routing/routing_tests/routing_algorithm.hpp
View File

@@ -18,7 +18,7 @@ using namespace routing;
struct SimpleEdge
{
SimpleEdge() = default; // needed for buffer_vector only
SimpleEdge() = default; // needed for buffer_vector only
SimpleEdge(uint32_t to, double weight) : m_to(to), m_weight(weight) {}
uint32_t GetTarget() const { return m_to; }
@@ -37,9 +37,7 @@ public:
double GetSpeedKMpH(Edge const & edge, SpeedParams const & speedParams) const
{
double const speedKMpH =
(edge.IsFake() ? GetMaxSpeedKMpH()
: GetSpeedKMpH(edge.GetFeatureId(), speedParams));
double const speedKMpH = (edge.IsFake() ? GetMaxSpeedKMpH() : GetSpeedKMpH(edge.GetFeatureId(), speedParams));
ASSERT_LESS_OR_EQUAL(speedKMpH, GetMaxSpeedKMpH(), ());
return speedKMpH;
}
@@ -53,10 +51,8 @@ public:
// AStarGraph overrides
// @{
void GetIngoingEdgesList(astar::VertexData<Vertex, Weight> const & vertexData,
EdgeListT & adj) override;
void GetOutgoingEdgesList(astar::VertexData<Vertex, Weight> const & vertexData,
EdgeListT & adj) override;
void GetIngoingEdgesList(astar::VertexData<Vertex, Weight> const & vertexData, EdgeListT & adj) override;
void GetOutgoingEdgesList(astar::VertexData<Vertex, Weight> const & vertexData, EdgeListT & adj) override;
double HeuristicCostEstimate(Vertex const & v, Vertex const & w) override;
// @}
@@ -102,4 +98,4 @@ public:
};
std::string DebugPrint(TestAStarBidirectionalAlgo::Result const & result);
} // namespace routing_tests
} // namespace routing_test