Struct statrs::distribution::Triangular
source · pub struct Triangular { /* private fields */ }
Expand description
Implements the Triangular distribution
Examples
use statrs::distribution::{Triangular, Continuous};
use statrs::statistics::Distribution;
let n = Triangular::new(0.0, 5.0, 2.5).unwrap();
assert_eq!(n.mean().unwrap(), 7.5 / 3.0);
assert_eq!(n.pdf(2.5), 5.0 / 12.5);
Implementations§
source§impl Triangular
impl Triangular
sourcepub fn new(min: f64, max: f64, mode: f64) -> Result<Triangular>
pub fn new(min: f64, max: f64, mode: f64) -> Result<Triangular>
Constructs a new triangular distribution with a minimum of min
,
maximum of max
, and a mode of mode
.
Errors
Returns an error if min
, max
, or mode
are NaN
or ±INF
.
Returns an error if max < mode
, mode < min
, or max == min
.
Examples
use statrs::distribution::Triangular;
let mut result = Triangular::new(0.0, 5.0, 2.5);
assert!(result.is_ok());
result = Triangular::new(2.5, 1.5, 0.0);
assert!(result.is_err());
Trait Implementations§
source§impl Clone for Triangular
impl Clone for Triangular
source§fn clone(&self) -> Triangular
fn clone(&self) -> Triangular
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Continuous<f64, f64> for Triangular
impl Continuous<f64, f64> for Triangular
source§impl ContinuousCDF<f64, f64> for Triangular
impl ContinuousCDF<f64, f64> for Triangular
source§fn inverse_cdf(&self, p: T) -> K
fn inverse_cdf(&self, p: T) -> K
Due to issues with rounding and floating-point accuracy the default
implementation may be ill-behaved.
Specialized inverse cdfs should be used whenever possible.
Performs a binary search on the domain of
cdf
to obtain an approximation
of F^-1(p) := inf { x | F(x) >= p }
. Needless to say, performance may
may be lacking.source§impl Debug for Triangular
impl Debug for Triangular
source§impl Distribution<f64> for Triangular
impl Distribution<f64> for Triangular
source§fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64
Generate a random value of
T
, using rng
as the source of randomness.source§impl Distribution<f64> for Triangular
impl Distribution<f64> for Triangular
source§impl Max<f64> for Triangular
impl Max<f64> for Triangular
source§impl Median<f64> for Triangular
impl Median<f64> for Triangular
source§impl Min<f64> for Triangular
impl Min<f64> for Triangular
source§impl PartialEq<Triangular> for Triangular
impl PartialEq<Triangular> for Triangular
source§fn eq(&self, other: &Triangular) -> bool
fn eq(&self, other: &Triangular) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl Copy for Triangular
impl StructuralPartialEq for Triangular
Auto Trait Implementations§
impl RefUnwindSafe for Triangular
impl Send for Triangular
impl Sync for Triangular
impl Unpin for Triangular
impl UnwindSafe for Triangular
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<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.