Struct EitherQueue

pub struct EitherQueue<L, R> { /* private fields */ }

Representation of two queues in one.

Implementations

impl<L, R> EitherQueue<L, R>

pub fn new() -> Self

Allocate and return a new, empty, EitherQueue object.

pub fn len(&self) -> usize

Returns the number of nodes in both left and right queues combined.

let mut q = eitherq::EitherQueue::<&str, u32>::new();
q.push_left("elena");
q.push_left("chloe");
q.push_right(42);
assert_eq!(q.len(), 3);

pub fn left_len(&self) -> usize

pub fn right_len(&self) -> usize

pub fn is_empty(&self) -> bool

Returns true if both internal queues are empty.

let mut q = eitherq::EitherQueue::<&str, u32>::new();
assert_eq!(q.is_empty(), true);
q.push_left("charlie");
assert_eq!(q.is_empty(), false);
q.clear();
q.push_right(17);
assert_eq!(q.is_empty(), false);

pub fn is_left_empty(&self) -> bool

Returns true if the left queue is empty. Returns false otherwise.

pub fn is_right_empty(&self) -> bool

Returns true if the right queue is empty. Returns false otherwise.

pub fn clear(&mut self)

Clears all elements from both queues.

let mut q = eitherq::EitherQueue::<&str, u32>::new();
q.push_left("sully");
q.push_right(11);
q.clear();
assert_eq!(q.len(), 0);

pub fn push(&mut self, n: Either<L, R>)

pub fn push_left(&mut self, n: L)

pub fn push_right(&mut self, n: R)

pub fn pop(&mut self) -> Option<Either<L, R>>

Take the “oldest” node off the queue.

pub fn pop_left(&mut self) -> Option<L>

Take the oldest node off the left queue.

pub fn pop_right(&mut self) -> Option<R>

Take the oldest node off the right queue.

Trait Implementations

impl<L, R> Default for EitherQueue<L, R>

fn default() -> Self

Returns the “default value” for a type.