There is pre-processing in m&i. but it is not necessarily a hash table.
----- Original Message ----- From: Henry Rich <[EMAIL PROTECTED]> Date: Thursday, June 7, 2007 2:55 pm Subject: RE: [Jgeneral] Roger ! what is the secret under the hood ? > i. builds a hash table. m&i. builds the table when the > verb is defined; m i. y builds the table when i. is > executed. > > Henry Rich > > > -----Original Message----- > > From: [EMAIL PROTECTED] > > [mailto:[EMAIL PROTECTED] On Behalf Of > > [EMAIL PROTECTED] > > Sent: Thursday, June 07, 2007 5:50 PM > > To: General forum > > Subject: [Jgeneral] Roger ! what is the secret under the hood ? > > > > Roger, > > Why is 'f a' so much faster ? > > > > a=:(i.1e7)+_1+2^31 > > ts'i.~a' > > 7.41238 2.01327e8 > > f=:a&i. > > ts'f a' > > 4.6502 6.71097e7 > > 5!:5<'f' > > (2147483647+i.10000000)&i. > > ts'(2147483647+i.10000000)&i.a' > > 7.79408 4.69764e8 ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
