pub enum SmoothFunctional<'a> {
PointEvaluation {
design_row: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>,
},
AverageDerivative {
derivative_design: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 2]>>,
weights: Option<ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>>,
},
Contrast {
design_row_a: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>,
design_row_b: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>,
},
AverageValue {
value_design: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 2]>>,
weights: Option<ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>>,
},
Linear {
gradient: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>,
},
}Expand description
Functional descriptor for the Layer-1 closed-form path. All variants are linear in the fitted coefficient vector.
Variants§
PointEvaluation
m(x0), represented by the prediction/design row at x0.
AverageDerivative
mean_i w_i * d m(x_i) / d x_j, represented by derivative-basis rows.
Fields
Contrast
m(x_a) - m(x_b), represented by the two prediction design rows.
Fields
AverageValue
mean_i w_i * m(x_i), represented by value-basis rows.
Fields
Linear
Direct caller-supplied linear functional gradient.
Implementations§
Auto Trait Implementations§
impl<'a> Freeze for SmoothFunctional<'a>
impl<'a> RefUnwindSafe for SmoothFunctional<'a>
impl<'a> Send for SmoothFunctional<'a>
impl<'a> Sync for SmoothFunctional<'a>
impl<'a> Unpin for SmoothFunctional<'a>
impl<'a> UnsafeUnpin for SmoothFunctional<'a>
impl<'a> UnwindSafe for SmoothFunctional<'a>
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> 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.