Struct concurrent::sync::Treiber

pub struct Treiber<T> { /* fields omitted */ }

A Treiber stack.

Treiber stacks are one way to implement concurrent LIFO stack.

Treiber stacks builds on linked lists. They are lock-free and non-blocking. It can be compared to transactional memory in that it repeats operations, if another thread changes it while.

The ABA problem is of course addressed through the API of this crate.

Methods

impl<T> Treiber<T>

fn new() -> Treiber<T>

Create a new, empty Treiber stack.

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

Pop an item from the stack.

fn push(&self, item: T) where
    T: 'static, 

Push an item to the stack.

Trait Implementations

impl<T> Drop for Treiber<T>

fn drop(&mut self)

A method called when the value goes out of scope.