data structures #

implementation notes on the structures themselves: their contracts, tradeoffs, layout, and behavior on real hardware.

• B+ trees — high-fanout ordered indexes, linked leaves, rebalancing, and bulk loading
• bloom filters — probabilistic membership, sizing, hashing, deletion, and locality
• cache lifetimes — bounding key populations and aligning derived state with owner lifetimes
• ring buffers — bounded queues and histories, wraparound, ownership, and concurrency
• union–find — disjoint sets, weighted union, path compression, and dynamic limits