Function malachite_base::num::random::striped::striped_random_positive_signeds

source · [−]

pub fn striped_random_positive_signeds<T: PrimitiveSigned>(
    seed: Seed, 
    m_numerator: u64, 
    m_denominator: u64
) -> NonzeroValues<StripedRandomNaturalSigneds<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

Generates random positive signed integers from a random striped distribution.

See here for more information.

The mean run length (before the bit sequences are truncated) is $m$ = m_numerator / m_denominator.

The output length is infinite.

Expected complexity per iteration

$T(n) = O(n)$

$M(n) = O(n)$

where $T$ is time, $M$ is additional memory, and n is the width of the type.

Panics

Panics if m_denominator is zero or if m_numerator <= m_denominator.

Examples

use malachite_base::iterators::prefix_to_string;
use malachite_base::num::random::striped::striped_random_positive_signeds;
use malachite_base::random::EXAMPLE_SEED;
use malachite_base::strings::ToBinaryString;

assert_eq!(
    prefix_to_string(
        striped_random_positive_signeds::<i8>(EXAMPLE_SEED, 4, 1)
                .map(|x| x.to_binary_string()),
        10
    ),
    "[101100, 110000, 1111100, 1111, 1111110, 111, 11101, 1100000, 1111111, 1100000, ...]"
)