aboutsummaryrefslogtreecommitdiff
path: root/lib/std/sort.zig
diff options
context:
space:
mode:
authorAndrew Kelley <andrew@ziglang.org>2023-02-19 10:20:19 -0700
committerAndrew Kelley <andrew@ziglang.org>2023-02-19 10:20:19 -0700
commitb5b634e4e8a2a1fe32fba50ccd175257b4213936 (patch)
tree4eed625db81dd4d6907e386084df36ec3ac85687 /lib/std/sort.zig
parentefdc94c10712f610e7de5e49fd9cd6f88b4bbbae (diff)
parent02f5d2673f1bb21e7329acdd664fed565ecd4317 (diff)
downloadzig-b5b634e4e8a2a1fe32fba50ccd175257b4213936.tar.gz
zig-b5b634e4e8a2a1fe32fba50ccd175257b4213936.zip
Merge remote-tracking branch 'origin/master' into llvm16
Diffstat (limited to 'lib/std/sort.zig')
-rw-r--r--lib/std/sort.zig10
1 files changed, 5 insertions, 5 deletions
diff --git a/lib/std/sort.zig b/lib/std/sort.zig
index 64b0711d83..fa1e33e7ce 100644
--- a/lib/std/sort.zig
+++ b/lib/std/sort.zig
@@ -1219,9 +1219,9 @@ fn testStableSort() !void {
IdAndValue{ .id = 2, .value = 0 },
},
};
- for (cases) |*case| {
+ for (&cases) |*case| {
insertionSort(IdAndValue, (case.*)[0..], {}, cmpByValue);
- for (case.*) |item, i| {
+ for (case.*, 0..) |item, i| {
try testing.expect(item.id == expected[i].id);
try testing.expect(item.value == expected[i].value);
}
@@ -1373,7 +1373,7 @@ fn fuzzTest(rng: std.rand.Random) !void {
var array = try testing.allocator.alloc(IdAndValue, array_size);
defer testing.allocator.free(array);
// populate with random data
- for (array) |*item, index| {
+ for (array, 0..) |*item, index| {
item.id = index;
item.value = rng.intRangeLessThan(i32, 0, 100);
}
@@ -1401,7 +1401,7 @@ pub fn argMin(
var smallest = items[0];
var smallest_index: usize = 0;
- for (items[1..]) |item, i| {
+ for (items[1..], 0..) |item, i| {
if (lessThan(context, item, smallest)) {
smallest = item;
smallest_index = i + 1;
@@ -1453,7 +1453,7 @@ pub fn argMax(
var biggest = items[0];
var biggest_index: usize = 0;
- for (items[1..]) |item, i| {
+ for (items[1..], 0..) |item, i| {
if (lessThan(context, biggest, item)) {
biggest = item;
biggest_index = i + 1;