On 7/14/06, John Randall <[EMAIL PROTECTED]> wrote:
I agree. That's why I suggested (-p) C. name for short positive p. For example, Forth has rot as a primitive correpsonding to p=:2 3 1 (or possibly its inverse).
If one had a strong restriction like short positive p would not p&A. be clearer and more useful than (-p)&C. ? The latter includes permutations affecting the beginning of the stack. i don't have the Knuth ref here but would that not mean moving the whole stack - unless one had spare padding at the beginning? Eg _9&C. While p&A. just marches through the permutations at the end of the stack. i was thinking C. in its full generality might be implemented. That would have a lot of use, and be easier to utilize than A. in its full generality. ~greg ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
