pub struct Ranged<Inner, Range> {
pub inner: Inner,
pub range: Range,
}
Expand description
Model filtering the inner
model to a certain argument range
.
Fields§
§inner: Inner
§range: Range
Trait Implementations§
Source§impl<Inner, Range> FitModel for Ranged<Inner, Range>
impl<Inner, Range> FitModel for Ranged<Inner, Range>
Source§type Scalar = <Inner as FitModel>::Scalar
type Scalar = <Inner as FitModel>::Scalar
Type of
x
, y
, model parameters and all the derivatives. Different types are not supported (yet)Source§type ParamCount = <Inner as FitModel>::ParamCount
type ParamCount = <Inner as FitModel>::ParamCount
Type representing number of parameters. Read more
Source§fn evaluate(&self, x: &Self::Scalar) -> Self::Scalar
fn evaluate(&self, x: &Self::Scalar) -> Self::Scalar
Computes model value for supplied
x
value and current parameters.Source§fn jacobian(
&self,
x: &Self::Scalar,
) -> impl Into<GenericArray<Self::Scalar, <Self::ParamCount as Conv>::TNum>>
fn jacobian( &self, x: &Self::Scalar, ) -> impl Into<GenericArray<Self::Scalar, <Self::ParamCount as Conv>::TNum>>
Computes jacobian (array of derivatives) for supplied
x
value and current parameters. Read moreSource§fn set_params(
&mut self,
new_params: GenericArray<Self::Scalar, <Self::ParamCount as Conv>::TNum>,
)
fn set_params( &mut self, new_params: GenericArray<Self::Scalar, <Self::ParamCount as Conv>::TNum>, )
Sets model parameters to ones contained in a generic array Read more
Source§fn get_params(
&self,
) -> impl Into<GenericArray<Self::Scalar, <Self::ParamCount as Conv>::TNum>>
fn get_params( &self, ) -> impl Into<GenericArray<Self::Scalar, <Self::ParamCount as Conv>::TNum>>
Returns current values of model params. Read more
Source§impl<Inner, Range> FitModelXDeriv for Ranged<Inner, Range>
impl<Inner, Range> FitModelXDeriv for Ranged<Inner, Range>
Source§impl<Inner: Ord, Range: Ord> Ord for Ranged<Inner, Range>
impl<Inner: Ord, Range: Ord> Ord for Ranged<Inner, Range>
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl<Inner: PartialOrd, Range: PartialOrd> PartialOrd for Ranged<Inner, Range>
impl<Inner: PartialOrd, Range: PartialOrd> PartialOrd for Ranged<Inner, Range>
impl<Inner: Copy, Range: Copy> Copy for Ranged<Inner, Range>
impl<Inner: Eq, Range: Eq> Eq for Ranged<Inner, Range>
impl<Inner, Range> StructuralPartialEq for Ranged<Inner, Range>
Auto Trait Implementations§
impl<Inner, Range> Freeze for Ranged<Inner, Range>
impl<Inner, Range> RefUnwindSafe for Ranged<Inner, Range>where
Inner: RefUnwindSafe,
Range: RefUnwindSafe,
impl<Inner, Range> Send for Ranged<Inner, Range>
impl<Inner, Range> Sync for Ranged<Inner, Range>
impl<Inner, Range> Unpin for Ranged<Inner, Range>
impl<Inner, Range> UnwindSafe for Ranged<Inner, Range>where
Inner: UnwindSafe,
Range: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Inner> CompositionExt for Innerwhere
Inner: FitModel,
impl<Inner> CompositionExt for Innerwhere
Inner: FitModel,
Source§fn compose<Outer>(self, outer: Outer) -> Composition<Inner, Outer>
fn compose<Outer>(self, outer: Outer) -> Composition<Inner, Outer>
Applies second model on top of current one.
§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.