pub struct AtomicI16(/* private fields */);
Expand description
Mock implementation of std::sync::atomic::AtomicI16
.
NOTE: Unlike std::sync::atomic::AtomicI16
, this type has a different in-memory representation than i16
.
Implementations§
source§impl AtomicI16
impl AtomicI16
sourcepub fn with_mut<R>(&mut self, f: impl FnOnce(&mut i16) -> R) -> R
pub fn with_mut<R>(&mut self, f: impl FnOnce(&mut i16) -> R) -> R
Get access to a mutable reference to the inner value.
sourcepub unsafe fn unsync_load(&self) -> i16
pub unsafe fn unsync_load(&self) -> i16
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) -> i16
pub fn into_inner(self) -> i16
Consumes the atomic and returns the contained value.
sourcepub fn swap(&self, val: i16, order: Ordering) -> i16
pub fn swap(&self, val: i16, order: Ordering) -> i16
Stores a value into the atomic integer, returning the previous value.
sourcepub fn compare_and_swap(&self, current: i16, new: i16, order: Ordering) -> i16
pub fn compare_and_swap(&self, current: i16, new: i16, order: Ordering) -> i16
Stores a value into the atomic integer if the current value is the same as the current
value.
sourcepub fn compare_exchange(
&self,
current: i16,
new: i16,
success: Ordering,
failure: Ordering
) -> Result<i16, i16>
pub fn compare_exchange( &self, current: i16, new: i16, success: Ordering, failure: Ordering ) -> Result<i16, i16>
Stores a value into the atomic if the current value is the same as the current
value.
sourcepub fn compare_exchange_weak(
&self,
current: i16,
new: i16,
success: Ordering,
failure: Ordering
) -> Result<i16, i16>
pub fn compare_exchange_weak( &self, current: i16, new: i16, success: Ordering, failure: Ordering ) -> Result<i16, i16>
Stores a value into the atomic if the current value is the same as the current value.
sourcepub fn fetch_add(&self, val: i16, order: Ordering) -> i16
pub fn fetch_add(&self, val: i16, order: Ordering) -> i16
Adds to the current value, returning the previous value.
sourcepub fn fetch_sub(&self, val: i16, order: Ordering) -> i16
pub fn fetch_sub(&self, val: i16, order: Ordering) -> i16
Subtracts from the current value, returning the previous value.
sourcepub fn fetch_and(&self, val: i16, order: Ordering) -> i16
pub fn fetch_and(&self, val: i16, order: Ordering) -> i16
Bitwise “and” with the current value.
sourcepub fn fetch_nand(&self, val: i16, order: Ordering) -> i16
pub fn fetch_nand(&self, val: i16, order: Ordering) -> i16
Bitwise “nand” with the current value.
sourcepub fn fetch_xor(&self, val: i16, order: Ordering) -> i16
pub fn fetch_xor(&self, val: i16, order: Ordering) -> i16
Bitwise “xor” with the current value.
sourcepub fn fetch_max(&self, val: i16, order: Ordering) -> i16
pub fn fetch_max(&self, val: i16, order: Ordering) -> i16
Stores the maximum of the current and provided value, returning the previous value
sourcepub fn fetch_min(&self, val: i16, order: Ordering) -> i16
pub fn fetch_min(&self, val: i16, order: Ordering) -> i16
Stores the minimum of the current and provided value, returning the previous value