When it comes to test organization, Go’s standard testing library only gives you a few options. I think that’s a great thing because there are fewer details to remember and fewer things to onboard people to. However, during code reviews, I often see people contravene...
When developing applications that interact with object storage like AWS S3, it’s useful to have a local setup that mimics the real service. MinIO is an open-source S3-compatible object storage server that fits perfectly for this purpose.
"The Compromise" by Sergei Dovlatov - (read in Russian) the author was a journalist in the Soviet Union in the 60s and 70s. This book is a humorous, semi-biographic account of some of the issues faced by Soviet journalists in their attempt to report news aligned with p...
#572 — October 1, 2025 Read the Web Version Go Weekly Flight Recorder in Go 1.25 — Billed as “a powerful new tool in the Go diagnostics toolbox”, the ‘flight recorder’ continuously collects execution traces and buffers the p...
Go has support for subtests starting from version 1.7. With t.Run, you can nest tests, assign names to cases, and let the runner execute work in parallel by calling t.Parallel from subtests if needed. For small suites, a flat set of t.Run calls is usually enough. That’s whe...
Go has support for subtests starting from version 1.7. With t.Run, you can nest tests, assign names to cases, and let the runner execute work in parallel by calling t.Parallel from subtests if needed. For small suites, a flat set of t.Run calls is usually enough. That’s whe...
Hi, thanks for visiting my personal website! My name is Alex Pliutau. I am currently employed as a Staff Software Engineer at Entyre Care. I write this blog in my personal time to share my experience and knowledge about software development, Golang, and few other topics. I also w...
Writing concurrent programs is easy, but understanding why they don’t work is much harder. In our continuing tutorial, we’ll learn about when and why goroutines starve, sleep, or yield.
This post is an introduction to consistent hashing, an algorithm for designing a hash table such that only a small portion of keys has to be recomputed when the table's size changes. Motivating use case Suppose we're designing a caching web proxy, but the expected storage demand...