The home for great developer writing.

We surface the best developer writing from thousands of independent blogs, updated daily.

Run, Right, and Fast for the Adaptive Radix Tree

1 · Kent Beck · May 2, 2026, 2:12 a.m.

Adaptive Radix Tree data-structures Performance Optimization kent beck

Summary

This blog post features a recording of a live video by Kent Beck discussing the Adaptive Radix Tree, focusing on efficient data structure management and optimization techniques.

Read full post on tidyfirst.substack.com →

MORE POSTS LIKE THIS

Adaptive Radix Tree

Kent Beck · May 4, 2026

Adaptive Radix Tree data-structures

A deep dive into SmallVector::push_back

MaskRay · Jun 27, 2026

LLVM performance

Flattening 8 × 400MB Vec<T> takes ~3s. Why is this and how do I parallelise it?

Users Rust Lang · Apr 28, 2026

Rust Performance Optimization

Bloom Filter in Go

Kien Nguyen-Tuan · Feb 21, 2026

bloom-filter Go Programming

Scaling HNSWs

Salvatore Sanfilippo · Nov 11, 2025

HNSW Redis

std::array in C++ is faster than array in C. Sometimes

PVS-Studio blog · Mar 6, 2025

Cpp Knowledge

Discover more posts →

AUTHOR