Correction: probable that y has distinct items; highly probable that x has duplicate items.
----- Original Message ----- From: Roger Hui <[EMAIL PROTECTED]> Date: Tuesday, December 11, 2007 19:14 Subject: Re: [Jprogramming] test for unique To: Programming forum <[email protected]> > It is highly probable that the y used in the benchmarks > has distinct items, and the x has duplicate items. > > My current judgment is that *./@~: is fast and lean enough > without special code. > > > > ----- Original Message ----- > From: bill lam <[EMAIL PROTECTED]> > Date: Tuesday, December 11, 2007 19:03 > Subject: Re: [Jprogramming] test for unique > To: Programming forum <[email protected]> > > > Thanks to Roger and Ross for suggestions. I also think > > that benchmark timing > > will be slightly different if all items are in fact unique. > > > > Any chance to make special code for *./@~: ? > > > > Roger Hui wrote: > > > ts=: 6!:2 , 7!:[EMAIL PROTECTED] > > > x=: 1e6 [EMAIL PROTECTED] 1e6 > > > y=: 1e5 2 5 [EMAIL PROTECTED] 10 ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
