8 releases (4 breaking)

0.5.0 Dec 13, 2021
0.4.1 Mar 11, 2020
0.3.0 Mar 5, 2020
0.2.0 Feb 28, 2020
0.1.2 Jun 26, 2019

#478 in Concurrency

Download history 56/week @ 2024-02-25 71/week @ 2024-03-03 82/week @ 2024-03-10 80/week @ 2024-03-17 75/week @ 2024-03-24 92/week @ 2024-03-31 76/week @ 2024-04-07 79/week @ 2024-04-14 61/week @ 2024-04-21 47/week @ 2024-04-28 59/week @ 2024-05-05 75/week @ 2024-05-12 87/week @ 2024-05-19 71/week @ 2024-05-26 84/week @ 2024-06-02 92/week @ 2024-06-09

343 downloads per month

AGPL-3.0-or-later

115KB
2K SLoC

cht

crates.io docs.rs Travis CI

cht provides a lockfree hash table that supports fully concurrent lookups, insertions, modifications, and deletions. The table may also be concurrently resized to allow more elements to be inserted. cht also provides a segmented hash table using the same lockfree algorithm for increased concurrent write performance.

Usage

In your Cargo.toml:

cht = "0.5"

Then in your code:

use cht::HashMap;

use std::{sync::Arc, thread};

let map = Arc::new(HashMap::new());

let threads: Vec<_> = (0..16)
    .map(|i| {
        let map = map.clone();

        thread::spawn(move || {
            const NUM_INSERTIONS: usize = 64;

            for j in (i * NUM_INSERTIONS)..((i + 1) * NUM_INSERTIONS) {
                map.insert_and(j, j, |prev| assert_eq!(prev, None));
            }
        })
    })
    .collect();

let _: Vec<_> = threads.into_iter().map(|t| t.join()).collect();

License

cht is licensed under the GNU Affero General Public License v3.0 or later.

Dependencies

~255KB