Struct std::rand::XorShiftRngDeprecated
[-] [+]
[src]
pub struct XorShiftRng {
// some fields omitted
}An Xorshift[1] random number generator.
The Xorshift algorithm is not suitable for cryptographic purposes
but is very fast. If you do not know for sure that it fits your
requirements, use a more secure one such as IsaacRng or OsRng.
[1]: Marsaglia, George (July 2003). "Xorshift RNGs". Journal of Statistical Software. Vol. 8 (Issue 14).
Methods
impl XorShiftRng
fn new_unseeded() -> XorShiftRng
Creates a new XorShiftRng instance which is not seeded.
The initial values of this RNG are constants, so all generators created
by this function will yield the same stream of random numbers. It is
highly recommended that this is created through SeedableRng instead of
this function
Trait Implementations
impl Rng for XorShiftRng
fn next_u32(&mut self) -> u32
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, XorShiftRng> 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, XorShiftRng>
fn choose<T>(&mut self, &'a [T]) -> Option<&'a T>
fn shuffle<T>(&mut self, &mut [T])
impl SeedableRng<[u32; 4]> for XorShiftRng
fn reseed(&mut self, seed: [u32; 4])
Reseed an XorShiftRng. This will panic if seed is entirely 0.
fn from_seed(seed: [u32; 4]) -> XorShiftRng
Create a new XorShiftRng. This will panic if seed is entirely 0.