Struct rand::isaac::IsaacRng

pub struct IsaacRng {
    // some 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

Methods

impl IsaacRng

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

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

impl Rng for IsaacRng

fn next_u32(&mut self) -> u32

fn next_u64(&mut self) -> u64

fn next_f32(&mut self) -> f32

fn next_f64(&mut self) -> f64

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

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

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

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

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

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

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

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

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

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

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.

impl Rand for IsaacRng

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

Derived Implementations

impl Copy for IsaacRng