programming

I present a couple of patterns that help modelling persistent datastructures in Go. I also apply them to three examples.

I philosophize about error handling, what it actually means and how to characterize Go’s approach to it.

I come up with a couple of useless, but entertaining ways to generate entropy without relying on any packages.

I explain the mathematical background of a joke-explanation of monads. Contains lots of math and a hasty introduction to category theory

When talking about static type systems, we often tend to focus on one side of the equation. I’m trying to make explicit how I view the question as a tradeoff and why I neither agree with “more is always better”, nor with “a little is enough”.

In light of recent discussions about its removal, I try to discuss what kinds of problems context.Value tries to solve. I then try to describe a design which would address most (but not all) of the criticism surrounding it.

Logging in Go is a notoriously lacking topic in the standard library. There are 3rd-party libraries trying to work around this. I’m trying to explain, why I find them still lacking

I take a look at the pattern of optional interfaces in Go: what they are used for, why they are bad and what we can do about it.

Using math, I made it a lot easier to find the last undiscovered parts of my Zelda - Breath Of The Wild map.

Trying to provide some advice on how to do easy, readable, scalable routing in go, without relying on any muxers/routers (or writing your own).