Struct u32x4
#[repr(C, align(16))]pub struct u32x4 { /* private fields */ }
dep_wide
only.Implementations§
§impl u32x4
impl u32x4
pub const fn new(array: [u32; 4]) -> u32x4
pub fn cmp_eq(self, rhs: u32x4) -> u32x4
pub fn cmp_gt(self, rhs: u32x4) -> u32x4
pub fn cmp_lt(self, rhs: u32x4) -> u32x4
pub fn mul_keep_high(self, rhs: u32x4) -> u32x4
pub fn mul_keep_high(self, rhs: u32x4) -> u32x4
Multiplies 32x32 bit to 64 bit and then only keeps the high 32 bits of the result. Useful for implementing divide constant value (see t_usefulness example)
pub fn mul_widen(self, rhs: u32x4) -> u64x4
pub fn mul_widen(self, rhs: u32x4) -> u64x4
Multiplies corresponding 32 bit lanes and returns the 64 bit result on the corresponding lanes.
Effectively does two multiplies on 128 bit platforms, but is easier to use than wrapping mul_widen_u32_odd_m128i individually.
pub fn blend(self, t: u32x4, f: u32x4) -> u32x4
pub fn max(self, rhs: u32x4) -> u32x4
pub fn min(self, rhs: u32x4) -> u32x4
pub fn any(self) -> bool
pub fn all(self) -> bool
pub fn none(self) -> bool
pub fn to_array(self) -> [u32; 4]
pub fn as_array_ref(&self) -> &[u32; 4]
pub fn as_array_mut(&mut self) -> &mut [u32; 4]
Trait Implementations§
§impl AddAssign<&u32x4> for u32x4
impl AddAssign<&u32x4> for u32x4
§fn add_assign(&mut self, rhs: &u32x4)
fn add_assign(&mut self, rhs: &u32x4)
+=
operation. Read more§impl BitAndAssign<&u32x4> for u32x4
impl BitAndAssign<&u32x4> for u32x4
§fn bitand_assign(&mut self, rhs: &u32x4)
fn bitand_assign(&mut self, rhs: &u32x4)
&=
operation. Read more§impl BitAndAssign for u32x4
impl BitAndAssign for u32x4
§fn bitand_assign(&mut self, rhs: u32x4)
fn bitand_assign(&mut self, rhs: u32x4)
&=
operation. Read more§impl BitOrAssign<&u32x4> for u32x4
impl BitOrAssign<&u32x4> for u32x4
§fn bitor_assign(&mut self, rhs: &u32x4)
fn bitor_assign(&mut self, rhs: &u32x4)
|=
operation. Read more§impl BitOrAssign for u32x4
impl BitOrAssign for u32x4
§fn bitor_assign(&mut self, rhs: u32x4)
fn bitor_assign(&mut self, rhs: u32x4)
|=
operation. Read more§impl BitXorAssign<&u32x4> for u32x4
impl BitXorAssign<&u32x4> for u32x4
§fn bitxor_assign(&mut self, rhs: &u32x4)
fn bitxor_assign(&mut self, rhs: &u32x4)
^=
operation. Read more§impl BitXorAssign for u32x4
impl BitXorAssign for u32x4
§fn bitxor_assign(&mut self, rhs: u32x4)
fn bitxor_assign(&mut self, rhs: u32x4)
^=
operation. Read more§impl<'de> Deserialize<'de> for u32x4
impl<'de> Deserialize<'de> for u32x4
§fn deserialize<D>(
deserializer: D,
) -> Result<u32x4, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<u32x4, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
§impl Serialize for u32x4
impl Serialize for u32x4
§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
§impl Shl for u32x4
Shifts lanes by the corresponding lane.
impl Shl for u32x4
Shifts lanes by the corresponding lane.
Bitwise shift-left; yields self << mask(rhs)
, where mask removes any
high-order bits of rhs
that would cause the shift to exceed the bitwidth
of the type. (same as wrapping_shl
)
§impl Shr for u32x4
Shifts lanes by the corresponding lane.
impl Shr for u32x4
Shifts lanes by the corresponding lane.
Bitwise shift-right; yields self >> mask(rhs)
, where mask removes any
high-order bits of rhs
that would cause the shift to exceed the bitwidth
of the type. (same as wrapping_shr
)
§impl SubAssign<&u32x4> for u32x4
impl SubAssign<&u32x4> for u32x4
§fn sub_assign(&mut self, rhs: &u32x4)
fn sub_assign(&mut self, rhs: &u32x4)
-=
operation. Read moreimpl Copy for u32x4
impl Eq for u32x4
impl Pod for u32x4
impl StructuralPartialEq for u32x4
Auto Trait Implementations§
impl Freeze for u32x4
impl RefUnwindSafe for u32x4
impl Send for u32x4
impl Sync for u32x4
impl Unpin for u32x4
impl UnwindSafe for u32x4
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,
§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
type Bits = T
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
bits
as &Self
.Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.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.