struct ReciprocalSummands<'a, const N: usize> {
wave: Family,
inputs: &'a Inputs<N>,
rows: &'a [[Jet<N>; 3]; 3],
kpar: &'a [Jet<N>; 3],
kpar_reduced: bool,
eta: Complex,
split: &'a Split,
shared: Option<&'a SphericalCache<N>>,
index: Cell<usize>,
}Expand description
What the reciprocal-space terms of one sum read.
Fields§
§wave: Family§inputs: &'a Inputs<N>§rows: &'a [[Jet<N>; 3]; 3]The reduced reciprocal rows.
kpar: &'a [Jet<N>; 3]The Bloch vector reduced into a cell of rows.
kpar_reduced: boolWhether the reduction moved the Bloch vector.
eta: Complex§split: &'a Split§index: Cell<usize>Implementations§
Source§impl<const N: usize> ReciprocalSummands<'_, N>
impl<const N: usize> ReciprocalSummands<'_, N>
Sourcefn at(&self, n: [i64; 3], rounding: &mut Rounding<N>) -> Result<Jet<N>>
fn at(&self, n: [i64; 3], rounding: &mut Rounding<N>) -> Result<Jet<N>>
The reciprocal-space term at the reciprocal lattice point with the coordinates
n, adding its absolute rounding bounds in units of epsilon to rounding. Always
inlined: it is the body of the term loop of Shells::sum.
Sourcefn prepare(&self, n: [i64; 3]) -> Result<SphericalReciprocalSample<N>>
fn prepare(&self, n: [i64; 3]) -> Result<SphericalReciprocalSample<N>>
Geometry, threshold argument and Bloch phase shared by all spherical orders.
fn term( &self, diffraction: Diffraction<N>, phase: Jet<N>, rounding: &mut Rounding<N>, plane_integrals: Option<&mut Vec<Option<Complex>>>, ) -> Result<Jet<N>>
Auto Trait Implementations§
impl<'a, const N: usize> !Freeze for ReciprocalSummands<'a, N>
impl<'a, const N: usize> !RefUnwindSafe for ReciprocalSummands<'a, N>
impl<'a, const N: usize> !Send for ReciprocalSummands<'a, N>
impl<'a, const N: usize> !Sync for ReciprocalSummands<'a, N>
impl<'a, const N: usize> Unpin for ReciprocalSummands<'a, N>
impl<'a, const N: usize> !UnwindSafe for ReciprocalSummands<'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.