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

Jan 18, 2026 at 00:30
3
I've been working on a search tool for a website with 9K items and a dumb implementation works just fine. I'd normally gravitate to a library or tool like elasticsearch (ES). Adding custom filters etc is trivial on handrolled code. I wonder what scale requires actual search infra like ES.
Mar 12, 2025 at 07:26
64
I'm working on arity errors in Garden, my toy programming language. Rather than just saying "expected 3, got 4 arguments", I'm trying to report where the extra argument is, or what extra argument was expected.
PhotoPhoto
Feb 9, 2025 at 00:45
I made some changes to a node express project that I haven't touched in almost five years. I was pleasantly surprised that I only needed to update one dependency to get it working again! (It was sqlite3, which is a native dependency using node-gyp.)