Struct rand::rngs::StdRng [−][src]
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 on all platforms is HC-128.
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, for example ChaChaRng.
Trait Implementations
impl Clone for StdRng[src]
impl CryptoRng for StdRng[src]
impl Debug for StdRng[src]
impl RngCore for StdRng[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 StdRng[src]
type Seed = <Hc128Rng 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]
pub fn seed_from_u64(state: u64) -> Self[src]
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> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<R> FromEntropy for R where
R: SeedableRng, [src]
R: SeedableRng,
pub fn from_entropy() -> R[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
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>,
fn gen_range<T: PartialOrd + SampleUniform>(&mut self, low: T, high: T) -> T[src]
fn sample<T, D: Distribution<T>>(&mut self, distr: D) -> T[src]
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,
fn fill<T: AsByteSliceMut + ?Sized>(&mut self, dest: &mut T)[src]
fn try_fill<T: AsByteSliceMut + ?Sized>(
&mut self,
dest: &mut T
) -> Result<(), Error>[src]
&mut self,
dest: &mut T
) -> Result<(), Error>
fn gen_bool(&mut self, p: f64) -> bool[src]
fn choose<'a, T>(&mut self, values: &'a [T]) -> Option<&'a T>[src]
fn choose_mut<'a, T>(&mut self, values: &'a mut [T]) -> Option<&'a mut T>[src]
fn shuffle<T>(&mut self, values: &mut [T])[src]
fn gen_iter<T>(&mut self) -> Generator<T, &mut Self>ⓘ where
Standard: Distribution<T>, [src]
Standard: Distribution<T>,
fn gen_weighted_bool(&mut self, n: u32) -> bool[src]
fn gen_ascii_chars(&mut self) -> AsciiGenerator<&mut Self>ⓘNotable traits for AsciiGenerator<R>
impl<R: RngCore> Iterator for AsciiGenerator<R> type Item = char;[src]
Notable traits for AsciiGenerator<R>
impl<R: RngCore> Iterator for AsciiGenerator<R> type Item = char;impl<T> ToOwned for T where
T: Clone, [src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn clone_into(&self, target: &mut T)[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,