Struct cap_rand::prelude::StdRng [−][src]
pub struct StdRng(_);
Expand description
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 12 rounds. Please see this relevant rand issue for the discussion. 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
type Seed = <ChaCha12Rng as SeedableRng>::Seed
type Seed = <ChaCha12Rng as SeedableRng>::Seed
Seed type, which is restricted to types mutably-dereferencable as u8
arrays (we recommend [u8; N]
for some N
). Read more
Create a new PRNG using the given seed. Read more
Create a new PRNG seeded from another Rng
. Read more
Create a new PRNG using a u64
seed. Read more
Auto Trait Implementations
impl RefUnwindSafe for StdRng
impl UnwindSafe for StdRng
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