update to Zig 2024.05-mach (helps hexops/mach#1276)

Signed-off-by: Stephen Gutekanst <[email protected]>

Author: Stephen Gutekanst

src/benchmark.zig

@@ -75,7 +75,7 @@ fn bench(algorithm: []const u8, Filter: anytype, size: usize, trials: usize) !vo
     // Perform random matches.
     var random_matches: u64 = 0;
     var i: u64 = 0;
-    var rng = std.rand.DefaultPrng.init(0);
+    var rng = std.Random.DefaultPrng.init(0);
     const random = rng.random();
     timer.reset();
     const randomMatchesTimeStart = timer.lap();

src/binaryfusefilter.zig

@@ -441,7 +441,7 @@ fn binaryFuseTest(T: anytype, size: usize, size_in_bytes: usize) !void {
     var random_matches: u64 = 0;
     const trials = 10000000;
     var i: u64 = 0;
-    var rng = std.rand.DefaultPrng.init(0);
+    var rng = std.Random.DefaultPrng.init(0);
     const random = rng.random();
     while (i < trials) : (i += 1) {
         const random_key: u64 = random.uintAtMost(u64, std.math.maxInt(u64));

src/fusefilter.zig

@@ -280,7 +280,7 @@ fn fuseTest(T: anytype, size: usize, size_in_bytes: usize) !void {
     var random_matches: u64 = 0;
     const trials = 10000000;
     var i: u64 = 0;
-    var rng = std.rand.DefaultPrng.init(0);
+    var rng = std.Random.DefaultPrng.init(0);
     const random = rng.random();
     while (i < trials) : (i += 1) {
         const random_key: u64 = random.uintAtMost(u64, std.math.maxInt(u64));

src/xorfilter.zig

@@ -360,7 +360,7 @@ fn xorTest(T: anytype, size: usize, size_in_bytes: usize) !void {
     var random_matches: u64 = 0;
     const trials = 10000000;
     var i: u64 = 0;
-    var rng = std.rand.DefaultPrng.init(0);
+    var rng = std.Random.DefaultPrng.init(0);
     const random = rng.random();
     while (i < trials) : (i += 1) {
         const random_key: u64 = random.uintAtMost(u64, std.math.maxInt(u64));