Struct MorrisDesign 

pub struct MorrisDesign { /* private fields */ }

The points of a Morris screening, path after path, each path’s k + 1 points in order. It is not serialized: Morris::design rebuilds it, bit for bit, from the screening and its seed.

Implementations

impl MorrisDesign

pub fn paths(&self) -> &[Path]

The paths.

pub fn len(&self) -> usize

The number of points, r (k + 1).

pub fn is_empty(&self) -> bool

Whether there are no points; never, as a screening has at least two paths.

pub fn points(&self) -> Vec<Vec<f64>>

The points, in physical units, path after path: each path’s start, then the point after each step in its order.

pub fn analyze(&self, outputs: &[f64]) -> Result<Screening, AnalysisError>

Each factor’s elementary effects from outputs, the model’s output at each of MorrisDesign::points in order. A step up of factor i from point x to x′ gives (y(x′) − y(x))/Δ, a step down (y(x) − y(x′))/Δ, so either is the effect at the lower point.

Errors

• AnalysisError::Length unless there is one output per point.
• AnalysisError::Output for an output that isn’t finite.

Trait Implementations

impl Clone for MorrisDesign

fn clone(&self) -> MorrisDesign

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MorrisDesign

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for MorrisDesign

fn eq(&self, other: &MorrisDesign) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for MorrisDesign