In June Journal, I left off with a thought to make toykv thread-safe and to| dx13.co.uk
Or how we'll implement sharding and transactions for our search engine.| jdrouet
Collection types.| doc.rust-lang.org
If you've been itching to write Convex programs in Rust, your time has come. We take the new Convex Rust crate for a spin by writing a distributed sys...| stack.convex.dev
An ordered map based on a B-Tree.| doc.rust-lang.org
Dividing and Conquering unordered collections is messy business.| nested.substack.com
5000x faster CRDTs: An Adventure in Optimization| josephg.com
For my next entry in my series comparing Rust to C++, I will be discussing a specific data structure API: the Rust map API. Maps are often one of the more awkward parts of a collections library, and the Rust map API is top-notch, especially its entry API – I literally squealed when I first learned about entries. And as we shall discuss, this isn’t just because Rust made better choices than other standard libraries when designing the maps API.| The Coded Message