Part 1 of this saga shipped a compare-and-swap loop that gave up after 100 tries. It can fail at most 64 times. What really loses an Add is Union, with no retry involved and nothing the race detector can see. With …
A 99.2% hit rate hid nine cache stampedes. What singleflight fixed, what it did not, and the two bugs that only exist under concurrency.
Rank and select turn two expensive log queries into constant-time lookups. What that costs, what it buys, and why the same code can honestly report both 2ns and 13ns.
A comprehensive exploration of a cache-line optimized Bloom filter implementation in Go with SIMD acceleration and assembly integration.
GO