ok    1  indexed reads after a fill: sorted (the path that always worked)
ok    2  print fruits$ right after a fill shows the SORTED order
ok    3  print again after a re-fill: sorted again
ok    4  an array expression reads a sorted array in sorted order
ok    5  filter() over a sorted array sees sorted values
ok    6  stats$ on a sorted array (through array$info; the fixed array's unused slots are zeros, so sum not min)
ok    7  an append re-sorts before the next indexed read
ok    8  print after an append: the live elements sorted, the unused slot last
ok    9  a bulk fill of short (inline) and long strings sorts correctly: Apricot, banana, Cherry, pear
ok    10  six inline strings, case-blind: apple, Apricot, banana, Cherry, kiwi, pear
ok    11  a bulk fill of an already-sorted five (old build: apple, banana, Apricot, Cherry -- the struct-copied tmp aliased a slot)
ok    12  appends, a read, then v$(5) = Cherry: Apricot stays before banana

passed:  12   failed:  0 
