Struct statrs::distribution::Beta
source · pub struct Beta { /* private fields */ }
Expand description
Implementations§
source§impl Beta
impl Beta
sourcepub fn new(shape_a: f64, shape_b: f64) -> Result<Beta>
pub fn new(shape_a: f64, shape_b: f64) -> Result<Beta>
Constructs a new beta distribution with shapeA (α) of shape_a
and shapeB (β) of shape_b
Errors
Returns an error if shape_a
or shape_b
are NaN
.
Also returns an error if shape_a <= 0.0
or shape_b <= 0.0
Examples
use statrs::distribution::Beta;
let mut result = Beta::new(2.0, 2.0);
assert!(result.is_ok());
result = Beta::new(0.0, 0.0);
assert!(result.is_err());
Trait Implementations§
source§impl ContinuousCDF<f64, f64> for Beta
impl ContinuousCDF<f64, f64> for Beta
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 Distribution<f64> for Beta
impl Distribution<f64> for Beta
source§impl Distribution<f64> for Beta
impl Distribution<f64> for Beta
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 PartialEq<Beta> for Beta
impl PartialEq<Beta> for Beta
impl Copy for Beta
impl StructuralPartialEq for Beta
Auto Trait Implementations§
impl RefUnwindSafe for Beta
impl Send for Beta
impl Sync for Beta
impl Unpin for Beta
impl UnwindSafe for Beta
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.