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 implicity 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<T> = ComplexConj<<E as Entity>::Group<T>>
type Group<T> = ComplexConj<<E as Entity>::Group<T>>
If
Group<()> == (), then that must imply Group<T> == T.type Iter<I: Iterator> = ComplexConjIter<<E as Entity>::Iter<I>>
const N_COMPONENTS: usize = _
const UNIT: Self::GroupCopy<()> = _
fn from_units(group: Self::Group<Self::Unit>) -> Self
fn into_units(self) -> Self::Group<Self::Unit>
fn as_ref<T>(group: &Self::Group<T>) -> Self::Group<&T>
fn as_mut<T>(group: &mut Self::Group<T>) -> Self::Group<&mut T>
fn map<T, U>(group: Self::Group<T>, f: impl FnMut(T) -> U) -> Self::Group<U>
fn map_with_context<Ctx, T, U>( ctx: Ctx, group: Self::Group<T>, f: impl FnMut(Ctx, T) -> (Ctx, U) ) -> (Ctx, Self::Group<U>)
fn zip<T, U>( first: Self::Group<T>, second: Self::Group<U> ) -> Self::Group<(T, U)>
fn unzip<T, U>(zipped: Self::Group<(T, U)>) -> (Self::Group<T>, Self::Group<U>)
fn into_iter<I: IntoIterator>(iter: Self::Group<I>) -> Self::Iter<I::IntoIter>
fn unzip2<T>(zipped: Self::Group<[T; 2]>) -> [Self::Group<T>; 2]
fn unzip4<T>(zipped: Self::Group<[T; 4]>) -> [Self::Group<T>; 4]
fn unzip8<T>(zipped: Self::Group<[T; 8]>) -> [Self::Group<T>; 8]
fn as_arrays<const N: usize, T>( group: Self::Group<&[T]> ) -> (Self::Group<&[[T; N]]>, Self::Group<&[T]>)
fn as_arrays_mut<const N: usize, T>( group: Self::Group<&mut [T]> ) -> (Self::Group<&mut [[T; N]]>, Self::Group<&mut [T]>)
fn deref<T: Copy>(group: Self::Group<&T>) -> Self::Group<T>
fn rb<'short, T: Reborrow<'short>>( value: Self::Group<&'short T> ) -> Self::Group<T::Target>
fn rb_mut<'short, T: ReborrowMut<'short>>( value: Self::Group<&'short mut T> ) -> Self::Group<T::Target>
fn into_const<T: IntoConst>(value: Self::Group<T>) -> Self::Group<T::Target>
fn from_copy<T: Copy>(group: Self::GroupCopy<T>) -> Self::Group<T>
fn into_copy<T: Copy>(group: Self::Group<T>) -> Self::GroupCopy<T>
fn map_copy<T: Copy, U: Copy>( group: Self::GroupCopy<T>, f: impl FnMut(T) -> U ) -> Self::GroupCopy<U>
fn copy<T: Copy>(group: &Self::Group<T>) -> Self::Group<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> StructuralEq for ComplexConj<T>
impl<T> StructuralPartialEq for ComplexConj<T>
Auto Trait Implementations§
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.