2022-01-04 12:21:08 +03:00
|
|
|
// Copyright (c) 2019-2022 Alexander Medvednikov. All rights reserved.
|
2020-06-01 22:13:56 +03:00
|
|
|
// Use of this source code is governed by an MIT license
|
|
|
|
// that can be found in the LICENSE file.
|
2020-06-09 16:06:07 +03:00
|
|
|
module splitmix64
|
|
|
|
|
2021-01-26 16:55:09 +03:00
|
|
|
import rand.seed
|
2022-02-28 14:17:54 +03:00
|
|
|
|
|
|
|
pub const seed_len = 2
|
2020-06-01 22:13:56 +03:00
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// SplitMix64RNG ported from http://xoshiro.di.unimi.it/splitmix64.c
|
2020-06-01 22:13:56 +03:00
|
|
|
pub struct SplitMix64RNG {
|
2019-09-23 00:50:22 +03:00
|
|
|
mut:
|
2022-02-28 14:17:54 +03:00
|
|
|
state u64 = seed.time_seed_64()
|
|
|
|
bytes_left int
|
|
|
|
buffer u64
|
2019-09-23 00:50:22 +03:00
|
|
|
}
|
2019-12-20 00:29:37 +03:00
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// seed sets the seed of the accepting SplitMix64RNG to the given data
|
2020-06-01 22:13:56 +03:00
|
|
|
// in little-endian format (i.e. lower 32 bits are in [0] and higher 32 bits in [1]).
|
|
|
|
pub fn (mut rng SplitMix64RNG) seed(seed_data []u32) {
|
|
|
|
if seed_data.len != 2 {
|
|
|
|
eprintln('SplitMix64RNG needs 2 32-bit unsigned integers as the seed.')
|
|
|
|
exit(1)
|
|
|
|
}
|
|
|
|
rng.state = seed_data[0] | (u64(seed_data[1]) << 32)
|
2022-02-28 14:17:54 +03:00
|
|
|
rng.bytes_left = 0
|
|
|
|
rng.buffer = 0
|
|
|
|
}
|
|
|
|
|
|
|
|
// byte returns a uniformly distributed pseudorandom 8-bit unsigned positive `byte`.
|
|
|
|
[inline]
|
|
|
|
pub fn (mut rng SplitMix64RNG) byte() byte {
|
|
|
|
if rng.bytes_left >= 1 {
|
|
|
|
rng.bytes_left -= 1
|
|
|
|
value := byte(rng.buffer)
|
|
|
|
rng.buffer >>= 8
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
rng.buffer = rng.u64()
|
|
|
|
rng.bytes_left = 7
|
|
|
|
value := byte(rng.buffer)
|
|
|
|
rng.buffer >>= 8
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
|
|
|
|
// u16 returns a pseudorandom 16bit int in range `[0, 2¹⁶)`.
|
|
|
|
[inline]
|
|
|
|
pub fn (mut rng SplitMix64RNG) u16() u16 {
|
|
|
|
if rng.bytes_left >= 2 {
|
|
|
|
rng.bytes_left -= 2
|
|
|
|
value := u16(rng.buffer)
|
|
|
|
rng.buffer >>= 16
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
ans := rng.u64()
|
|
|
|
rng.buffer = ans >> 16
|
|
|
|
rng.bytes_left = 6
|
|
|
|
return u16(ans)
|
2019-09-23 00:50:22 +03:00
|
|
|
}
|
2019-12-20 00:29:37 +03:00
|
|
|
|
2022-02-28 14:17:54 +03:00
|
|
|
// u32 returns a pseudorandom 32bit int in range `[0, 2³²)`.
|
2020-06-01 22:13:56 +03:00
|
|
|
[inline]
|
|
|
|
pub fn (mut rng SplitMix64RNG) u32() u32 {
|
2022-02-28 14:17:54 +03:00
|
|
|
if rng.bytes_left >= 4 {
|
|
|
|
rng.bytes_left -= 4
|
|
|
|
value := u32(rng.buffer)
|
|
|
|
rng.buffer >>= 32
|
|
|
|
return value
|
2020-06-01 22:13:56 +03:00
|
|
|
}
|
2022-02-28 14:17:54 +03:00
|
|
|
ans := rng.u64()
|
|
|
|
rng.buffer = ans >> 32
|
|
|
|
rng.bytes_left = 4
|
|
|
|
return u32(ans)
|
2020-06-01 22:13:56 +03:00
|
|
|
}
|
2019-12-20 00:29:37 +03:00
|
|
|
|
2022-02-28 14:17:54 +03:00
|
|
|
// u64 returns a pseudorandom 64bit int in range `[0, 2⁶⁴)`.
|
2019-12-20 00:29:37 +03:00
|
|
|
[inline]
|
2020-06-01 22:13:56 +03:00
|
|
|
pub fn (mut rng SplitMix64RNG) u64() u64 {
|
2019-12-07 15:51:00 +03:00
|
|
|
rng.state += (0x9e3779b97f4a7c15)
|
2019-09-23 00:50:22 +03:00
|
|
|
mut z := rng.state
|
2021-11-16 12:44:36 +03:00
|
|
|
z = (z ^ (z >> u64(30))) * 0xbf58476d1ce4e5b9
|
|
|
|
z = (z ^ (z >> u64(27))) * 0x94d049bb133111eb
|
2020-06-01 22:13:56 +03:00
|
|
|
return z ^ (z >> (31))
|
2019-09-23 00:50:22 +03:00
|
|
|
}
|
2019-12-20 00:29:37 +03:00
|
|
|
|
2022-02-28 14:17:54 +03:00
|
|
|
// block_size returns the number of bits that the RNG can produce in a single iteration.
|
|
|
|
[inline]
|
|
|
|
pub fn (mut rng SplitMix64RNG) block_size() int {
|
|
|
|
return 64
|
|
|
|
}
|
|
|
|
|
2021-09-23 11:14:20 +03:00
|
|
|
// free should be called when the generator is no longer needed
|
|
|
|
[unsafe]
|
|
|
|
pub fn (mut rng SplitMix64RNG) free() {
|
|
|
|
unsafe { free(rng) }
|
|
|
|
}
|