Struct lockfree::stack::Stack

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

A lock-free stack. LIFO/FILO semanthics are fully respected.

Implementations

impl<T> Stack<T>

pub fn new() -> Self

Creates a new empty stack.

pub fn push(&self, val: T)

Pushes a new value onto the top of the stack.

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

Pops a single element from the top of the stack.

pub fn extend<I>(&self, iterable: I)where
    I: IntoIterator<Item = T>,

Extends the stack from a given iterable. All values are pushed.

pub fn iter<'a>(&'a self) -> Iter<'a, T>

Creates an iterator over Ts, based on pop operation of the stack.

Trait Implementations

impl<T> Debug for Stack<T>

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

Formats the value using the given formatter.

impl<T> Default for Stack<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for Stack<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T> FromIterator<T> for Stack<T>

fn from_iter<I>(iterable: I) -> Selfwhere
    I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<'a, T> IntoIterator for &'a Stack<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

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