pub struct AtomicI32(/* private fields */);
Expand description
Mock implementation of std::sync::atomic::AtomicI32
.
NOTE: Unlike std::sync::atomic::AtomicI32
, this type has a different in-memory representation than i32
.
Implementations§
source§impl AtomicI32
impl AtomicI32
sourcepub fn with_mut<R>(&mut self, f: impl FnOnce(&mut i32) -> R) -> R
pub fn with_mut<R>(&mut self, f: impl FnOnce(&mut i32) -> R) -> R
Get access to a mutable reference to the inner value.
sourcepub unsafe fn unsync_load(&self) -> i32
pub unsafe fn unsync_load(&self) -> i32
Load the value without any synchronization.
Safety
An unsynchronized atomic load technically always has undefined behavior. However, if the atomic value is not currently visible by other threads, this should always be equivalent to a non-atomic load of an un-shared integer value.
sourcepub fn into_inner(self) -> i32
pub fn into_inner(self) -> i32
Consumes the atomic and returns the contained value.
sourcepub fn swap(&self, val: i32, order: Ordering) -> i32
pub fn swap(&self, val: i32, order: Ordering) -> i32
Stores a value into the atomic integer, returning the previous value.
sourcepub fn compare_and_swap(&self, current: i32, new: i32, order: Ordering) -> i32
pub fn compare_and_swap(&self, current: i32, new: i32, order: Ordering) -> i32
Stores a value into the atomic integer if the current value is the same as the current
value.
sourcepub fn compare_exchange(
&self,
current: i32,
new: i32,
success: Ordering,
failure: Ordering
) -> Result<i32, i32>
pub fn compare_exchange( &self, current: i32, new: i32, success: Ordering, failure: Ordering ) -> Result<i32, i32>
Stores a value into the atomic if the current value is the same as the current
value.
sourcepub fn compare_exchange_weak(
&self,
current: i32,
new: i32,
success: Ordering,
failure: Ordering
) -> Result<i32, i32>
pub fn compare_exchange_weak( &self, current: i32, new: i32, success: Ordering, failure: Ordering ) -> Result<i32, i32>
Stores a value into the atomic if the current value is the same as the current value.
sourcepub fn fetch_add(&self, val: i32, order: Ordering) -> i32
pub fn fetch_add(&self, val: i32, order: Ordering) -> i32
Adds to the current value, returning the previous value.
sourcepub fn fetch_sub(&self, val: i32, order: Ordering) -> i32
pub fn fetch_sub(&self, val: i32, order: Ordering) -> i32
Subtracts from the current value, returning the previous value.
sourcepub fn fetch_and(&self, val: i32, order: Ordering) -> i32
pub fn fetch_and(&self, val: i32, order: Ordering) -> i32
Bitwise “and” with the current value.
sourcepub fn fetch_nand(&self, val: i32, order: Ordering) -> i32
pub fn fetch_nand(&self, val: i32, order: Ordering) -> i32
Bitwise “nand” with the current value.
sourcepub fn fetch_xor(&self, val: i32, order: Ordering) -> i32
pub fn fetch_xor(&self, val: i32, order: Ordering) -> i32
Bitwise “xor” with the current value.
sourcepub fn fetch_max(&self, val: i32, order: Ordering) -> i32
pub fn fetch_max(&self, val: i32, order: Ordering) -> i32
Stores the maximum of the current and provided value, returning the previous value
sourcepub fn fetch_min(&self, val: i32, order: Ordering) -> i32
pub fn fetch_min(&self, val: i32, order: Ordering) -> i32
Stores the minimum of the current and provided value, returning the previous value