ok    1  fill x(1 step 2) with 7: the odd elements 1, 3, .., 9
ok    2  fill x(4 step 3) with 5: 4, 7, 10 and no other
ok    3  a start near the end: one element (9), never past 10
ok    4  step 1 = every element from the start
ok    5  fill x(10 step -4) with 2: 10, 6, 2
ok    6  fill x(2 step 2) with 1, 2, 3 lands at 2, 4, 6
ok    7  fill x(1 step 3) with 4 of 9: 1, 4, 7, 10
ok    8  an array source and a value stride too: 1, 3, 5, 7
ok    9  fill x(5 step 3) with 1, 2, 3 would reach 11: FILLOVER, nothing written
ok    10  fill x(3 step -2) with 1, 2, 3 would reach -1: SUBOUTBND, nothing written
ok    11  step 0 raises NUM_OUTOFRANGE (-4106)
ok    12  fill e(2 step 2) with 0 on six live elements: 2, 4, 6; size stays 6
ok    13  a strided list past the end grows it: 5, 7, 9 -> size 9, the gap 8 zero
ok    14  a strided one-value fill from past the live end covers nothing and does not grow
ok    15  fill r(1 step 2) with rnd(1000): a fresh roll per stride, the even elements untouched
ok    16  a string array strides
ok    17  fill g(1, 2 step 5) with 1: storage-order ordinals 2, 7, 12 = (1,2), (2,3), (3,4)
ok    18  the odd-only sieve with a strided fill counts 78498 primes below a million
ok    19  report: the strided-fill sieve to a million took 0 s
ok    20  the bit walk on a packed boolean array: 3, 10, 17, ... exactly

passed:  20   failed:  0 
