Forum;

Suppose I have a sparse array X, and a verb foo, which only involves + , and |. Under what conditions would

  (1 e.((3&$.)e.(5&$.))) foo X

equal 1? In other words, how does the sparse element (3&$.)find its way into the value list (5&$.)?

: --
------------------------------------------------------------------------
|\/| Randy A MacDonald   | APL: If you can say it, it's done.. (ram)
|/\| [EMAIL PROTECTED]  |
|\ |                     | The only real problem with APL is that
BSc(Math) UNBF'83        | it is "still ahead of its time."
Sapere Aude              |     - Morten Kromberg
Natural Born APL'er      | Demo website: http://156.34.65.44/
-----------------------------------------------------(INTP)----{ gnat }-

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

Reply via email to