N
Nitex
Guest
Hi guys, so I've implemented A* for my hex grid, but it's too slow, as in, it's causing noticeable lag. Note that each run of it isn't terribly slow, but I have to run it across ds_lists that can get up to a hundred entries long (using it as a pathfinding check).
If this were python, I'd throw some timing code on there and see what parts are the slowest. I thought delta time might be useful for this purpose, but it turns out not to be, I don't think, or maybe I'm just using it wrong. (All I do is print the delta time in a few places, all it says is stuff like "33347".)
Does anyone have a clever or generic way to time their code?
If this were python, I'd throw some timing code on there and see what parts are the slowest. I thought delta time might be useful for this purpose, but it turns out not to be, I don't think, or maybe I'm just using it wrong. (All I do is print the delta time in a few places, all it says is stuff like "33347".)
Does anyone have a clever or generic way to time their code?