12 releases

new 0.2.11 Mar 20, 2025
0.2.8 Dec 29, 2024
0.2.7 Nov 7, 2024
0.2.5 May 1, 2024
0.1.0 Mar 13, 2022

#157 in Concurrency

Download history 6766/week @ 2024-12-02 8965/week @ 2024-12-09 7786/week @ 2024-12-16 4609/week @ 2024-12-23 5669/week @ 2024-12-30 9887/week @ 2025-01-06 7660/week @ 2025-01-13 9964/week @ 2025-01-20 8555/week @ 2025-01-27 29889/week @ 2025-02-03 41700/week @ 2025-02-10 32420/week @ 2025-02-17 32354/week @ 2025-02-24 39572/week @ 2025-03-03 45531/week @ 2025-03-10 36790/week @ 2025-03-17

158,463 downloads per month
Used in 99 crates (20 directly)

MIT license

45KB
766 lines

boxcar

crates.io github docs.rs

A concurrent, append-only vector.

The vector provided by this crate supports lock-free get and push operations. The vector grows internally but never reallocates, so element addresses are stable for the lifetime of the vector. Additionally, both get and push run in constant-time.

Examples

Appending an element to a vector and retrieving it:

let vec = boxcar::Vec::new();
let i = vec.push(42);
assert_eq!(vec[i], 42);

The vector can be modified by multiple threads concurrently:

let vec = boxcar::Vec::new();

// Spawn a few threads that append to the vector.
std::thread::scope(|s| for i in 0..6 {
    let vec = &vec;

    s.spawn(move || {
        // Push through the shared reference.
        vec.push(i);
    });
});

for i in 0..6 {
    assert!(vec.iter().any(|(_, &x)| x == i));
}

Elements can be mutated through fine-grained locking:

let vec = boxcar::Vec::new();

std::thread::scope(|s| {
    // Insert an element.
    vec.push(std::sync::Mutex::new(0));

    s.spawn(|| {
        // Mutate through the lock.
        *vec[0].lock().unwrap() += 1;
    });
});

let x = vec[0].lock().unwrap();
assert_eq!(*x, 1);

Dependencies

~0–22MB
~291K SLoC