Well I thought it was fairly expensive, but I guess everything is relative. It took 1.4 seconds using u\. and 1.3 using u/ .
On 5 Nov 2011, at 02:37, Henry Rich wrote: > Yeah, unless your verb is expensive it's not worthwhile to avoid the > duplication. > > Henry Rich > > On 11/4/2011 10:10 PM, David Vaughan wrote: >> Hm, seems that was actually slightly slower than using / . >> >> On 5 Nov 2011, at 01:59, Kip Murray wrote: >> >>> Here is an example (u is +) >>> >>> ]a =:>: i. 5 >>> 1 2 3 4 5 >>> a +&.> <\. a >>> +---------+-------+-----+---+--+ >>> |2 3 4 5 6|4 5 6 7|6 7 8|8 9|10| >>> +---------+-------+-----+---+--+ >>> a +/ a >>> 2 3 4 5 6 >>> 3 4 5 6 7 >>> 4 5 6 7 8 >>> 5 6 7 8 9 >>> 6 7 8 9 10 >>> >>> >>> On 11/4/2011 8:27 PM, David Vaughan wrote: >>>> I have a dyadic verb which is applied on the same boxed list using x u/ y >>>> (where x=y), but this is inefficient because I only want to consider >>>> distinct pairs once. How can I do this? >>>> >>>> Thanks. >>>> ---------------------------------------------------------------------- >>>> For information about J forums see http://www.jsoftware.com/forums.htm >>> ---------------------------------------------------------------------- >>> For information about J forums see http://www.jsoftware.com/forums.htm >> >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm >> > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
