Struct RingBuffer 

pub struct RingBuffer<const N: usize> { /* private fields */ }

Fixed-capacity byte ring buffer for variable-length packets.

Stores packets contiguously with a 2-byte length prefix. When a packet doesn’t fit between the write cursor and the buffer end, the gap is skipped and the packet wraps to position 0. Worst case wastes MTU bytes once — same as one Deque slot — but typical utilization is much better since small packets pack tightly.

When the ring is full, push returns false and the packet is dropped (tail-drop policy).

Implementations

impl<const N: usize> RingBuffer<N>

pub const fn new() -> Self

Create a new empty ring buffer.

pub fn push(&mut self, data: &[u8]) -> bool

Push a packet into the ring. Returns false if full.

pub fn front(&self) -> Option<&[u8]>

Peek at the front packet without removing it.

pub fn pop(&mut self)

Remove the front packet.

pub fn len(&self) -> usize

Number of packets currently stored.

pub fn is_empty(&self) -> bool

Returns true if the ring contains no packets.