Struct rand_seeder::SipRng

pub struct SipRng { /* fields omitted */ }

A generator built using SipHash's primitives.

SipRng is statistically high-quality, passing practrand tests to at least 4 TiB. It is also reasonably fast, though not quite competitive with the best non-cryptographic RNGs or optimised block RNGs such as ChaCha.

This implementation is fixed to use two "compression" rounds between output values (similar to SipHash 2-4). Construction via SipHasher::into_rng adds two extra rounds to maintain four rounds between final input consumption and the first output, however this first result is not identical to SipHash's result.

Although this generator is heavily based on the design of SipHash, it has not been reviewed for cryptographic strength, and thus cannot be recommended for applications requiring this property.

Trait Implementations

impl Clone for SipRng

fn clone(&self) -> SipRng

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SipRng

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl RngCore for SipRng

fn next_u32(&mut self) -> u32

Return the next random u32.

fn next_u64(&mut self) -> u64

Return the next random u64.

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

Fill dest with random data.

fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>

Fill dest entirely with random data.

impl SeedableRng for SipRng

type Seed = [u8; 32]

Seed type, which is restricted to types mutably-dereferencable as u8 arrays (we recommend [u8; N] for some N).

fn from_seed(seed: Self::Seed) -> Self

Create a new PRNG using the given seed.

fn seed_from_u64(state: u64) -> Self

Create a new PRNG using a u64 seed.

fn from_rng<R>(rng: R) -> Result<Self, Error> where
    R: RngCore, 

Create a new PRNG seeded from another Rng.