Struct ArrayStorage

pub struct ArrayStorage<T, const SIZE: usize, const CAPACITY: usize>
where
    T: PartialEq + Copy + Default,
    [T; CAPACITY]: Sized,
{ /* private fields */ }

A highly optimized fixed-size array-based sliding window implementation

Type Parameters

• T - The type of elements stored in the window
• SIZE - The size of the sliding window
• CAPACITY - The total capacity of the underlying array

Implementation Note

Uses a fixed-size array with constant memory footprint. The window slides through the array using head and tail pointers, with rewind operations when needed.

Implementations

impl<T, const SIZE: usize, const CAPACITY: usize> ArrayStorage<T, SIZE, CAPACITY>

where T: PartialEq + Copy + Default, [T; CAPACITY]: Sized,

pub fn new() -> Self

Creates a new ArrayStorage instance

Returns

• Self - A new ArrayStorage instance with initialized array and pointers

Implementation Note

Initializes a fixed-size array with default values and sets up window tracking

Trait Implementations

impl<T, const SIZE: usize, const CAPACITY: usize> Debug for ArrayStorage<T, SIZE, CAPACITY>

where T: PartialEq + Copy + Default + Debug, [T; CAPACITY]: Sized,

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

Formats the value using the given formatter.

impl<T, const SIZE: usize, const CAPACITY: usize> Default for ArrayStorage<T, SIZE, CAPACITY>

where T: PartialEq + Copy + Default, [T; SIZE]: Sized,

fn default() -> Self

Returns the “default value” for a type.

impl<T, const SIZE: usize, const CAPACITY: usize> WindowStorage<T> for ArrayStorage<T, SIZE, CAPACITY>

where T: PartialEq + Copy + Default, [T; SIZE]: Sized,

fn push(&mut self, value: T)

Pushes a new element into the sliding window

Args

• value - The value to be pushed into the window

Implementation Note

Optimized for the common case with minimal branching

fn first(&self) -> Result<T, String>

Returns the first (oldest) element in the sliding window

Returns

• Ok(T) - The first element in the window
• Err(String) - If the window is empty

fn last(&self) -> Result<T, String>

Returns the last (newest) element in the sliding window

Returns

• Ok(T) - The last element in the window
• Err(String) - If the window is not yet filled

fn tail(&self) -> usize

Returns the current tail position of the window

fn size(&self) -> usize

Returns the size of the sliding window

fn get_slice(&self) -> &[T]

Returns a slice of the current window contents

Returns

• &[T] - A slice containing the current window elements

fn filled(&self) -> bool

Checks if the sliding window is filled to its maximum size

fn empty(&self) -> bool

Returns true if the window is empty

fn arr<const S: usize>(&self) -> Result<[T; S], String>

Returns the sliding window as a fixed size static array

fn slice(&self) -> Result<&[T], String>

Returns the sliding window as a slice

fn vec(&self) -> Result<Vec<T>, String>

Returns the sliding window as a vector