Johnny Cache: http://t.co/2B3xI1GTEE is a much better solution for Django caching anyway, as it caches all redundant reads.
Related Posts
TIL Advent of Code and Project Euler will deliberately look for puzzles where the naive solution is worse than quadratic.
This ensures that people can solve them with any programming language. You don't want fast languages to be able to use the naive solution.
I've been experimenting with different pagination UIs.
It's so common to have arrows, but I've realised they're redundant here. When you have the adjacent values as well as the final value, you don't need > and >> arrows too.
Thoughts?
I've just squeezed another 5% of performance out of difftastic by finding a few HashSet values that weren't FxHashSet.
I do wonder whether hash DoS resistance is a good default. Sure, Rust programs are often pretty fast anyway, but it feels like a different threat model to the rest of Rust.