crossync 0.1.2

A fast concurrent programming suite for Rust.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

use crossync::atomic::AtomicHashMap;
use std::sync::{Arc, Barrier};
use std::thread;
use std::time::Instant;

fn benchmark_concurrent_rw(
    n_threads: usize,
    n_operations: usize,
    map: AtomicHashMap<usize, usize>,
) {
    let mut handles = Vec::new();
    let barrier = Arc::new(Barrier::new(n_threads));

    // Populate the map with some initial data
    for i in 0..1000 {
        map.insert(i, i);
    }

    let start = Instant::now();

    for _i in 0..n_threads {
        let map_clone = map.clone();
        let barrier_clone = Arc::clone(&barrier);
        let h = thread::spawn(move || {
            // Wait for all threads to be ready before starting the channels
            barrier_clone.wait();

            for op_id in 0..n_operations {
                if op_id % 2 == 0 {
                    // Even operations: write
                    let key = op_id % 1000;
                    map_clone.insert(key, op_id);
                } else {
                    // Odd operations: read
                    let key = op_id % 1000;
                    let _ = map_clone.get(&key);
                }
            }
        });
        handles.push(h);
    }

    for h in handles {
        h.join().unwrap();
    }

    let elapsed = start.elapsed();
    println!(
        "{} threads, {} read/write operations each → {:?}",
        n_threads, n_operations, elapsed
    );
}

pub fn run() {
    println!("\nBenching HashMap\n");
    
    let map = AtomicHashMap::new();
    
    for &threads in &[1, 2, 4, 8, 16] {
        benchmark_concurrent_rw(threads, 100_000, map.clone());
    }
}