Struct caffe2_imports::StdRng
source · pub struct StdRng { /* private fields */ }
Expand description
The standard RNG. This is designed to be efficient on the current platform.
Implementations§
source§impl StdRng
impl StdRng
sourcepub fn new() -> Result<StdRng, Error>
pub fn new() -> Result<StdRng, Error>
Create a randomly seeded instance of StdRng
.
This is a very expensive operation as it has to read
randomness from the operating system and use this in an
expensive seeding operation. If one is only generating a small
number of random numbers, or doesn’t need the utmost speed for
generating each number, thread_rng
and/or random
may be more
appropriate.
Reading the randomness from the OS may fail, and any error is
propagated via the io::Result
return value.
Trait Implementations§
source§impl Rng for StdRng
impl Rng for StdRng
source§fn next_f32(&mut self) -> f32
fn next_f32(&mut self) -> f32
Return the next random f32 selected from the half-open
interval
[0, 1)
. Read moresource§fn next_f64(&mut self) -> f64
fn next_f64(&mut self) -> f64
Return the next random f64 selected from the half-open
interval
[0, 1)
. Read moresource§fn fill_bytes(&mut self, dest: &mut [u8])
fn fill_bytes(&mut self, dest: &mut [u8])
Fill
dest
with random data. Read moresource§fn gen<T>(&mut self) -> Twhere
T: Rand,
Self: Sized,
fn gen<T>(&mut self) -> Twhere T: Rand, Self: Sized,
Return a random value of a
Rand
type. Read moresource§fn gen_iter<T, 'a>(&'a mut self) -> Generator<'a, T, Self> ⓘwhere
T: Rand,
Self: Sized,
fn gen_iter<T, 'a>(&'a mut self) -> Generator<'a, T, Self> ⓘwhere T: Rand, Self: Sized,
Return an iterator that will yield an infinite number of randomly
generated items. Read more
source§fn gen_range<T>(&mut self, low: T, high: T) -> Twhere
T: PartialOrd<T> + SampleRange,
Self: Sized,
fn gen_range<T>(&mut self, low: T, high: T) -> Twhere T: PartialOrd<T> + SampleRange, Self: Sized,
source§fn gen_weighted_bool(&mut self, n: u32) -> boolwhere
Self: Sized,
fn gen_weighted_bool(&mut self, n: u32) -> boolwhere Self: Sized,
Return a bool with a 1 in n chance of true Read more
source§fn gen_ascii_chars<'a>(&'a mut self) -> AsciiGenerator<'a, Self> ⓘwhere
Self: Sized,
fn gen_ascii_chars<'a>(&'a mut self) -> AsciiGenerator<'a, Self> ⓘwhere Self: Sized,
Return an iterator of random characters from the set A-Z,a-z,0-9. Read more
source§fn choose<T, 'a>(&mut self, values: &'a [T]) -> Option<&'a T>where
Self: Sized,
fn choose<T, 'a>(&mut self, values: &'a [T]) -> Option<&'a T>where Self: Sized,
Return a random element from
values
. Read moresource§impl<'a> SeedableRng<&'a [usize]> for StdRng
impl<'a> SeedableRng<&'a [usize]> for StdRng
impl Copy for StdRng
Auto Trait Implementations§
impl RefUnwindSafe for StdRng
impl Send for StdRng
impl Sync for StdRng
impl Unpin for StdRng
impl UnwindSafe for StdRng
Blanket Implementations§
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.