ok    1  fill flags?(5 step 3) with false on 2M flags: every element right (0 wrong)
ok    2  fill flags?(top step -7) with false: every element right (0 wrong)
ok    3  flags?[2:*:5] = true: every element right (0 wrong)
ok    4  fill reals(2 step 3) with 7.5 on 1M: every element right (0 wrong)
ok    5  fill reals with 2.25: every element
ok    6  reals[1:*:4] = 3: every element right (0 wrong)
ok    7  fill ints%(1 step 2) with 9 on 1M: every element right (0 wrong)
ok    8  ints%[*:1:-3] = 5: every element right (0 wrong)
ok    9  an expandable array: the live elements, every other cleared
ok    10  fill reals(1 step 2) with rnd(1000000): a fresh roll per element (393713 distinct)
ok    11  the odd-only sieve counts 5,761,455 primes below 100M (0.109 s)
ok    12  bits: the big walk 0.272 ns a write against 1.359 ns for small walks (0.453 s / 2.265 s)
ok    13  INT: the big fill 0.395 ns an element against 2.340 ns for small fills (0.079 s / 0.468 s)

passed:  13   failed:  0 
