[−][src]Struct rand::rngs::SmallRng
An RNG recommended when small state, cheap initialization and good
performance are required. 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 for StdRng
.
Reproducibility of output from this generator is however not required, thus future library versions may use a different internal generator with different output. Further, this generator may not be portable and can produce different output depending on the architecture. If you require reproducible output, use a named RNG. Refer to The Book.
The current algorithm is Pcg64Mcg
on 64-bit platforms with Rust version
1.26 and later, or Pcg32
otherwise. Both are found in
the rand_pcg crate.
Examples
Initializing SmallRng
with a random seed can be done using FromEntropy
:
use rand::FromEntropy; 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 std::iter; 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> = iter::repeat(()) .map(|()| SmallRng::from_rng(&mut thread_rng).unwrap()) .take(10) .collect();
Trait Implementations
impl Clone for SmallRng
[src]
fn clone(&self) -> SmallRng
[src]
default fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl Debug for SmallRng
[src]
impl RngCore for SmallRng
[src]
fn next_u32(&mut self) -> u32
[src]
fn next_u64(&mut self) -> u64
[src]
fn fill_bytes(&mut self, dest: &mut [u8])
[src]
fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>
[src]
impl SeedableRng for SmallRng
[src]
type Seed = <Pcg64Mcg as SeedableRng>::Seed
Seed type, which is restricted to types mutably-dereferencable as u8
arrays (we recommend [u8; N]
for some N
). Read more
fn from_seed(seed: Self::Seed) -> Self
[src]
fn from_rng<R: RngCore>(rng: R) -> Result<Self, Error>
[src]
default fn seed_from_u64(state: u64) -> Self
[src]
Create a new PRNG using a u64
seed. Read more
Auto Trait Implementations
Blanket Implementations
impl<R> Rng for R where
R: RngCore + ?Sized,
[src]
R: RngCore + ?Sized,
fn gen<T>(&mut self) -> T where
Standard: Distribution<T>,
[src]
Standard: Distribution<T>,
Return a random value supporting the [Standard
] distribution. Read more
fn gen_range<T: SampleUniform, B1, B2>(&mut self, low: B1, high: B2) -> T where
B1: SampleBorrow<T> + Sized,
B2: SampleBorrow<T> + Sized,
[src]
B1: SampleBorrow<T> + Sized,
B2: SampleBorrow<T> + Sized,
Generate a random value in the range [low
, high
), i.e. inclusive of low
and exclusive of high
. Read more
fn sample<T, D: Distribution<T>>(&mut self, distr: D) -> T
[src]
Sample a new value, using the given distribution. Read more
ⓘImportant traits for DistIter<'a, D, R, T>fn sample_iter<'a, T, D: Distribution<T>>(
&'a mut self,
distr: &'a D
) -> DistIter<'a, D, Self, T> where
Self: Sized,
[src]
&'a mut self,
distr: &'a D
) -> DistIter<'a, D, Self, T> where
Self: Sized,
Create an iterator that generates values using the given distribution. Read more
fn fill<T: AsByteSliceMut + ?Sized>(&mut self, dest: &mut T)
[src]
Fill 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 more
fn try_fill<T: AsByteSliceMut + ?Sized>(
&mut self,
dest: &mut T
) -> Result<(), Error>
[src]
&mut self,
dest: &mut T
) -> Result<(), Error>
Fill 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 more
fn gen_bool(&mut self, p: f64) -> bool
[src]
Return a bool with a probability p
of being true. Read more
fn gen_ratio(&mut self, numerator: u32, denominator: u32) -> bool
[src]
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
fn choose<'a, T>(&mut self, values: &'a [T]) -> Option<&'a T>
[src]
use SliceRandom::choose instead
Return a random element from values
. Read more
fn choose_mut<'a, T>(&mut self, values: &'a mut [T]) -> Option<&'a mut T>
[src]
use SliceRandom::choose_mut instead
Return a mutable pointer to a random element from values
. Read more
fn shuffle<T>(&mut self, values: &mut [T])
[src]
use SliceRandom::shuffle instead
Shuffle a mutable slice in place. Read more
impl<R> FromEntropy for R where
R: SeedableRng,
[src]
R: SeedableRng,
fn from_entropy() -> R
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
impl<T> From for T
[src]
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,