struct Column<'a, const N: usize> {
from: Mode,
k: Complex,
helicity: bool,
destination: &'a [[f64; 3]],
source: [f64; 3],
coefficients: HashMap<Mode, Jet<N>>,
translations: HashMap<(usize, i32), CartesianTranslation>,
}Expand description
The entries of one source column. Angular coefficients depend only on the destination mode label and translations only on the destination position and order, so each is evaluated once per column and shared by the modes of every destination position, degree and polarization.
Fields§
§from: Mode§k: Complex§helicity: bool§destination: &'a [[f64; 3]]§source: [f64; 3]§coefficients: HashMap<Mode, Jet<N>>§translations: HashMap<(usize, i32), CartesianTranslation>Implementations§
Auto Trait Implementations§
impl<'a, const N: usize> Freeze for Column<'a, N>
impl<'a, const N: usize> RefUnwindSafe for Column<'a, N>
impl<'a, const N: usize> Send for Column<'a, N>
impl<'a, const N: usize> Sync for Column<'a, N>
impl<'a, const N: usize> Unpin for Column<'a, N>
impl<'a, const N: usize> UnwindSafe for Column<'a, N>
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> 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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.