Struct ZipfFast

pub struct ZipfFast { /* private fields */ }

A fast Zipf distribution generator.

This generator takes an exponent and a start value. The start is typically set to 1, and the exponent is typically set to something slightly larger than 1 (like 1.1)

Increasing exponent reduces the likelihood of larger return values. Increasing start increases the likelihood of larger return values.

Algorithm from: “Rejection-Inversion to Generate Variates from Monotone Discrete Distributions” http://eeyore.wu-wien.ac.at/papers/96-04-04.wh-der.ps.gz

Implementations

impl ZipfFast

pub fn new(exponent: f64, start: f64, imax: u64) -> Result<Self, ZipfError>

Trait Implementations

impl Debug for ZipfFast

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

Formats the value using the given formatter.

impl Deref for ZipfFast

type Target = Precomputes

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl Distribution<u64> for ZipfFast

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

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

fn sample_iter<R>(self, rng: R) -> Iter<Self, R, T>

where R: Rng, Self: Sized,

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

fn map<F, S>(self, func: F) -> Map<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Map sampled values to type S