asgardius/virtualx-engine
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Reduce allocations when solving path in AStarGrid2D

Browse source
This commit is contained in:
detomon 2024-05-08 13:12:04 +02:00
parent db66bd35af
commit eaea7c1065
1 changed files with 2 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
core/math/a_star_grid_2d.cpp
View file

@ -503,6 +503,7 @@ bool AStarGrid2D::_solve(Point *p_begin_point, Point *p_end_point, bool p_allow_
LocalVector<Point *> open_list;
SortArray<Point *, SortPoints> sorter;
LocalVector<Point *> nbors;
p_begin_point->g_score = 0;
p_begin_point->f_score = _estimate_cost(p_begin_point->id, p_end_point->id);
@ -528,7 +529,7 @@ bool AStarGrid2D::_solve(Point *p_begin_point, Point *p_end_point, bool p_allow_
open_list.remove_at(open_list.size() - 1);
p->closed_pass = pass; // Mark the point as closed.
LocalVector<Point *> nbors;
nbors.clear();
_get_nbors(p, nbors);
for (Point *e : nbors) {