Ibraheem Ahmed

I recently released papaya , a fast and feature-complete concurrent hash table for Rust. In this post I want to dive into the design and research that went into creating it, as well as why you might consider using it over existing solutions. If you're loo

I've found that one of the best ways to understand a new concept is to start from the very beginning. Start from a place where it doesn't exist yet and recreate it yourself, learning in the process not just how it works, but why it was designed the way it

The ideas laid out in this crate have since been implemented in the boxcar crate. A while back while researching for seize , I came across a cool little idea for a concurrent vector in this paper . I'm not sure where the idea originated from, but it's als

There are a handful of concurrent algorithms, most famously solutions to the ABA problem , that require 128-bit atomics. Unfortunately, the story around 128-bit atomics hasn't been great, but recently both compilers and CPU manufacturers have been making

Async Rust is taking over, quickly becoming the default for libraries that do any sort of I/O. While async is incredibly useful for a large number of applications and enables patterns that simply cannot be expressed in blocking code, it does come with a c

I wrote a post a while back about how I think Rust's async fn syntax hiding the returned Future type was a mistake. I essentially proposed changing this: async fn f...

Hidden inside std::collections::hash_map is a struct called RandomState . It's job is to initialize a DefaultHasher with a random seed for use in a HashMap . It turns out that if you create a random DefaultHasher and extract the final hash without actuall

After thinking about the async fn in traits problem for a while, I've come to the conclusion that the syntax Rust chose for async fn is the wrong one. Specifically, the fact that the returned future type is hidden is quite limiting: span sty...