Struct CircularBuffer 

pub struct CircularBuffer { /* private fields */ }

A fixed-capacity circular (ring) buffer backed by a flat array.

Supports O(1) push-front, push-back, pop-front, and pop-back. Useful for implementing deques and sliding-window algorithms.

Implementations

impl CircularBuffer

pub fn new(cap: usize) -> Self

Create a new circular buffer with the given capacity.

pub fn len(&self) -> usize

Return the number of elements currently stored.

pub fn is_empty(&self) -> bool

Return true if the buffer contains no elements.

pub fn is_full(&self) -> bool

Return true if the buffer is at full capacity.

pub fn push_back(&mut self, val: i64) -> bool

Push an element to the back. Returns false if the buffer is full.

pub fn pop_front(&mut self) -> Option<i64>

Pop an element from the front. Returns None if empty.

pub fn front(&self) -> Option<i64>

Peek at the front element without removing it.