ok    1  500 random appends, each followed by a full read: always in order
ok    2  x(1) = 45 on a sorted array: the value moves right to its place
ok    3  x(6) = 5: the value moves left to the front
ok    4  a write that is already in place stays put
ok    5  an equal key lands after its equals (stable)
ok    6  string appends: case-blind order (apple < Apricot < banana), long and short strings mixed
ok    7  an indexed string write moves to its place (pear -> Cherry)
ok    8  lset into an element re-places it too (lset keeps the length: zzz padded)
ok    9  a fill marks the array dirty; the next read sorts it
ok    10  an append after the sort is placed
ok    11  an indexed write after the sort is placed
ok    12  integer sorted array: placed appends
ok    13  an array expression over the maintained array sees the order
ok    14  stats$ over the maintained array
ok    15  unread appends then fresh$(4) = Cherry: the 4th smallest (pear) is replaced -- positions are ranks from the first write
ok    16  numeric: unread appends then freshn(3) = 5 replaces the largest (30), not the last written
ok    17  lset into element 1 of a fixed sorted array moves it to the end (the lvalue read of the length must not cancel the placement)

passed:  17   failed:  0 
