Struct f32x4
#[repr(C, align(16))]pub struct f32x4 { /* private fields */ }
dep_wide
only.Implementations§
§impl f32x4
impl f32x4
pub const ONE: f32x4
pub const ZERO: f32x4
pub const HALF: f32x4
pub const E: f32x4
pub const FRAC_1_PI: f32x4
pub const FRAC_2_PI: f32x4
pub const FRAC_2_SQRT_PI: f32x4
pub const FRAC_1_SQRT_2: f32x4
pub const FRAC_PI_2: f32x4
pub const FRAC_PI_3: f32x4
pub const FRAC_PI_4: f32x4
pub const FRAC_PI_6: f32x4
pub const FRAC_PI_8: f32x4
pub const LN_2: f32x4
pub const LN_10: f32x4
pub const LOG2_E: f32x4
pub const LOG10_E: f32x4
pub const LOG10_2: f32x4
pub const LOG2_10: f32x4
pub const PI: f32x4
pub const SQRT_2: f32x4
pub const TAU: f32x4
§impl f32x4
impl f32x4
pub const fn new(array: [f32; 4]) -> f32x4
pub fn blend(self, t: f32x4, f: f32x4) -> f32x4
pub fn abs(self) -> f32x4
pub fn floor(self) -> f32x4
pub fn ceil(self) -> f32x4
pub fn fast_max(self, rhs: f32x4) -> f32x4
pub fn fast_max(self, rhs: f32x4) -> f32x4
Calculates the lanewise maximum of both vectors. This is a faster
implementation than max
, but it doesn’t specify any behavior if NaNs are
involved.
pub fn max(self, rhs: f32x4) -> f32x4
pub fn max(self, rhs: f32x4) -> f32x4
Calculates the lanewise maximum of both vectors. If either lane is NaN,
the other lane gets chosen. Use fast_max
for a faster implementation
that doesn’t handle NaNs.
pub fn fast_min(self, rhs: f32x4) -> f32x4
pub fn fast_min(self, rhs: f32x4) -> f32x4
Calculates the lanewise minimum of both vectors. This is a faster
implementation than min
, but it doesn’t specify any behavior if NaNs are
involved.
pub fn min(self, rhs: f32x4) -> f32x4
pub fn min(self, rhs: f32x4) -> f32x4
Calculates the lanewise minimum of both vectors. If either lane is NaN,
the other lane gets chosen. Use fast_min
for a faster implementation
that doesn’t handle NaNs.
pub fn is_nan(self) -> f32x4
pub fn is_finite(self) -> f32x4
pub fn is_inf(self) -> f32x4
pub fn round(self) -> f32x4
pub fn fast_round_int(self) -> i32x4
pub fn fast_round_int(self) -> i32x4
Rounds each lane into an integer. This is a faster implementation than
round_int
, but it doesn’t handle out of range values or NaNs. For those
values you get implementation defined behavior.
pub fn round_int(self) -> i32x4
pub fn round_int(self) -> i32x4
Rounds each lane into an integer. This saturates out of range values and
turns NaNs into 0. Use fast_round_int
for a faster implementation that
doesn’t handle out of range values or NaNs.
pub fn fast_trunc_int(self) -> i32x4
pub fn fast_trunc_int(self) -> i32x4
Truncates each lane into an integer. This is a faster implementation than
trunc_int
, but it doesn’t handle out of range values or NaNs. For those
values you get implementation defined behavior.
pub fn trunc_int(self) -> i32x4
pub fn trunc_int(self) -> i32x4
Truncates each lane into an integer. This saturates out of range values
and turns NaNs into 0. Use fast_trunc_int
for a faster implementation
that doesn’t handle out of range values or NaNs.
pub fn mul_add(self, m: f32x4, a: f32x4) -> f32x4
pub fn mul_sub(self, m: f32x4, s: f32x4) -> f32x4
pub fn mul_neg_add(self, m: f32x4, a: f32x4) -> f32x4
pub fn mul_neg_sub(self, m: f32x4, a: f32x4) -> f32x4
pub fn flip_signs(self, signs: f32x4) -> f32x4
pub fn copysign(self, sign: f32x4) -> f32x4
pub fn asin_acos(self) -> (f32x4, f32x4) ⓘ
pub fn asin(self) -> f32x4
pub fn acos(self) -> f32x4
pub fn atan(self) -> f32x4
pub fn atan2(self, x: f32x4) -> f32x4
pub fn sin_cos(self) -> (f32x4, f32x4) ⓘ
pub fn sin(self) -> f32x4
pub fn cos(self) -> f32x4
pub fn tan(self) -> f32x4
pub fn to_degrees(self) -> f32x4
pub fn to_radians(self) -> f32x4
pub fn recip(self) -> f32x4
pub fn recip_sqrt(self) -> f32x4
pub fn sqrt(self) -> f32x4
pub fn move_mask(self) -> i32 ⓘ
pub fn any(self) -> bool
pub fn all(self) -> bool
pub fn none(self) -> bool
pub fn sign_bit(self) -> f32x4
pub fn reduce_add(self) -> f32 ⓘ
pub fn reduce_add(self) -> f32 ⓘ
horizontal add of all the elements of the vector
pub fn log2(self) -> f32x4
pub fn log10(self) -> f32x4
pub fn pow_f32x4(self, y: f32x4) -> f32x4
pub fn powf(self, y: f32) -> f32x4
pub fn to_array(self) -> [f32; 4]
pub fn as_array_ref(&self) -> &[f32; 4]
pub fn as_array_mut(&mut self) -> &mut [f32; 4]
pub fn from_i32x4(v: i32x4) -> f32x4
Trait Implementations§
§impl AddAssign<&f32x4> for f32x4
impl AddAssign<&f32x4> for f32x4
§fn add_assign(&mut self, rhs: &f32x4)
fn add_assign(&mut self, rhs: &f32x4)
+=
operation. Read more§impl BitAndAssign<&f32x4> for f32x4
impl BitAndAssign<&f32x4> for f32x4
§fn bitand_assign(&mut self, rhs: &f32x4)
fn bitand_assign(&mut self, rhs: &f32x4)
&=
operation. Read more§impl BitAndAssign for f32x4
impl BitAndAssign for f32x4
§fn bitand_assign(&mut self, rhs: f32x4)
fn bitand_assign(&mut self, rhs: f32x4)
&=
operation. Read more§impl BitOrAssign<&f32x4> for f32x4
impl BitOrAssign<&f32x4> for f32x4
§fn bitor_assign(&mut self, rhs: &f32x4)
fn bitor_assign(&mut self, rhs: &f32x4)
|=
operation. Read more§impl BitOrAssign for f32x4
impl BitOrAssign for f32x4
§fn bitor_assign(&mut self, rhs: f32x4)
fn bitor_assign(&mut self, rhs: f32x4)
|=
operation. Read more§impl BitXorAssign<&f32x4> for f32x4
impl BitXorAssign<&f32x4> for f32x4
§fn bitxor_assign(&mut self, rhs: &f32x4)
fn bitxor_assign(&mut self, rhs: &f32x4)
^=
operation. Read more§impl BitXorAssign for f32x4
impl BitXorAssign for f32x4
§fn bitxor_assign(&mut self, rhs: f32x4)
fn bitxor_assign(&mut self, rhs: f32x4)
^=
operation. Read more§impl<'de> Deserialize<'de> for f32x4
impl<'de> Deserialize<'de> for f32x4
§fn deserialize<D>(
deserializer: D,
) -> Result<f32x4, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<f32x4, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
§impl DivAssign<&f32x4> for f32x4
impl DivAssign<&f32x4> for f32x4
§fn div_assign(&mut self, rhs: &f32x4)
fn div_assign(&mut self, rhs: &f32x4)
/=
operation. Read more§impl MulAssign<&f32x4> for f32x4
impl MulAssign<&f32x4> for f32x4
§fn mul_assign(&mut self, rhs: &f32x4)
fn mul_assign(&mut self, rhs: &f32x4)
*=
operation. Read more§impl Serialize for f32x4
impl Serialize for f32x4
§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 SubAssign<&f32x4> for f32x4
impl SubAssign<&f32x4> for f32x4
§fn sub_assign(&mut self, rhs: &f32x4)
fn sub_assign(&mut self, rhs: &f32x4)
-=
operation. Read moreimpl Copy for f32x4
impl Pod for f32x4
impl StructuralPartialEq for f32x4
Auto Trait Implementations§
impl Freeze for f32x4
impl RefUnwindSafe for f32x4
impl Send for f32x4
impl Sync for f32x4
impl Unpin for f32x4
impl UnwindSafe for f32x4
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,
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.