Implementing a Fixed-Size Circular Queue with Const Generics

pub struct ArrayBuffer<T, const N: usize> {
    data: [Option<T>; N],
    head: usize,
    tail: usize,
}
 
impl<T, const N: usize> ArrayBuffer<T, N> {
    pub fn new() -> Self
    where
        [Option<T>; N]: Default,
    {
        Self {
            data: Default::default(),
            head: 0,
            tail: 0,
        }
    }
 
    pub fn push(&mut self, item: T) -> Result<(), &'static str> {
        let next_head = (self.head + 1) % N;
        if next_head == self.tail {
            return Err("Queue full");
        }
        self.data[self.head] = Some(item);
        self.head = next_head;
        Ok(())
    }
}