pub struct TermCollectionDerivativeDesign {
pub design: Array2<f64>,
pub affine_offset: Array1<f64>,
}Expand description
Exact analytic derivative of an affine term-collection realization.
Fields§
§design: Array2<f64>∂design(x)/∂x_c, aligned column-for-column with the value design.
affine_offset: Array1<f64>∂affine_offset(x)/∂x_c on the same rows.
Implementations§
Source§impl TermCollectionDerivativeDesign
impl TermCollectionDerivativeDesign
Sourcepub fn apply(
&self,
beta: ArrayView1<'_, f64>,
) -> Result<Array1<f64>, BasisError>
pub fn apply( &self, beta: ArrayView1<'_, f64>, ) -> Result<Array1<f64>, BasisError>
Evaluate ∂affine_offset/∂x_c + (∂design/∂x_c) * beta.
Trait Implementations§
Source§impl Clone for TermCollectionDerivativeDesign
impl Clone for TermCollectionDerivativeDesign
Source§fn clone(&self) -> TermCollectionDerivativeDesign
fn clone(&self) -> TermCollectionDerivativeDesign
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for TermCollectionDerivativeDesign
impl RefUnwindSafe for TermCollectionDerivativeDesign
impl Send for TermCollectionDerivativeDesign
impl Sync for TermCollectionDerivativeDesign
impl Unpin for TermCollectionDerivativeDesign
impl UnsafeUnpin for TermCollectionDerivativeDesign
impl UnwindSafe for TermCollectionDerivativeDesign
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.