struct Sfc64 [src]

Alias for std.Random.Sfc64

Sfc64 pseudo-random number generator from Practically Random. Fastest engine of pracrand and smallest footprint. See http://pracrand.sourceforge.net/

Fields

a: u64 = undefined
b: u64 = undefined
c: u64 = undefined
counter: u64 = undefined

Members

Source

//! Sfc64 pseudo-random number generator from Practically Random. //! Fastest engine of pracrand and smallest footprint. //! See http://pracrand.sourceforge.net/ const std = @import("std"); const math = std.math; const Sfc64 = @This(); a: u64 = undefined, b: u64 = undefined, c: u64 = undefined, counter: u64 = undefined, const Rotation = 24; const RightShift = 11; const LeftShift = 3; pub fn init(init_s: u64) Sfc64 { var x = Sfc64{}; x.seed(init_s); return x; } pub fn random(self: *Sfc64) std.Random { return std.Random.init(self, fill); } fn next(self: *Sfc64) u64 { const tmp = self.a +% self.b +% self.counter; self.counter += 1; self.a = self.b ^ (self.b >> RightShift); self.b = self.c +% (self.c << LeftShift); self.c = math.rotl(u64, self.c, Rotation) +% tmp; return tmp; } fn seed(self: *Sfc64, init_s: u64) void { self.a = init_s; self.b = init_s; self.c = init_s; self.counter = 1; var i: u32 = 0; while (i < 12) : (i += 1) { _ = self.next(); } } pub fn fill(self: *Sfc64, buf: []u8) void { var i: usize = 0; const aligned_len = buf.len - (buf.len & 7); // Complete 8 byte segments. while (i < aligned_len) : (i += 8) { var n = self.next(); comptime var j: usize = 0; inline while (j < 8) : (j += 1) { buf[i + j] = @as(u8, @truncate(n)); n >>= 8; } } // Remaining. (cuts the stream) if (i != buf.len) { var n = self.next(); while (i < buf.len) : (i += 1) { buf[i] = @as(u8, @truncate(n)); n >>= 8; } } } test "sequence" { // Unfortunately there does not seem to be an official test sequence. var r = Sfc64.init(0); const seq = [_]u64{ 0x3acfa029e3cc6041, 0xf5b6515bf2ee419c, 0x1259635894a29b61, 0xb6ae75395f8ebd6, 0x225622285ce302e2, 0x520d28611395cb21, 0xdb909c818901599d, 0x8ffd195365216f57, 0xe8c4ad5e258ac04a, 0x8f8ef2c89fdb63ca, 0xf9865b01d98d8e2f, 0x46555871a65d08ba, 0x66868677c6298fcd, 0x2ce15a7e6329f57d, 0xb2f1833ca91ca79, 0x4b0890ac9bf453ca, }; for (seq) |s| { try std.testing.expectEqual(s, r.next()); } } test fill { // Unfortunately there does not seem to be an official test sequence. var r = Sfc64.init(0); const seq = [_]u64{ 0x3acfa029e3cc6041, 0xf5b6515bf2ee419c, 0x1259635894a29b61, 0xb6ae75395f8ebd6, 0x225622285ce302e2, 0x520d28611395cb21, 0xdb909c818901599d, 0x8ffd195365216f57, 0xe8c4ad5e258ac04a, 0x8f8ef2c89fdb63ca, 0xf9865b01d98d8e2f, 0x46555871a65d08ba, 0x66868677c6298fcd, 0x2ce15a7e6329f57d, 0xb2f1833ca91ca79, 0x4b0890ac9bf453ca, }; for (seq) |s| { var buf0: [8]u8 = undefined; var buf1: [7]u8 = undefined; std.mem.writeInt(u64, &buf0, s, .little); r.fill(&buf1); try std.testing.expect(std.mem.eql(u8, buf0[0..7], buf1[0..])); } }