Whilst normal hash tables have amortised O(1) lookup, perfect hash tables guarantee O(1)! There's a nifty Rusty lib:
miniblog.
Related Posts
I'm trying to teach LLMs to yak shave responsibly.
It's normal to be programming and notice other clean ups that really ought to be done. I don't want it done in that PR though.
Currently experimenting with asking the AI to just create hand-off tasks in the issue tracker.
Bootstrapping a language can be immensely satisfying.
I've added the ability to define stub types in the Garden stdlib and suddenly I don't need to special-case Int or String! They're just normal type declarations.
I've been really enjoying paru as a pacman substitute on Arch Linux: https://github.com/Morganamilo/paru
It allows you to update both normal and AUR packages in one go, which is super convenient. It also shows you PKGBUILD files, so there's still a human audit step for AUR.