Le 09/09/2011 00:57, Allin Cottrell a écrit :
In fact quite a nice speed-up was available here. Things
should look better in current CVS.
> Before:
> ? print tt
> tt (3 x 1)
>
> 1.8
> 7.21
> 29.04
>
> After:
> tt (3 x 1)
>
> 1.73
> 7.03
> 28.63
>
> Not bad at all, I say.
Maybe, but that improvement seems marginal to me. I was really
talking about the exact case raised by Artur, where the
often-repeated operation is assigment from some scalar value to a
single element within a pre-existing matrix, and in that case the
improvement is dramatic:
WOW! You say dramatic ? On my 4-year old machine (Core Duo
T2450@2Ghz,
2gb ram), it takes 0.468 seconds for 100 000 observations and 3,931 for
1 000 000 observations. It's simply UNBELIEVABLE.
Thanks a lot Allin! You'r great !
Ps. I'm sorry but I've not tested for n = 10 000. Not so big for gretl
actually !:-)