Simon Ampleman wrote: > - Is there a J solution ? What other programmer does with the same > context? Another language? Extreme optimization?
I think the slowest operation is going to be updating memory. If you represent memory using a 65536 element vector, you're going to wind up making a copy of that every time you update it. I think memr/memw on a region of system memory will be much faster than using a variable for the kinds of operations you want to perform. Other than that, your big issue is going to be J overhead. Each J operation has to check type and shape, and each J result requires allocating a new J array. So minimizing the number of J operations you perform for each 6502 operation will tend to reduce this overhead. -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
