Struct pcg_rand::Pcg32Basic

pub struct Pcg32Basic {
    // some fields omitted
}

A low overhead very simple PCG impementation

This is mostly useful for demonstrating how PCG works. If you want better statistical performance you should use one of the predefined types like Pcg32.

Methods

impl Pcg32Basic

fn new_unseeded() -> Pcg32Basic

Trait Implementations

impl Rng for Pcg32Basic

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 shuffle<T>(&mut self, values: &mut [T])

Shuffle a mutable slice in place.

impl SeedableRng<[u64; 2]> for Pcg32Basic

fn reseed(&mut self, seed: [u64; 2])

Reseed an RNG with the given seed.

fn from_seed(seed: [u64; 2]) -> Pcg32Basic

Create a new RNG with the given seed.

impl Rand for Pcg32Basic

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

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