Struct rand::rngs::mock::StepRng [−][src]
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
impl StepRng
[src][−]
pub fn new(initial: u64, increment: u64) -> Self
[src][−]
Create a StepRng
, yielding an arithmetic sequence starting with
initial
and incremented by increment
each time.
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for StepRng
impl Send for StepRng
impl Sync for StepRng
impl Unpin for StepRng
impl UnwindSafe for StepRng
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src][+]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> From<T> for T
[src][+]
impl<T, U> Into<U> for T where
U: From<T>,
[src][+]
U: From<T>,
impl<R> Rng for R where
R: RngCore + ?Sized,
[src][+]
R: RngCore + ?Sized,
impl<T> ToOwned for T where
T: Clone,
[src][+]
T: Clone,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src][+]
U: Into<T>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
[src][+]
V: MultiLane<T>,