miniblog.

The Bitter Lesson: how implementing generic search and scaling compute outperforms custom logic in many situations:

I refactored some Rust string splitting logic: old: &[&str] -> Vec<String> new: &[&str] -> Vec<&str> It's a little faster, but it's an interesting type signature. You can figure out more of how the new one works! It must be slicing into the input string.

Tried fuzz-testing difftastic this morning (using cargo fuzz), and didn't find any crashes. I guess that's a good thing? I was slightly disappointed. Judging by the output, I think the tree-sitter parsers were exercised much more heavily than the tree diffing logic.