Function malachite_q::random::random_nonzero_rationals

pub fn random_nonzero_rationals(
    seed: Seed,
    mean_bits_numerator: u64,
    mean_bits_denominator: u64
) -> RandomRationalsFromSingleAndSign<RandomNaturals<GeometricRandomNaturalValues<u64>>> 

Generates random nonzero Rationals with a specified numerator and denominator mean bit length.

The output length is infinite.

Expected complexity per iteration

$T(n) = O(n (\log n)^2 \log\log n)$

$M(n) = O(n \log n)$

where $T$ is time, $M$ is additional memory, and $n$ is mean_bits_numerator / mean_bits_denominator.

Panics

Panics if mean_bits_numerator or mean_bits_denominator are zero or if mean_bits_numerator <= mean_bits_denominator.

Examples

use malachite_base::iterators::prefix_to_string;
use malachite_base::random::EXAMPLE_SEED;
use malachite_q::random::random_nonzero_rationals;

assert_eq!(
    prefix_to_string(random_nonzero_rationals(EXAMPLE_SEED, 32, 1), 10),
    "[-80861953616/9687130509484985, -14557437513/313, 100721397389/392237929981, \
    713431423/1285, -3887883364/889, 14185/969, 12609/11359517108746272468338071, \
    3443/4354945, 1/29, 5551/892095, ...]"
)