pub struct StepRng { /* private fields */ }
Expand description
A simple implementation of RngCore
for testing purposes.
This generates an arithmetic sequence (i.e. adds a constant each step)
over a u64
number, using wrapping arithmetic. If the increment is 0
the generator yields a constant.
use rand::Rng;
use rand::rngs::mock::StepRng;
let mut my_rng = StepRng::new(2, 1);
let sample: [u64; 3] = my_rng.gen();
assert_eq!(sample, [2, 3, 4]);
Implementations
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for StepRng
impl UnwindSafe for StepRng
Blanket Implementations
Mutably borrows from an owned value. Read more
Generate a random value in the given range. Read more
Sample a new value, using the given distribution. Read more
fn sample_iter<T, D>(self, distr: D) -> DistIter<D, Self, T>ⓘ where
D: Distribution<T>,
fn sample_iter<T, D>(self, distr: D) -> DistIter<D, Self, T>ⓘ where
D: Distribution<T>,
Create an iterator that generates values using the given distribution. Read more
Return a bool with a probability p
of being true. Read more
Return a bool with a probability of numerator/denominator
of being
true. I.e. gen_ratio(2, 3)
has chance of 2 in 3, or about 67%, of
returning true. If numerator == denominator
, then the returned value
is guaranteed to be true
. If numerator == 0
, then the returned
value is guaranteed to be false
. Read more