pub(super) struct Inputs<const N: usize> {
pub(super) dim: usize,
pub(super) axes: [usize; 3],
pub(super) k: Jet<N>,
pub(super) r: [Jet<N>; 3],
pub(super) kpar: [Jet<N>; 3],
pub(super) direct: [[Jet<N>; 3]; 3],
pub(super) reciprocal: [[Jet<N>; 3]; 3],
pub(super) measure: Jet<N>,
}Expand description
The inputs of one sum as jets in the slots above (or constants for the split derivative), in lattice coordinates except for the Cartesian shift.
Fields§
§dim: usize§axes: [usize; 3]Cartesian axis of each lattice coordinate.
k: Jet<N>§r: [Jet<N>; 3]§kpar: [Jet<N>; 3]§direct: [[Jet<N>; 3]; 3]§reciprocal: [[Jet<N>; 3]; 3]Reciprocal rows; a_i · b_j = 2π δ_ij gives their vector derivatives.
measure: Jet<N>Cell measure |det a|.
Implementations§
Source§impl<const N: usize> Inputs<N>
impl<const N: usize> Inputs<N>
Sourcepub(super) fn new(
wave: Family,
k: Complex,
lattice: &BlochLattice,
r: [f64; 3],
variable: bool,
with_reciprocal: bool,
) -> Self
pub(super) fn new( wave: Family, k: Complex, lattice: &BlochLattice, r: [f64; 3], variable: bool, with_reciprocal: bool, ) -> Self
Without with_reciprocal the reciprocal rows and the measure, which only the Ewald
parts read, stay zero: the direct shells skip their jets. Always inlined, so the
caller builds the inputs in its own frame instead of copying a returned value.
Sourcepub(super) fn point(&self, rows: &[[Jet<N>; 3]; 3], n: [i64; 3]) -> [Jet<N>; 3]
pub(super) fn point(&self, rows: &[[Jet<N>; 3]; 3], n: [i64; 3]) -> [Jet<N>; 3]
Integer combination Σ_i n_i rows_i of lattice rows.
Sourcepub(super) fn combination(
&self,
rows: &[[Jet<N>; 3]; 3],
c: [f64; 3],
) -> [Jet<N>; 3]
pub(super) fn combination( &self, rows: &[[Jet<N>; 3]; 3], c: [f64; 3], ) -> [Jet<N>; 3]
Combination Σ_i c_i rows_i of lattice rows with integer-valued c.
Sourcepub(super) fn reduce(
&self,
rows: &[[Jet<N>; 3]; 3],
reduction: Option<&Reduction>,
) -> [[Jet<N>; 3]; 3]
pub(super) fn reduce( &self, rows: &[[Jet<N>; 3]; 3], reduction: Option<&Reduction>, ) -> [[Jet<N>; 3]; 3]
The reduced rows U rows, or rows when they are reduced already.
Auto Trait Implementations§
impl<const N: usize> Freeze for Inputs<N>
impl<const N: usize> RefUnwindSafe for Inputs<N>
impl<const N: usize> Send for Inputs<N>
impl<const N: usize> Sync for Inputs<N>
impl<const N: usize> Unpin for Inputs<N>
impl<const N: usize> UnwindSafe for Inputs<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.