Trait indicator::ticked::tumbling::queue::QueueCapAtLeast

pub trait QueueCapAtLeast<const LEN: usize> {
    type Item;
    fn empty() -> Self;
    fn len(&self) -> usize;
    fn deque(&mut self) -> Option<Self::Item>;
    fn enque(&mut self, item: Self::Item);
    fn get_latest(&self, n: usize) -> Option<&Self::Item>;

    fn is_reach(&self) -> bool { ... }
    fn enque_and_deque_overflow(
        &mut self, 
        item: Self::Item
    ) -> Option<Self::Item> { ... }
}

Queue that can hold at least LEN items.

Associated Types

type Item

Item type.

Required methods

fn empty() -> Self

Creat an empty queue.

fn len(&self) -> usize

Get the nubmer of items in queue.

fn deque(&mut self) -> Option<Self::Item>

Deque an item.

fn enque(&mut self, item: Self::Item)

Enque a new item.

fn get_latest(&self, n: usize) -> Option<&Self::Item>

Get the nth latest item.

The index is starting from 0.

Provided methods

fn is_reach(&self) -> bool

Tumbling full.

fn enque_and_deque_overflow(&mut self, item: Self::Item) -> Option<Self::Item>

Push a new item and return the oldest item if full.

Implementations on Foreign Types

impl<T, const LEN: usize> QueueCapAtLeast<LEN> for ArrayVec<T, LEN>

type Item = T

fn empty() -> Self

fn len(&self) -> usize

fn deque(&mut self) -> Option<Self::Item>

fn enque(&mut self, item: Self::Item)

fn get_latest(&self, n: usize) -> Option<&Self::Item>

Implementors