Struct std::rand::Isaac64RngDeprecated
[-] [+]
[src]
pub struct Isaac64Rng {
// some fields omitted
}A random number generator that uses ISAAC-64[1], the 64-bit variant of the ISAAC algorithm.
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 Isaac64Rng
fn new_unseeded() -> Isaac64Rng
Create a 64-bit ISAAC random number generator using the default fixed seed.
Trait Implementations
impl Clone for Isaac64Rng
fn clone(&self) -> Isaac64Rng
fn clone_from(&mut self, &Isaac64Rng)
impl Rng for Isaac64Rng
fn next_u32(&mut self) -> u32
fn next_u64(&mut self) -> u64
fn next_u64(&mut self) -> u64
fn next_f32(&mut self) -> f32
fn next_f64(&mut self) -> f64
fn fill_bytes(&mut self, &mut [u8])
fn gen<T>(&mut self) -> T where T: Rand
fn gen_iter<T>(&'a mut self) -> Generator<'a, T, Isaac64Rng> where T: Rand
fn gen_range<T>(&mut self, T, T) -> T where T: SampleRange, T: PartialOrd<T>
fn gen_weighted_bool(&mut self, usize) -> bool
fn gen_ascii_chars(&'a mut self) -> AsciiGenerator<'a, Isaac64Rng>
fn choose<T>(&mut self, &'a [T]) -> Option<&'a T>
fn shuffle<T>(&mut self, &mut [T])
impl<'a> SeedableRng<&'a [u64]> for Isaac64Rng
fn reseed(&mut self, seed: &'a [u64])
fn from_seed(seed: &'a [u64]) -> Isaac64Rng
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.