Struct ssd1362::terminal::ringbuffer::Ringbuffer

pub struct Ringbuffer<N: ArrayLength<u8>> { /* fields omitted */ }

Implementations

impl<N: ArrayLength<u8>> Ringbuffer<N>

pub fn new() -> Self

pub fn try_add(&mut self, bytes: &[u8]) -> Result<(), Error>

try to add slice of bytes as a new element throws error if there is no space in the buffer

pub fn add(&mut self, bytes: &[u8])

pub fn iter(&self, offset: usize) -> impl Iterator<Item = &[u8]>

pub fn reverse_iter(&self, offset: usize) -> impl Iterator<Item = &[u8]>

pub fn element(&self, index: usize) -> Option<&[u8]>

pub fn pop(&mut self) -> bool

Pop one element from the front of the buffer. That is, the element that was added first. Returns bool indicating whether anything was popped or not.

pub fn used(&self) -> usize

pub fn wrap_wp(&mut self, size: usize)

Returns optimal write pointer for given element size It makes sure that elements are always in continuous memory

pub fn free(&self) -> usize

Get number of free elements in ringbuffer

Trait Implementations

impl<N: ArrayLength<u8>> Debug for Ringbuffer<N>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.