Struct Queue

pub struct Queue<T>(/* private fields */);

A queue created with two stacks.

Implementations

impl<T> Queue<T>

pub fn new() -> Self

Creates a new Queue.

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

Adds an item to the end of the queue in O(1) time.

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

Removes the first item from the queue in O(n) time.

Trait Implementations

impl<T: Debug> Debug for Queue<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Queue<T>

fn default() -> Queue<T>

Returns the “default value” for a type.

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

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

Creates a value from an iterator.

impl<T> IntoIterator for Queue<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = Chain<IntoIter<T>, IntoIter<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for Queue<T>

fn eq(&self, other: &Queue<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for Queue<T>

impl<T> StructuralPartialEq for Queue<T>