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