Struct Stack

pub struct Stack<T: Clone> { /* private fields */ }

structure representing a stack

A stack is handled as a collection of nodes. we specify the top node who himself specifies the previous node and so on.

Implementations

impl<T: Clone> Stack<T>

pub fn new() -> Stack<T>

create a new stack

Arguments

• val: the value to use

Returns

this function returns a new stack with one node that has the value of val

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

push a new element to the stack

Arguments

val: the value for the new element to have

Examples

use stacking::stacks::Stack;

let mut stack: Stack<i32> = Stack::new();
stack.push(4);
assert_eq!(stack.pop(), Some(4));

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

pop the top element of the stack.

Returns

an Option<T> for the value that the element had

Examples

use stacking::stacks::Stack;

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

pub fn len(&self) -> usize

return the length of the stack

Returns

the length of the stack as a usize

Examples

use stacking::stacks::Stack;

let mut stack: Stack<i32> = Stack::new();
stack.push(5);
assert_eq!(stack.len(), 1);
stack.pop();
assert_eq!(stack.len(), 0);

Trait Implementations

impl<T: Clone + Clone> Clone for Stack<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Clone> Debug for Stack<T>

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

Formats the value using the given formatter.