Skip to content

Conversation

@Grufoony
Copy link
Collaborator

No description provided.

@codecov
Copy link

codecov bot commented Feb 20, 2025

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 90.57%. Comparing base (017586d) to head (dd8c0fe).
Report is 20 commits behind head on main.

Additional details and impacted files
@@            Coverage Diff             @@
##             main     #273      +/-   ##
==========================================
- Coverage   90.66%   90.57%   -0.09%     
==========================================
  Files          36       36              
  Lines        5086     5084       -2     
  Branches      460      459       -1     
==========================================
- Hits         4611     4605       -6     
- Misses        475      479       +4     
Flag Coverage Δ
unittests 90.57% <100.00%> (-0.09%) ⬇️

Flags with carried forward coverage won't be shown. Click here to find out more.

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:
  • ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.
  • 📦 JS Bundle Analysis: Save yourself from yourself by tracking and limiting bundle sizes in JS merges.

@Grufoony Grufoony requested a review from sbaldu February 20, 2025 16:40

protected:
std::vector<std::pair<double, double>> m_travelDTs;
tbb::concurrent_vector<std::pair<double, double>> m_travelDTs;

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 12.3 rule Note

MISRA 12.3 rule
continue;
return;
}
assert(srcNode->id() == nextStreet->nodePair().first);

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 15.5 rule Note

MISRA 15.5 rule
const auto& pNode = nodes.at(i);
for (auto const& sourceId :
this->m_graph.adjacencyMatrix().getCol(pNode->id())) {
auto const streetId = sourceId * N + pNode->id();

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 14.4 rule Note

MISRA 14.4 rule
auto const streetId = sourceId * N + pNode->id();
auto const& pStreet = this->m_graph.edge(streetId);

if (bUpdateData) {

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 14.4 rule Note

MISRA 14.4 rule
auto const streetId = sourceId * N + pNode->id();
auto const& pStreet = this->m_graph.edge(streetId);

if (bUpdateData) {

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 13.1 rule Note

MISRA 13.1 rule
// Evolve the node based on its transport capacity.
for (auto j = 0; j < pNode->transportCapacity(); ++j) {
this->m_evolveNode(pNode);
}

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 12.3 rule Note

MISRA 12.3 rule
for (auto j = 0; j < pNode->transportCapacity(); ++j) {
this->m_evolveNode(pNode);
}

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 13.1 rule Note

MISRA 13.1 rule
}
std::discrete_distribution<size_t> laneDist{weights.begin(),
weights.end()};
street->enqueue(agentId, laneDist(this->m_generator));

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 12.1 rule Note

MISRA 12.1 rule
street->enqueue(agentId, nLanes - 1); // Always the last lane
}
} else { // U turn
// Normalize the weights

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 15.5 rule Note

MISRA 15.5 rule
auto& roundabout = dynamic_cast<Roundabout&>(*srcNode);
roundabout.enqueue(agentId);
}
pAgent->setNextStreetId(nextStreet->id());

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 14.4 rule Note

MISRA 14.4 rule
pAgent->setSpeed(0.);
}
pAgent->incrementTime();
}

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 14.4 rule Note

MISRA 14.4 rule
requires(is_numeric_v<delay_t>)
void RoadDynamics<delay_t>::evolve(bool reinsert_agents) {
// move the first agent of each street queue, if possible, putting it in the next node
bool const bUpdateData =

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 14.4 rule Note

MISRA 14.4 rule
bool const bUpdateData =
m_dataUpdatePeriod.has_value() && this->m_time % m_dataUpdatePeriod.value() == 0;
auto const N{this->m_graph.nNodes()};
std::for_each(this->m_graph.nodes().cbegin(),

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 14.4 rule Note

MISRA 14.4 rule
}

for (auto j = 0; j < pStreet->transportCapacity(); ++j) {
this->m_evolveStreet(pStreet, reinsert_agents);

Check notice

Code scanning / Cppcheck (reported by Codacy)

MISRA 12.1 rule Note

MISRA 12.1 rule
@Grufoony Grufoony closed this Mar 24, 2025
@Grufoony Grufoony deleted the parallelchesembraandare branch October 3, 2025 10:14
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants