Talk:SmileBASIC (Petit Computer 3)/@comment-15296152-20150711190934/@comment-4509370-20150711194341

Tried it out.

COPY A,1, A,0,9 (copy A[0] through A[8] -> A[1] through A[9]): 3,0,0,0,0,0,0,0,0,0 -> 3,3,0,0,0,0,0,0,0,0 -> 3,3,3,0,0,0,0,0,0,0 -> 3,3,3,3,0,0,0,0,0,0 -> 3,3,3,3,3,3,0,0,0,0 -> 3,3,3,3,3,3,3,0,0,0 -> 3,3,3,3,3,3,3,3,0,0 -> 3,3,3,3,3,3,3,3,3,3 To make it clearer, I filled the array with values 1 through 10.

1,2,3,4,5,6,7,8,9,10 -> 1,1,2,3,4,4,6,7,8,8 -> 1,1,1,2,3,3,4,6,7,7 -> 1,1,1,1,2,2,3,4,6,6 -> 1,1,1,1,1,1,2,3,4,4 -> 1,1,1,1,1,1,1,2,3,3 -> 1,1,1,1,1,1,1,1,2,2 -> 1,1,1,1,1,1,1,1,1,1

...I don't know how to interpret that, but there you go. Trying it again and again got the same result, so it doesn't seem to be hitting a race condition at least.

And yes, you can make an integer array and store it as a DAT file, each element takes up four bytes and stores 1 32-bit integer.