Struct faer_entity::complex_split::ComplexConj
source · #[repr(C)]pub struct ComplexConj<T> {
pub re: T,
pub neg_im: T,
}Expand description
This structure contains the real and imaginary parts of an implicitly conjugated value.
Fields§
§re: T§neg_im: TTrait Implementations§
source§impl<T: Clone> Clone for ComplexConj<T>
impl<T: Clone> Clone for ComplexConj<T>
source§fn clone(&self) -> ComplexConj<T>
fn clone(&self) -> ComplexConj<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl<E: Entity + ComplexField> Conjugate for ComplexConj<E>
impl<E: Entity + ComplexField> Conjugate for ComplexConj<E>
§type Conj = Complex<E>
type Conj = Complex<E>
Must have the same layout as
Self, and Conj::Unit must have the same layout as Unit.§type Canonical = Complex<E>
type Canonical = Complex<E>
Must have the same layout as
Self, and Canonical::Unit must have the same layout as
Unit.source§fn canonicalize(self) -> Self::Canonical
fn canonicalize(self) -> Self::Canonical
Performs the implicit conjugation operation on the given value, returning the canonical
form.
source§impl<T: Debug> Debug for ComplexConj<T>
impl<T: Debug> Debug for ComplexConj<T>
source§impl<E: Entity> Entity for ComplexConj<E>
impl<E: Entity> Entity for ComplexConj<E>
type Unit = <E as Entity>::Unit
type Index = <E as Entity>::Index
type SimdUnit<S: Simd> = <E as Entity>::SimdUnit<S>
type SimdMask<S: Simd> = <E as Entity>::SimdMask<S>
type SimdIndex<S: Simd> = <E as Entity>::SimdIndex<S>
type Group = ComplexConjGroup<<E as Entity>::Group>
type Iter<I: Iterator> = ComplexConjIter<<E as Entity>::Iter<I>>
type PrefixUnit<'a, S: Simd> = <E as Entity>::PrefixUnit<'a, S>
type SuffixUnit<'a, S: Simd> = <E as Entity>::SuffixUnit<'a, S>
type PrefixMutUnit<'a, S: Simd> = <E as Entity>::PrefixMutUnit<'a, S>
type SuffixMutUnit<'a, S: Simd> = <E as Entity>::SuffixMutUnit<'a, S>
const N_COMPONENTS: usize = _
const UNIT: GroupFor<Self, ()> = _
fn faer_first<T>(group: GroupFor<Self, T>) -> T
fn faer_from_units(group: GroupFor<Self, UnitFor<Self>>) -> Self
fn faer_into_units(self) -> GroupFor<Self, UnitFor<Self>>
fn faer_as_ref<T>(group: &GroupFor<Self, T>) -> GroupFor<Self, &T>
fn faer_as_mut<T>(group: &mut GroupFor<Self, T>) -> GroupFor<Self, &mut T>
fn faer_as_ptr<T>(group: *mut GroupFor<Self, T>) -> GroupFor<Self, *mut T>
fn faer_map_impl<T, U>( group: GroupFor<Self, T>, f: &mut impl FnMut(T) -> U ) -> GroupFor<Self, U>
fn faer_map_with_context<Ctx, T, U>( ctx: Ctx, group: GroupFor<Self, T>, f: &mut impl FnMut(Ctx, T) -> (Ctx, U) ) -> (Ctx, GroupFor<Self, U>)
fn faer_zip<T, U>( first: GroupFor<Self, T>, second: GroupFor<Self, U> ) -> GroupFor<Self, (T, U)>
fn faer_unzip<T, U>( zipped: GroupFor<Self, (T, U)> ) -> (GroupFor<Self, T>, GroupFor<Self, U>)
fn faer_into_iter<I: IntoIterator>( iter: GroupFor<Self, I> ) -> Self::Iter<I::IntoIter>
fn faer_map<T, U>( group: GroupFor<Self, T>, f: impl FnMut(T) -> U ) -> GroupFor<Self, U>
fn faer_unzip2<T>(zipped: GroupFor<Self, [T; 2]>) -> [GroupFor<Self, T>; 2]
fn faer_unzip4<T>(zipped: GroupFor<Self, [T; 4]>) -> [GroupFor<Self, T>; 4]
fn faer_unzip8<T>(zipped: GroupFor<Self, [T; 8]>) -> [GroupFor<Self, T>; 8]
fn faer_as_arrays<const N: usize, T>( group: GroupFor<Self, &[T]> ) -> (GroupFor<Self, &[[T; N]]>, GroupFor<Self, &[T]>)
fn faer_as_arrays_mut<const N: usize, T>( group: GroupFor<Self, &mut [T]> ) -> (GroupFor<Self, &mut [[T; N]]>, GroupFor<Self, &mut [T]>)
fn faer_deref<T: Copy>(group: GroupFor<Self, &T>) -> GroupFor<Self, T>
fn faer_rb<'short, T: Reborrow<'short>>( value: GroupFor<Self, &'short T> ) -> GroupFor<Self, T::Target>
fn faer_rb_mut<'short, T: ReborrowMut<'short>>( value: GroupFor<Self, &'short mut T> ) -> GroupFor<Self, T::Target>
fn faer_into_const<T: IntoConst>( value: GroupFor<Self, T> ) -> GroupFor<Self, T::Target>
fn faer_copy<T: Copy>(x: &GroupFor<Self, T>) -> GroupFor<Self, T>
source§impl<T: PartialEq> PartialEq for ComplexConj<T>
impl<T: PartialEq> PartialEq for ComplexConj<T>
source§fn eq(&self, other: &ComplexConj<T>) -> bool
fn eq(&self, other: &ComplexConj<T>) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl<T: Zeroable> Zeroable for ComplexConj<T>
impl<T: Zeroable> Zeroable for ComplexConj<T>
impl<T: Copy> Copy for ComplexConj<T>
impl<T: Eq> Eq for ComplexConj<T>
impl<T: Pod> Pod for ComplexConj<T>
impl<T> StructuralPartialEq for ComplexConj<T>
Auto Trait Implementations§
impl<T> Freeze for ComplexConj<T>where
T: Freeze,
impl<T> RefUnwindSafe for ComplexConj<T>where
T: RefUnwindSafe,
impl<T> Send for ComplexConj<T>where
T: Send,
impl<T> Sync for ComplexConj<T>where
T: Sync,
impl<T> Unpin for ComplexConj<T>where
T: Unpin,
impl<T> UnwindSafe for ComplexConj<T>where
T: UnwindSafe,
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.