pub struct IsaacRng { /* private fields */ }
Expand description
A random number generator that uses the ISAAC algorithm[1].
The ISAAC algorithm is generally accepted as suitable for
cryptographic purposes, but this implementation has not be
verified as such. Prefer a generator like OsRng
that defers to
the operating system for cases that need high security.
[1]: Bob Jenkins, ISAAC: A fast cryptographic random number generator
Implementations§
Trait Implementations§
source§impl Rng for IsaacRng
impl Rng for IsaacRng
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 [u32]> for IsaacRng
impl<'a> SeedableRng<&'a [u32]> for IsaacRng
source§fn from_seed(seed: &'a [u32]) -> IsaacRng
fn from_seed(seed: &'a [u32]) -> IsaacRng
Create an ISAAC random number generator with a seed. This can be any length, although the maximum number of elements used is 256 and any more will be silently ignored. A generator constructed with a given seed will generate the same sequence of values as all other generators constructed with that seed.