Struct c64conj
pub struct c64conj {
pub re: f64,
pub neg_im: f64,
}
Expand description
64-bit implicitly conjugated complex floating point type.
Fields§
§re: f64
Real part.
neg_im: f64
Negated imaginary part.
Trait Implementations§
§impl AddAssign<c64conj> for c64
impl AddAssign<c64conj> for c64
§fn add_assign(&mut self, rhs: c64conj)
fn add_assign(&mut self, rhs: c64conj)
Performs the
+=
operation. Read more§impl Conjugate for c64conj
impl Conjugate for c64conj
§type Conj = c64
type Conj = c64
Must have the same layout as
Self
, and Conj::Unit
must have the same layout as Unit
.§type Canonical = c64
type Canonical = c64
Must have the same layout as
Self
, and Canonical::Unit
must have the same layout as
Unit
.§fn canonicalize(self) -> <c64conj as Conjugate>::Canonical
fn canonicalize(self) -> <c64conj as Conjugate>::Canonical
Performs the implicit conjugation operation on the given value, returning the canonical
form.
§impl DivAssign<c64conj> for c64
impl DivAssign<c64conj> for c64
§fn div_assign(&mut self, rhs: c64conj)
fn div_assign(&mut self, rhs: c64conj)
Performs the
/=
operation. Read more§impl Entity for c64conj
impl Entity for c64conj
const N_COMPONENTS: usize = 1usize
const UNIT: <<c64conj as Entity>::Group as ForCopyType>::FaerOfCopy<()> = ()
type Unit = c64conj
type Index = u64
type SimdUnit<S: Simd> = <S as Simd>::c64s
type SimdMask<S: Simd> = <S as Simd>::m64s
type SimdIndex<S: Simd> = <S as Simd>::u64s
type Group = IdentityGroup
type Iter<I: Iterator> = I
type PrefixUnit<'a, S: Simd> = Prefix<'a, Complex<f64>, S, <S as Simd>::m64s>
type SuffixUnit<'a, S: Simd> = Suffix<'a, Complex<f64>, S, <S as Simd>::m64s>
type PrefixMutUnit<'a, S: Simd> = PrefixMut<'a, Complex<f64>, S, <S as Simd>::m64s>
type SuffixMutUnit<'a, S: Simd> = SuffixMut<'a, Complex<f64>, S, <S as Simd>::m64s>
fn faer_first<T>(group: <<c64conj as Entity>::Group as ForType>::FaerOf<T>) -> T
fn faer_from_units( group: <<c64conj as Entity>::Group as ForType>::FaerOf<<c64conj as Entity>::Unit>, ) -> c64conj
fn faer_into_units( self, ) -> <<c64conj as Entity>::Group as ForType>::FaerOf<<c64conj as Entity>::Unit>
fn faer_as_ref<T>( group: &<<c64conj as Entity>::Group as ForType>::FaerOf<T>, ) -> <<c64conj as Entity>::Group as ForType>::FaerOf<&T>
fn faer_as_mut<T>( group: &mut <<c64conj as Entity>::Group as ForType>::FaerOf<T>, ) -> <<c64conj as Entity>::Group as ForType>::FaerOf<&mut T>
fn faer_as_ptr<T>( group: *mut <<c64conj as Entity>::Group as ForType>::FaerOf<T>, ) -> <<c64conj as Entity>::Group as ForType>::FaerOf<*mut T>
fn faer_map_impl<T, U>( group: <<c64conj as Entity>::Group as ForType>::FaerOf<T>, f: &mut impl FnMut(T) -> U, ) -> <<c64conj as Entity>::Group as ForType>::FaerOf<U>
fn faer_map_with_context<Ctx, T, U>( ctx: Ctx, group: <<c64conj as Entity>::Group as ForType>::FaerOf<T>, f: &mut impl FnMut(Ctx, T) -> (Ctx, U), ) -> (Ctx, <<c64conj as Entity>::Group as ForType>::FaerOf<U>)
fn faer_zip<T, U>( first: <<c64conj as Entity>::Group as ForType>::FaerOf<T>, second: <<c64conj as Entity>::Group as ForType>::FaerOf<U>, ) -> <<c64conj as Entity>::Group as ForType>::FaerOf<(T, U)>
fn faer_unzip<T, U>( zipped: <<c64conj as Entity>::Group as ForType>::FaerOf<(T, U)>, ) -> (<<c64conj as Entity>::Group as ForType>::FaerOf<T>, <<c64conj as Entity>::Group as ForType>::FaerOf<U>)
fn faer_into_iter<I>(
iter: <<c64conj as Entity>::Group as ForType>::FaerOf<I>,
) -> <c64conj 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,
§impl MulAssign<c64conj> for c64
impl MulAssign<c64conj> for c64
§fn mul_assign(&mut self, rhs: c64conj)
fn mul_assign(&mut self, rhs: c64conj)
Performs the
*=
operation. Read more§impl RemAssign<c64conj> for c64
impl RemAssign<c64conj> for c64
§fn rem_assign(&mut self, rhs: c64conj)
fn rem_assign(&mut self, rhs: c64conj)
Performs the
%=
operation. Read more§impl SubAssign<c64conj> for c64
impl SubAssign<c64conj> for c64
§fn sub_assign(&mut self, rhs: c64conj)
fn sub_assign(&mut self, rhs: c64conj)
Performs the
-=
operation. Read moreimpl Copy for c64conj
impl Pod for c64conj
impl StructuralPartialEq for c64conj
Auto Trait Implementations§
impl Freeze for c64conj
impl RefUnwindSafe for c64conj
impl Send for c64conj
impl Sync for c64conj
impl Unpin for c64conj
impl UnwindSafe for c64conj
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
§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
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§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