difftastic/vendored_parsers/tree-sitter-hare/example/random.ha

36 lines
1.1 KiB
Plaintext

// math::random provides a pseudorandom number generator, which yields a
// deterministic sequence of psuedo-random numbers based on a seed value.
//
// Beware! This module is NOT suitable for generating genuinely random data for
// cryptographic use. See [crypto::random] for cryptographically secure random
// number generation.
// State for a pseudorandom number generator.
export type random = u64;
// Initializes a pseudorandom number generator with a given seed. This seed will
// yield the same sequence of psuedo-random numbers if used again.
export fn init(seed: u64) random = seed;
// Returns a psuedo-random 64-bit unsigned integer.
export fn next(r: *random) u64 = {
// SplitMix64
*r += 0x9e3779b97f4a7c15;
*r = (*r ^ *r >> 30) * 0xbf58476d1ce4e5b9;
*r = (*r ^ *r >> 27) * 0x94d049bb133111eb;
return *r ^ *r >> 31;
};
@test fn rng() void = {
let r = init(0);
let expected: [_]u64 = [
16294208416658607535,
15501543990041496116,
15737388954706874752,
15091258616627000950,
];
for (let i = 0z; i < len(expected); i += 1) {
assert(next(&r) == expected[i]);
};
};