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

77
libs/routing/routing_tests/index_graph_tools.hpp
View File

@@ -61,16 +61,14 @@ public:
m_graph->GetPoint(to, true /* front */));
}
void GetOutgoingEdgesList(astar::VertexData<Vertex, RouteWeight> const & vertexData,
EdgeListT & edges) override
void GetOutgoingEdgesList(astar::VertexData<Vertex, RouteWeight> const & vertexData, EdgeListT & edges) override
{
edges.clear();
m_graph->GetEdgeList(vertexData, true /* isOutgoing */, true /* useRoutingOptions */,
true /* useAccessConditional */, edges);
}
void GetIngoingEdgesList(astar::VertexData<Vertex, RouteWeight> const & vertexData,
EdgeListT & edges) override
void GetIngoingEdgesList(astar::VertexData<Vertex, RouteWeight> const & vertexData, EdgeListT & edges) override
{
edges.clear();
m_graph->GetEdgeList(vertexData, false /* isOutgoing */, true /* useRoutingOptions */,
@@ -106,8 +104,7 @@ struct NoUTurnRestrictionTest
void SetRestrictions(RestrictionVec && restrictions);
void SetNoUTurnRestrictions(std::vector<RestrictionUTurn> && restrictions);
void TestRouteGeom(Segment const & start, Segment const & finish,
AlgorithmForWorldGraph::Result expectedRouteResult,
void TestRouteGeom(Segment const & start, Segment const & finish, AlgorithmForWorldGraph::Result expectedRouteResult,
std::vector<m2::PointD> const & expectedRouteGeom);
std::unique_ptr<WorldGraphForAStar> m_graph;
@@ -131,10 +128,7 @@ public:
IndexGraph & GetIndexGraph(NumMwmId mwmId) override;
Geometry & GetGeometry(NumMwmId mwmId) override;
std::vector<RouteSegment::SpeedCamera> GetSpeedCameraInfo(Segment const & segment) override
{
return {};
}
std::vector<RouteSegment::SpeedCamera> GetSpeedCameraInfo(Segment const & segment) override { return {}; }
void Clear() override;
@@ -171,8 +165,7 @@ public:
explicit WeightedEdgeEstimator(std::map<Segment, double> const & segmentWeights)
: EdgeEstimator(1e10 /* maxSpeedKMpH */, 1.0 /* offroadSpeedKMpH */)
, m_segmentWeights(segmentWeights)
{
}
{}
// EdgeEstimator overrides:
~WeightedEdgeEstimator() override = default;
@@ -207,8 +200,7 @@ public:
// Sets access for previously added edge.
void SetEdgeAccess(Vertex from, Vertex to, RoadAccess::Type type);
/// \param |condition| in osm opening hours format.
void SetEdgeAccessConditional(Vertex from, Vertex to, RoadAccess::Type type,
std::string const & condition);
void SetEdgeAccessConditional(Vertex from, Vertex to, RoadAccess::Type type, std::string const & condition);
// Sets access type for previously added point.
void SetVertexAccess(Vertex v, RoadAccess::Type type);
@@ -216,11 +208,13 @@ public:
void SetVertexAccessConditional(Vertex v, RoadAccess::Type type, std::string const & condition);
// Finds a path between the start and finish vertices. Returns true iff a path exists.
bool FindPath(Vertex start, Vertex finish, double & pathWeight,
std::vector<Edge> & pathEdges) const;
bool FindPath(Vertex start, Vertex finish, double & pathWeight, std::vector<Edge> & pathEdges) const;
template <typename T>
void SetCurrentTimeGetter(T && getter) { m_currentTimeGetter = std::forward<T>(getter); }
void SetCurrentTimeGetter(T && getter)
{
m_currentTimeGetter = std::forward<T>(getter);
}
private:
struct EdgeRequest
@@ -239,10 +233,8 @@ private:
RoadAccess::Type m_toAccessType = RoadAccess::Type::Yes;
RoadAccess::Conditional m_toAccessConditionalType;
EdgeRequest(uint32_t id, Vertex from, Vertex to, double weight)
: m_id(id), m_from(from), m_to(to), m_weight(weight)
{
}
EdgeRequest(uint32_t id, Vertex from, Vertex to, double weight) : m_id(id), m_from(from), m_to(to), m_weight(weight)
{}
};
// Builder builds a graph from edge requests.
@@ -266,8 +258,7 @@ private:
std::function<time_t()> m_currentTimeGetter;
};
void AddDirectedEdge(std::vector<EdgeRequest> & edgeRequests, Vertex from, Vertex to,
double weight) const;
void AddDirectedEdge(std::vector<EdgeRequest> & edgeRequests, Vertex from, Vertex to, double weight) const;
std::function<time_t()> m_currentTimeGetter;
uint32_t const m_numVertices;
@@ -281,31 +272,28 @@ std::unique_ptr<SingleVehicleWorldGraph> BuildWorldGraph(std::unique_ptr<ZeroGeo
std::shared_ptr<EdgeEstimator> estimator,
std::vector<Joint> const & joints);
AStarAlgorithm<Segment, SegmentEdge, RouteWeight>::Result CalculateRoute(
IndexGraphStarter & starter, std::vector<Segment> & roadPoints, double & timeSec);
AStarAlgorithm<Segment, SegmentEdge, RouteWeight>::Result CalculateRoute(IndexGraphStarter & starter,
std::vector<Segment> & roadPoints,
double & timeSec);
void TestRouteGeometry(
IndexGraphStarter & starter,
AStarAlgorithm<Segment, SegmentEdge, RouteWeight>::Result expectedRouteResult,
std::vector<m2::PointD> const & expectedRouteGeom);
void TestRouteGeometry(IndexGraphStarter & starter,
AStarAlgorithm<Segment, SegmentEdge, RouteWeight>::Result expectedRouteResult,
std::vector<m2::PointD> const & expectedRouteGeom);
/// \brief Applies |restrictions| to graph in |restrictionTest| and
/// tests the resulting route.
/// \note restrictionTest should have a valid |restrictionTest.m_graph|.
void TestRestrictions(std::vector<m2::PointD> const & expectedRouteGeom,
AStarAlgorithm<Segment, SegmentEdge, RouteWeight>::Result expectedRouteResult,
FakeEnding const & start, FakeEnding const & finish,
RestrictionVec && restrictions, RestrictionTest & restrictionTest);
FakeEnding const & start, FakeEnding const & finish, RestrictionVec && restrictions,
RestrictionTest & restrictionTest);
void TestRestrictions(std::vector<m2::PointD> const & expectedRouteGeom,
AStarAlgorithm<Segment, SegmentEdge, RouteWeight>::Result expectedRouteResult,
FakeEnding const & start, FakeEnding const & finish,
RestrictionVec && restrictions,
std::vector<RestrictionUTurn> && restrictionsNoUTurn,
RestrictionTest & restrictionTest);
FakeEnding const & start, FakeEnding const & finish, RestrictionVec && restrictions,
std::vector<RestrictionUTurn> && restrictionsNoUTurn, RestrictionTest & restrictionTest);
void TestRestrictions(double timeExpected,
FakeEnding const & start, FakeEnding const & finish,
void TestRestrictions(double timeExpected, FakeEnding const & start, FakeEnding const & finish,
RestrictionVec && restrictions, RestrictionTest & restrictionTest);
// Tries to find a unique path from |from| to |to| in |graph|.
@@ -314,23 +302,18 @@ void TestRestrictions(double timeExpected,
// If |expectedPathFound| is false, |expectedWeight| and |expectedEdges| may
// take arbitrary values.
void TestTopologyGraph(TestIndexGraphTopology const & graph, TestIndexGraphTopology::Vertex from,
TestIndexGraphTopology::Vertex to, bool expectedPathFound,
double expectedWeight,
TestIndexGraphTopology::Vertex to, bool expectedPathFound, double expectedWeight,
std::vector<TestIndexGraphTopology::Edge> const & expectedEdges);
// Creates FakeEnding projected to |Segment(kTestNumMwmId, featureId, segmentIdx, true /* forward
// */)|.
FakeEnding MakeFakeEnding(uint32_t featureId, uint32_t segmentIdx, m2::PointD const & point,
WorldGraph & graph);
FakeEnding MakeFakeEnding(uint32_t featureId, uint32_t segmentIdx, m2::PointD const & point, WorldGraph & graph);
std::unique_ptr<IndexGraphStarter> MakeStarter(FakeEnding const & start, FakeEnding const & finish,
WorldGraph & graph);
std::unique_ptr<IndexGraphStarter> MakeStarter(FakeEnding const & start, FakeEnding const & finish, WorldGraph & graph);
using Month = osmoh::MonthDay::Month;
using Weekday = osmoh::Weekday;
time_t GetUnixtimeByDate(uint16_t year, Month month, uint8_t monthDay, uint8_t hours,
uint8_t minutes);
time_t GetUnixtimeByDate(uint16_t year, Month month, Weekday weekday, uint8_t hours,
uint8_t minutes);
time_t GetUnixtimeByDate(uint16_t year, Month month, uint8_t monthDay, uint8_t hours, uint8_t minutes);
time_t GetUnixtimeByDate(uint16_t year, Month month, Weekday weekday, uint8_t hours, uint8_t minutes);
} // namespace routing_test