1 | Consider FORALL( i=1:n ) a(ix(i)) = a(i) |
2 |
is allowed in HPF but will only give sensible reproducible results if ix(i) is a true permutation of 1...n
|
3 |
Of course we always use "old" value" of a(i) on rhs so that if ix(i)= i+1 and a(0) defined, then result is
|