Struct PersistentQueue 

pub struct PersistentQueue { /* private fields */ }

An immutable FIFO queue.

Uses a front list (for dequeue) and a rear vector (for enqueue). Amortized O(1) for both operations.

Implementations

impl PersistentQueue

pub fn empty() -> Self

pub fn new(front: PersistentList, rear: PersistentVector) -> Self

pub fn count(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn conj(&self, val: Value) -> Self

Add an element to the back of the queue.

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

View the front element without removing it.

pub fn pop(&self) -> Option<Self>

Remove the front element, returning the new queue.

pub fn iter(&self) -> impl Iterator<Item = &Value>

Iterate over elements from front to back.

Trait Implementations

impl Clone for PersistentQueue

fn clone(&self) -> PersistentQueue

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PersistentQueue

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

Formats the value using the given formatter.

impl PartialEq for PersistentQueue

fn eq(&self, other: &Self) -> 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 Trace for PersistentQueue

fn trace(&self, visitor: &mut MarkVisitor)