Struct Queue

pub struct Queue<T> { /* private fields */ }

FIFO queue with async pop.

Implementations

impl<T> Queue<T>

pub fn new() -> Self

Creates new queue with unbounded capacity.

pub fn with_capacity(capacity: usize) -> Self

Creates new queue with given capacity.

capacity must be greater than 0 - it’ll panic otherwise.

pub fn push(&self, element: T)

Pushes element into the queue.

If queue is full it will push out the last (oldest) element out of the queue.

pub fn pop(&self) -> Pop<'_, T>

Pops (asynchronously) element off the queue.

It means that if queue is currently empty await will wait till element is pushed into the queue.

pub fn try_pop(&self) -> Option<T>

Pops element off the queue.

Returns None if queue is currently empty.

pub fn len(&self) -> usize

Returns count of elements currently in the queue.

pub fn is_empty(&self) -> bool

Returns true if queue is currently empty.

pub fn is_full(&self) -> bool

Returns true if queue is currently full.

Trait Implementations

impl<T> Default for Queue<T>

fn default() -> Self

Returns the “default value” for a type.