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
miniblog.
Related Posts
1
Today I learnt about "bypass charging", a phone feature where it can run directly off the mains without using the battery at all. No battery charging, less heat, less battery wear. Nifty.
1
I'm considering using WebP more: for example, my websites would load faster and browsers have supported it since 2020: https://caniuse.com/webp
That said, GitHub just added support in August 2025, so I suspect I'd still find use cases that don't work yet:
3
Test code is total: we require it to always terminate or it's a failure! It also typically has 100% line and branch coverage.
I feel way less nervous about refactoring tests, you can always just run them.