A recent release of Free Pascal has a rather interesting behaviour for its list implementation. Lists grow additivitely (rather than multiplicatively) above 128MiB, trading off computational complexity for trying to avoid out-of-memory issues!
https://wiki.lazarus.freepascal.org/User_Changes_3.0.4#TList_auto-growth
Related Posts
I'm working on arity errors in Garden, my toy programming language.
Rather than just saying "expected 3, got 4 arguments", I'm trying to report where the extra argument is, or what extra argument was expected.
Today I learnt that the original name for DOS was QDOS, for "Quick and Dirty Operating System"! https://en.wikipedia.org/wiki/DOS#QDOS
(Seems rather unfortunate that they dropped the Q.)
It feels like a mature software project is one where bugs require multiple commits to fix.
You've hammered out the basic issues, so the remaining issues are often weird interactions between components.