ringbuffer-spsc

A fast thread-safe single producer-single consumer ring buffer

9 releases

0.1.9 Dec 30, 2022
0.1.8 Dec 12, 2022
0.1.6 Sep 22, 2022
0.1.3 Jul 27, 2022
Download history 9080/week @ 2024-06-11 9476/week @ 2024-06-18 9778/week @ 2024-06-25 8464/week @ 2024-07-02 8871/week @ 2024-07-09 8947/week @ 2024-07-16 9679/week @ 2024-07-23 9017/week @ 2024-07-30 9932/week @ 2024-08-06 8746/week @ 2024-08-13 9683/week @ 2024-08-20 12223/week @ 2024-08-27 9837/week @ 2024-09-03 12301/week @ 2024-09-10 13245/week @ 2024-09-17 11064/week @ 2024-09-24

48,855 downloads per month
Used in 40 crates (via zenoh-transport)

EPL-2.0 license

9KB
105 lines

ringbuffer-spsc

A fast single-producer single-consumer ring buffer. For performance reasons, the capacity of the buffer is determined at compile time via a const generic and it is required to be a power of two for a more efficient index handling.

Example

use ringbuffer_spsc::RingBuffer;

fn main() {
    const N: usize = 1_000_000;
    let (mut tx, mut rx) = RingBuffer::<usize, 16>::new();

    let p = std::thread::spawn(move || {
        let mut current: usize = 0;
        while current < N {
            if tx.push(current).is_none() {
                current = current.wrapping_add(1);
            } else {
                std::thread::yield_now();
            }
        }
    });

    let c = std::thread::spawn(move || {
        let mut current: usize = 0;
        while current < N {
            if let Some(c) = rx.pull() {
                assert_eq!(c, current);
                current = current.wrapping_add(1);
            } else {
                std::thread::yield_now();
            }
        }
    });

    p.join().unwrap();
    c.join().unwrap();
}

Dependencies

~33KB