pub struct FieldGradient {
pub coefficients: Vec<Complex>,
pub points: Vec<[f64; 3]>,
pub positions: Vec<[f64; 3]>,
pub ks: [Complex; 2],
}Expand description
Input gradients of a field or operator pullback, under the convention
dL = Re sum(conj(g) dx).
Fields§
§coefficients: Vec<Complex>Gradients of the complex mode coefficients; empty for OperatorResidual.
points: Vec<[f64; 3]>Gradients of the sample points.
positions: Vec<[f64; 3]>Gradients of the expansion centres of the basis.
ks: [Complex; 2]Gradients of the wavenumbers of polarizations 0 and 1 (negative and positive helicity).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for FieldGradient
impl RefUnwindSafe for FieldGradient
impl Send for FieldGradient
impl Sync for FieldGradient
impl Unpin for FieldGradient
impl UnwindSafe for FieldGradient
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.