Struct stacking::stack::stacks::Queue

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

a struct representing a queue which is a specific type of stack. You push to the top and pop from the bottom.

Implementations

impl<T: Clone> Queue<T>

pub fn new() -> Queue<T>

create a new instance of a Queue

Returns

a new empty instance of a Queue

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

push a new element to the Queue

Arguments

• val: the value to push

Examples

use stacking::stacks::Queue;

let mut queue: Queue<i32> = Queue::new();
queue.push(4);
queue.push(5);
assert_eq!(queue.pop(), Some(4));
assert_eq!(queue.pop(), Some(5));

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

pop the element at the bottom and return it’s value

Returns

the value of the element at the bottom

Examples

use stacking::stacks::Queue;

let mut queue: Queue<i32> = Queue::new();
queue.push(4);
queue.push(5);
assert_eq!(queue.pop(), Some(4));
assert_eq!(queue.pop(), Some(5));

pub fn len(&self) -> usize

get the length of the current Queue

Returns

the length of the current Queue as a usize

Examples

use stacking::stacks::Queue;

let mut queue: Queue<i32> = Queue::new();
assert_eq!(queue.len(), 0);
queue.push(4);
assert_eq!(queue.len(), 1);

Trait Implementations

impl<T: Clone> 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: Debug + Clone> Debug for Queue<T>

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

Formats the value using the given formatter.