Struct deadqueue::unlimited::Queue

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

Queue that is unlimited in size.

This queue implementation has the following characteristics:

• Based on crossbeam_queue::SegQueue
• Has unlimitied capacity and no back pressure on push
• Enabled via the unlimited feature in your Cargo.toml

Implementations

impl<T> Queue<T>

pub fn new() -> Self

Create new empty queue

pub async fn pop(&self) -> T

Get an item from the queue. If the queue is currently empty this method blocks until an item is available.

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

Try to get an item from the queue. If the queue is currently empty return None instead.

pub fn push(&self, item: T)

Push an item into the queue

pub fn len(&self) -> usize

Get current length of queue (number of items currently stored).

pub fn is_empty(&self) -> bool

Returns true if the queue is empty.

pub fn available(&self) -> isize

Get available count. This is the difference between the current queue length and the number of tasks waiting for an item of the queue.

Trait Implementations

impl<T> Debug for Queue<T>

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

Formats the value using the given formatter.

impl<T> Default for Queue<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> FromIterator<T> for Queue<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.