pub struct Poisson { /* private fields */ }Expand description
Possion distribution over x in {0, 1, … }.
§Example
use rv::prelude::*;
// Create Poisson(λ=5.3)
let pois = Poisson::new(5.3).unwrap();
// CDF at 5
assert!((pois.cdf(&5_u16) - 0.56347339228807169).abs() < 1E-12);
// Draw 100 samples
let mut rng = rand::thread_rng();
let xs: Vec<u32> = pois.sample(100, &mut rng);
assert_eq!(xs.len(), 100)The Poisson can have two modes. The modes are distinct only if the rate is an integer.
{
let pois = Poisson::new(2.0).unwrap();
let modes: (u32, u32) = pois.mode().unwrap();
assert_eq!(modes, (1, 2))
}
{
let pois = Poisson::new(2.1).unwrap();
let modes: (u32, u32) = pois.mode().unwrap();
assert_eq!(modes, (2, 2))
}If we know that the rate is not an integer, or we only care about one of the modes, we can call mode for an unsigned type, which will return the leftmost (lowest) mode.
let pois = Poisson::new(2.1).unwrap();
let mode: u32 = pois.mode().unwrap();
assert_eq!(mode, 2)Implementations§
Source§impl Poisson
impl Poisson
Sourcepub fn new(rate: f64) -> Result<Poisson, PoissonError>
pub fn new(rate: f64) -> Result<Poisson, PoissonError>
Create a new Poisson distribution with given rate
Sourcepub fn new_unchecked(rate: f64) -> Poisson
pub fn new_unchecked(rate: f64) -> Poisson
Creates a new Poisson without checking whether the parameter is valid.
Sourcepub fn rate(&self) -> f64
pub fn rate(&self) -> f64
Get the rate parameter
§Example
let pois = Poisson::new(2.0).unwrap();
assert_eq!(pois.rate(), 2.0);Sourcepub fn set_rate(&mut self, rate: f64) -> Result<(), PoissonError>
pub fn set_rate(&mut self, rate: f64) -> Result<(), PoissonError>
Set the rate parameter
§Example
use rv::dist::Poisson;
let mut pois = Poisson::new(1.0).unwrap();
assert_eq!(pois.rate(), 1.0);
pois.set_rate(1.1).unwrap();
assert_eq!(pois.rate(), 1.1);Will error for invalid values
assert!(pois.set_rate(1.1).is_ok());
assert!(pois.set_rate(0.0).is_err());
assert!(pois.set_rate(-1.0).is_err());
assert!(pois.set_rate(std::f64::INFINITY).is_err());
assert!(pois.set_rate(std::f64::NEG_INFINITY).is_err());
assert!(pois.set_rate(std::f64::NAN).is_err());Sourcepub fn set_rate_unchecked(&mut self, rate: f64)
pub fn set_rate_unchecked(&mut self, rate: f64)
Set the rate parameter without input validation
Trait Implementations§
Source§impl ConjugatePrior<u16, Poisson> for Gamma
impl ConjugatePrior<u16, Poisson> for Gamma
Source§fn posterior(&self, x: &DataOrSuffStat<'_, u16, Poisson>) -> Gamma
fn posterior(&self, x: &DataOrSuffStat<'_, u16, Poisson>) -> Gamma
Computes the posterior distribution from the data
Source§fn ln_m_cache(&self) -> <Gamma as ConjugatePrior<u16, Poisson>>::LnMCache
fn ln_m_cache(&self) -> <Gamma as ConjugatePrior<u16, Poisson>>::LnMCache
Compute the cache for the log marginal likelihood.
Source§fn ln_m_with_cache(
&self,
cache: &<Gamma as ConjugatePrior<u16, Poisson>>::LnMCache,
x: &DataOrSuffStat<'_, u16, Poisson>,
) -> f64
fn ln_m_with_cache( &self, cache: &<Gamma as ConjugatePrior<u16, Poisson>>::LnMCache, x: &DataOrSuffStat<'_, u16, Poisson>, ) -> f64
Log marginal likelihood with supplied cache.
Source§fn ln_pp_cache(
&self,
x: &DataOrSuffStat<'_, u16, Poisson>,
) -> <Gamma as ConjugatePrior<u16, Poisson>>::LnPpCache
fn ln_pp_cache( &self, x: &DataOrSuffStat<'_, u16, Poisson>, ) -> <Gamma as ConjugatePrior<u16, Poisson>>::LnPpCache
Compute the cache for the Log posterior predictive of y given x. Read more
Source§fn ln_pp_with_cache(
&self,
cache: &<Gamma as ConjugatePrior<u16, Poisson>>::LnPpCache,
y: &u16,
) -> f64
fn ln_pp_with_cache( &self, cache: &<Gamma as ConjugatePrior<u16, Poisson>>::LnPpCache, y: &u16, ) -> f64
Log posterior predictive of y given x with supplied ln(norm)
Source§fn ln_m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn ln_m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
The log marginal likelihood
Source§fn ln_pp(&self, y: &X, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn ln_pp(&self, y: &X, x: &DataOrSuffStat<'_, X, Fx>) -> f64
Log posterior predictive of y given x
Source§fn m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
Marginal likelihood of x
Source§impl ConjugatePrior<u32, Poisson> for Gamma
impl ConjugatePrior<u32, Poisson> for Gamma
Source§fn posterior(&self, x: &DataOrSuffStat<'_, u32, Poisson>) -> Gamma
fn posterior(&self, x: &DataOrSuffStat<'_, u32, Poisson>) -> Gamma
Computes the posterior distribution from the data
Source§fn ln_m_cache(&self) -> <Gamma as ConjugatePrior<u32, Poisson>>::LnMCache
fn ln_m_cache(&self) -> <Gamma as ConjugatePrior<u32, Poisson>>::LnMCache
Compute the cache for the log marginal likelihood.
Source§fn ln_m_with_cache(
&self,
cache: &<Gamma as ConjugatePrior<u32, Poisson>>::LnMCache,
x: &DataOrSuffStat<'_, u32, Poisson>,
) -> f64
fn ln_m_with_cache( &self, cache: &<Gamma as ConjugatePrior<u32, Poisson>>::LnMCache, x: &DataOrSuffStat<'_, u32, Poisson>, ) -> f64
Log marginal likelihood with supplied cache.
Source§fn ln_pp_cache(
&self,
x: &DataOrSuffStat<'_, u32, Poisson>,
) -> <Gamma as ConjugatePrior<u32, Poisson>>::LnPpCache
fn ln_pp_cache( &self, x: &DataOrSuffStat<'_, u32, Poisson>, ) -> <Gamma as ConjugatePrior<u32, Poisson>>::LnPpCache
Compute the cache for the Log posterior predictive of y given x. Read more
Source§fn ln_pp_with_cache(
&self,
cache: &<Gamma as ConjugatePrior<u32, Poisson>>::LnPpCache,
y: &u32,
) -> f64
fn ln_pp_with_cache( &self, cache: &<Gamma as ConjugatePrior<u32, Poisson>>::LnPpCache, y: &u32, ) -> f64
Log posterior predictive of y given x with supplied ln(norm)
Source§fn ln_m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn ln_m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
The log marginal likelihood
Source§fn ln_pp(&self, y: &X, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn ln_pp(&self, y: &X, x: &DataOrSuffStat<'_, X, Fx>) -> f64
Log posterior predictive of y given x
Source§fn m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
Marginal likelihood of x
Source§impl ConjugatePrior<u8, Poisson> for Gamma
impl ConjugatePrior<u8, Poisson> for Gamma
Source§fn posterior(&self, x: &DataOrSuffStat<'_, u8, Poisson>) -> Gamma
fn posterior(&self, x: &DataOrSuffStat<'_, u8, Poisson>) -> Gamma
Computes the posterior distribution from the data
Source§fn ln_m_cache(&self) -> <Gamma as ConjugatePrior<u8, Poisson>>::LnMCache
fn ln_m_cache(&self) -> <Gamma as ConjugatePrior<u8, Poisson>>::LnMCache
Compute the cache for the log marginal likelihood.
Source§fn ln_m_with_cache(
&self,
cache: &<Gamma as ConjugatePrior<u8, Poisson>>::LnMCache,
x: &DataOrSuffStat<'_, u8, Poisson>,
) -> f64
fn ln_m_with_cache( &self, cache: &<Gamma as ConjugatePrior<u8, Poisson>>::LnMCache, x: &DataOrSuffStat<'_, u8, Poisson>, ) -> f64
Log marginal likelihood with supplied cache.
Source§fn ln_pp_cache(
&self,
x: &DataOrSuffStat<'_, u8, Poisson>,
) -> <Gamma as ConjugatePrior<u8, Poisson>>::LnPpCache
fn ln_pp_cache( &self, x: &DataOrSuffStat<'_, u8, Poisson>, ) -> <Gamma as ConjugatePrior<u8, Poisson>>::LnPpCache
Compute the cache for the Log posterior predictive of y given x. Read more
Source§fn ln_pp_with_cache(
&self,
cache: &<Gamma as ConjugatePrior<u8, Poisson>>::LnPpCache,
y: &u8,
) -> f64
fn ln_pp_with_cache( &self, cache: &<Gamma as ConjugatePrior<u8, Poisson>>::LnPpCache, y: &u8, ) -> f64
Log posterior predictive of y given x with supplied ln(norm)
Source§fn ln_m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn ln_m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
The log marginal likelihood
Source§fn ln_pp(&self, y: &X, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn ln_pp(&self, y: &X, x: &DataOrSuffStat<'_, X, Fx>) -> f64
Log posterior predictive of y given x
Source§fn m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
fn m(&self, x: &DataOrSuffStat<'_, X, Fx>) -> f64
Marginal likelihood of x
Source§impl ContinuousDistr<Poisson> for Gamma
impl ContinuousDistr<Poisson> for Gamma
Source§impl DiscreteDistr<u16> for Poisson
impl DiscreteDistr<u16> for Poisson
Source§impl DiscreteDistr<u32> for Poisson
impl DiscreteDistr<u32> for Poisson
Source§impl DiscreteDistr<u8> for Poisson
impl DiscreteDistr<u8> for Poisson
Source§impl DiscreteDistr<usize> for Poisson
impl DiscreteDistr<usize> for Poisson
Source§impl HasSuffStat<u16> for Poisson
impl HasSuffStat<u16> for Poisson
type Stat = PoissonSuffStat
fn empty_suffstat(&self) -> <Poisson as HasSuffStat<u16>>::Stat
Source§impl HasSuffStat<u32> for Poisson
impl HasSuffStat<u32> for Poisson
type Stat = PoissonSuffStat
fn empty_suffstat(&self) -> <Poisson as HasSuffStat<u32>>::Stat
Source§impl HasSuffStat<u8> for Poisson
impl HasSuffStat<u8> for Poisson
type Stat = PoissonSuffStat
fn empty_suffstat(&self) -> <Poisson as HasSuffStat<u8>>::Stat
Source§impl HasSuffStat<usize> for Poisson
impl HasSuffStat<usize> for Poisson
type Stat = PoissonSuffStat
fn empty_suffstat(&self) -> <Poisson as HasSuffStat<usize>>::Stat
Source§impl KlDivergence for Poisson
impl KlDivergence for Poisson
Source§impl Rv<Poisson> for Gamma
impl Rv<Poisson> for Gamma
Source§impl Rv<u16> for Poisson
impl Rv<u16> for Poisson
Source§impl Rv<u32> for Poisson
impl Rv<u32> for Poisson
Source§impl Rv<u8> for Poisson
impl Rv<u8> for Poisson
Source§impl Rv<usize> for Poisson
impl Rv<usize> for Poisson
Auto Trait Implementations§
impl !Freeze for Poisson
impl RefUnwindSafe for Poisson
impl Send for Poisson
impl Sync for Poisson
impl Unpin for Poisson
impl UnsafeUnpin for Poisson
impl UnwindSafe for Poisson
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<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> GetSetFdFlags for T
impl<T> GetSetFdFlags for T
Source§fn get_fd_flags(&self) -> Result<FdFlags, Error>where
T: AsFilelike,
fn get_fd_flags(&self) -> Result<FdFlags, Error>where
T: AsFilelike,
Query the “status” flags for the
self file descriptor.Source§fn new_set_fd_flags(&self, fd_flags: FdFlags) -> Result<SetFdFlags<T>, Error>where
T: AsFilelike,
fn new_set_fd_flags(&self, fd_flags: FdFlags) -> Result<SetFdFlags<T>, Error>where
T: AsFilelike,
Source§fn set_fd_flags(&mut self, set_fd_flags: SetFdFlags<T>) -> Result<(), Error>where
T: AsFilelike,
fn set_fd_flags(&mut self, set_fd_flags: SetFdFlags<T>) -> Result<(), Error>where
T: AsFilelike,
Set the “status” flags for the
self file descriptor. Read moreSource§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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.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.