Struct ping_pong_cell::PingPongCell

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

An Atomic Cell game for up to two players.

Implementations

impl<T> PingPongCell<T>

pub fn new(value: Option<T>) -> Self

Create a new PingPongCell

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

If there is a value currently inside, take it.

pub fn put(&self, value: T)

Replace the value inside unconditionally.

pub fn put_if_empty(&self, value: T) -> Result<(), T>

Puts a value inside only if there is not one currently.

pub fn transact<F, R>(&self, fun: F) -> R where
    F: FnOnce(&mut Option<T>) -> R, 

Runs a closure with a mutable reference to the state

impl<T: Clone> PingPongCell<T>

pub fn put_empty_clone(&self, value: T) -> Result<(), (T, T)>

put_empty(), but clones the current contents on failure

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

Clones the contents, if any.

impl<T: Eq> PingPongCell<T>

pub fn compare_and_swap(&self, expected: &T, new: T) -> Result<(), T>

A single CAS operation

impl<T: Clone + Eq> PingPongCell<T>

pub fn compare_swap_clone(
    &self,
    expected: &T,
    new: T
) -> Result<(), (T, Option<T>)>

A single CAS operation, cloning the current value on failure

Trait Implementations

impl<T: Debug> Debug for PingPongCell<T>

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

Formats the value using the given formatter.

impl<T: Send> Send for PingPongCell<T>

impl<T: Sync> Sync for PingPongCell<T>