Re-exports§
Modules§
Structs§
- 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). - A reference to the thread-local generator
Constants§
- Archimedes’ constant (π)
Traits§
- A marker trait used to indicate that an
RngCore
orBlockRngCore
implementation is supposed to be cryptographically secure. - Types (distributions) that can be used to create a random instance of
T
. - Extension trait on iterators, providing random sampling methods.
- An automatically-implemented extension trait on
RngCore
providing high-level generic methods for sampling values and other convenience methods. - The core of a random number generator.
- A random number generator that can be explicitly seeded.
- Extension trait on slices, providing random mutation and sampling methods.
Functions§
- Generates a random value using the thread-local random number generator.
- Retrieve the lazily-initialized thread-local random number generator, seeded by the system. Intended to be used in method chaining style, e.g.
thread_rng().gen::<i32>()
, or cached locally, e.g.let mut rng = thread_rng();
. Invoked by theDefault
trait, makingThreadRng::default()
equivalent.