Hi all !
Just to clarify one thing:
q } x,:y
0 11 2
13 4 15
6 17 8
q([ } ])x,:y
0 1 2
3 4 5
6 7 8
10 11 12
13 14 15
16 17 18
q ([ {"0 1 ] ) x,"0 y
0 11 2
13 4 15
6 17 8
Why is Amend so much faster then From? It seems to do the same thing?
/Erling
On 2014-07-07 22:19, Dan Bron wrote:
I wrote:
If you want to be able to calculate q on-the-fly, using tacit code,
here's a little helper utility:
...
It works on the same principles as x q} y , using gerund} to permit
the calculation of q from x and/or y at runtime. It's a bit convoluted
because the definition of gerund} doesn't readily support accessing
the monadic semantics of m} in a dyadic context or vice-versa.
In real-life examples, where x and y have the same shape, one is often
derived from the other.
If that's true in your case, you could likely out the middleman (mergeMask)
and just use f`g`h} directly. Doing so would probably save time and
effort and reduce complexity compared to, e.g. (u mergeMask~
x_calculator) .
-Dan
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
