Struct rpds::queue::Queue

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

A persistent queue with structural sharing. This data structure supports fast enqueue(), dequeue(), and peek().

Complexity

Let n be the number of elements in the queue.

Temporal complexity

Operation	Best case	Average	Worst case
new()	Θ(1)	Θ(1)	Θ(1)
enqueue()	Θ(1)	Θ(1)	Θ(1)
dequeue()	Θ(1)	Θ(1)	Θ(n)
dequeue() amortized	Θ(1)	Θ(1)	Θ(1)
peek()	Θ(1)	Θ(1)	Θ(1)
len()	Θ(1)	Θ(1)	Θ(1)
clone()	Θ(1)	Θ(1)	Θ(1)
iterator creation	Θ(1)	Θ(1)	Θ(1)
iterator step	Θ(1)	Θ(1)	Θ(n)
iterator full	Θ(n)	Θ(n)	Θ(n)

Implementation details

This queue is implemented as described in Immutability in C# Part Four: An Immutable Queue.

Methods

impl<T> Queue<T>

pub fn new() -> Queue<T>

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

pub fn dequeue(&self) -> Option<Queue<T>>

pub fn enqueue(&self, v: T) -> Queue<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

Trait Implementations

impl<T> Serialize for Queue<T> where
    T: Serialize, 

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl<'de, T> Deserialize<'de> for Queue<T> where
    T: Deserialize<'de>, 

fn deserialize<D: Deserializer<'de>>(
    deserializer: D
) -> Result<Queue<T>, D::Error>

Deserialize this value from the given Serde deserializer.

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

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> Default for Queue<T>

fn default() -> Queue<T>

Returns the "default value" for a type.

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

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

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

impl<T: PartialOrd<T>> PartialOrd<Queue<T>> for Queue<T>

fn partial_cmp(&self, other: &Queue<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Ord> Ord for Queue<T>

fn cmp(&self, other: &Queue<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

impl<T: Hash> Hash for Queue<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<T> Clone for Queue<T>

fn clone(&self) -> Queue<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Display> Display for Queue<T>

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'a, T> IntoIterator for &'a Queue<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value.

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

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

Creates a value from an iterator.