miniblog.

← Back to all posts
May 31, 2018 at 21:58
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

Mar 15, 2026 at 20:42
Really elegant developer tool: Go's inline IDE feature is used with deprecation markers, so call sites are autofixed from OldApi() to NewApi() based on the implementation of OldApi.
//go:fix inline and the source-level inliner - The Go Programming Language
How Go 1.26's source-level inliner works, and how it can help you with self-service API migrations.
Mar 5, 2026 at 10:27
12
Is there a good term for "after using this feature we realised that the best design is different from the current design"? In casual conversation I generally hear "bug" but there was nothing wrong with the original implementation.
Jan 18, 2026 at 00:30
3
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.