⚡ Optimize AStar.Solve by reusing state collections - #139
Conversation
Co-authored-by: johnstrand <11484777+johnstrand@users.noreply.github.com>
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
🎯 What: Replaced per-solve dictionary, hashset, and priority queue allocations in AStar.Solve with reusable instance fields (_gScore, _previousNodes, _visited, _open).
📊 Coverage: Passed all 410 unit tests in GameUtils.Tests.
✨ Result: Reduced memory allocation per pathfinding operation from 30.32 KB to 5.01 KB (~83.5% allocation reduction) and improved execution time from 27.62 us to 19.39 us (~30% speedup).
PR created automatically by Jules for task 17565362982342470063 started by @johnstrand