devela/num/rand/xorshift/u32.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
// devela::num::rand::xorshift::u32
//
//! 32-bit versions of XorShift generators.
//
use crate::{ConstDefault, Own};
/// The `XorShift32` pseudo-random number generator.
///
/// It has a 32-bit state and generates 32-bit numbers.
///
/// This is the classic 32-bit XorShift algorithm (13, 17, 5),
/// by George Marsaglia.
#[must_use]
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct XorShift32(u32);
impl Default for XorShift32 {
fn default() -> Self {
Self::DEFAULT
}
}
impl ConstDefault for XorShift32 {
const DEFAULT: Self = Self::new_unchecked(Self::DEFAULT_SEED);
}
// private associated items
impl XorShift32 {
const DEFAULT_SEED: u32 = 0xDEFA_0017;
#[cold] #[rustfmt::skip]
const fn cold_path_result() -> Option<Self> { None }
#[cold] #[allow(dead_code)] #[rustfmt::skip]
const fn cold_path_default() -> Self { Self::new_unchecked(Self::DEFAULT_SEED) }
}
impl XorShift32 {
/// Returns a seeded `XorShift32` generator from the given 32-bit seed.
///
/// Returns `None` if seed == `0`.
#[must_use]
pub const fn new(seed: u32) -> Option<Self> {
if seed == 0 {
Self::cold_path_result()
} else {
Some(Self(seed))
}
}
/// Returns a seeded `XorShift32` generator from the given 8-bit seed, unchecked.
///
/// The seed must not be `0`, otherwise every result will also be `0`.
pub const fn new_unchecked(seed: u32) -> Self {
debug_assert![seed != 0, "Seed must be non-zero"];
Self(seed)
}
/// Returns the current random `u32`.
#[must_use]
pub const fn current_u32(&self) -> u32 {
self.0
}
/// Returns the next random `u32`.
//
// Algorithm "xor" from p. 4 of Marsaglia, "Xorshift RNGs"
#[must_use]
pub fn next_u32(&mut self) -> u32 {
let mut x = self.0;
x ^= x << 13;
x ^= x >> 17;
x ^= x << 5;
self.0 = x;
x
}
/// Returns a copy of the next new random state.
pub const fn next_state(&self) -> Self {
let mut x = self.0;
x ^= x << 13;
x ^= x >> 17;
x ^= x << 5;
Self(x)
}
/// Returns both the next random state and the `u32` value.
pub const fn own_next_u32(self) -> Own<Self, u32> {
let s = self.next_state();
let v = s.current_u32();
Own::new(s, v)
}
}
/// # Extra constructors
impl XorShift32 {
/// Returns a seeded `XorShift32` generator from the given 32-bit seed.
///
/// This is an alias of [`new`][Self#method.new].
#[must_use]
pub const fn new1_u32(seed: u32) -> Option<Self> {
Self::new(seed)
}
/// Returns a seeded `XorShift32` generator from the given 2 × 16-bit seeds.
///
/// The seeds will be joined in little endian order.
#[must_use]
#[cfg(feature = "join")]
#[cfg_attr(feature = "nightly_doc", doc(cfg(feature = "join")))]
pub const fn new2_u16(seeds: [u16; 2]) -> Option<Self> {
Self::new(crate::Cast::<u32>::from_u16_le(seeds))
}
/// Returns a seeded `XorShift32` generator from the given 4 × 8-bit seeds.
///
/// The seeds will be joined in little endian order.
#[must_use]
pub const fn new4_u8(seeds: [u8; 4]) -> Option<Self> {
Self::new(u32::from_le_bytes(seeds))
}
}
#[cfg(all(feature = "dep_rand_core", feature = "join"))]
#[cfg_attr(feature = "nightly_doc", doc(cfg(all(feature = "dep_rand_core", feature = "join"))))]
mod impl_rand {
use crate::_dep::rand_core::{Error, RngCore, SeedableRng};
use crate::{Cast, XorShift32};
impl RngCore for XorShift32 {
/// Returns the next random `u32`.
fn next_u32(&mut self) -> u32 {
self.next_u32()
}
/// Returns the next 2 × random `u32` combined as a single `u64`.
fn next_u64(&mut self) -> u64 {
Cast::<u64>::from_u32_le([self.next_u32(), self.next_u32()])
}
fn fill_bytes(&mut self, dest: &mut [u8]) {
let mut i = 0;
while i < dest.len() {
let random_u32 = self.next_u32();
let bytes = random_u32.to_le_bytes();
let remaining = dest.len() - i;
if remaining >= 4 {
dest[i..i + 4].copy_from_slice(&bytes);
i += 4;
} else {
dest[i..].copy_from_slice(&bytes[..remaining]);
break;
}
}
}
fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error> {
self.fill_bytes(dest);
Ok(())
}
}
impl SeedableRng for XorShift32 {
type Seed = [u8; 4];
/// When seeded with zero this implementation uses the default seed
/// value as the cold path.
fn from_seed(seed: Self::Seed) -> Self {
if seed == [0; 4] {
Self::cold_path_default()
} else {
Self::new_unchecked(u32::from_le_bytes(seed))
}
}
}
}