Enhance memory leak detection #245
Conversation
![github-advanced-security[bot]](https://avatars.githubusercontent.com/in/57789?s=60&v=4){kind=small}
|
|
||
| Measurement<double> FirstOrderDynamics::streetMeanSpeed() const { | ||
| if (this->m_agents.size() == 0) { | ||
| if (this->agents().empty()) { |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 14.4 rule Note
| Measurement<double> FirstOrderDynamics::streetMeanSpeed(double threshold, | ||
| bool above) const { | ||
| if (this->m_agents.size() == 0) { | ||
| if (this->agents().empty()) { |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 14.4 rule Note
| if (!(nextStreet->isFull())) { | ||
| if (this->m_agents[agentId]->streetId().has_value()) { | ||
| const auto streetId = this->m_agents[agentId]->streetId().value(); | ||
| if (this->agents().at(agentId)->streetId().has_value()) { |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 14.4 rule Note
| std::uniform_int_distribution<Id> nodeDist{ | ||
| 0, static_cast<Id>(this->m_graph.nNodes() - 1)}; | ||
| for (const auto& [agentId, agent] : this->m_agents) { | ||
| for (const auto& [agentId, agent] : this->agents()) { |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note
| graph2.addNode<Intersection>(2, std::make_pair(1, 1)); | ||
| graph2.addNode<Intersection>(3, std::make_pair(1, -1)); | ||
| graph2.addNode<Intersection>(4, std::make_pair(-1, -1)); | ||
| graph2.addEdge<Street>(0, std::make_pair(0, 1), 10., 10.); |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note test
| graph2.addEdge<Street>(0, std::make_pair(0, 1), 10., 10.); | ||
| graph2.addEdge<Street>(1, std::make_pair(0, 2), 10., 10.); | ||
| graph2.addEdge<Street>(2, std::make_pair(0, 3), 10., 10.); | ||
| graph2.addEdge<Street>(3, std::make_pair(0, 4), 10., 10.); |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note test
| graph2.addEdge<Street>(1, std::make_pair(0, 2), 10., 10.); | ||
| graph2.addEdge<Street>(2, std::make_pair(0, 3), 10., 10.); | ||
| graph2.addEdge<Street>(3, std::make_pair(0, 4), 10., 10.); | ||
| graph2.addEdge<Street>(4, std::make_pair(1, 0), 10., 10.); |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note test
| graph2.addEdge<Street>(2, std::make_pair(0, 3), 10., 10.); | ||
| graph2.addEdge<Street>(3, std::make_pair(0, 4), 10., 10.); | ||
| graph2.addEdge<Street>(4, std::make_pair(1, 0), 10., 10.); | ||
| graph2.addEdge<Street>(5, std::make_pair(2, 0), 10., 10.); |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note test
| graph2.addEdge<Street>(3, std::make_pair(0, 4), 10., 10.); | ||
| graph2.addEdge<Street>(4, std::make_pair(1, 0), 10., 10.); | ||
| graph2.addEdge<Street>(5, std::make_pair(2, 0), 10., 10.); | ||
| graph2.addEdge<Street>(6, std::make_pair(3, 0), 10., 10.); |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note test
| graph2.addEdge<Street>(4, std::make_pair(1, 0), 10., 10.); | ||
| graph2.addEdge<Street>(5, std::make_pair(2, 0), 10., 10.); | ||
| graph2.addEdge<Street>(6, std::make_pair(3, 0), 10., 10.); | ||
| graph2.addEdge<Street>(7, std::make_pair(4, 0), 10., 10.); |
Check notice
Code scanning / Cppcheck (reported by Codacy)
MISRA 12.3 rule Note test
No description provided.