pub struct Pert<F>{ /* private fields */ }Expand description
The PERT distribution.
Similar to the Triangular distribution, the PERT distribution is
parameterised by a range and a mode within that range. Unlike the
Triangular distribution, the probability density function of the PERT
distribution is smooth, with a configurable weighting around the mode.
§Example
use rand_distr::{Pert, Distribution};
let d = Pert::new(0., 5., 2.5).unwrap();
let v = d.sample(&mut rand::thread_rng());
println!("{} is from a PERT distribution", v);Implementations§
Source§impl<F> Pert<F>
impl<F> Pert<F>
Sourcepub fn new(min: F, max: F, mode: F) -> Result<Pert<F>, PertError>
pub fn new(min: F, max: F, mode: F) -> Result<Pert<F>, PertError>
Set up the PERT distribution with defined min, max and mode.
This is equivalent to calling Pert::new_shape with shape == 4.0.
Sourcepub fn new_with_shape(
min: F,
max: F,
mode: F,
shape: F,
) -> Result<Pert<F>, PertError>
pub fn new_with_shape( min: F, max: F, mode: F, shape: F, ) -> Result<Pert<F>, PertError>
Set up the PERT distribution with defined min, max, mode and
shape.
Trait Implementations§
Source§impl<F> Clone for Pert<F>where
F: Clone + Float,
StandardNormal: Distribution<F>,
Exp1: Distribution<F>,
Open01: Distribution<F>,
impl<F> Clone for Pert<F>where
F: Clone + Float,
StandardNormal: Distribution<F>,
Exp1: Distribution<F>,
Open01: Distribution<F>,
Source§impl<F> Debug for Pert<F>where
F: Debug + Float,
StandardNormal: Distribution<F>,
Exp1: Distribution<F>,
Open01: Distribution<F>,
impl<F> Debug for Pert<F>where
F: Debug + Float,
StandardNormal: Distribution<F>,
Exp1: Distribution<F>,
Open01: Distribution<F>,
Source§impl<F> Distribution<F> for Pert<F>
impl<F> Distribution<F> for Pert<F>
impl<F> Copy for Pert<F>where
F: Copy + Float,
StandardNormal: Distribution<F>,
Exp1: Distribution<F>,
Open01: Distribution<F>,
Auto Trait Implementations§
impl<F> Freeze for Pert<F>where
F: Freeze,
impl<F> RefUnwindSafe for Pert<F>where
F: RefUnwindSafe,
impl<F> Send for Pert<F>where
F: Send,
impl<F> Sync for Pert<F>where
F: Sync,
impl<F> Unpin for Pert<F>where
F: Unpin,
impl<F> UnwindSafe for Pert<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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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
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.