Struct AtomicI64_be
#[repr(C, align(8))]pub struct AtomicI64_be(/* private fields */);
dep_rkyv
only.Expand description
A big-endian AtomicI64
with a guaranteed size and alignment of 8
.
Implementations§
§impl AtomicI64_be
impl AtomicI64_be
pub const fn new(value: i64) -> AtomicI64_be
pub const fn new(value: i64) -> AtomicI64_be
Returns a AtomicI64_be
containing value
.
§impl AtomicI64_be
impl AtomicI64_be
pub fn compare_exchange(
&self,
current: i64,
new: i64,
success: Ordering,
failure: Ordering,
) -> Result<i64, i64> ⓘ
pub fn compare_exchange( &self, current: i64, new: i64, success: Ordering, failure: Ordering, ) -> Result<i64, i64> ⓘ
Stores a value into the atomic integer if the current value is
the same as the current
value.
See AtomicI64::compare_exchange
for more information.
pub fn compare_exchange_weak(
&self,
current: i64,
new: i64,
success: Ordering,
failure: Ordering,
) -> Result<i64, i64> ⓘ
pub fn compare_exchange_weak( &self, current: i64, new: i64, success: Ordering, failure: Ordering, ) -> Result<i64, i64> ⓘ
Stores a value into the atomic integer if the current value is
the same as the current
value.
See AtomicI64::compare_exchange_weak
for more information.
pub fn fetch_add(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_add(&self, val: i64, order: Ordering) -> i64 ⓘ
Adds to the current value, returning the previous value.
Because addition is not an endian-agnostic operation, fetch_add
is implemented in terms of AtomicI64::compare_exchange_weak
on little-endian targets. This may result in worse performance on those targets.
See AtomicI64::fetch_add
for more information.
pub fn fetch_and(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_and(&self, val: i64, order: Ordering) -> i64 ⓘ
Bitwise “and” with the current value.
See AtomicI64::fetch_and
for more information.
pub fn fetch_max(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_max(&self, val: i64, order: Ordering) -> i64 ⓘ
Maximum with the current value.
Because maximum is not an endian-agnostic operation, fetch_max
is implemented in terms of AtomicI64::compare_exchange_weak
on little-endian targets. This may result in worse performance on those targets.
See AtomicI64::fetch_max
for more information.
pub fn fetch_min(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_min(&self, val: i64, order: Ordering) -> i64 ⓘ
Minimum with the current value.
Because minimum is not an endian-agnostic operation, fetch_min
is implemented in terms of AtomicI64::compare_exchange_weak
on little-endian targets. This may result in worse performance on those targets.
See AtomicI64::fetch_min
for more information.
pub fn fetch_nand(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_nand(&self, val: i64, order: Ordering) -> i64 ⓘ
Bitwise “nand” with the current value.
See AtomicI64::fetch_nand
for more information.
pub fn fetch_or(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_or(&self, val: i64, order: Ordering) -> i64 ⓘ
Bitwise “or” with the current value.
See AtomicI64::fetch_or
for more information.
pub fn fetch_sub(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_sub(&self, val: i64, order: Ordering) -> i64 ⓘ
Subtracts from the current value, returning the previous value.
Because subtraction is not an endian-agnostic operation, fetch_sub
is implemented in terms of AtomicI64::compare_exchange_weak
on little-endian targets. This may result in worse performance on those targets.
See AtomicI64::fetch_sub
for more information.
pub fn fetch_update<F>(
&self,
set_order: Ordering,
fetch_order: Ordering,
f: F,
) -> Result<i64, i64> ⓘ
pub fn fetch_update<F>( &self, set_order: Ordering, fetch_order: Ordering, f: F, ) -> Result<i64, i64> ⓘ
Fetches the value, and applies a function to it that returns an
optional new value. Returns a Result
of Ok(previous_value)
if the function returned Some(_)
, else Err(previous_value)
.
See AtomicI64::fetch_update
for more information.
pub fn fetch_xor(&self, val: i64, order: Ordering) -> i64 ⓘ
pub fn fetch_xor(&self, val: i64, order: Ordering) -> i64 ⓘ
Bitwise “xor” with the current value.
See AtomicI64::fetch_xor
for more information.
pub fn into_inner(self) -> i64 ⓘ
pub fn into_inner(self) -> i64 ⓘ
Consumes the atomic and returns the contained value.
See AtomicI64::into_inner
for more information.
pub fn load(&self, order: Ordering) -> i64 ⓘ
pub fn load(&self, order: Ordering) -> i64 ⓘ
Loads a value from the atomic integer.
See AtomicI64::load
for more information.
pub fn store(&self, val: i64, order: Ordering)
pub fn store(&self, val: i64, order: Ordering)
Stores a value into the atomic integer.
See AtomicI64::store
for more information.
Trait Implementations§
§impl<SO> ArchiveWith<AtomicI64_be> for AtomicLoad<SO>where
SO: LoadOrdering,
impl<SO> ArchiveWith<AtomicI64_be> for AtomicLoad<SO>where
SO: LoadOrdering,
§fn resolve_with(
field: &AtomicI64_be,
_: <AtomicLoad<SO> as ArchiveWith<AtomicI64_be>>::Resolver,
out: Place<<AtomicLoad<SO> as ArchiveWith<AtomicI64_be>>::Archived>,
)
fn resolve_with( field: &AtomicI64_be, _: <AtomicLoad<SO> as ArchiveWith<AtomicI64_be>>::Resolver, out: Place<<AtomicLoad<SO> as ArchiveWith<AtomicI64_be>>::Archived>, )
F
.§impl<C> CheckBytes<C> for AtomicI64_be
impl<C> CheckBytes<C> for AtomicI64_be
§impl Debug for AtomicI64_be
impl Debug for AtomicI64_be
§impl Default for AtomicI64_be
impl Default for AtomicI64_be
§fn default() -> AtomicI64_be
fn default() -> AtomicI64_be
§impl<D, SO> DeserializeWith<i64_le, AtomicI64_be, D> for AtomicLoad<SO>
impl<D, SO> DeserializeWith<i64_le, AtomicI64_be, D> for AtomicLoad<SO>
§fn deserialize_with(
field: &i64_le,
_: &mut D,
) -> Result<AtomicI64_be, <D as Fallible>::Error> ⓘ
fn deserialize_with( field: &i64_le, _: &mut D, ) -> Result<AtomicI64_be, <D as Fallible>::Error> ⓘ
F
using the given deserializer.§impl From<i64> for AtomicI64_be
impl From<i64> for AtomicI64_be
§fn from(value: i64) -> AtomicI64_be
fn from(value: i64) -> AtomicI64_be
§impl<S, SO> SerializeWith<AtomicI64_be, S> for AtomicLoad<SO>
impl<S, SO> SerializeWith<AtomicI64_be, S> for AtomicLoad<SO>
§fn serialize_with(
_: &AtomicI64_be,
_: &mut S,
) -> Result<<AtomicLoad<SO> as ArchiveWith<AtomicI64_be>>::Resolver, <S as Fallible>::Error> ⓘ
fn serialize_with( _: &AtomicI64_be, _: &mut S, ) -> Result<<AtomicLoad<SO> as ArchiveWith<AtomicI64_be>>::Resolver, <S as Fallible>::Error> ⓘ
F
using the given serializer.Auto Trait Implementations§
impl !Freeze for AtomicI64_be
impl RefUnwindSafe for AtomicI64_be
impl Send for AtomicI64_be
impl Sync for AtomicI64_be
impl Unpin for AtomicI64_be
impl UnwindSafe for AtomicI64_be
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.