test: migrate 24 residual carriers into the fixture corpus
Audit-driven migrate-and-retire wave (one read-only auditor per carrier batch, verdicts row-checked through the full corpus gate): every retired carrier's assertions are now owned by declarative fixtures or an existing owner. 238 new fixtures land (corpus 1,239 -> 1,477; cells 2,954), covering enum/str/slice/tagged array elements, inferred-length arrays, global slice/str zero-init and literals, global array/pointer field reads and stores, struct-literal slice fields, struct returns, float arithmetic, size/int limits, sort and log-vstream behavior, place-addressed stores, and append places. Rejection rows STRENGTHEN the old nonzero-exit checks to required diagnostic fragments; all byte-id claims fold into the blanket test-data-byteid sweep (now 1,142 compared, 0 pinned-divergent). Four carriers were fully redundant with existing fixtures/lang tests (749, 722, 765, and 771's byteid rows) and retire without new rows. Native carriers 171 -> 147 (residual 135 -> 111).
This commit is contained in:
30
test/wcc/data/r963_sort_rbisect/case.ww
Normal file
30
test/wcc/data/r963_sort_rbisect/case.ww
Normal file
@@ -0,0 +1,30 @@
|
||||
//ww:run
|
||||
package main;
|
||||
import sort;
|
||||
fn ints(a: *opaque, b: *opaque) int = {
|
||||
let pa: *i32 = a: *i32;
|
||||
let pb: *i32 = b: *i32;
|
||||
let va: i32 = *pa;
|
||||
let vb: i32 = *pb;
|
||||
if (va < vb) { return -1; };
|
||||
if (va > vb) { return 1; };
|
||||
return 0;
|
||||
};
|
||||
export fn main() i32 = {
|
||||
let nums: [10]i32 = [1, 3, 4, 4, 5, 7, 9, 11, 11, 11];
|
||||
let s: []i32 = nums[0:10];
|
||||
let n: size = len(s): size;
|
||||
let i: size = 0;
|
||||
for (i < n) {
|
||||
if (i == n - 1 || nums[i + 1] != nums[i]) {
|
||||
let key: i32 = nums[i];
|
||||
if (sort.rbisect(s, size(i32), &key, ints) != i + 1) { return 1; };
|
||||
};
|
||||
i = i + 1;
|
||||
};
|
||||
let n0: i32 = 0; if (sort.rbisect(s, size(i32), &n0, ints) != 0) { return 2; };
|
||||
let n6: i32 = 6; if (sort.rbisect(s, size(i32), &n6, ints) != 5) { return 3; };
|
||||
let n8: i32 = 8; if (sort.rbisect(s, size(i32), &n8, ints) != 6) { return 4; };
|
||||
let n12: i32 = 12; if (sort.rbisect(s, size(i32), &n12, ints) != n) { return 5; };
|
||||
return 0;
|
||||
};
|
||||
Reference in New Issue
Block a user