Wilfred Hughes
Wilfred Hughes
An explicit visited set is a perf loss too, even with FxHash and the same size hint.
Another option would be an 'iterative Dijkstra'. Search N nodes, and if we've not reached the end, take the closest node (according to an A* heuristic) and restart the search...
HashMap::get() is really hot too. I wonder if there's a way of tracking vertex frontier such that we can tell that the vertex has never been visited before (e.g. highest...
a18dce036ad6dc9fa44b04e0129949971a2765a5 hunks.rs LHS line 397 is a good example of this.
box2d 07ad4954c8a386839e0d69dc17b6bb6d11ec5a52 src/collision/b2_polygon_shape.cpp is also a good example.
#236 has several examples too.
IJulia 5488fc6fe320daca2a02372f3f4689e2ed8b9216 is a good example too.
Yeah, I agree. I've actually made this mistake: accidentally reformatting some code and not immediately noticing because I used difftastic. Long term I'd like to support this, but I'm still...
Interesting, I didn't know about this git setting. Here's the docs: https://git-scm.com/docs/git-config#Documentation/git-config.txt-interactivediffFilter > without manually specifying --ext-diff every time FWIW you can do this today, by setting diff.external: https://difftastic.wilfred.me.uk/git.html >...
This is really really exciting! I agree this is the right direction for the display, bringing difftastic much closer to how changes are displayed in e.g. GitHub. Display logic has...