#ring-buffer #spsc #ringbuffer-spsc

ringbuffer-spsc

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

12 releases

0.1.13 Feb 10, 2025
0.1.12 Feb 10, 2025
0.1.11 Jan 29, 2025
0.1.9 Dec 30, 2022
0.1.3 Jul 27, 2022

#159 in Algorithms

Download history 15410/week @ 2025-01-10 14132/week @ 2025-01-17 14979/week @ 2025-01-24 16031/week @ 2025-01-31 14920/week @ 2025-02-07 13942/week @ 2025-02-14 17043/week @ 2025-02-21 18775/week @ 2025-02-28 21528/week @ 2025-03-07 23154/week @ 2025-03-14 22746/week @ 2025-03-21 21489/week @ 2025-03-28 26183/week @ 2025-04-04 18253/week @ 2025-04-11 15690/week @ 2025-04-18 18042/week @ 2025-04-25

83,200 downloads per month
Used in 58 crates (via zenoh-transport)

EPL-2.0 license

10KB
119 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

~145KB