Function malachite_base::num::random::random_positive_unsigneds

source · [−]

pub fn random_positive_unsigneds<T: PrimitiveUnsigned>(
    seed: Seed
) -> NonzeroValues<RandomPrimitiveInts<T>>ⓘNotable traits for NonzeroValues<I>impl<I: Iterator> Iterator for NonzeroValues<I> where
    I::Item: PartialEq<I::Item> + Zero,     type Item = I::Item;

Expand description

Uniformly generates random positive unsigned integers.

$$ P(x) = \begin{cases} \frac{1}{2^W-1} & \text{if} \quad x > 0, \\ 0 & \text{otherwise}, \end{cases} $$ where $W$ is the width of the type.

The output length is infinite.

Expected complexity per iteration

Constant time and additional memory.

Examples

use malachite_base::iterators::prefix_to_string;
use malachite_base::num::random::random_positive_unsigneds;
use malachite_base::random::EXAMPLE_SEED;

assert_eq!(
    prefix_to_string(random_positive_unsigneds::<u8>(EXAMPLE_SEED), 10),
    "[113, 239, 69, 108, 228, 210, 168, 161, 87, 32, ...]"
)