# Struct rand_distr::Zipf

``````pub struct Zipf<F>where
F: Float,
Standard: Distribution<F>,{ /* private fields */ }``````
Expand description

The Zipf (Zipfian) distribution `Zipf(n, s)`.

The samples follow Zipf’s law: The frequency of each sample from a finite set of size `n` is inversely proportional to a power of its frequency rank (with exponent `s`).

For large `n`, this converges to the `Zeta` distribution.

For `s = 0`, this becomes a `uniform` distribution.

## §Plot

The following plot illustrates the Zipf distribution for `n = 10` and various values of `s`.

## §Example

``````use rand::prelude::*;
use rand_distr::Zipf;

let val: f64 = thread_rng().sample(Zipf::new(10, 1.5).unwrap());
println!("{}", val);``````

## §Implementation details

Implemented via rejection sampling, due to Jason Crease1.

## Implementations§

source§

### impl<F> Zipf<F>where F: Float, Standard: Distribution<F>,

source

#### pub fn new(n: u64, s: F) -> Result<Zipf<F>, Error>

Construct a new `Zipf` distribution for a set with `n` elements and a frequency rank exponent `s`.

For large `n`, rounding may occur to fit the number into the float type.

## Trait Implementations§

source§

### impl<F> Clone for Zipf<F>where F: Float + Clone, Standard: Distribution<F>,

source§

#### fn clone(&self) -> Zipf<F>

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<F> Debug for Zipf<F>where F: Float + Debug, Standard: Distribution<F>,

source§

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

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

### impl<F> Distribution<F> for Zipf<F>where F: Float, Standard: Distribution<F>,

source§

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

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<F> PartialEq for Zipf<F>where F: Float + PartialEq, Standard: Distribution<F>,

source§

#### fn eq(&self, other: &Zipf<F>) -> bool

Tests for `self` and `other` values to be equal, and is used by `==`.
1.0.0 · source§

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

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

source§

§

§

§

§

§

§

## 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> CloneToUninit for Twhere T: Clone,

source§

#### unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (`clone_to_uninit`)
Performs copy-assignment from `self` to `dst`. 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> ToOwned for Twhere T: Clone,

source§

#### 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>,

source§

#### 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>,

source§

#### 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§

source§