pub struct SmallRng(/* private fields */);
Expand description
A small-state, fast non-crypto PRNG
SmallRng
may be a good choice when a PRNG with small state, cheap
initialization, good statistical quality and good performance are required.
It is not a good choice when security against prediction or
reproducibility are important.
This PRNG is feature-gated: to use, you must enable the crate feature
small_rng
.
The algorithm is deterministic but should not be considered reproducible due to dependence on platform and possible replacement in future library versions. For a reproducible generator, use a named PRNG from an external crate, e.g. rand_pcg or rand_chacha. Refer also to The Book.
The PRNG algorithm in SmallRng
is chosen to be
efficient on the current platform, without consideration for cryptography
or security. The size of its state is much smaller than StdRng
.
The current algorithm is Pcg64Mcg
on 64-bit
platforms and Pcg32
on 32-bit platforms. Both are
implemented by the rand_pcg crate.
§Examples
Initializing SmallRng
with a random seed can be done using SeedableRng::from_entropy
:
use rand::{Rng, SeedableRng};
use rand::rngs::SmallRng;
// Create small, cheap to initialize and fast RNG with a random seed.
// The randomness is supplied by the operating system.
let mut small_rng = SmallRng::from_entropy();
When initializing a lot of SmallRng
’s, using thread_rng
can be more
efficient:
use rand::{SeedableRng, thread_rng};
use rand::rngs::SmallRng;
// Create a big, expensive to initialize and slower, but unpredictable RNG.
// This is cached and done only once per thread.
let mut thread_rng = thread_rng();
// Create small, cheap to initialize and fast RNGs with random seeds.
// One can generally assume this won't fail.
let rngs: Vec<SmallRng> = (0..10)
.map(|_| SmallRng::from_rng(&mut thread_rng).unwrap())
.collect();
Trait Implementations§
Source§impl RngCore for SmallRng
impl RngCore for SmallRng
Source§fn fill_bytes(&mut self, dest: &mut [u8])
fn fill_bytes(&mut self, dest: &mut [u8])
dest
with random data. Read moreSource§impl SeedableRng for SmallRng
impl SeedableRng for SmallRng
Source§type Seed = <Mcg128Xsl64 as SeedableRng>::Seed
type Seed = <Mcg128Xsl64 as SeedableRng>::Seed
u8
arrays (we recommend [u8; N]
for some N
). Read moreSource§fn from_seed(seed: <SmallRng as SeedableRng>::Seed) -> SmallRng
fn from_seed(seed: <SmallRng as SeedableRng>::Seed) -> SmallRng
Source§fn from_rng<R>(rng: R) -> Result<SmallRng, Error>where
R: RngCore,
fn from_rng<R>(rng: R) -> Result<SmallRng, Error>where
R: RngCore,
Rng
. Read moreSource§fn seed_from_u64(state: u64) -> Self
fn seed_from_u64(state: u64) -> Self
u64
seed. Read moreSource§fn from_entropy() -> Self
fn from_entropy() -> Self
Auto Trait Implementations§
impl Freeze for SmallRng
impl RefUnwindSafe for SmallRng
impl Send for SmallRng
impl Sync for SmallRng
impl Unpin for SmallRng
impl UnwindSafe for SmallRng
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<R> Rng for R
impl<R> Rng for R
Source§fn gen<T>(&mut self) -> Twhere
Standard: Distribution<T>,
fn gen<T>(&mut self) -> Twhere
Standard: Distribution<T>,
Source§fn gen_range<T, B1, B2>(&mut self, low: B1, high: B2) -> T
fn gen_range<T, B1, B2>(&mut self, low: B1, high: B2) -> T
low
, high
), i.e. inclusive of
low
and exclusive of high
. Read moreSource§fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
Source§fn sample_iter<T, D>(self, distr: D) -> DistIter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
fn sample_iter<T, D>(self, distr: D) -> DistIter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
Source§fn fill<T>(&mut self, dest: &mut T)where
T: AsByteSliceMut + ?Sized,
fn fill<T>(&mut self, dest: &mut T)where
T: AsByteSliceMut + ?Sized,
dest
entirely with random bytes (uniform value distribution),
where dest
is any type supporting AsByteSliceMut
, namely slices
and arrays over primitive integer types (i8
, i16
, u32
, etc.). Read moreSource§fn try_fill<T>(&mut self, dest: &mut T) -> Result<(), Error>where
T: AsByteSliceMut + ?Sized,
fn try_fill<T>(&mut self, dest: &mut T) -> Result<(), Error>where
T: AsByteSliceMut + ?Sized,
dest
entirely with random bytes (uniform value distribution),
where dest
is any type supporting AsByteSliceMut
, namely slices
and arrays over primitive integer types (i8
, i16
, u32
, etc.). Read moreSource§fn gen_bool(&mut self, p: f64) -> bool
fn gen_bool(&mut self, p: f64) -> bool
p
of being true. Read moreSource§fn gen_ratio(&mut self, numerator: u32, denominator: u32) -> bool
fn gen_ratio(&mut self, numerator: u32, denominator: u32) -> bool
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