pub struct Zeta<F>{ /* private fields */ }Expand description
Samples integers according to the zeta distribution.
The zeta distribution is a limit of the Zipf distribution. Sometimes it
is called one of the following: discrete Pareto, Riemann-Zeta, Zipf, or
Zipf–Estoup distribution.
It has the density function f(k) = k^(-a) / C(a) for k >= 1, where a
is the parameter and C(a) is the Riemann zeta function.
§Example
use rand::prelude::*;
use rand_distr::Zeta;
let val: f64 = thread_rng().sample(Zeta::new(1.5).unwrap());
println!("{}", val);§Remarks
The zeta distribution has no upper limit. Sampled values may be infinite. In particular, a value of infinity might be returned for the following reasons:
- it is the best representation in the type
Fof the actual sample. - to prevent infinite loops for very small
a.
§Implementation details
We are using the algorithm from Non-Uniform Random Variate Generation, Section 6.1, page 551.
Implementations§
Trait Implementations§
Source§impl<F> Distribution<F> for Zeta<F>
impl<F> Distribution<F> for Zeta<F>
impl<F> Copy for Zeta<F>
Auto Trait Implementations§
impl<F> Freeze for Zeta<F>where
F: Freeze,
impl<F> RefUnwindSafe for Zeta<F>where
F: RefUnwindSafe,
impl<F> Send for Zeta<F>where
F: Send,
impl<F> Sync for Zeta<F>where
F: Sync,
impl<F> Unpin for Zeta<F>where
F: Unpin,
impl<F> UnwindSafe for Zeta<F>where
F: UnwindSafe,
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> 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.