Struct microstack::Stack

pub struct Stack<V, const N: usize> { /* private fields */ }

This is a simplest and the fastest implementation of a stack on stack.

For example, here is how a stack can be created:

use microstack::Stack;
let mut s : Stack<u64, 10> = Stack::new();
s.push(1);
s.push(2);
assert_eq!(2, *s.pop().unwrap());

Implementations

impl<V, const N: usize> Stack<V, N>

pub const fn new() -> Self

Make it.

The size of the stack is defined by the generic argument.

impl<V, const N: usize> Stack<V, N>

pub fn from_vec(v: Vec<V>) -> Self

Make it from vector.

pub fn capacity(&mut self) -> usize

Get the capacity.

pub fn push(&mut self, v: V)

Push new element into it.

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

Pop a element from it.

pub fn clear(&mut self)

Clear.

pub const fn is_empty(&self) -> bool

Is it empty.

pub const fn len(&self) -> usize

Length of it.

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

Iterate them.

impl<'a, V: Clone + 'a, const N: usize> Stack<V, N>

pub fn into_iter(&self) -> impl Iterator<Item = V> + '_

Into-iterate them.

Trait Implementations

impl<V: Clone, const N: usize> Clone for Stack<V, N>

fn clone(&self) -> Self

Clone it.

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

Performs copy-assignment from source.

impl<V: Display, const N: usize> Debug for Stack<V, N>

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

Formats the value using the given formatter.

impl<V, const N: usize> Default for Stack<V, N>

fn default() -> Self

Make a default empty Stack.

impl<V: Display, const N: usize> Display for Stack<V, N>

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

Formats the value using the given formatter.

impl<V, const N: usize> Drop for Stack<V, N>

fn drop(&mut self)

Executes the destructor for this type.