ok    1  boolean element stores by variable, literal and expression subscripts; a store of another element
ok    2  a value other than 0 / 1 raises NOT0OR1 (literal and variable), out of bounds raises SUBOUTBND, the element untouched
ok    3  a frozen boolean array raises; an expandable boolean array grows on a store past its end
ok    4  REAL and INT literals, negative, a fraction, a wide value, into elements by variable / literal / expression subscripts
ok    5  a literal into a SORTED array places it, a string literal element store, a literal into an out-of-bounds element raises
ok    6  stepped INT loops: literal step, negative step, a variable step
ok    7  a stepped loop ends when its increment has no integer, both ways; exit for; nested stepped loops
ok    8  a REAL loop with a step is unchanged
ok    9  fill with one value, with n of, and from a position: whole bytes and the partial bytes at both ends
ok    10  a mixed list (elements past it keep their values in a fixed array), a variable count, an expandable boolean array grown by fill then appended to, a value other than 0 / 1 raises
ok    11  n of an expression is evaluated per element (the per-write path, not the word fill)
ok    12  the odd-only sieve counts 78498 primes below a million
ok    13  report: the sieve to a million took 0.016 s

passed:  13   failed:  0 
