Struct LaggedFibonacciRand 

pub struct LaggedFibonacciRand<T> { /* private fields */ }

implements a subtract-with-carry(lagged Fibonacci) algorithm lagged fibonacci algorithm $$ x_{i} = (x_{i-s} - x_{i-r} - carry_{i-1}) \bmod m $$

Implementations

impl<T> LaggedFibonacciRand<T>

where T: PrimitiveType + Default + PartialOrd + Debug,

pub fn new<Sd: Seed<T>>(sd: &Sd, w: T, s: T, r: T) -> Result<Self>

w: word size in number bits to determine the range of values generated by the Rand, 0 < w <= (sizeof(T)*8); r: the size of the internal state s: lagged step when compute the current state, $0 < s < r$

Trait Implementations

impl<T: Clone> Clone for LaggedFibonacciRand<T>

fn clone(&self) -> LaggedFibonacciRand<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl IterSource<u32> for LaggedFibonacciRand<u32>

fn iter_mut(&mut self) -> Iter<'_, Self, u32>

impl IterSource<u64> for LaggedFibonacciRand<u64>

fn iter_mut(&mut self) -> Iter<'_, Self, u64>

impl IterSource<usize> for LaggedFibonacciRand<usize>

fn iter_mut(&mut self) -> Iter<'_, Self, usize>

impl Source<u32> for LaggedFibonacciRand<u32>

fn gen(&mut self) -> Result<u32>

fn reset<Sd: Seed<u32>>(&mut self, sd: &Sd) -> Result<()>

impl Source<u64> for LaggedFibonacciRand<u64>

fn gen(&mut self) -> Result<u64>

fn reset<Sd: Seed<u64>>(&mut self, sd: &Sd) -> Result<()>

impl Source<usize> for LaggedFibonacciRand<usize>

fn gen(&mut self) -> Result<usize>

fn reset<Sd: Seed<usize>>(&mut self, sd: &Sd) -> Result<()>