Struct rand::IsaacRng

pub struct IsaacRng { /* fields omitted */ }

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

impl IsaacRng

pub fn new_unseeded() -> IsaacRng

Create an ISAAC random number generator using the default fixed seed.

Trait Implementations

impl Clone for IsaacRng

fn clone(&self) -> IsaacRng

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for IsaacRng

impl Debug for IsaacRng

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Rand for IsaacRng

fn rand<R>(other: &mut R) -> IsaacRng where
    R: Rng, 

Generates a random instance of this type using the specified source of randomness.

impl Rng for IsaacRng

fn next_u32(&mut self) -> u32

Return the next random u32.

fn next_u64(&mut self) -> u64

Return the next random u64.

fn next_f32(&mut self) -> f32

Return the next random f32 selected from the half-open interval [0, 1).

fn next_f64(&mut self) -> f64

Return the next random f64 selected from the half-open interval [0, 1).

fn fill_bytes(&mut self, dest: &mut [u8])

Fill dest with random data.

fn gen<T>(&mut self) -> T where
    T: Rand, 

Return a random value of a Rand type.

fn gen_iter<T>(&'a mut self) -> Generator<'a, T, Self> where
    T: Rand, 

Return an iterator that will yield an infinite number of randomly generated items.

fn gen_range<T>(&mut self, low: T, high: T) -> T where
    T: SampleRange + PartialOrd<T>, 

Generate a random value in the range [low, high).

fn gen_weighted_bool(&mut self, n: u32) -> bool

Return a bool with a 1 in n chance of true

fn gen_ascii_chars(&'a mut self) -> AsciiGenerator<'a, Self>

Return an iterator of random characters from the set A-Z,a-z,0-9.

fn choose<T>(&mut self, values: &'a [T]) -> Option<&'a T>

Return a random element from values.

fn choose_mut<T>(&mut self, values: &'a mut [T]) -> Option<&'a mut T>

Return a mutable pointer to a random element from values.

fn shuffle<T>(&mut self, values: &mut [T])

Shuffle a mutable slice in place.

impl<'a> SeedableRng<&'a [u32]> for IsaacRng

fn reseed(&mut self, seed: &'a [u32])

Reseed an RNG with the given seed.

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.