Struct extendr_api::prelude::complex_native::c32conj
source · pub struct c32conj {
pub re: f32,
pub neg_im: f32,
}Expand description
32-bit implicitly conjugated complex floating point type.
Fields§
§re: f32Real part.
neg_im: f32Negated imaginary part.
Trait Implementations§
source§impl AddAssign<c32conj> for c32
impl AddAssign<c32conj> for c32
source§fn add_assign(&mut self, rhs: c32conj)
fn add_assign(&mut self, rhs: c32conj)
Performs the
+= operation. Read moresource§impl Conjugate for c32conj
impl Conjugate for c32conj
source§impl DivAssign<c32conj> for c32
impl DivAssign<c32conj> for c32
source§fn div_assign(&mut self, rhs: c32conj)
fn div_assign(&mut self, rhs: c32conj)
Performs the
/= operation. Read moresource§impl Entity for c32conj
impl Entity for c32conj
type Unit = c32conj
type Index = u32
type SimdUnit<S: Simd> = <S as Simd>::c32s
type SimdMask<S: Simd> = <S as Simd>::m32s
type SimdIndex<S: Simd> = <S as Simd>::u32s
type Group = IdentityGroup
type Iter<I: Iterator> = I
type PrefixUnit<'a, S: Simd> = Prefix<'a, Complex<f32>, S, <S as Simd>::m32s>
type SuffixUnit<'a, S: Simd> = Suffix<'a, Complex<f32>, S, <S as Simd>::m32s>
type PrefixMutUnit<'a, S: Simd> = PrefixMut<'a, Complex<f32>, S, <S as Simd>::m32s>
type SuffixMutUnit<'a, S: Simd> = SuffixMut<'a, Complex<f32>, S, <S as Simd>::m32s>
const N_COMPONENTS: usize = 1usize
const UNIT: <<c32conj as Entity>::Group as ForCopyType>::FaerOfCopy<()> = ()
fn faer_first<T>(group: <<c32conj as Entity>::Group as ForType>::FaerOf<T>) -> T
fn faer_from_units( group: <<c32conj as Entity>::Group as ForType>::FaerOf<<c32conj as Entity>::Unit>, ) -> c32conj
fn faer_into_units( self, ) -> <<c32conj as Entity>::Group as ForType>::FaerOf<<c32conj as Entity>::Unit>
fn faer_as_ref<T>( group: &<<c32conj as Entity>::Group as ForType>::FaerOf<T>, ) -> <<c32conj as Entity>::Group as ForType>::FaerOf<&T>
fn faer_as_mut<T>( group: &mut <<c32conj as Entity>::Group as ForType>::FaerOf<T>, ) -> <<c32conj as Entity>::Group as ForType>::FaerOf<&mut T>
fn faer_as_ptr<T>( group: *mut <<c32conj as Entity>::Group as ForType>::FaerOf<T>, ) -> <<c32conj as Entity>::Group as ForType>::FaerOf<*mut T>
fn faer_map_impl<T, U>( group: <<c32conj as Entity>::Group as ForType>::FaerOf<T>, f: &mut impl FnMut(T) -> U, ) -> <<c32conj as Entity>::Group as ForType>::FaerOf<U>
fn faer_map_with_context<Ctx, T, U>( ctx: Ctx, group: <<c32conj as Entity>::Group as ForType>::FaerOf<T>, f: &mut impl FnMut(Ctx, T) -> (Ctx, U), ) -> (Ctx, <<c32conj as Entity>::Group as ForType>::FaerOf<U>)
fn faer_zip<T, U>( first: <<c32conj as Entity>::Group as ForType>::FaerOf<T>, second: <<c32conj as Entity>::Group as ForType>::FaerOf<U>, ) -> <<c32conj as Entity>::Group as ForType>::FaerOf<(T, U)>
fn faer_unzip<T, U>( zipped: <<c32conj as Entity>::Group as ForType>::FaerOf<(T, U)>, ) -> (<<c32conj as Entity>::Group as ForType>::FaerOf<T>, <<c32conj as Entity>::Group as ForType>::FaerOf<U>)
fn faer_into_iter<I>(
iter: <<c32conj as Entity>::Group as ForType>::FaerOf<I>,
) -> <c32conj as Entity>::Iter<<I as IntoIterator>::IntoIter>where
I: IntoIterator,
fn faer_map<T, U>( group: <Self::Group as ForType>::FaerOf<T>, f: impl FnMut(T) -> U, ) -> <Self::Group as ForType>::FaerOf<U>
fn faer_unzip2<T>( zipped: <Self::Group as ForType>::FaerOf<[T; 2]>, ) -> [<Self::Group as ForType>::FaerOf<T>; 2]
fn faer_unzip4<T>( zipped: <Self::Group as ForType>::FaerOf<[T; 4]>, ) -> [<Self::Group as ForType>::FaerOf<T>; 4]
fn faer_unzip8<T>( zipped: <Self::Group as ForType>::FaerOf<[T; 8]>, ) -> [<Self::Group as ForType>::FaerOf<T>; 8]
fn faer_as_arrays<const N: usize, T>( group: <Self::Group as ForType>::FaerOf<&[T]>, ) -> (<Self::Group as ForType>::FaerOf<&[[T; N]]>, <Self::Group as ForType>::FaerOf<&[T]>)
fn faer_as_arrays_mut<const N: usize, T>( group: <Self::Group as ForType>::FaerOf<&mut [T]>, ) -> (<Self::Group as ForType>::FaerOf<&mut [[T; N]]>, <Self::Group as ForType>::FaerOf<&mut [T]>)
fn faer_deref<T>(
group: <Self::Group as ForType>::FaerOf<&T>,
) -> <Self::Group as ForType>::FaerOf<T>where
T: Copy,
fn faer_rb<'short, T>(
value: <Self::Group as ForType>::FaerOf<&'short T>,
) -> <Self::Group as ForType>::FaerOf<<T as Reborrow<'short>>::Target>where
T: Reborrow<'short>,
fn faer_rb_mut<'short, T>(
value: <Self::Group as ForType>::FaerOf<&'short mut T>,
) -> <Self::Group as ForType>::FaerOf<<T as ReborrowMut<'short>>::Target>where
T: ReborrowMut<'short>,
fn faer_into_const<T>(
value: <Self::Group as ForType>::FaerOf<T>,
) -> <Self::Group as ForType>::FaerOf<<T as IntoConst>::Target>where
T: IntoConst,
fn faer_copy<T>(
x: &<Self::Group as ForType>::FaerOf<T>,
) -> <Self::Group as ForType>::FaerOf<T>where
T: Copy,
source§impl MulAssign<c32conj> for c32
impl MulAssign<c32conj> for c32
source§fn mul_assign(&mut self, rhs: c32conj)
fn mul_assign(&mut self, rhs: c32conj)
Performs the
*= operation. Read moresource§impl PartialEq for c32conj
impl PartialEq for c32conj
source§impl RemAssign<c32conj> for c32
impl RemAssign<c32conj> for c32
source§fn rem_assign(&mut self, rhs: c32conj)
fn rem_assign(&mut self, rhs: c32conj)
Performs the
%= operation. Read moresource§impl SubAssign<c32conj> for c32
impl SubAssign<c32conj> for c32
source§fn sub_assign(&mut self, rhs: c32conj)
fn sub_assign(&mut self, rhs: c32conj)
Performs the
-= operation. Read moreimpl Copy for c32conj
impl Pod for c32conj
impl StructuralPartialEq for c32conj
Auto Trait Implementations§
impl Freeze for c32conj
impl RefUnwindSafe for c32conj
impl Send for c32conj
impl Sync for c32conj
impl Unpin for c32conj
impl UnwindSafe for c32conj
Blanket Implementations§
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
Mutably borrows from an owned value. Read more
source§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.source§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self.source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)source§impl<T> CloneToUninit for Twhere
T: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)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> ⓘ
Converts
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> ⓘ
Converts
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