pub struct LatticeExpansionFromTableResidual {
destination: Basis,
source: Basis,
helicity: bool,
blocks: Vec<Block>,
table_shape: [usize; 4],
shape: (usize, usize),
}Expand description
What lattice_expansion_from_table saves for its pullback: the sparse angular
weights, never the table values. The pullback runs in block order and gives the same
result every run.
Fields§
§destination: Basis§source: Basis§helicity: bool§blocks: Vec<Block>§table_shape: [usize; 4]§shape: (usize, usize)Implementations§
Source§impl LatticeExpansionFromTableResidual
impl LatticeExpansionFromTableResidual
Sourcepub fn pushforward(&self, tangent: &[Complex]) -> Result<DMatrix<Complex>>
pub fn pushforward(&self, tangent: &[Complex]) -> Result<DMatrix<Complex>>
The same sparse linear angular map applied to the table direction.
Sourcefn apply_table(&self, tangent: &[Complex]) -> Result<DMatrix<Complex>>
fn apply_table(&self, tangent: &[Complex]) -> Result<DMatrix<Complex>>
Values and directions use one sparse linear contraction.
Sourcepub const fn shape(&self) -> (usize, usize)
pub const fn shape(&self) -> (usize, usize)
Destination and source mode counts: the shape of the coupling matrix.
Sourcepub const fn table_shape(&self) -> [usize; 4]
pub const fn table_shape(&self) -> [usize; 4]
The shape of the normalized harmonic table, which is also the shape of the table gradient.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LatticeExpansionFromTableResidual
impl RefUnwindSafe for LatticeExpansionFromTableResidual
impl Send for LatticeExpansionFromTableResidual
impl Sync for LatticeExpansionFromTableResidual
impl Unpin for LatticeExpansionFromTableResidual
impl UnwindSafe for LatticeExpansionFromTableResidual
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.