Are their any known limitations in relation to copycode.

I have implemented a quicksort algorithm using copycode. The idea is that any data type can be used, since the type of data array elements are determined at compile time. This doesn’t seem to work for some reason.

If you look at the following excerpt

0190 #qs.n := *ubound(&1&)

0200 for #qs.j 1 #qs.n

0210 #qs.l := (#qs.n / 2) + 1

0220 #qs.ir := #qs.n

0230 repeat

0240 if #qs.l > 1

0250 #tempidx1 := #qs.l

0260 #qs.indxt := &2&(#tempidx1)

0270 #tempidx1 := #qs.indxt

0280 &3& := &1&(#tempidx1)

0290 subtract 1 from #qs.l

First I have used #tempidx1, since the compiler seems to have problems with a construction like &2&(#qs.l), so I replaced #qs.l with a temporary variable. That seems to solve this problem. But when I run the test program, #tempidx1 is 0 while #qs.l is 4, even after the assignment.

Personally I have no clue what’s going on. That’s why I would like to know if their are any restrictions in relation to arrays.

Rudolf