Every minute, every open order against every rider on duty, solved as one vehicle routing problem with VROOM. How the round works, why the solver's answer is only a proposal, and why the legs are diffed instead of rebuilt.
One search box, six indexes, one round trip. How I built a multi-vertical search in Go on Elasticsearch, why it rebuilds its indexes instead of syncing them, and how I would sync them at a million documents per vertical.
at and cron as a service, in Go: six services, MySQL as the queue, Cassandra for history. The decisions behind it, their trade-offs, and what load-testing it on an AWS-shaped bench found, including a bug of mine.
An EKS and RDS lookalike on one PC, a cron platform with 30,000 jobs due at 09:00:00, and ten tests. Nothing was lost; the 300 jobs/s ceiling turned out to be an N+1 of mine.
Why the jobs table is the queue, why MySQL and not Postgres, why Cassandra only for history, and how leases, fencing tokens and idempotency keys keep at-least-once honest. With the alternatives I rejected and the SQL behind each decision.
I thought I understood net/http's connection pool. Then I found out the pool key ignores the path entirely, and that my own Transport config had silently turned off HTTP/2. Three discoveries, measured with httptrace.
When a hot cache key expires, N concurrent requests all miss and slam the same expensive query at once. golang.org/x/sync/singleflight collapses them into a single execution. Here's the problem it solves and exactly how it works inside.
From done channels to context trees. How Go's context package solves cancellation propagation, deadline management, and request-scoped data across concurrent call graphs.
A deep dive into Go's sync package and atomic operations. Mutex, RWMutex, WaitGroup, Cond, Once, sync.Map, and atomic types explained with real examples and common pitfalls.
Understand how Go's RoundTripper works, the low-level mechanism behind every HTTP request. Learn to customize it for logging, retry, headers, and more.