Struct rand::rngs::mock::StepRng

[+] Show declaration

pub struct StepRng { /* fields omitted */ }

[−] 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

impl StepRng[−]

pub fn new(initial: u64, increment: u64) -> Self[−]

Create a StepRng, yielding an arithmetic sequence starting with initial and incremented by increment each time.

Trait Implementations

impl Clone for StepRng[+]

[+] Show hidden undocumented items

fn clone(&self) -> StepRng[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl Debug for StepRng[+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter<'_>) -> Result[−]

Formats the value using the given formatter.

impl Eq for StepRng

impl PartialEq<StepRng> for StepRng[+]

[+] Show hidden undocumented items

fn eq(&self, other: &StepRng) -> bool[−]

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &StepRng) -> bool[−]

This method tests for !=.

impl RngCore for StepRng[+]

[+] Show hidden undocumented items

fn next_u32(&mut self) -> u32[−]

Return the next random u32.

fn next_u64(&mut self) -> u64[−]

Return the next random u64.

fn fill_bytes(&mut self, dest: &mut [u8])[−]

Fill dest with random data.

fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>[−]

Fill dest entirely with random data.

impl StructuralEq for StepRng

impl StructuralPartialEq for StepRng