miniblog.

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.

C++ no longer considers trivial infinite loops to be undefined behaviour! https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2024/p2809r3.html Spotted in the release notes for the latest clang.

ASTs typically discard comments, and that's usually what you want. The only time (AFAICS) that preserving comments is useful is for writing a code formatter. Could you write a formatter in terms of a list of lexemes? A CST is a non-trivial bit of code for one use case.