Struct Queue 

pub struct Queue<'a, T: 'a, A: Allocator> { /* private fields */ }

A first-in, first-out data structure backed by a Deque

Implementations

impl<'a, T: 'a, A: Allocator> Queue<'a, T, A>

pub fn into_inner(self) -> Deque<'a, T, A>

Turns the Queue into its inner Deque

pub fn is_empty(&self) -> bool

Returns true if the queue contains no elements

pub fn iter(&self) -> Iter<'a, T>

Produces an iterator over all of the elements in the queue

pub fn iter_mut(&mut self) -> IterMut<'a, T>

Produces a mutable iterator over all of the elements in the queue

pub fn len(&self) -> usize

Returns the number of elements in the queue

pub unsafe fn new_in(allocator: A) -> Self

Creates a new queue inside an allocator

Arguments

allocator: The allocator

Safety

The allocator specified must safely allocate ande de-allocate valid memory

pub fn pop(&mut self) -> Option<T>

Pops an element from the queue, returning the element on top if there was one

pub fn push(&mut self, elem: T)

Pushes an element to the queue

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

Peeks the top element in the queue without popping it

Trait Implementations

impl<'a, T: 'a + Debug, A: Allocator> Debug for Queue<'a, T, A>

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

Formats the value using the given formatter.

impl<'a, T: 'a, A: Allocator + Default> Default for Queue<'a, T, A>

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T: 'a, A: Allocator + Default> FromIterator<T> for Queue<'a, T, A>

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

Creates a value from an iterator.

impl<'a, T: 'a, A: Allocator> IntoIterator for Queue<'a, T, A>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<'a, T, A>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T: Send + 'a, A: Allocator + Send> Send for Queue<'a, T, A>

impl<'a, T: Sync + 'a, A: Allocator + Sync> Sync for Queue<'a, T, A>