Struct statrs::distribution::Bernoulli [−][src]
pub struct Bernoulli { /* fields omitted */ }
Expand description
Implements the
Bernoulli
distribution which is a special case of the
Binomial
distribution where n = 1
(referenced Here)
Examples
use statrs::distribution::{Bernoulli, Discrete}; use statrs::statistics::Distribution; let n = Bernoulli::new(0.5).unwrap(); assert_eq!(n.mean().unwrap(), 0.5); assert_eq!(n.pmf(0), 0.5); assert_eq!(n.pmf(1), 0.5);
Implementations
impl Bernoulli
[src]
impl Bernoulli
[src]pub fn new(p: f64) -> Result<Bernoulli>
[src]
pub fn new(p: f64) -> Result<Bernoulli>
[src]Constructs a new bernoulli distribution with
the given p
probability of success.
Errors
Returns an error if p
is NaN
, less than 0.0
or greater than 1.0
Examples
use statrs::distribution::Bernoulli; let mut result = Bernoulli::new(0.5); assert!(result.is_ok()); result = Bernoulli::new(-0.5); assert!(result.is_err());
Trait Implementations
impl Discrete<u64, f64> for Bernoulli
[src]
impl Discrete<u64, f64> for Bernoulli
[src]impl DiscreteCDF<u64, f64> for Bernoulli
[src]
impl DiscreteCDF<u64, f64> for Bernoulli
[src]fn cdf(&self, x: u64) -> f64
[src]
fn cdf(&self, x: u64) -> f64
[src]Calculates the cumulative distribution
function for the bernoulli distribution at x
.
Formula
if x < 0 { 0 } else if x >= 1 { 1 } else { 1 - p }
fn inverse_cdf(&self, p: T) -> K
[src]
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 Distribution<f64> for Bernoulli
[src]
impl Distribution<f64> for Bernoulli
[src]impl Distribution<f64> for Bernoulli
[src]
impl Distribution<f64> for Bernoulli
[src]fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64
[src]
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64
[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]
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 Copy for Bernoulli
[src]
impl StructuralPartialEq for Bernoulli
[src]
Auto Trait Implementations
impl RefUnwindSafe for Bernoulli
impl Send for Bernoulli
impl Sync for Bernoulli
impl Unpin for Bernoulli
impl UnwindSafe for Bernoulli
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
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
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
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
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]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
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]
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<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,