admin/omath
1
0
Fork 0
mirror of https://github.com/orange-cpp/omath.git synced 2026-02-13 07:03:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

fixed style

Browse Source
This commit is contained in:
Orange
2025-05-03 20:38:58 +03:00
parent df6d75e554
commit b5e788385d
11 changed files with 34 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
source/pathfinding/a_star.cpp
View File

@@ -38,13 +38,13 @@ namespace omath::pathfinding
return path;
}
auto Astar::get_perfect_node(const std::unordered_map<Vector3<float>, PathNode>& open_list,
const Vector3<float>& endVertex)
const Vector3<float>& end_vertex)
{
return std::ranges::min_element(open_list,
[&endVertex](const auto& a, const auto& b)
[&end_vertex](const auto& a, const auto& b)
{
const float fa = a.second.g_cost + a.first.distance_to(endVertex);
const float fb = b.second.g_cost + b.first.distance_to(endVertex);
const float fa = a.second.g_cost + a.first.distance_to(end_vertex);
const float fb = b.second.g_cost + b.first.distance_to(end_vertex);
return fa < fb;
});
}
@@ -86,6 +86,7 @@ namespace omath::pathfinding
const float tentative_g_cost = current_node.g_cost + neighbor.distance_to(current);
// ReSharper disable once CppTooWideScopeInitStatement
const auto open_it = open_list.find(neighbor);
if (open_it == open_list.end() || tentative_g_cost < open_it->second.g_cost)