| author | |
| committer | |
| log | 44ff55091f1e851484e04e87d1f36d6662e80af0 |
| tree | 8dc67b56e3d40b5e55ded9aa89025871218fb3d5 |
| parent | 6b2274fd994edfd26db49d4a2599bbace881fd7a |
| parent | 3817420d42dd07fa9a48e1a7521cb520539b6f64 |
closes #50852 files changed, 6 insertions(+), 2 deletions(-)
lib/std/rand.zig+4| ... | ... | @@ -1123,3 +1123,7 @@ fn testRangeBias(r: *Random, start: i8, end: i8, biased: bool) void { |
| 1123 | 1123 | } |
| 1124 | 1124 | } |
| 1125 | 1125 | } |
| 1126 | ||
| 1127 | test "" { | |
| 1128 | std.meta.refAllDecls(@This()); | |
| 1129 | } |
lib/std/rand/ziggurat.zig+2-2| ... | ... | @@ -16,8 +16,8 @@ pub fn next_f64(random: *Random, comptime tables: ZigTable) f64 { |
| 16 | 16 | while (true) { |
| 17 | 17 | // We manually construct a float from parts as we can avoid an extra random lookup here by |
| 18 | 18 | // using the unused exponent for the lookup table entry. |
| 19 | const bits = random.scalar(u64); | |
| 20 | const i = @as(usize, bits & 0xff); | |
| 19 | const bits = random.int(u64); | |
| 20 | const i = @as(usize, @truncate(u8, bits)); | |
| 21 | 21 | |
| 22 | 22 | const u = blk: { |
| 23 | 23 | if (tables.is_symmetric) { |