Function malachite_base::num::random::striped::striped_random_unsigned_bit_chunks

source · [−]

pub fn striped_random_unsigned_bit_chunks<T: PrimitiveUnsigned>(
    seed: Seed, 
    chunk_size: u64, 
    m_numerator: u64, 
    m_denominator: u64
) -> StripedRandomUnsignedBitChunks<T>ⓘNotable traits for StripedRandomUnsignedBitChunks<T>impl<T: PrimitiveUnsigned> Iterator for StripedRandomUnsignedBitChunks<T>    type Item = T;

Expand description

Generates random unsigned integers of up to chunk_size bits 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 chunk_size.

Panics

Panics if m_denominator is zero, if m_numerator <= m_denominator, or if chunk_size is greater than the width of the type.

Examples

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

assert_eq!(
    prefix_to_string(
        striped_random_unsigned_bit_chunks::<u8>(EXAMPLE_SEED, 3, 4, 1)
                .map(|x| x.to_binary_string()),
        10
    ),
    "[0, 0, 0, 101, 11, 100, 11, 11, 0, 111, ...]"
)