Commit 26de7a3513901dcdd5a5d588a2f38f25fda0e626 | zig

author	GasInfinity <me@gasinfinity.dev> 2026-01-17 19:32:43+01:00
committer	GasInfinity <me@gasinfinity.dev> 2026-01-17 21:42:32+01:00
log	26de7a3513901dcdd5a5d588a2f38f25fda0e626
tree	894e88eb5d5cebc3074484395ae0ce645149ddaa
parent	27685bcf2097605be7bcb6d1e16e2f4747a1a841
signature	Signed by SSH key SHA256:p3IHbr0lyK2ekfDC1Zi7dOEV/9T6lGghNawhl5sBnM4

1 files changed, 7 insertions(+), 2 deletions(-)

lib/std/mem.zig+7-2

 @@ -662,10 +662,15 @@ pub fn order(comptime T: type, lhs: []const T, rhs: []const T) math.Order {
 /// Compares two many-item pointers with NUL-termination lexicographically.
 pub fn orderZ(comptime T: type, lhs: [*:0]const T, rhs: [*:0]const T) math.Order {
+    return boundedOrderZ(T, lhs, rhs, std.math.maxInt(usize));
+}
+/// Compares two many-item pointers with NUL-termination lexicographically until some specified bound.
+pub fn boundedOrderZ(comptime T: type, lhs: [*:0]const T, rhs: [*:0]const T, bound: usize) math.Order {
     if (lhs == rhs) return .eq;
     var i: usize = 0;
-    while (lhs[i] == rhs[i] and lhs[i] != 0) : (i += 1) {}
+    while (lhs[i] == rhs[i] and lhs[i] != 0 and i < bound) : (i += 1) {}
-    return math.order(lhs[i], rhs[i]);
+    return if (i < bound) math.order(lhs[i], rhs[i]) else .eq;
 }
 test order {