blob: 13d7faceca337df81694ab9c710bf011e749e5e8 [file] [log] [blame]
// Copyright 2018 Developers of the Rand project.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
//! The PERT distribution.
use rand::Rng;
use crate::{Distribution, Beta};
/// 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
///
/// ```rust
/// 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);
/// ```
#[derive(Clone, Copy, Debug)]
pub struct Pert {
min: f64,
range: f64,
beta: Beta,
}
/// Error type returned from [`Pert`] constructors.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum PertError {
/// `max < min` or `min` or `max` is NaN.
RangeTooSmall,
/// `mode < min` or `mode > max` or `mode` is NaN.
ModeRange,
/// `shape < 0` or `shape` is NaN
ShapeTooSmall,
}
impl Pert {
/// Set up the PERT distribution with defined `min`, `max` and `mode`.
///
/// This is equivalent to calling `Pert::new_shape` with `shape == 4.0`.
#[inline]
pub fn new(min: f64, max: f64, mode: f64) -> Result<Pert, PertError> {
Pert::new_with_shape(min, max, mode, 4.)
}
/// Set up the PERT distribution with defined `min`, `max`, `mode` and
/// `shape`.
pub fn new_with_shape(min: f64, max: f64, mode: f64, shape: f64) -> Result<Pert, PertError> {
if !(max > min) {
return Err(PertError::RangeTooSmall);
}
if !(mode >= min && max >= mode) {
return Err(PertError::ModeRange);
}
if !(shape >= 0.) {
return Err(PertError::ShapeTooSmall);
}
let range = max - min;
let mu = (min + max + shape * mode) / (shape + 2.);
let v = if mu == mode {
shape * 0.5 + 1.
} else {
(mu - min) * (2. * mode - min - max)
/ ((mode - mu) * (max - min))
};
let w = v * (max - mu) / (mu - min);
let beta = Beta::new(v, w).map_err(|_| PertError::RangeTooSmall)?;
Ok(Pert{ min, range, beta })
}
}
impl Distribution<f64> for Pert {
#[inline]
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64 {
self.beta.sample(rng) * self.range + self.min
}
}
#[cfg(test)]
mod test {
use std::f64;
use super::*;
#[test]
fn test_pert() {
for &(min, max, mode) in &[
(-1., 1., 0.),
(1., 2., 1.),
(5., 25., 25.),
] {
let _distr = Pert::new(min, max, mode).unwrap();
// TODO: test correctness
}
for &(min, max, mode) in &[
(-1., 1., 2.),
(-1., 1., -2.),
(2., 1., 1.),
] {
assert!(Pert::new(min, max, mode).is_err());
}
}
#[test]
fn test_pert_vector() {
let rng = crate::test::rng(860);
let distr = Pert::new(2., 10., 3.).unwrap(); // mean = 4, var = 12/7
let seq = distr.sample_iter(rng).take(5).collect::<Vec<f64>>();
println!("seq: {:?}", seq);
let expected = vec![3.945192480331639, 4.571769050527243,
7.419819712922435, 4.049743197259167, 5.825644880531534];
assert!(seq == expected);
}
}