miniblog.

Difftastic spends a remarkable 49% of its runtime just reading and writing to a FxHashMap of ~1 million items. This hashmap stores the predecessor vertex when calculating the shortest route. I'm running out of ideas. I can't use perfect hashmaps, are there other speed tricks?

I really like instruction counts for measuring performance. It's not perfect, but it's a very stable metric, even if I'm listening to music whilst developing and benchmarking.

The docs for autochrome are incredible. It's just a readme.clj file, so the worked example is just running the library inline! No screenshots, just perfect HTML. The stdlib functions in the examples are even linkified.