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

62
libs/routing/leaps_postprocessor.cpp
View File

@@ -25,10 +25,7 @@ public:
m_intervals.emplace_back(pathInterval);
}
std::vector<LeapsPostProcessor::PathInterval> && StealIntervals()
{
return std::move(m_intervals);
}
std::vector<LeapsPostProcessor::PathInterval> && StealIntervals() { return std::move(m_intervals); }
private:
base::NonIntersectingIntervals<size_t> m_nonIntersectingIntervals;
@@ -52,10 +49,9 @@ size_t const LeapsPostProcessor::kMaxStep = 5;
/// Thus if we look at the first s1, we will find out that a jump to second s1 exists
/// and we will skip all segments between first and second s1 and the result path will be:
/// s1, s11, s12, ... , s100
LeapsPostProcessor::LeapsPostProcessor(std::vector<Segment> const & path,
IndexGraphStarter & starter)
: m_starter(starter),
m_bfs(starter)
LeapsPostProcessor::LeapsPostProcessor(std::vector<Segment> const & path, IndexGraphStarter & starter)
: m_starter(starter)
, m_bfs(starter)
{
std::map<size_t, size_t> jumps;
std::map<Segment, size_t> segmentToIndex;
@@ -173,36 +169,36 @@ auto LeapsPostProcessor::CalculateIntervalsToRelax() -> std::set<PathInterval, P
return result;
}
void LeapsPostProcessor::FillIngoingPaths(
Segment const & start, std::map<Segment, LeapsPostProcessor::SegmentData> & segmentsData)
void LeapsPostProcessor::FillIngoingPaths(Segment const & start,
std::map<Segment, LeapsPostProcessor::SegmentData> & segmentsData)
{
m_bfs.Run(start, false /* isOutgoing */,
[&segmentsData, this](BFS<IndexGraphStarter>::State const & state)
{
if (segmentsData.count(state.m_vertex) != 0)
return false;
m_bfs.Run(start, false /* isOutgoing */, [&segmentsData, this](BFS<IndexGraphStarter>::State const & state)
{
if (segmentsData.count(state.m_vertex) != 0)
return false;
auto const & parent = segmentsData[state.m_parent];
ASSERT_LESS_OR_EQUAL(parent.m_steps, kMaxStep, ());
if (parent.m_steps == kMaxStep)
return false;
auto const & parent = segmentsData[state.m_parent];
ASSERT_LESS_OR_EQUAL(parent.m_steps, kMaxStep, ());
if (parent.m_steps == kMaxStep)
return false;
auto & current = segmentsData[state.m_vertex];
current.m_summaryETA =
parent.m_summaryETA + m_starter.CalculateETAWithoutPenalty(state.m_vertex);
auto & current = segmentsData[state.m_vertex];
current.m_summaryETA = parent.m_summaryETA + m_starter.CalculateETAWithoutPenalty(state.m_vertex);
current.m_steps = parent.m_steps + 1;
current.m_steps = parent.m_steps + 1;
return true;
});
return true;
});
}
LeapsPostProcessor::SegmentData::SegmentData(size_t steps, double eta)
: m_steps(steps), m_summaryETA(eta) {}
LeapsPostProcessor::SegmentData::SegmentData(size_t steps, double eta) : m_steps(steps), m_summaryETA(eta) {}
LeapsPostProcessor::PathInterval::PathInterval(double weight, size_t left, size_t right,
std::vector<Segment> && path)
: m_winWeight(weight), m_left(left), m_right(right), m_path(std::move(path)) {}
LeapsPostProcessor::PathInterval::PathInterval(double weight, size_t left, size_t right, std::vector<Segment> && path)
: m_winWeight(weight)
, m_left(left)
, m_right(right)
, m_path(std::move(path))
{}
bool LeapsPostProcessor::PathInterval::GreaterByWeight::operator()(PathInterval const & lhs,
PathInterval const & rhs) const
@@ -212,8 +208,7 @@ bool LeapsPostProcessor::PathInterval::GreaterByWeight::operator()(PathInterval
bool LeapsPostProcessor::PathInterval::operator<(PathInterval const & rhs) const
{
CHECK(m_left > rhs.m_right || m_right < rhs.m_left ||
(m_left == rhs.m_left && m_right == rhs.m_right),
CHECK(m_left > rhs.m_right || m_right < rhs.m_left || (m_left == rhs.m_left && m_right == rhs.m_right),
("Intervals shouldn't intersect.", *this, rhs));
return m_right < rhs.m_left;
@@ -222,8 +217,7 @@ bool LeapsPostProcessor::PathInterval::operator<(PathInterval const & rhs) const
std::string DebugPrint(LeapsPostProcessor::PathInterval const & interval)
{
std::stringstream ss;
ss << "[" << interval.m_left << ", " << interval.m_right << "], weight = "
<< interval.m_winWeight;
ss << "[" << interval.m_left << ", " << interval.m_right << "], weight = " << interval.m_winWeight;
return ss.str();
}