pub fn boundedOrderZ(comptime T: type, lhs: [*:0]const T, rhs: [*:0]const T, bound: usize) math.Order
Compares two many-item pointers with NUL-termination lexicographically until some specified bound.
T: type
lhs: [*:0]const T
rhs: [*:0]const T
bound: usize
693 694 695 696 697 698
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 and i < bound) : (i += 1) {} return if (i < bound) math.order(lhs[i], rhs[i]) else .eq; }
Compares two many-item pointers with NUL-termination lexicographically until some specified bound.