[−][src]Struct rand::isaac::Isaac64Rng
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
Implementations
impl Isaac64Rng
[src]
pub fn new_unseeded() -> Isaac64Rng
[src]
Create a 64-bit ISAAC random number generator using the default fixed seed.
Trait Implementations
impl Clone for Isaac64Rng
[src]
fn clone(&self) -> Isaac64Rng
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Copy for Isaac64Rng
[src]
impl Debug for Isaac64Rng
[src]
impl Rand for Isaac64Rng
[src]
fn rand<R>(other: &mut R) -> Isaac64Rng where
R: Rng,
[src]
R: Rng,
impl Rng for Isaac64Rng
[src]
fn next_u32(&mut self) -> u32
[src]
fn next_u64(&mut self) -> u64
[src]
fn next_f32(&mut self) -> f32
[src]
fn next_f64(&mut self) -> f64
[src]
fn fill_bytes(&mut self, dest: &mut [u8])
[src]
fn gen<T>(&mut self) -> T where
T: Rand,
[src]
T: Rand,
fn gen_iter<T>(&'a mut self) -> Generator<'a, T, Self>ⓘ where
T: Rand,
[src]
T: Rand,
fn gen_range<T>(&mut self, low: T, high: T) -> T where
T: SampleRange + PartialOrd<T>,
[src]
T: SampleRange + PartialOrd<T>,
fn gen_weighted_bool(&mut self, n: u32) -> bool
[src]
fn gen_ascii_chars(&'a mut self) -> AsciiGenerator<'a, Self>ⓘNotable traits for AsciiGenerator<'a, R>
impl<'a, R> Iterator for AsciiGenerator<'a, R> where
R: Rng, type Item = char;
[src]
Notable traits for AsciiGenerator<'a, R>
impl<'a, R> Iterator for AsciiGenerator<'a, R> where
R: Rng, type Item = char;
fn choose<T>(&mut self, values: &'a [T]) -> Option<&'a T>
[src]
fn choose_mut<T>(&mut self, values: &'a mut [T]) -> Option<&'a mut T>
[src]
fn shuffle<T>(&mut self, values: &mut [T])
[src]
impl<'a> SeedableRng<&'a [u64]> for Isaac64Rng
[src]
fn reseed(&mut self, seed: &'a [u64])
[src]
fn from_seed(seed: &'a [u64]) -> Isaac64Rng
[src]
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.
Auto Trait Implementations
impl RefUnwindSafe for Isaac64Rng
impl Send for Isaac64Rng
impl Sync for Isaac64Rng
impl Unpin for Isaac64Rng
impl UnwindSafe for Isaac64Rng
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,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
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.
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>,