Learn Zig Series (#115) - Slab Allocators What will I learn? What a slab allocator actually is -- not a new trick, but the machine episode 114 was pointing at: take the single-size memory pool we built

Learn Zig Series (#114) - Memory Pools What will I learn? Why a memory pool (a.k.a. object pool, fixed-size block allocator, or free-list allocator) is the idea episode 113 was quietly walking toward --

Learn Zig Series (#113) - Ring Buffers: Lock-Free What will I learn? Why a ring buffer (a.k.a. circular buffer) is the data structure that answers the question episode 112 ended on -- a buffer of exactly

Learn Zig Series (#112) - Cuckoo Filters What will I learn? Why the cuckoo filter answers the exact question the bloom filter left dangling at the end of episode 111 -- membership testing with clean deletion

Learn Zig Series (#111) - Bloom Filters What will I learn? Why a bloom filter throws out the one thing every structure so far has quietly insisted on -- storing the keys themselves -- and keeps nothing

Learn Zig Series (#110) - Tries: Prefix Trees What will I learn? Why a trie throws out the one assumption every tree so far has quietly leaned on -- that the only thing you can do with a key is compare

Learn Zig Series (#109) - Red-Black Trees What will I learn? Why a red-black tree is the exact same balancing idea as last episode's B-tree, only squeezed back down onto a binary node -- one key, two children