False.Genesis

7db3ad2a Adds the greedy search i mentioned. I can't measure any direct performance benefits, but it may be useful if you implement some kind of follower AI that tries to...

> I found that when I limit steps in Jump, performance will get better. Got some code to demonstrate? Because right now i don't quite understand what you did and...

Actually, before i go back to actually re-implement this, do you have any numbers? Because i never had any maps that really warranted using skip, so this wasn't well tested...

Yes, -1 can happen as the search underflows when going out-of-bounds. This is expected and you're supposed to handle this in your grid check. (You could implement wrap-around easily this...

Eh, so i DID introduce a bug in the meantime, yes? Please confirm, then i'll go look when i have time. The newer rev adds a bunch of flags, JPS_Flag_NoStartCheck...

Just fixed a bug. Pull + try again now. EDIT: I've noticed that passing JPS_AStarOnly results in really bad paths, so there must be another bug since i haven't tested...

Hmm but both have the "problem" that they depend so much on STL. If i'm going to redo JPS then only shipping with its own (hash)map impl. minihttp uses std::string,...

Isn't that C++11? I plan to stick to C++03 because oldskool reasons. But re: JPS, I've started refactoring the thing to work without STL and much nicer memory handling. It's...

Oopsie. Now this was a nice round of optimization. All on a Core i7, for reference. (v1 = old version of JPS.h, v2 = jps.hh, this repo) Started with MSVC...

Yes, but the index i may change in _percolateDown() when traversing children. Depending on the new value a node goes either up or down the heap, and since that isn't...