pub struct MorrisAnalyzer<F: Float + Debug> { /* private fields */ }Expand description
Morris Elementary Effects analyzer.
Implementations§
Source§impl<F: Float + Debug> MorrisAnalyzer<F>
impl<F: Float + Debug> MorrisAnalyzer<F>
Sourcepub fn with_trajectories(self, r: usize) -> Self
pub fn with_trajectories(self, r: usize) -> Self
Set the number of independent trajectories r.
Sourcepub fn with_levels(self, p: usize) -> Self
pub fn with_levels(self, p: usize) -> Self
Set the grid resolution p. Must be even and >= 2.
Sourcepub fn n_trajectories(&self) -> usize
pub fn n_trajectories(&self) -> usize
Number of trajectories used per analysis.
Sourcepub fn last_indices(&self) -> Option<&MorrisIndices<F>>
pub fn last_indices(&self) -> Option<&MorrisIndices<F>>
Cached indices from the last analysis.
Sourcepub fn analyze_morris(
&mut self,
model: &dyn Fn(&Array1<F>) -> F,
bounds: &[(F, F)],
) -> Result<MorrisIndices<F>>
pub fn analyze_morris( &mut self, model: &dyn Fn(&Array1<F>) -> F, bounds: &[(F, F)], ) -> Result<MorrisIndices<F>>
Run the analysis and store the result on the analyzer.
Trait Implementations§
Source§impl<F: Float + Debug> SensitivityAnalyzer<F> for MorrisAnalyzer<F>
impl<F: Float + Debug> SensitivityAnalyzer<F> for MorrisAnalyzer<F>
Auto Trait Implementations§
impl<F> Freeze for MorrisAnalyzer<F>
impl<F> RefUnwindSafe for MorrisAnalyzer<F>where
F: RefUnwindSafe,
impl<F> Send for MorrisAnalyzer<F>where
F: Send,
impl<F> Sync for MorrisAnalyzer<F>where
F: Sync,
impl<F> Unpin for MorrisAnalyzer<F>where
F: Unpin,
impl<F> UnsafeUnpin for MorrisAnalyzer<F>
impl<F> UnwindSafe for MorrisAnalyzer<F>where
F: 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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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.