Struct Racy 

pub struct Racy<'a, T: RacyStorage>(/* private fields */);

An opaque pointer to memory implementing the ECMAScript atomic memory model.

Implementations

impl<T: RacyStorage> Racy<'_, T>

pub fn compare_exchange(&self, current: T, new: T) -> Result<T, T>

Stores a value into the racy atomic integer if the current value is the same as the current value.

The return value is a result indicating whether the new value was written and containing the previous value. On success this value is guaranteed to be equal to current.

The Ordering of the operation is always SeqCst.

pub fn fetch_add(&self, val: T) -> T

Adds to the current value, returning the previous value.

This operation wraps around on overflow.

The Ordering of the operation is always SeqCst.

pub fn fetch_and(&self, val: T) -> T

Bitwise “and” with the current value.

Performs a bitwise “and” operation on the current value and the argument val, and sets the new value to the result.

Returns the previous value.

The Ordering of the operation is always SeqCst.

pub fn fetch_or(&self, val: T) -> T

Bitwise “or” with the current value.

Performs a bitwise “or” operation on the current value and the argument val, and sets the new value to the result.

Returns the previous value.

The Ordering of the operation is always SeqCst.

pub fn fetch_xor(&self, val: T) -> T

Bitwise “xor” with the current value.

Performs a bitwise “xor” operation on the current value and the argument val, and sets the new value to the result.

Returns the previous value.

The Ordering of the operation is always SeqCst.

pub fn load(&self, order: Ordering) -> T

Loads a value from the atomic integer.

load takes an Ordering argument which describes the memory ordering of this operation. All ordering modes are possible.

pub fn store(&self, val: T, order: Ordering)

Stores a value into the atomic integer.

store takes an Ordering argument which describes the memory ordering of this operation. All ordering modes are possible.

pub fn swap(&self, val: T) -> T

Stores a value into the atomic integer, returning the previous value.

swap takes an Ordering argument which describes the memory ordering of this operation. All ordering modes are possible.

Trait Implementations

impl<'a, T: Clone + RacyStorage> Clone for Racy<'a, T>

fn clone(&self) -> Racy<'a, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, T: Copy + RacyStorage> Copy for Racy<'a, T>

impl<T: RacyStorage> Send for Racy<'_, T>

impl<T: RacyStorage> Sync for Racy<'_, T>