miniblog.

← Back to all posts
Jul 12, 2021 at 07:02
Spent some time today trying to replace difftastic's implementation of Dijkstra's algorithm with A* search. I got a working implementation that passes tests: https://github.com/Wilfred/difftastic/commit/9a271169f68cdb678efe2035f5a4e45daeb6533d but sadly it's no faster. My slowest files still take 1.5 seconds with similar memory.
Rewrite graph search as A* · Wilfred/difftastic@9a27116
Rewrite graph search as A* · Wilfred/difftastic@9a27116
a structural diff that understands syntax 🟥🟩. Contribute to Wilfred/difftastic development by creating an account on GitHub.

Related Posts

Feb 12, 2018 at 23:42
I fear software tends towards the slowest tolerable speed. We only optimise when it's hurting us. Perhaps we need less tolerant users? :)
Jul 16, 2015 at 20:25
"Stories take an average of 8 seconds to load, by far the slowest single content type on Facebook." http://t.co/XdvR87MPo2 (web is bonkers!)