pub struct DiscreteUniform { /* private fields */ }
Expand description

Implements the Discrete Uniform distribution

Examples

use statrs::distribution::{DiscreteUniform, Discrete};
use statrs::statistics::Distribution;

let n = DiscreteUniform::new(0, 5).unwrap();
assert_eq!(n.mean().unwrap(), 2.5);
assert_eq!(n.pmf(3), 1.0 / 6.0);

Implementations§

source§

impl DiscreteUniform

source

pub fn new(min: i64, max: i64) -> Result<DiscreteUniform>

Constructs a new discrete uniform distribution with a minimum value of min and a maximum value of max.

Errors

Returns an error if max < min

Examples
use statrs::distribution::DiscreteUniform;

let mut result = DiscreteUniform::new(0, 5);
assert!(result.is_ok());

result = DiscreteUniform::new(5, 0);
assert!(result.is_err());

Trait Implementations§

source§

impl Clone for DiscreteUniform

source§

fn clone(&self) -> DiscreteUniform

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for DiscreteUniform

source§

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

Formats the value using the given formatter. Read more
source§

impl Discrete<i64, f64> for DiscreteUniform

source§

fn pmf(&self, x: i64) -> f64

Calculates the probability mass function for the discrete uniform distribution at x

Remarks

Returns 0.0 if x is not in [min, max]

Formula
1 / (max - min + 1)
source§

fn ln_pmf(&self, x: i64) -> f64

Calculates the log probability mass function for the discrete uniform distribution at x

Remarks

Returns f64::NEG_INFINITY if x is not in [min, max]

Formula
ln(1 / (max - min + 1))
source§

impl DiscreteCDF<i64, f64> for DiscreteUniform

source§

fn cdf(&self, x: i64) -> f64

Calculates the cumulative distribution function for the discrete uniform distribution at x

Formula
(floor(x) - min + 1) / (max - min + 1)
source§

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.
source§

impl Distribution<f64> for DiscreteUniform

source§

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64

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

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

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

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F Read more
source§

impl Distribution<f64> for DiscreteUniform

source§

fn mean(&self) -> Option<f64>

Returns the mean of the discrete uniform distribution

Formula
(min + max) / 2
source§

fn variance(&self) -> Option<f64>

Returns the variance of the discrete uniform distribution

Formula
((max - min + 1)^2 - 1) / 12
source§

fn entropy(&self) -> Option<f64>

Returns the entropy of the discrete uniform distribution

Formula
ln(max - min + 1)
source§

fn skewness(&self) -> Option<f64>

Returns the skewness of the discrete uniform distribution

Formula
source§

fn std_dev(&self) -> Option<T>

Returns the standard deviation, if it exists. Read more
source§

impl Max<i64> for DiscreteUniform

source§

fn max(&self) -> i64

Returns the maximum value in the domain of the discrete uniform distribution

Remarks

This is the same value as the maximum passed into the constructor

source§

impl Median<f64> for DiscreteUniform

source§

fn median(&self) -> f64

Returns the median of the discrete uniform distribution

Formula
(max + min) / 2
source§

impl Min<i64> for DiscreteUniform

source§

fn min(&self) -> i64

Returns the minimum value in the domain of the discrete uniform distribution

Remarks

This is the same value as the minimum passed into the constructor

source§

impl Mode<Option<i64>> for DiscreteUniform

source§

fn mode(&self) -> Option<i64>

Returns the mode for the discrete uniform distribution

Remarks

Since every element has an equal probability, mode simply returns the middle element

Formula
N/A // (max + min) / 2 for the middle element
source§

impl PartialEq<DiscreteUniform> for DiscreteUniform

source§

fn eq(&self, other: &DiscreteUniform) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Copy for DiscreteUniform

source§

impl StructuralPartialEq for DiscreteUniform

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> Scalar for Twhere T: Copy + PartialEq<T> + Debug + Any,

source§

fn inlined_clone(&self) -> T

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

fn is<T>() -> boolwhere T: Scalar,

Tests if Self the same as the type T Read more
source§

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

source§

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

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

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

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

fn from_subset(element: &SS) -> SP

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

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

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

fn clone_into(&self, target: &mut T)

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

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

source§

fn vzip(self) -> V