std.rand: builtin @{min,max}Value to std.math.{min,max}Value;

Author: kristopher tate

std/rand/index.zig

@@ -39,7 +39,7 @@ pub const Random = struct {
         return r.int(u1) != 0;
     }
 
-    /// Returns a random int `i` such that `0 <= i <= @maxValue(T)`.
+    /// Returns a random int `i` such that `0 <= i <= std.math.maxInt(T)`.
     /// `i` is evenly distributed.
     pub fn int(r: *Random, comptime T: type) T {
         const UnsignedT = @IntType(false, T.bit_count);
@@ -69,14 +69,14 @@ pub const Random = struct {
         assert(T.is_signed == false);
         assert(0 < less_than);
 
-        const last_group_size_minus_one: T = @maxValue(T) % less_than;
+        const last_group_size_minus_one: T = std.math.maxInt(T) % less_than;
         if (last_group_size_minus_one == less_than - 1) {
             // less_than is a power of two.
             assert(math.floorPowerOfTwo(T, less_than) == less_than);
-            // There is no retry zone. The optimal retry_zone_start would be @maxValue(T) + 1.
+            // There is no retry zone. The optimal retry_zone_start would be std.math.maxInt(T) + 1.
             return r.int(T) % less_than;
         }
-        const retry_zone_start = @maxValue(T) - last_group_size_minus_one;
+        const retry_zone_start = std.math.maxInt(T) - last_group_size_minus_one;
 
         while (true) {
             const rand_val = r.int(T);
@@ -91,7 +91,7 @@ pub const Random = struct {
     /// for commentary on the runtime of this function.
     pub fn uintAtMost(r: *Random, comptime T: type, at_most: T) T {
         assert(T.is_signed == false);
-        if (at_most == @maxValue(T)) {
+        if (at_most == std.math.maxInt(T)) {
             // have the full range
             return r.int(T);
         }