[Jprogramming] Recursive algorithm

[Marshall Lochbaum]

If J ever implements parallel architecture, the first thing to do would be
to parallelize operations of rank less than or equal to _1 . At this point,
any code that relies on side-effects and implicit loops will be in trouble.

Marshall

-----Original Message-----
From: programming-bounces at jsoftware.com
[mailto:programming-bounces at jsoftware.com] On Behalf Of Raul Miller
Sent: Monday, March 14, 2011 8:28 AM
To: Programming forum
Cc: Zsbán Ambrus
Subject: Re: [Jprogramming] Recursive algorithm

On Mon, Mar 14, 2011 at 7:15 AM, Zsbán Ambrus <ambrus at math.bme.hu> wrote:
> (For loops could have the advantage that I think jsoftware has made 
> some vague statements on the mailing lists that if you use the rank 
> operator on verbs with side effects, it might not always call the verb 
> as many times or in the right order in some case of optimizations in 
> future versions.  This is belivable because (u/\. y) already does such 
> an optimization, and in fact I think that's a right idea.)

I do not recall any official statement of that nature, *ever*.

I believe that that is "folk wisdom" based on experience with other
languages.

--
Raul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm