Struct RingBuffer

pub struct RingBuffer<T> { /* private fields */ }

An indexed multiple readable spsc ring buffer.

• access by an absolute index.
• a Single-Producer Single-Consumer with Multi-Reader
• using RwLock of parking_lot

extern crate indexed_ring_buffer;
use indexed_ring_buffer::*;

let (mut p, mut c, r) = indexed_ring_buffer::<usize>(0, 5);
for i in 0..101 {
    p.push(i);
    c.shift();
}

for i in 101..106 {
    p.push(i);
}

let (start, end, data) = r.get_from(101,5).unwrap();
assert_eq!(data,vec![101,102,103,104,105]);
assert_eq!(start,101);
assert_eq!(end,105);

c.shift_to(105);
let rslt = r.get_all();
assert_eq!(rslt,None);

Ring buffer itself.

Implementations

impl<T> RingBuffer<T>

where T: Sized + Default + Clone + Copy,

pub fn new(offset: usize, size: usize) -> RingBuffer<T>

Creates a new instance of a ring buffer.

pub fn get_ref(&self) -> &[MaybeUninit<T>]

pub fn get_mut(&self) -> &mut [MaybeUninit<T>]

pub fn is_empty(&self) -> bool

Checks if the ring buffer is empty.

pub fn is_full(&self) -> bool

Checks if the ring buffer is full.