Struct rand::rngs::StdRng

pub struct StdRng(_);

The standard RNG. The PRNG algorithm in StdRng is chosen to be efficient on the current platform, to be statistically strong and unpredictable (meaning a cryptographically secure PRNG).

The current algorithm used is the ChaCha block cipher with either 20 or 12 rounds (see the stdrng_* feature flags, documented in the README). This may change as new evidence of cipher security and performance becomes available.

The algorithm is deterministic but should not be considered reproducible due to dependence on configuration and possible replacement in future library versions. For a secure reproducible generator, we recommend use of the rand_chacha crate directly.

Trait Implementations

impl Clone for StdRng

fn clone(&self) -> StdRng

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StdRng

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl CryptoRng for StdRng

impl SeedableRng for StdRng

type Seed = <Rng as SeedableRng>::Seed

Seed type, which is restricted to types mutably-dereferencable as u8 arrays (we recommend [u8; N] for some N).

fn from_seed(seed: Self::Seed) -> Self

Create a new PRNG using the given seed.

fn from_rng<R: RngCore>(rng: R) -> Result<Self, Error>

Create a new PRNG seeded from another Rng.

fn seed_from_u64(state: u64) -> Self

Create a new PRNG using a u64 seed.

fn from_entropy() -> Self

Creates a new instance of the RNG seeded via [getrandom].

impl RngCore for StdRng

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.