6 releases

0.0.6 Feb 13, 2024
0.0.5 Jan 27, 2024
0.0.4 Nov 28, 2023
0.0.2 Oct 1, 2023
0.0.1 Sep 28, 2023

#136 in Memory management

Download history 35/week @ 2024-02-13 9/week @ 2024-02-20 13/week @ 2024-02-27 1/week @ 2024-03-05 8/week @ 2024-03-12 7/week @ 2024-03-26 30/week @ 2024-04-02

53 downloads per month

MIT license

970 lines


Provides shared, mutable state by utilizing hazard pointers.

The core concept of the crate is to trade memory for speed. The containers avoid locking the value, and instead accumulate garbage: Excess data that will need to be freed at a later point. The garbage collection is controlled using hazard pointers. Each reader of the value can hold one reference to the value. If the value of the container is swapped, then the reference they hold is kept valid through their hazard pointer. They can then (at some later point) drop the reference, and the value will be cleaned up at some point. The core API in the crate is the HzrdCell.


HzrdCell aims to provide something akin to a multithreaded version of std's Cell-type. A basic example:

use hzrd::HzrdCell;

let cell = HzrdCell::new(false);

std::thread::scope(|s| {
    s.spawn(|| {
        // Loop until the value is true
        while !cell.get() {

        // And then set it back to false!

    s.spawn(|| {
        // Set the value to true

        // And then read the value!
        // This might print either `true` or `false`
        println!("{}", cell.get()); 

HzrdCell provides memory safe, multithreaded, shared mutability. But this isn't all that useful. We often want some sort of synchronization to avoid races (not data races, just general races).

No runtime deps