Struct statrs::distribution::NegativeBinomial[][src]

pub struct NegativeBinomial { /* fields omitted */ }
Expand description

Implements the NegativeBinomial distribution

Examples

use statrs::distribution::{NegativeBinomial, Discrete};
use statrs::statistics::DiscreteDistribution;
use statrs::prec::almost_eq;

let r = NegativeBinomial::new(4.0, 0.5).unwrap();
assert_eq!(r.mean().unwrap(), 4.0);
assert!(almost_eq(r.pmf(0), 0.0625, 1e-8));
assert!(almost_eq(r.pmf(3), 0.15625, 1e-8));

Implementations

impl NegativeBinomial[src]

pub fn new(r: f64, p: f64) -> Result<NegativeBinomial>[src]

Constructs a new negative binomial distribution with a given p probability of the number of successes r

Errors

Returns an error if p is NaN, less than 0.0, greater than 1.0, or if r is NaN or less than 0

Examples

use statrs::distribution::NegativeBinomial;

let mut result = NegativeBinomial::new(4.0, 0.5);
assert!(result.is_ok());

result = NegativeBinomial::new(-0.5, 5.0);
assert!(result.is_err());

pub fn p(&self) -> f64[src]

Returns the probability of success p of the negative binomial distribution.

Examples

use statrs::distribution::NegativeBinomial;

let r = NegativeBinomial::new(5.0, 0.5).unwrap();
assert_eq!(r.p(), 0.5);

pub fn r(&self) -> f64[src]

Returns the number r of success of this negative binomial distribution

Examples

use statrs::distribution::NegativeBinomial;

let r = NegativeBinomial::new(5.0, 0.5).unwrap();
assert_eq!(r.r(), 5.0);

Trait Implementations

impl Clone for NegativeBinomial[src]

fn clone(&self) -> NegativeBinomial[src]

Returns a copy of the value. Read more

fn clone_from(&mut self, source: &Self)1.0.0[src]

Performs copy-assignment from source. Read more

impl Debug for NegativeBinomial[src]

fn fmt(&self, f: &mut Formatter<'_>) -> Result[src]

Formats the value using the given formatter. Read more

impl Discrete<u64, f64> for NegativeBinomial[src]

fn pmf(&self, x: u64) -> f64[src]

Calculates the probability mass function for the negative binomial distribution at x

Formula

(x + r - 1 choose k) * (1 - p)^x * p^r

fn ln_pmf(&self, x: u64) -> f64[src]

Calculates the log probability mass function for the negative binomial distribution at x

Formula

ln(x + r - 1 choose k) * (1 - p)^x * p^r))

impl DiscreteCDF<u64, f64> for NegativeBinomial[src]

fn cdf(&self, x: u64) -> f64[src]

Calculates the cumulative distribution function for the negative binomial distribution at x

Note that due to extending the distribution to the reals (allowing positive real values for r), while still technically a discrete distribution the CDF behaves more like that of a continuous distribution rather than a discrete distribution (i.e. a smooth graph rather than a step-ladder)

Formula

1 - I_(1 - p)(x + 1, r)

where I_(x)(a, b) is the regularized incomplete beta function

fn inverse_cdf(&self, p: T) -> K[src]

Due to issues with rounding and floating-point accuracy the default implementation may be ill-behaved Specialized inverse cdfs should be used whenever possible. Read more

impl DiscreteDistribution<f64> for NegativeBinomial[src]

fn mean(&self) -> Option<f64>[src]

Returns the mean of the negative binomial distribution

Formula

r * (1-p) / p

fn variance(&self) -> Option<f64>[src]

Returns the variance of the negative binomial distribution

Formula

r * (1-p) / p^2

fn skewness(&self) -> Option<f64>[src]

Returns the skewness of the negative binomial distribution

Formula

(2-p) / sqrt(r * (1-p))

fn std_dev(&self) -> Option<T>[src]

Returns the standard deviation, if it exists.

fn entropy(&self) -> Option<T>[src]

Returns the entropy, if it exists.

impl Distribution<u64> for NegativeBinomial[src]

fn sample<R: Rng + ?Sized>(&self, r: &mut R) -> u64[src]

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T> where
    R: Rng
[src]

Create an iterator that generates random values of T, using rng as the source of randomness. Read more

impl Max<u64> for NegativeBinomial[src]

fn max(&self) -> u64[src]

Returns the maximum value in the domain of the negative binomial distribution representable by a 64-bit integer

Formula

u64::MAX

impl Min<u64> for NegativeBinomial[src]

fn min(&self) -> u64[src]

Returns the minimum value in the domain of the negative binomial distribution representable by a 64-bit integer

Formula

0

impl Mode<Option<f64>> for NegativeBinomial[src]

fn mode(&self) -> Option<f64>[src]

Returns the mode for the negative binomial distribution

Formula

if r > 1 then
    floor((r - 1) * (1-p / p))
else
    0

impl PartialEq<NegativeBinomial> for NegativeBinomial[src]

fn eq(&self, other: &NegativeBinomial) -> bool[src]

This method tests for self and other values to be equal, and is used by ==. Read more

fn ne(&self, other: &NegativeBinomial) -> bool[src]

This method tests for !=.

impl Copy for NegativeBinomial[src]

impl StructuralPartialEq for NegativeBinomial[src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

pub fn borrow_mut(&mut self) -> &mut T[src]

Mutably borrows from an owned value. Read more

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

Performs the conversion.

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

pub fn into(self) -> U[src]

Performs the conversion.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> Scalar for T where
    T: Copy + PartialEq<T> + Debug + Any
[src]

pub fn inlined_clone(&self) -> T[src]

Performance hack: Clone doesn’t get inlined for Copy types in debug mode, so make it inline anyway.

fn is<T>() -> bool where
    T: Scalar
[src]

Tests if Self the same as the type T Read more

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, 

pub fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

pub fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

pub fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

pub fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

pub fn to_owned(&self) -> T[src]

Creates owned data from borrowed data, usually by cloning. Read more

pub fn clone_into(&self, target: &mut T)[src]

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

Performs the conversion.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

Performs the conversion.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>, 

pub fn vzip(self) -> V