From the archive
Tuesday, 17 November
Folded from 39 sources that day.
Sorted by quality and by how many sources covered it, the same for everyone.
-
Distributed primary keys
Compares five primary key designs for tables written by several regions under logical replication. Per-region sequences can reuse ids after failover, while uuidv7() and composite keys avoid coordination.
-
Deterministic Simulation Testing
Unmesh Joshi explains how deterministic simulation testing replaces clocks, networks and storage with simulated components on a single-threaded loop. Every failure in a distributed system becomes reproducible, illustrated with a quorum key-value store.
-
Making Games in Go: Entity Component System (ECS)
Part of a series on Go game development, this post explains Entity Component System as a data-oriented alternative to objects with Update and Draw methods. It is illustrated with a small playable 2D game built on Ebiten.
-
How to Bypass Rust's Orphan Rule
Explains why Rust's orphan rule exists, why the usual workarounds (building impls into the library or wrapping types in newtypes) fall short, and how a generic slot on the trait can help.