miniblog.

I think software maintainers can perceive their projects as way more buggy than they actually are. You spend more time looking at the bug tracker, which is (hopefully!) not representative of typical usage.

I've compiled the parser for my Garden programming language to wasm, so I can offer a web playground: https://www.garden-lang.org/ It's over 600KiB of wasm just for a function that returns a parse error message! I'm not sure if that's a lot (cf JS) or a little (cf typical binaries).

Today I learnt that A* doesn't work for an arbitrary non-planar graph, you need additional structure: https://stackoverflow.com/q/26568552/509706 This matches my experience with difftastic so far. The graph is non-planar and my best heuristic only matches Dijkstra perf in typical cases.