pub struct SumGradient {
pub k: Complex,
pub eta: Complex,
pub shift: [f64; 3],
pub kpar: [f64; 3],
pub vectors: [[f64; 3]; 3],
}Expand description
Cotangents of the continuous Ewald parameters under the real Hermitian pairing.
The fields run (k, eta, shift, kpar, vectors); treams_rs.diff.lattice_sum returns
the same cotangents in the treams argument order (k, kpar, a, r, eta).
Fields§
§k: ComplexComplex wavenumber cotangent.
eta: ComplexComplex split cotangent; zero for the full and direct sums.
shift: [f64; 3]Real shift cotangents.
kpar: [f64; 3]Real Bloch cotangents in the lattice frame of BlochLattice.
vectors: [[f64; 3]; 3]Real row lattice-vector cotangents in the lattice frame.
Implementations§
Source§impl SumGradient
impl SumGradient
Trait Implementations§
Source§impl Clone for SumGradient
impl Clone for SumGradient
Source§fn clone(&self) -> SumGradient
fn clone(&self) -> SumGradient
Returns a duplicate 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 Debug for SumGradient
impl Debug for SumGradient
Source§impl Default for SumGradient
impl Default for SumGradient
Source§fn default() -> SumGradient
fn default() -> SumGradient
Returns the “default value” for a type. Read more
impl Copy for SumGradient
Auto Trait Implementations§
impl Freeze for SumGradient
impl RefUnwindSafe for SumGradient
impl Send for SumGradient
impl Sync for SumGradient
impl Unpin for SumGradient
impl UnwindSafe for SumGradient
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.