Struct Stack

Source
pub struct Stack<T> { /* private fields */ }
Expand description

§stack data structure

在栈中,被删除的是最近插入的元素: 栈的实现是一种后进先出策略。 这里采用数组实现栈,还有别的方式也是可以实现栈的。

§栈的操作

栈的操作有,栈上的INSERT操作称为压入PUSH,而无元素参数的DELETE操作称为弹出POP。

Implementations§

Source§

impl<T: Clone> Stack<T>

Source

pub fn new() -> Stack<T>

Creating an empty stack

use algorithms_rs::Stack;

let stack = Stack::<i32>::new();

assert_eq!(stack.is_empty(), true);
Source

pub fn is_empty(&self) -> bool

Determine if stack is empty

use algorithms_rs::Stack;

let mut stack = Stack::<i32>::new();

assert_eq!(stack.is_empty(), true);

stack.push(2);

assert_eq!(stack.is_empty(), false);
STACK-EMPTY(S)
if S.top == 0
    return true
else return false
Source

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

Put an element into the top of the stack of stack

use algorithms_rs::Stack;

let mut stack = Stack::<i32>::new();

stack.push(1);

assert_eq!(stack.is_empty(), false);
PUSH(S, x)
    S.top = S.top + 1
    S[S.top] = x
Source

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

Remove an element from the top of the stack of stack

use algorithms_rs::Stack;

let mut stack = Stack::<i32>::new();

stack.push(1);

let element = stack.pop().unwrap();

assert_eq!(element, 1);
assert_eq!(stack.is_empty(), true);

if let Err(err) = stack.pop() {
 assert_eq!(err.to_string(), "underflow".to_string())
}
POP(S)
    if STACK-EMPTY(S)
        error "underflow"
    else
        S.top = S.top - 1
        return S[S.top + 1]
Source

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

Return the top element of the stack

use algorithms_rs::Stack;

let mut stack = Stack::<i32>::new();

assert_eq!(stack.peek(), None);

stack.push(1);
stack.push(2);

assert_eq!(stack.peek(), Some(&2));
assert_eq!(stack.is_empty(), false);
Source

pub fn size(&self) -> usize

the stack size

use algorithms_rs::Stack;

let stack = Stack::<i32>::new();

assert_eq!(0, stack.size());

Trait Implementations§

Source§

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

Source§

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

Formats the value using the given formatter. Read more
Source§

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

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl<T> Freeze for Stack<T>

§

impl<T> RefUnwindSafe for Stack<T>
where T: RefUnwindSafe,

§

impl<T> Send for Stack<T>
where T: Send,

§

impl<T> Sync for Stack<T>
where T: Sync,

§

impl<T> Unpin for Stack<T>
where T: Unpin,

§

impl<T> UnwindSafe for Stack<T>
where T: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.