Struct rv::data::BernoulliSuffStat [−][src]
pub struct BernoulliSuffStat { /* fields omitted */ }
Expand description
Sufficient statistic for the Bernoulli distribution.
Contains the number of trials and the number of successes.
Implementations
Create a sufficient statistic from components without checking whether they are valid.
Get the total number of trials, n.
Example
let mut stat = BernoulliSuffStat::new(); stat.observe(&true); stat.observe(&false); assert_eq!(stat.n(), 2);
Trait Implementations
impl<'a, X> From<&'a BernoulliSuffStat> for DataOrSuffStat<'a, X, Bernoulli> where
X: Booleable,
[src]
impl<'a, X> From<&'a BernoulliSuffStat> for DataOrSuffStat<'a, X, Bernoulli> where
X: Booleable,
[src]Performs the conversion.
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
Assimilate several observations
Forget several observations
Auto Trait Implementations
impl RefUnwindSafe for BernoulliSuffStat
impl Send for BernoulliSuffStat
impl Sync for BernoulliSuffStat
impl Unpin for BernoulliSuffStat
impl UnwindSafe for BernoulliSuffStat
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
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.
pub fn vzip(self) -> V