pub struct PeriodicResidual {
top: DMatrix<Complex>,
reflection: DMatrix<Complex>,
solve: SolveResidual,
}Expand description
What periodic() saves for its pullback: the upper rows of the transfer matrix, the
reflection block S10 and the solve with S11.
Fields§
§top: DMatrix<Complex>§reflection: DMatrix<Complex>§solve: SolveResidualImplementations§
Source§impl PeriodicResidual
impl PeriodicResidual
Sourcepub fn state_size(n: usize) -> Result<usize>
pub fn state_size(n: usize) -> Result<usize>
Byte count for saved transfer-matrix state with n modes per direction.
Source§impl PeriodicResidual
impl PeriodicResidual
Trait Implementations§
Source§impl Debug for PeriodicResidual
impl Debug for PeriodicResidual
Source§impl SavedState for PeriodicResidual
impl SavedState for PeriodicResidual
Auto Trait Implementations§
impl Freeze for PeriodicResidual
impl RefUnwindSafe for PeriodicResidual
impl Send for PeriodicResidual
impl Sync for PeriodicResidual
impl Unpin for PeriodicResidual
impl UnwindSafe for PeriodicResidual
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.